./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-memsafety/java_BubbleSort-alloca-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/array-memsafety/java_BubbleSort-alloca-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ba885d2ca843c278430bc3d4272c307ea7df8f1fbcd0da84e81382a8c1939a93 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 07:12:48,526 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 07:12:48,586 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2025-01-10 07:12:48,589 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 07:12:48,590 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 07:12:48,606 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 07:12:48,607 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 07:12:48,607 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 07:12:48,607 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 07:12:48,607 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 07:12:48,608 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 07:12:48,608 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 07:12:48,608 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 07:12:48,608 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-01-10 07:12:48,608 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-01-10 07:12:48,608 INFO L153 SettingsManager]: * Use old map elimination=false [2025-01-10 07:12:48,608 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-01-10 07:12:48,608 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-01-10 07:12:48,608 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-01-10 07:12:48,609 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 07:12:48,609 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-01-10 07:12:48,609 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 07:12:48,609 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 07:12:48,609 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 07:12:48,609 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 07:12:48,609 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-01-10 07:12:48,609 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-01-10 07:12:48,609 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-01-10 07:12:48,609 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 07:12:48,609 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 07:12:48,609 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 07:12:48,609 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-01-10 07:12:48,609 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 07:12:48,609 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 07:12:48,609 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 07:12:48,609 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 07:12:48,609 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 07:12:48,610 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 07:12:48,610 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-01-10 07:12:48,610 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ba885d2ca843c278430bc3d4272c307ea7df8f1fbcd0da84e81382a8c1939a93 [2025-01-10 07:12:48,777 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 07:12:48,784 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 07:12:48,786 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 07:12:48,787 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 07:12:48,787 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 07:12:48,788 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/java_BubbleSort-alloca-1.i [2025-01-10 07:12:49,978 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0c3447fb4/066888b5dea742cab4622670297493b1/FLAG17716ccff [2025-01-10 07:12:50,329 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 07:12:50,329 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-memsafety/java_BubbleSort-alloca-1.i [2025-01-10 07:12:50,344 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0c3447fb4/066888b5dea742cab4622670297493b1/FLAG17716ccff [2025-01-10 07:12:50,602 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0c3447fb4/066888b5dea742cab4622670297493b1 [2025-01-10 07:12:50,604 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 07:12:50,606 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 07:12:50,612 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 07:12:50,612 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 07:12:50,615 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 07:12:50,621 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 07:12:50" (1/1) ... [2025-01-10 07:12:50,622 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7255d2d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:12:50, skipping insertion in model container [2025-01-10 07:12:50,622 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 07:12:50" (1/1) ... [2025-01-10 07:12:50,653 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 07:12:50,864 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 07:12:50,872 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 07:12:50,912 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 07:12:50,943 INFO L204 MainTranslator]: Completed translation [2025-01-10 07:12:50,944 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:12:50 WrapperNode [2025-01-10 07:12:50,946 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 07:12:50,947 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 07:12:50,947 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 07:12:50,947 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 07:12:50,953 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:12:50" (1/1) ... [2025-01-10 07:12:50,963 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:12:50" (1/1) ... [2025-01-10 07:12:50,984 INFO L138 Inliner]: procedures = 116, calls = 13, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 56 [2025-01-10 07:12:50,985 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 07:12:50,985 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 07:12:50,986 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 07:12:50,986 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 07:12:50,992 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:12:50" (1/1) ... [2025-01-10 07:12:50,992 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:12:50" (1/1) ... [2025-01-10 07:12:50,995 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:12:50" (1/1) ... [2025-01-10 07:12:51,009 INFO L175 MemorySlicer]: Split 7 memory accesses to 1 slices as follows [7]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 3 writes are split as follows [3]. [2025-01-10 07:12:51,010 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:12:50" (1/1) ... [2025-01-10 07:12:51,010 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:12:50" (1/1) ... [2025-01-10 07:12:51,018 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:12:50" (1/1) ... [2025-01-10 07:12:51,018 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:12:50" (1/1) ... [2025-01-10 07:12:51,022 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:12:50" (1/1) ... [2025-01-10 07:12:51,023 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:12:50" (1/1) ... [2025-01-10 07:12:51,023 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:12:50" (1/1) ... [2025-01-10 07:12:51,024 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 07:12:51,029 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 07:12:51,029 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 07:12:51,029 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 07:12:51,030 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:12:50" (1/1) ... [2025-01-10 07:12:51,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:12:51,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:12:51,069 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:12:51,073 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:12:51,091 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 07:12:51,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 07:12:51,092 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-10 07:12:51,092 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 07:12:51,092 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 07:12:51,092 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 07:12:51,165 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 07:12:51,168 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 07:12:51,279 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-01-10 07:12:51,280 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 07:12:51,285 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 07:12:51,286 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 07:12:51,286 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 07:12:51 BoogieIcfgContainer [2025-01-10 07:12:51,286 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 07:12:51,287 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-01-10 07:12:51,287 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-01-10 07:12:51,290 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-01-10 07:12:51,291 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 07:12:51,291 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.01 07:12:50" (1/3) ... [2025-01-10 07:12:51,292 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@31f5ed0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.01 07:12:51, skipping insertion in model container [2025-01-10 07:12:51,292 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 07:12:51,292 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:12:50" (2/3) ... [2025-01-10 07:12:51,292 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@31f5ed0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.01 07:12:51, skipping insertion in model container [2025-01-10 07:12:51,292 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 07:12:51,292 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 07:12:51" (3/3) ... [2025-01-10 07:12:51,293 INFO L363 chiAutomizerObserver]: Analyzing ICFG java_BubbleSort-alloca-1.i [2025-01-10 07:12:51,338 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-01-10 07:12:51,343 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-01-10 07:12:51,343 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-01-10 07:12:51,343 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-01-10 07:12:51,343 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-01-10 07:12:51,343 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-01-10 07:12:51,343 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-01-10 07:12:51,343 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-01-10 07:12:51,347 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:12:51,361 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2025-01-10 07:12:51,362 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:12:51,362 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:12:51,365 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-01-10 07:12:51,365 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-01-10 07:12:51,365 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-01-10 07:12:51,366 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:12:51,366 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2025-01-10 07:12:51,367 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:12:51,367 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:12:51,367 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-01-10 07:12:51,367 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-01-10 07:12:51,372 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~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~post11#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0;" [2025-01-10 07:12:51,372 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" [2025-01-10 07:12:51,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:12:51,375 INFO L85 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2025-01-10 07:12:51,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:12:51,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404866948] [2025-01-10 07:12:51,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:12:51,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:12:51,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:12:51,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:12:51,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:12:51,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:12:51,448 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:12:51,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:12:51,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:12:51,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:12:51,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:12:51,474 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:12:51,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:12:51,476 INFO L85 PathProgramCache]: Analyzing trace with hash 44, now seen corresponding path program 1 times [2025-01-10 07:12:51,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:12:51,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382255919] [2025-01-10 07:12:51,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:12:51,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:12:51,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-01-10 07:12:51,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-01-10 07:12:51,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:12:51,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:12:51,484 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:12:51,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-01-10 07:12:51,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-01-10 07:12:51,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:12:51,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:12:51,492 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:12:51,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:12:51,493 INFO L85 PathProgramCache]: Analyzing trace with hash 28695752, now seen corresponding path program 1 times [2025-01-10 07:12:51,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:12:51,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496557387] [2025-01-10 07:12:51,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:12:51,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:12:51,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 07:12:51,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 07:12:51,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:12:51,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:12:51,515 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:12:51,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 07:12:51,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 07:12:51,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:12:51,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:12:51,535 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:12:51,814 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:12:51,815 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:12:51,815 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:12:51,815 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:12:51,815 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-01-10 07:12:51,815 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:12:51,816 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:12:51,816 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:12:51,816 INFO L132 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca-1.i_Iteration1_Lasso [2025-01-10 07:12:51,816 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:12:51,816 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:12:51,829 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:51,835 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:51,838 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:51,844 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:51,848 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:51,851 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:51,961 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:51,963 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:51,967 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:52,223 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:12:52,226 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-01-10 07:12:52,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:12:52,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:12:52,229 INFO L229 MonitoredProcess]: Starting monitored process 2 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:12:52,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-01-10 07:12:52,232 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:12:52,244 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:12:52,245 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:12:52,245 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:12:52,245 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:12:52,245 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:12:52,249 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:12:52,249 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:12:52,254 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:12:52,265 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-01-10 07:12:52,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:12:52,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:12:52,269 INFO L229 MonitoredProcess]: Starting monitored process 3 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:12:52,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-01-10 07:12:52,271 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:12:52,284 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:12:52,284 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:12:52,284 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:12:52,284 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:12:52,285 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:12:52,285 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:12:52,285 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:12:52,287 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:12:52,294 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-01-10 07:12:52,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:12:52,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:12:52,297 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:12:52,298 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:12:52,300 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:12:52,313 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:12:52,313 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:12:52,313 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:12:52,313 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:12:52,316 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:12:52,317 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:12:52,320 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:12:52,327 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-01-10 07:12:52,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:12:52,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:12:52,331 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:12:52,332 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:12:52,333 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:12:52,342 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:12:52,343 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:12:52,343 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:12:52,343 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:12:52,343 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:12:52,343 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:12:52,343 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:12:52,344 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:12:52,350 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-01-10 07:12:52,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:12:52,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:12:52,353 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:12:52,354 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:12:52,355 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:12:52,365 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:12:52,365 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:12:52,365 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:12:52,365 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:12:52,366 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:12:52,366 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:12:52,369 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:12:52,377 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-01-10 07:12:52,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:12:52,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:12:52,379 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:12:52,380 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:12:52,381 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:12:52,391 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:12:52,391 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:12:52,391 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:12:52,391 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:12:52,393 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:12:52,393 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:12:52,396 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:12:52,401 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:12:52,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:12:52,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:12:52,404 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:12:52,405 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:12:52,406 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:12:52,416 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:12:52,416 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:12:52,416 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:12:52,416 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:12:52,416 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:12:52,417 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:12:52,417 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:12:52,420 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:12:52,426 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:12:52,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:12:52,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:12:52,428 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:12:52,430 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:12:52,431 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:12:52,440 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:12:52,441 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:12:52,441 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:12:52,441 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:12:52,443 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:12:52,443 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:12:52,447 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:12:52,457 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-01-10 07:12:52,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:12:52,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:12:52,459 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:12:52,461 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:12:52,462 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:12:52,472 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:12:52,473 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:12:52,473 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:12:52,473 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:12:52,483 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:12:52,483 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:12:52,496 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-01-10 07:12:52,528 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-01-10 07:12:52,530 INFO L444 ModelExtractionUtils]: 6 out of 19 variables were initially zero. Simplification set additionally 9 variables to zero. [2025-01-10 07:12:52,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:12:52,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:12:52,537 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:12:52,539 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:12:52,540 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-01-10 07:12:52,553 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-01-10 07:12:52,554 INFO L474 LassoAnalysis]: Proved termination. [2025-01-10 07:12:52,554 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc9#1.base)_1, ULTIMATE.start_main_~numbers~0#1.offset, ULTIMATE.start_main_~i~1#1) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc9#1.base)_1 - 1*ULTIMATE.start_main_~numbers~0#1.offset - 4*ULTIMATE.start_main_~i~1#1 Supporting invariants [] [2025-01-10 07:12:52,568 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:12:52,582 INFO L156 tatePredicateManager]: 2 out of 3 supporting invariants were superfluous and have been removed [2025-01-10 07:12:52,591 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-01-10 07:12:52,591 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-01-10 07:12:52,591 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~numbers~0!offset [2025-01-10 07:12:52,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:12:52,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:12:52,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:12:52,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:12:52,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:12:52,631 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 07:12:52,632 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:12:52,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-01-10 07:12:52,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-01-10 07:12:52,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:12:52,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:12:52,651 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 07:12:52,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:12:52,655 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:12:52,676 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-01-10 07:12:52,677 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:12:52,716 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 15 states and 21 transitions. Complement of second has 3 states. [2025-01-10 07:12:52,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2025-01-10 07:12:52,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:12:52,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 6 transitions. [2025-01-10 07:12:52,726 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 6 transitions. Stem has 4 letters. Loop has 1 letters. [2025-01-10 07:12:52,726 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:12:52,726 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 6 transitions. Stem has 5 letters. Loop has 1 letters. [2025-01-10 07:12:52,726 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:12:52,726 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 6 transitions. Stem has 4 letters. Loop has 2 letters. [2025-01-10 07:12:52,726 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:12:52,727 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 21 transitions. [2025-01-10 07:12:52,731 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-01-10 07:12:52,733 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 11 states and 16 transitions. [2025-01-10 07:12:52,734 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-01-10 07:12:52,734 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2025-01-10 07:12:52,734 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 16 transitions. [2025-01-10 07:12:52,736 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:12:52,736 INFO L218 hiAutomatonCegarLoop]: Abstraction has 11 states and 16 transitions. [2025-01-10 07:12:52,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 16 transitions. [2025-01-10 07:12:52,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2025-01-10 07:12:52,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.5) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:12:52,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 15 transitions. [2025-01-10 07:12:52,753 INFO L240 hiAutomatonCegarLoop]: Abstraction has 10 states and 15 transitions. [2025-01-10 07:12:52,753 INFO L432 stractBuchiCegarLoop]: Abstraction has 10 states and 15 transitions. [2025-01-10 07:12:52,753 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-01-10 07:12:52,753 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 15 transitions. [2025-01-10 07:12:52,755 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-01-10 07:12:52,755 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:12:52,755 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:12:52,756 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-01-10 07:12:52,756 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-01-10 07:12:52,756 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~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~post11#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0;" "assume !(main_~i~1#1 < main_~array_size~0#1);havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem2#1, sort_#t~mem3#1, sort_#t~mem4#1, sort_#t~mem5#1, sort_~temp~0#1, sort_#t~post6#1, sort_#t~post7#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1;" [2025-01-10 07:12:52,756 INFO L754 eck$LassoCheckResult]: Loop: "assume sort_~pass~0#1 < sort_~n#1;sort_~i~0#1 := 0;" "assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);sort_#t~post7#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post7#1;havoc sort_#t~post7#1;" [2025-01-10 07:12:52,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:12:52,757 INFO L85 PathProgramCache]: Analyzing trace with hash 28695754, now seen corresponding path program 1 times [2025-01-10 07:12:52,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:12:52,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231407349] [2025-01-10 07:12:52,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:12:52,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:12:52,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 07:12:52,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 07:12:52,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:12:52,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:12:52,861 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:12:52,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:12:52,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231407349] [2025-01-10 07:12:52,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231407349] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:12:52,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 07:12:52,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 07:12:52,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40187121] [2025-01-10 07:12:52,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:12:52,864 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 07:12:52,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:12:52,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1582, now seen corresponding path program 1 times [2025-01-10 07:12:52,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:12:52,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579460720] [2025-01-10 07:12:52,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:12:52,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:12:52,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:12:52,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:12:52,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:12:52,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:12:52,890 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:12:52,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:12:52,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579460720] [2025-01-10 07:12:52,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579460720] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:12:52,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 07:12:52,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 07:12:52,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758588569] [2025-01-10 07:12:52,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:12:52,891 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-01-10 07:12:52,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:12:52,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 07:12:52,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 07:12:52,893 INFO L87 Difference]: Start difference. First operand 10 states and 15 transitions. cyclomatic complexity: 7 Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:12:52,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:12:52,905 INFO L93 Difference]: Finished difference Result 11 states and 16 transitions. [2025-01-10 07:12:52,905 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 16 transitions. [2025-01-10 07:12:52,906 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-01-10 07:12:52,906 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 16 transitions. [2025-01-10 07:12:52,906 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2025-01-10 07:12:52,906 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2025-01-10 07:12:52,906 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 16 transitions. [2025-01-10 07:12:52,906 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:12:52,906 INFO L218 hiAutomatonCegarLoop]: Abstraction has 11 states and 16 transitions. [2025-01-10 07:12:52,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 16 transitions. [2025-01-10 07:12:52,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2025-01-10 07:12:52,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:12:52,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 16 transitions. [2025-01-10 07:12:52,907 INFO L240 hiAutomatonCegarLoop]: Abstraction has 11 states and 16 transitions. [2025-01-10 07:12:52,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 07:12:52,908 INFO L432 stractBuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2025-01-10 07:12:52,908 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-01-10 07:12:52,908 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 16 transitions. [2025-01-10 07:12:52,908 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-01-10 07:12:52,908 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:12:52,908 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:12:52,909 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-01-10 07:12:52,909 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-01-10 07:12:52,909 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~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~post11#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0;" "assume !(main_~i~1#1 < main_~array_size~0#1);havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem2#1, sort_#t~mem3#1, sort_#t~mem4#1, sort_#t~mem5#1, sort_~temp~0#1, sort_#t~post6#1, sort_#t~post7#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1;" [2025-01-10 07:12:52,909 INFO L754 eck$LassoCheckResult]: Loop: "assume sort_~pass~0#1 < sort_~n#1;sort_~i~0#1 := 0;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume sort_#t~mem2#1 > sort_#t~mem3#1;havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem4#1;havoc sort_#t~mem4#1;call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem5#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem5#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);sort_#t~post7#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post7#1;havoc sort_#t~post7#1;" [2025-01-10 07:12:52,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:12:52,909 INFO L85 PathProgramCache]: Analyzing trace with hash 28695754, now seen corresponding path program 2 times [2025-01-10 07:12:52,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:12:52,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378427593] [2025-01-10 07:12:52,910 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:12:52,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:12:52,913 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5 statements into 1 equivalence classes. [2025-01-10 07:12:52,916 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 07:12:52,917 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 07:12:52,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:12:52,946 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:12:52,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:12:52,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378427593] [2025-01-10 07:12:52,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378427593] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:12:52,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 07:12:52,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 07:12:52,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149214054] [2025-01-10 07:12:52,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:12:52,947 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 07:12:52,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:12:52,947 INFO L85 PathProgramCache]: Analyzing trace with hash 46887191, now seen corresponding path program 1 times [2025-01-10 07:12:52,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:12:52,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821583998] [2025-01-10 07:12:52,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:12:52,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:12:52,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 07:12:52,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 07:12:52,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:12:52,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:12:52,953 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:12:52,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 07:12:52,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 07:12:52,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:12:52,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:12:52,958 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:12:53,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:12:53,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 07:12:53,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 07:12:53,042 INFO L87 Difference]: Start difference. First operand 11 states and 16 transitions. cyclomatic complexity: 7 Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:12:53,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:12:53,054 INFO L93 Difference]: Finished difference Result 11 states and 15 transitions. [2025-01-10 07:12:53,054 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 15 transitions. [2025-01-10 07:12:53,054 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-01-10 07:12:53,055 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 15 transitions. [2025-01-10 07:12:53,055 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2025-01-10 07:12:53,055 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2025-01-10 07:12:53,055 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 15 transitions. [2025-01-10 07:12:53,055 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:12:53,055 INFO L218 hiAutomatonCegarLoop]: Abstraction has 11 states and 15 transitions. [2025-01-10 07:12:53,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 15 transitions. [2025-01-10 07:12:53,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2025-01-10 07:12:53,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:12:53,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 15 transitions. [2025-01-10 07:12:53,056 INFO L240 hiAutomatonCegarLoop]: Abstraction has 11 states and 15 transitions. [2025-01-10 07:12:53,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 07:12:53,057 INFO L432 stractBuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2025-01-10 07:12:53,057 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-01-10 07:12:53,057 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 15 transitions. [2025-01-10 07:12:53,057 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-01-10 07:12:53,057 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:12:53,057 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:12:53,057 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-01-10 07:12:53,058 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-01-10 07:12:53,058 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~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~post11#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "assume !(main_~i~1#1 < main_~array_size~0#1);havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem2#1, sort_#t~mem3#1, sort_#t~mem4#1, sort_#t~mem5#1, sort_~temp~0#1, sort_#t~post6#1, sort_#t~post7#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1;" [2025-01-10 07:12:53,058 INFO L754 eck$LassoCheckResult]: Loop: "assume sort_~pass~0#1 < sort_~n#1;sort_~i~0#1 := 0;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume sort_#t~mem2#1 > sort_#t~mem3#1;havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem4#1;havoc sort_#t~mem4#1;call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem5#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem5#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);sort_#t~post7#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post7#1;havoc sort_#t~post7#1;" [2025-01-10 07:12:53,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:12:53,058 INFO L85 PathProgramCache]: Analyzing trace with hash 889568327, now seen corresponding path program 1 times [2025-01-10 07:12:53,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:12:53,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581560767] [2025-01-10 07:12:53,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:12:53,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:12:53,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 07:12:53,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 07:12:53,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:12:53,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:12:53,078 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:12:53,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 07:12:53,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 07:12:53,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:12:53,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:12:53,099 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:12:53,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:12:53,100 INFO L85 PathProgramCache]: Analyzing trace with hash 46887191, now seen corresponding path program 2 times [2025-01-10 07:12:53,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:12:53,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129296909] [2025-01-10 07:12:53,100 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:12:53,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:12:53,110 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5 statements into 2 equivalence classes. [2025-01-10 07:12:53,112 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 07:12:53,112 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 07:12:53,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:12:53,113 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:12:53,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 07:12:53,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 07:12:53,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:12:53,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:12:53,117 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:12:53,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:12:53,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1869508753, now seen corresponding path program 1 times [2025-01-10 07:12:53,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:12:53,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891866520] [2025-01-10 07:12:53,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:12:53,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:12:53,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 07:12:53,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 07:12:53,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:12:53,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:12:53,205 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 07:12:53,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:12:53,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891866520] [2025-01-10 07:12:53,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891866520] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 07:12:53,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1225591415] [2025-01-10 07:12:53,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:12:53,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 07:12:53,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:12:53,208 INFO L229 MonitoredProcess]: Starting monitored process 12 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:12:53,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-01-10 07:12:53,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 07:12:53,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 07:12:53,280 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-01-10 07:12:53,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:12:53,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:12:53,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-10 07:12:53,286 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:12:53,326 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 07:12:53,328 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 07:12:53,382 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 07:12:53,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1225591415] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 07:12:53,387 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 07:12:53,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-01-10 07:12:53,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898883062] [2025-01-10 07:12:53,387 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 07:12:53,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:12:53,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 07:12:53,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-10 07:12:53,555 INFO L87 Difference]: Start difference. First operand 11 states and 15 transitions. cyclomatic complexity: 6 Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:12:53,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:12:53,584 INFO L93 Difference]: Finished difference Result 13 states and 17 transitions. [2025-01-10 07:12:53,584 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 17 transitions. [2025-01-10 07:12:53,584 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-01-10 07:12:53,584 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 12 states and 16 transitions. [2025-01-10 07:12:53,584 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2025-01-10 07:12:53,584 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2025-01-10 07:12:53,585 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 16 transitions. [2025-01-10 07:12:53,585 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:12:53,585 INFO L218 hiAutomatonCegarLoop]: Abstraction has 12 states and 16 transitions. [2025-01-10 07:12:53,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 16 transitions. [2025-01-10 07:12:53,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2025-01-10 07:12:53,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:12:53,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2025-01-10 07:12:53,586 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 16 transitions. [2025-01-10 07:12:53,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 07:12:53,586 INFO L432 stractBuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2025-01-10 07:12:53,586 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-01-10 07:12:53,586 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2025-01-10 07:12:53,587 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-01-10 07:12:53,587 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:12:53,587 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:12:53,587 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1] [2025-01-10 07:12:53,587 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-01-10 07:12:53,587 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~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~post11#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "assume !(main_~i~1#1 < main_~array_size~0#1);havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem2#1, sort_#t~mem3#1, sort_#t~mem4#1, sort_#t~mem5#1, sort_~temp~0#1, sort_#t~post6#1, sort_#t~post7#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1;" [2025-01-10 07:12:53,587 INFO L754 eck$LassoCheckResult]: Loop: "assume sort_~pass~0#1 < sort_~n#1;sort_~i~0#1 := 0;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume sort_#t~mem2#1 > sort_#t~mem3#1;havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem4#1;havoc sort_#t~mem4#1;call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem5#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem5#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);sort_#t~post7#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post7#1;havoc sort_#t~post7#1;" [2025-01-10 07:12:53,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:12:53,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1806814314, now seen corresponding path program 2 times [2025-01-10 07:12:53,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:12:53,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214141289] [2025-01-10 07:12:53,588 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:12:53,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:12:53,593 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 7 statements into 2 equivalence classes. [2025-01-10 07:12:53,604 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 07:12:53,604 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 07:12:53,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:12:53,604 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:12:53,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 07:12:53,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 07:12:53,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:12:53,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:12:53,613 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:12:53,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:12:53,613 INFO L85 PathProgramCache]: Analyzing trace with hash 46887191, now seen corresponding path program 3 times [2025-01-10 07:12:53,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:12:53,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300840939] [2025-01-10 07:12:53,613 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 07:12:53,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:12:53,617 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 5 statements into 2 equivalence classes. [2025-01-10 07:12:53,623 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 07:12:53,623 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-10 07:12:53,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:12:53,623 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:12:53,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 07:12:53,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 07:12:53,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:12:53,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:12:53,627 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:12:53,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:12:53,627 INFO L85 PathProgramCache]: Analyzing trace with hash 226885198, now seen corresponding path program 2 times [2025-01-10 07:12:53,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:12:53,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168027993] [2025-01-10 07:12:53,628 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:12:53,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:12:53,632 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-01-10 07:12:53,651 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 07:12:53,651 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 07:12:53,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:12:53,651 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:12:53,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 07:12:53,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 07:12:53,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:12:53,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:12:53,670 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:12:53,966 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:12:53,966 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:12:53,967 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:12:53,967 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:12:53,967 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-01-10 07:12:53,967 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:12:53,967 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:12:53,967 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:12:53,967 INFO L132 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca-1.i_Iteration5_Lasso [2025-01-10 07:12:53,967 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:12:53,967 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:12:53,969 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:53,970 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:53,972 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:53,973 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:53,975 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:54,082 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:54,088 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:54,090 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:54,091 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:54,093 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:54,094 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:54,096 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:54,097 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:54,099 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:54,101 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:54,102 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:54,104 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:54,105 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:54,107 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:54,108 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:54,110 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:54,111 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:54,327 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:12:54,328 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-01-10 07:12:54,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:12:54,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:12:54,330 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:12:54,332 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:12:54,333 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:12:54,343 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:12:54,343 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:12:54,343 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:12:54,343 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:12:54,343 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:12:54,343 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:12:54,344 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:12:54,345 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:12:54,350 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:12:54,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:12:54,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:12:54,353 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:12:54,354 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:12:54,355 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:12:54,365 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:12:54,365 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:12:54,365 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:12:54,365 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:12:54,365 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:12:54,369 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:12:54,369 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:12:54,373 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:12:54,379 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:12:54,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:12:54,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:12:54,382 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:12:54,386 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:12:54,387 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:12:54,397 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:12:54,397 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:12:54,397 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:12:54,397 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:12:54,397 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:12:54,398 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:12:54,398 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:12:54,399 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:12:54,405 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:12:54,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:12:54,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:12:54,411 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:12:54,413 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:12:54,414 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:12:54,424 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:12:54,424 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:12:54,424 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:12:54,424 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:12:54,424 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:12:54,425 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:12:54,425 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:12:54,426 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:12:54,431 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:12:54,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:12:54,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:12:54,433 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:12:54,434 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:12:54,435 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:12:54,445 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:12:54,445 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:12:54,445 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:12:54,445 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:12:54,448 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:12:54,448 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:12:54,452 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:12:54,458 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:12:54,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:12:54,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:12:54,460 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:12:54,463 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:12:54,468 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:12:54,478 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:12:54,478 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:12:54,478 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:12:54,478 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:12:54,481 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:12:54,482 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:12:54,485 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:12:54,491 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:12:54,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:12:54,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:12:54,495 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:12:54,497 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:12:54,500 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:12:54,511 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:12:54,511 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:12:54,511 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:12:54,511 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:12:54,512 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:12:54,512 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:12:54,515 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:12:54,522 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:12:54,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:12:54,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:12:54,525 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:12:54,526 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:12:54,527 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:12:54,537 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:12:54,538 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:12:54,538 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:12:54,538 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:12:54,543 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:12:54,543 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:12:54,550 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:12:54,560 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-01-10 07:12:54,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:12:54,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:12:54,567 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:12:54,568 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:12:54,568 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:12:54,583 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:12:54,583 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:12:54,583 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:12:54,583 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:12:54,599 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:12:54,599 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:12:54,612 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-01-10 07:12:54,633 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2025-01-10 07:12:54,633 INFO L444 ModelExtractionUtils]: 2 out of 16 variables were initially zero. Simplification set additionally 11 variables to zero. [2025-01-10 07:12:54,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:12:54,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:12:54,636 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:12:54,637 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:12:54,638 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-01-10 07:12:54,648 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-01-10 07:12:54,648 INFO L474 LassoAnalysis]: Proved termination. [2025-01-10 07:12:54,648 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_sort_~x#1.base) ULTIMATE.start_sort_~x#1.offset)_1, v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc9#1.base) 4)_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_sort_~x#1.base) ULTIMATE.start_sort_~x#1.offset)_1 - 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc9#1.base) 4)_1 Supporting invariants [] [2025-01-10 07:12:54,656 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:12:54,667 INFO L156 tatePredicateManager]: 5 out of 7 supporting invariants were superfluous and have been removed [2025-01-10 07:12:54,670 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-01-10 07:12:54,671 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-01-10 07:12:54,671 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~x!base,]]] [2025-01-10 07:12:54,671 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-01-10 07:12:54,671 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-01-10 07:12:54,671 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[#t~malloc9!base,]]] [2025-01-10 07:12:54,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:12:54,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 07:12:54,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 07:12:54,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:12:54,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:12:54,704 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-10 07:12:54,705 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:12:54,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 07:12:54,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 07:12:54,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:12:54,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:12:54,740 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-10 07:12:54,741 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:12:54,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 25 [2025-01-10 07:12:54,835 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:12:54,836 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2025-01-10 07:12:54,836 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 6 Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:12:54,898 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 6. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 30 states and 41 transitions. Complement of second has 10 states. [2025-01-10 07:12:54,899 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:12:54,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:12:54,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 18 transitions. [2025-01-10 07:12:54,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 7 letters. Loop has 5 letters. [2025-01-10 07:12:54,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:12:54,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 12 letters. Loop has 5 letters. [2025-01-10 07:12:54,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:12:54,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 7 letters. Loop has 10 letters. [2025-01-10 07:12:54,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:12:54,900 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 41 transitions. [2025-01-10 07:12:54,901 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2025-01-10 07:12:54,901 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 41 transitions. [2025-01-10 07:12:54,901 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2025-01-10 07:12:54,902 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2025-01-10 07:12:54,902 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 41 transitions. [2025-01-10 07:12:54,902 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:12:54,902 INFO L218 hiAutomatonCegarLoop]: Abstraction has 30 states and 41 transitions. [2025-01-10 07:12:54,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 41 transitions. [2025-01-10 07:12:54,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 26. [2025-01-10 07:12:54,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 25 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:12:54,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 36 transitions. [2025-01-10 07:12:54,903 INFO L240 hiAutomatonCegarLoop]: Abstraction has 26 states and 36 transitions. [2025-01-10 07:12:54,903 INFO L432 stractBuchiCegarLoop]: Abstraction has 26 states and 36 transitions. [2025-01-10 07:12:54,903 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-01-10 07:12:54,904 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 36 transitions. [2025-01-10 07:12:54,904 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2025-01-10 07:12:54,904 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:12:54,904 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:12:54,904 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2025-01-10 07:12:54,904 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-01-10 07:12:54,904 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~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~post11#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "assume !(main_~i~1#1 < main_~array_size~0#1);havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem2#1, sort_#t~mem3#1, sort_#t~mem4#1, sort_#t~mem5#1, sort_~temp~0#1, sort_#t~post6#1, sort_#t~post7#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1;" "assume sort_~pass~0#1 < sort_~n#1;sort_~i~0#1 := 0;" [2025-01-10 07:12:54,905 INFO L754 eck$LassoCheckResult]: Loop: "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);sort_#t~post7#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post7#1;havoc sort_#t~post7#1;" "assume sort_~pass~0#1 < sort_~n#1;sort_~i~0#1 := 0;" [2025-01-10 07:12:54,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:12:54,905 INFO L85 PathProgramCache]: Analyzing trace with hash 176668905, now seen corresponding path program 1 times [2025-01-10 07:12:54,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:12:54,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263749072] [2025-01-10 07:12:54,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:12:54,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:12:54,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 07:12:54,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 07:12:54,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:12:54,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:12:54,913 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:12:54,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 07:12:54,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 07:12:54,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:12:54,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:12:54,919 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:12:54,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:12:54,920 INFO L85 PathProgramCache]: Analyzing trace with hash 50734123, now seen corresponding path program 1 times [2025-01-10 07:12:54,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:12:54,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894422535] [2025-01-10 07:12:54,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:12:54,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:12:54,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 07:12:54,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 07:12:54,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:12:54,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:12:54,930 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:12:54,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 07:12:54,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 07:12:54,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:12:54,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:12:54,933 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:12:54,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:12:54,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1556433853, now seen corresponding path program 1 times [2025-01-10 07:12:54,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:12:54,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691312002] [2025-01-10 07:12:54,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:12:54,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:12:54,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 07:12:54,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 07:12:54,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:12:54,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:12:54,984 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 07:12:54,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:12:54,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691312002] [2025-01-10 07:12:54,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691312002] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 07:12:54,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [336132353] [2025-01-10 07:12:54,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:12:54,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 07:12:54,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:12:54,989 INFO L229 MonitoredProcess]: Starting monitored process 23 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:12:54,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-01-10 07:12:55,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 07:12:55,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 07:12:55,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:12:55,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:12:55,031 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-10 07:12:55,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:12:55,076 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 07:12:55,076 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 07:12:55,116 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 07:12:55,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [336132353] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 07:12:55,117 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 07:12:55,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 10 [2025-01-10 07:12:55,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226376088] [2025-01-10 07:12:55,117 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 07:12:55,195 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:12:55,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:12:55,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 07:12:55,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-01-10 07:12:55,214 INFO L87 Difference]: Start difference. First operand 26 states and 36 transitions. cyclomatic complexity: 14 Second operand has 11 states, 10 states have (on average 2.8) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:12:55,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:12:55,284 INFO L93 Difference]: Finished difference Result 65 states and 86 transitions. [2025-01-10 07:12:55,284 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 86 transitions. [2025-01-10 07:12:55,285 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 26 [2025-01-10 07:12:55,285 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 54 states and 71 transitions. [2025-01-10 07:12:55,286 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2025-01-10 07:12:55,286 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2025-01-10 07:12:55,286 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 71 transitions. [2025-01-10 07:12:55,286 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:12:55,286 INFO L218 hiAutomatonCegarLoop]: Abstraction has 54 states and 71 transitions. [2025-01-10 07:12:55,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 71 transitions. [2025-01-10 07:12:55,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 42. [2025-01-10 07:12:55,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 41 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:12:55,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 56 transitions. [2025-01-10 07:12:55,292 INFO L240 hiAutomatonCegarLoop]: Abstraction has 42 states and 56 transitions. [2025-01-10 07:12:55,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 07:12:55,293 INFO L432 stractBuchiCegarLoop]: Abstraction has 42 states and 56 transitions. [2025-01-10 07:12:55,293 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-01-10 07:12:55,293 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 56 transitions. [2025-01-10 07:12:55,294 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 19 [2025-01-10 07:12:55,294 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:12:55,294 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:12:55,294 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 1, 1, 1, 1, 1, 1] [2025-01-10 07:12:55,294 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1] [2025-01-10 07:12:55,294 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~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~post11#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "assume !(main_~i~1#1 < main_~array_size~0#1);havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem2#1, sort_#t~mem3#1, sort_#t~mem4#1, sort_#t~mem5#1, sort_~temp~0#1, sort_#t~post6#1, sort_#t~post7#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1;" "assume sort_~pass~0#1 < sort_~n#1;sort_~i~0#1 := 0;" [2025-01-10 07:12:55,294 INFO L754 eck$LassoCheckResult]: Loop: "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);sort_#t~post7#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post7#1;havoc sort_#t~post7#1;" "assume sort_~pass~0#1 < sort_~n#1;sort_~i~0#1 := 0;" [2025-01-10 07:12:55,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:12:55,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1181766732, now seen corresponding path program 2 times [2025-01-10 07:12:55,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:12:55,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900750143] [2025-01-10 07:12:55,295 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:12:55,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:12:55,299 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 9 statements into 2 equivalence classes. [2025-01-10 07:12:55,306 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 07:12:55,306 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 07:12:55,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:12:55,306 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:12:55,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 07:12:55,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 07:12:55,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:12:55,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:12:55,312 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:12:55,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:12:55,313 INFO L85 PathProgramCache]: Analyzing trace with hash -416243628, now seen corresponding path program 2 times [2025-01-10 07:12:55,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:12:55,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868672875] [2025-01-10 07:12:55,313 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:12:55,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:12:55,315 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 8 statements into 2 equivalence classes. [2025-01-10 07:12:55,317 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 07:12:55,317 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 07:12:55,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:12:55,317 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:12:55,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 07:12:55,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 07:12:55,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:12:55,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:12:55,321 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:12:55,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:12:55,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1575388769, now seen corresponding path program 2 times [2025-01-10 07:12:55,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:12:55,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037779951] [2025-01-10 07:12:55,322 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:12:55,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:12:55,326 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-01-10 07:12:55,334 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 07:12:55,334 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 07:12:55,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:12:55,335 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:12:55,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 07:12:55,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 07:12:55,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:12:55,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:12:55,348 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:12:55,689 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:12:55,689 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:12:55,689 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:12:55,690 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:12:55,690 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-01-10 07:12:55,690 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:12:55,690 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:12:55,690 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:12:55,690 INFO L132 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca-1.i_Iteration7_Lasso [2025-01-10 07:12:55,690 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:12:55,690 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:12:55,691 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:55,694 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:55,696 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:55,697 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:55,698 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:55,700 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:55,702 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:55,704 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:55,705 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:55,707 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:55,708 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:55,709 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:55,895 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:55,900 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:55,902 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:55,904 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:55,905 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:55,907 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:55,908 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:55,910 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:56,142 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:12:56,143 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-01-10 07:12:56,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:12:56,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:12:56,145 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:12:56,146 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:12:56,148 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:12:56,158 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:12:56,158 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:12:56,158 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:12:56,158 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:12:56,158 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:12:56,159 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:12:56,159 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:12:56,160 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:12:56,165 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:12:56,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:12:56,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:12:56,167 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:12:56,168 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:12:56,170 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:12:56,180 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:12:56,180 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:12:56,180 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:12:56,180 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:12:56,180 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:12:56,181 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:12:56,181 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:12:56,182 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:12:56,189 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2025-01-10 07:12:56,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:12:56,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:12:56,191 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:12:56,194 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:12:56,195 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:12:56,206 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:12:56,206 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:12:56,207 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:12:56,207 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:12:56,207 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:12:56,207 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:12:56,207 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:12:56,208 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:12:56,215 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:12:56,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:12:56,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:12:56,217 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:12:56,218 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:12:56,220 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:12:56,229 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:12:56,229 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:12:56,230 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:12:56,230 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:12:56,230 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:12:56,230 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:12:56,230 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:12:56,231 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:12:56,236 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2025-01-10 07:12:56,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:12:56,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:12:56,239 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:12:56,240 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:12:56,241 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:12:56,252 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:12:56,253 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:12:56,253 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:12:56,253 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:12:56,254 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:12:56,254 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:12:56,257 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:12:56,264 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2025-01-10 07:12:56,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:12:56,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:12:56,267 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:12:56,268 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:12:56,269 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:12:56,279 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:12:56,279 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:12:56,279 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:12:56,279 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:12:56,279 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:12:56,280 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:12:56,280 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:12:56,281 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:12:56,291 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:12:56,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:12:56,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:12:56,293 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:12:56,294 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:12:56,295 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:12:56,305 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:12:56,305 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:12:56,305 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:12:56,305 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:12:56,305 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:12:56,306 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:12:56,306 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:12:56,308 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:12:56,314 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:12:56,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:12:56,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:12:56,318 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:12:56,321 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:12:56,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:12:56,348 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:12:56,348 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:12:56,348 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:12:56,348 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:12:56,348 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:12:56,348 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:12:56,348 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:12:56,350 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:12:56,357 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:12:56,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:12:56,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:12:56,360 INFO L229 MonitoredProcess]: Starting monitored process 32 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:12:56,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2025-01-10 07:12:56,365 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:12:56,376 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:12:56,376 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:12:56,377 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:12:56,377 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:12:56,377 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:12:56,377 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:12:56,377 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:12:56,379 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:12:56,388 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2025-01-10 07:12:56,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:12:56,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:12:56,393 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:12:56,397 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:12:56,397 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:12:56,408 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:12:56,408 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:12:56,408 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:12:56,408 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:12:56,408 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:12:56,408 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:12:56,408 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:12:56,409 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:12:56,415 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2025-01-10 07:12:56,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:12:56,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:12:56,417 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:12:56,419 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:12:56,420 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:12:56,430 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:12:56,430 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:12:56,430 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:12:56,430 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:12:56,430 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:12:56,431 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:12:56,431 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:12:56,432 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:12:56,438 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:12:56,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:12:56,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:12:56,440 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:12:56,441 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:12:56,442 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:12:56,451 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:12:56,451 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:12:56,452 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:12:56,452 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:12:56,455 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:12:56,455 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:12:56,458 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:12:56,463 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:12:56,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:12:56,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:12:56,465 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:12:56,466 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:12:56,467 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:12:56,476 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:12:56,476 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:12:56,476 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:12:56,476 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:12:56,487 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:12:56,487 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:12:56,503 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:12:56,510 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:12:56,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:12:56,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:12:56,513 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:12:56,515 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:12:56,516 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:12:56,527 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:12:56,527 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:12:56,527 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:12:56,527 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:12:56,532 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:12:56,532 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:12:56,540 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-01-10 07:12:56,557 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2025-01-10 07:12:56,557 INFO L444 ModelExtractionUtils]: 12 out of 22 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-01-10 07:12:56,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:12:56,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:12:56,560 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:12:56,561 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:12:56,561 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-01-10 07:12:56,573 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-01-10 07:12:56,573 INFO L474 LassoAnalysis]: Proved termination. [2025-01-10 07:12:56,573 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sort_~pass~0#1, ULTIMATE.start_sort_~n#1) = -1*ULTIMATE.start_sort_~pass~0#1 + 1*ULTIMATE.start_sort_~n#1 Supporting invariants [] [2025-01-10 07:12:56,579 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2025-01-10 07:12:56,596 INFO L156 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2025-01-10 07:12:56,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:12:56,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 07:12:56,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 07:12:56,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:12:56,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:12:56,620 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 07:12:56,621 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:12:56,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 07:12:56,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 07:12:56,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:12:56,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:12:56,634 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 07:12:56,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:12:56,649 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 07:12:56,650 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-01-10 07:12:56,650 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 56 transitions. cyclomatic complexity: 19 Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:12:56,665 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 56 transitions. cyclomatic complexity: 19. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 71 states and 97 transitions. Complement of second has 6 states. [2025-01-10 07:12:56,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-01-10 07:12:56,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:12:56,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2025-01-10 07:12:56,666 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 9 letters. Loop has 8 letters. [2025-01-10 07:12:56,666 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:12:56,667 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 17 letters. Loop has 8 letters. [2025-01-10 07:12:56,667 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:12:56,667 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 9 letters. Loop has 16 letters. [2025-01-10 07:12:56,667 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:12:56,667 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 71 states and 97 transitions. [2025-01-10 07:12:56,668 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2025-01-10 07:12:56,669 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 71 states to 58 states and 79 transitions. [2025-01-10 07:12:56,669 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2025-01-10 07:12:56,669 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2025-01-10 07:12:56,669 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 79 transitions. [2025-01-10 07:12:56,669 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:12:56,669 INFO L218 hiAutomatonCegarLoop]: Abstraction has 58 states and 79 transitions. [2025-01-10 07:12:56,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states and 79 transitions. [2025-01-10 07:12:56,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 44. [2025-01-10 07:12:56,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 1.4090909090909092) internal successors, (62), 43 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:12:56,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 62 transitions. [2025-01-10 07:12:56,672 INFO L240 hiAutomatonCegarLoop]: Abstraction has 44 states and 62 transitions. [2025-01-10 07:12:56,672 INFO L432 stractBuchiCegarLoop]: Abstraction has 44 states and 62 transitions. [2025-01-10 07:12:56,672 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-01-10 07:12:56,672 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 62 transitions. [2025-01-10 07:12:56,672 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-01-10 07:12:56,672 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:12:56,672 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:12:56,673 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:12:56,673 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-01-10 07:12:56,673 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~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~post11#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "assume !(main_~i~1#1 < main_~array_size~0#1);havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem2#1, sort_#t~mem3#1, sort_#t~mem4#1, sort_#t~mem5#1, sort_~temp~0#1, sort_#t~post6#1, sort_#t~post7#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1;" "assume sort_~pass~0#1 < sort_~n#1;sort_~i~0#1 := 0;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume sort_#t~mem2#1 > sort_#t~mem3#1;havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem4#1;havoc sort_#t~mem4#1;call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem5#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem5#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1;" [2025-01-10 07:12:56,673 INFO L754 eck$LassoCheckResult]: Loop: "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume sort_#t~mem2#1 > sort_#t~mem3#1;havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem4#1;havoc sort_#t~mem4#1;call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem5#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem5#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1;" [2025-01-10 07:12:56,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:12:56,673 INFO L85 PathProgramCache]: Analyzing trace with hash -2019873396, now seen corresponding path program 1 times [2025-01-10 07:12:56,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:12:56,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471281424] [2025-01-10 07:12:56,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:12:56,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:12:56,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 07:12:56,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 07:12:56,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:12:56,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:12:56,683 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:12:56,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 07:12:56,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 07:12:56,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:12:56,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:12:56,690 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:12:56,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:12:56,690 INFO L85 PathProgramCache]: Analyzing trace with hash 59360, now seen corresponding path program 1 times [2025-01-10 07:12:56,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:12:56,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489450706] [2025-01-10 07:12:56,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:12:56,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:12:56,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:12:56,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:12:56,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:12:56,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:12:56,694 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:12:56,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:12:56,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:12:56,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:12:56,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:12:56,697 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:12:56,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:12:56,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1556493707, now seen corresponding path program 1 times [2025-01-10 07:12:56,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:12:56,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612942218] [2025-01-10 07:12:56,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:12:56,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:12:56,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 07:12:56,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 07:12:56,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:12:56,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:12:56,788 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:12:56,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:12:56,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612942218] [2025-01-10 07:12:56,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612942218] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 07:12:56,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1020351093] [2025-01-10 07:12:56,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:12:56,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 07:12:56,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:12:56,793 INFO L229 MonitoredProcess]: Starting monitored process 39 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:12:56,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2025-01-10 07:12:56,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 07:12:56,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 07:12:56,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:12:56,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:12:56,863 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:12:56,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-10 07:12:56,866 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:12:56,917 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:12:56,917 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 07:12:56,973 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:12:56,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1020351093] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 07:12:56,973 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 07:12:56,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2025-01-10 07:12:56,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120534304] [2025-01-10 07:12:56,974 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 07:12:57,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:12:57,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-10 07:12:57,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2025-01-10 07:12:57,036 INFO L87 Difference]: Start difference. First operand 44 states and 62 transitions. cyclomatic complexity: 23 Second operand has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:12:57,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:12:57,081 INFO L93 Difference]: Finished difference Result 48 states and 65 transitions. [2025-01-10 07:12:57,081 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 65 transitions. [2025-01-10 07:12:57,081 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-01-10 07:12:57,082 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 41 states and 57 transitions. [2025-01-10 07:12:57,082 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2025-01-10 07:12:57,082 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2025-01-10 07:12:57,082 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 57 transitions. [2025-01-10 07:12:57,082 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:12:57,082 INFO L218 hiAutomatonCegarLoop]: Abstraction has 41 states and 57 transitions. [2025-01-10 07:12:57,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 57 transitions. [2025-01-10 07:12:57,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2025-01-10 07:12:57,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 1.3902439024390243) internal successors, (57), 40 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:12:57,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 57 transitions. [2025-01-10 07:12:57,083 INFO L240 hiAutomatonCegarLoop]: Abstraction has 41 states and 57 transitions. [2025-01-10 07:12:57,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 07:12:57,084 INFO L432 stractBuchiCegarLoop]: Abstraction has 41 states and 57 transitions. [2025-01-10 07:12:57,084 INFO L338 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-01-10 07:12:57,084 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 57 transitions. [2025-01-10 07:12:57,085 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-01-10 07:12:57,085 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:12:57,085 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:12:57,085 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:12:57,085 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-01-10 07:12:57,085 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~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~post11#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "assume !(main_~i~1#1 < main_~array_size~0#1);havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem2#1, sort_#t~mem3#1, sort_#t~mem4#1, sort_#t~mem5#1, sort_~temp~0#1, sort_#t~post6#1, sort_#t~post7#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1;" "assume sort_~pass~0#1 < sort_~n#1;sort_~i~0#1 := 0;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;" [2025-01-10 07:12:57,085 INFO L754 eck$LassoCheckResult]: Loop: "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume sort_#t~mem2#1 > sort_#t~mem3#1;havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem4#1;havoc sort_#t~mem4#1;call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem5#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem5#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1;" [2025-01-10 07:12:57,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:12:57,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1806464049, now seen corresponding path program 1 times [2025-01-10 07:12:57,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:12:57,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956146773] [2025-01-10 07:12:57,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:12:57,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:12:57,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 07:12:57,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 07:12:57,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:12:57,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:12:57,097 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:12:57,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 07:12:57,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 07:12:57,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:12:57,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:12:57,105 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:12:57,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:12:57,106 INFO L85 PathProgramCache]: Analyzing trace with hash 59360, now seen corresponding path program 2 times [2025-01-10 07:12:57,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:12:57,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182967883] [2025-01-10 07:12:57,106 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:12:57,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:12:57,109 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:12:57,110 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:12:57,110 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 07:12:57,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:12:57,110 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:12:57,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:12:57,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:12:57,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:12:57,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:12:57,113 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:12:57,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:12:57,113 INFO L85 PathProgramCache]: Analyzing trace with hash 430294448, now seen corresponding path program 1 times [2025-01-10 07:12:57,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:12:57,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708068143] [2025-01-10 07:12:57,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:12:57,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:12:57,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 07:12:57,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 07:12:57,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:12:57,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:12:57,125 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:12:57,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 07:12:57,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 07:12:57,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:12:57,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:12:57,135 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:12:57,537 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:12:57,537 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:12:57,537 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:12:57,537 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:12:57,537 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-01-10 07:12:57,537 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:12:57,537 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:12:57,537 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:12:57,537 INFO L132 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca-1.i_Iteration9_Lasso [2025-01-10 07:12:57,537 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:12:57,537 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:12:57,539 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:57,545 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:57,547 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:57,548 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:57,549 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:57,553 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:57,557 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:57,835 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:57,837 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:57,838 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:57,840 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:57,841 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:57,843 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:57,846 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:57,848 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:57,849 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:57,851 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:57,852 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:57,854 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:57,855 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:58,064 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:12:58,064 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-01-10 07:12:58,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:12:58,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:12:58,066 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:12:58,068 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:12:58,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:12:58,078 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:12:58,078 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:12:58,078 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:12:58,078 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:12:58,078 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:12:58,079 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:12:58,079 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:12:58,082 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:12:58,087 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2025-01-10 07:12:58,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:12:58,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:12:58,090 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:12:58,091 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:12:58,092 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:12:58,101 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:12:58,102 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:12:58,102 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:12:58,102 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:12:58,102 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:12:58,102 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:12:58,102 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:12:58,103 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:12:58,108 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:12:58,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:12:58,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:12:58,113 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:12:58,114 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:12:58,114 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:12:58,124 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:12:58,124 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:12:58,124 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:12:58,124 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:12:58,124 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:12:58,124 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:12:58,124 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:12:58,126 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:12:58,131 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:12:58,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:12:58,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:12:58,133 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:12:58,134 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:12:58,136 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:12:58,145 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:12:58,145 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:12:58,145 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:12:58,145 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:12:58,145 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:12:58,146 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:12:58,146 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:12:58,147 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:12:58,152 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:12:58,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:12:58,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:12:58,155 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:12:58,156 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:12:58,157 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:12:58,167 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:12:58,167 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:12:58,167 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:12:58,167 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:12:58,167 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:12:58,167 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:12:58,167 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:12:58,168 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:12:58,173 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2025-01-10 07:12:58,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:12:58,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:12:58,175 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:12:58,176 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:12:58,177 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:12:58,186 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:12:58,186 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:12:58,186 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:12:58,186 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:12:58,186 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:12:58,187 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:12:58,187 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:12:58,187 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:12:58,193 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2025-01-10 07:12:58,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:12:58,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:12:58,195 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:12:58,196 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:12:58,197 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:12:58,206 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:12:58,207 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:12:58,207 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:12:58,207 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:12:58,213 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:12:58,213 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:12:58,221 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-01-10 07:12:58,237 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2025-01-10 07:12:58,237 INFO L444 ModelExtractionUtils]: 1 out of 22 variables were initially zero. Simplification set additionally 17 variables to zero. [2025-01-10 07:12:58,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:12:58,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:12:58,240 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:12:58,241 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:12:58,242 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-01-10 07:12:58,252 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-01-10 07:12:58,252 INFO L474 LassoAnalysis]: Proved termination. [2025-01-10 07:12:58,252 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sort_~n#1, ULTIMATE.start_sort_~pass~0#1, ULTIMATE.start_sort_~i~0#1) = 1*ULTIMATE.start_sort_~n#1 - 1*ULTIMATE.start_sort_~pass~0#1 - 1*ULTIMATE.start_sort_~i~0#1 Supporting invariants [] [2025-01-10 07:12:58,258 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2025-01-10 07:12:58,268 INFO L156 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2025-01-10 07:12:58,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:12:58,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 07:12:58,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 07:12:58,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:12:58,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:12:58,299 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 07:12:58,299 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:12:58,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:12:58,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:12:58,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:12:58,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:12:58,316 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 07:12:58,317 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:12:58,331 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:12:58,332 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:12:58,332 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 41 states and 57 transitions. cyclomatic complexity: 21 Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:12:58,350 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 41 states and 57 transitions. cyclomatic complexity: 21. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 96 states and 133 transitions. Complement of second has 7 states. [2025-01-10 07:12:58,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-01-10 07:12:58,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:12:58,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2025-01-10 07:12:58,352 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 11 letters. Loop has 3 letters. [2025-01-10 07:12:58,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:12:58,352 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 14 letters. Loop has 3 letters. [2025-01-10 07:12:58,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:12:58,352 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 11 letters. Loop has 6 letters. [2025-01-10 07:12:58,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:12:58,352 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 96 states and 133 transitions. [2025-01-10 07:12:58,355 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2025-01-10 07:12:58,355 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 96 states to 85 states and 118 transitions. [2025-01-10 07:12:58,355 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2025-01-10 07:12:58,355 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2025-01-10 07:12:58,355 INFO L73 IsDeterministic]: Start isDeterministic. Operand 85 states and 118 transitions. [2025-01-10 07:12:58,355 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:12:58,355 INFO L218 hiAutomatonCegarLoop]: Abstraction has 85 states and 118 transitions. [2025-01-10 07:12:58,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states and 118 transitions. [2025-01-10 07:12:58,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 78. [2025-01-10 07:12:58,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 78 states have (on average 1.4230769230769231) internal successors, (111), 77 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:12:58,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 111 transitions. [2025-01-10 07:12:58,364 INFO L240 hiAutomatonCegarLoop]: Abstraction has 78 states and 111 transitions. [2025-01-10 07:12:58,364 INFO L432 stractBuchiCegarLoop]: Abstraction has 78 states and 111 transitions. [2025-01-10 07:12:58,364 INFO L338 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-01-10 07:12:58,364 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 78 states and 111 transitions. [2025-01-10 07:12:58,364 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2025-01-10 07:12:58,364 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:12:58,364 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:12:58,365 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:12:58,365 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-01-10 07:12:58,365 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~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~post11#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "assume !(main_~i~1#1 < main_~array_size~0#1);havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem2#1, sort_#t~mem3#1, sort_#t~mem4#1, sort_#t~mem5#1, sort_~temp~0#1, sort_#t~post6#1, sort_#t~post7#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1;" "assume sort_~pass~0#1 < sort_~n#1;sort_~i~0#1 := 0;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" [2025-01-10 07:12:58,365 INFO L754 eck$LassoCheckResult]: Loop: "assume sort_#t~mem2#1 > sort_#t~mem3#1;havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem4#1;havoc sort_#t~mem4#1;call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem5#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem5#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" [2025-01-10 07:12:58,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:12:58,365 INFO L85 PathProgramCache]: Analyzing trace with hash -2019936949, now seen corresponding path program 1 times [2025-01-10 07:12:58,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:12:58,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134411068] [2025-01-10 07:12:58,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:12:58,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:12:58,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 07:12:58,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 07:12:58,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:12:58,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:12:58,376 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:12:58,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 07:12:58,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 07:12:58,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:12:58,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:12:58,391 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:12:58,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:12:58,391 INFO L85 PathProgramCache]: Analyzing trace with hash 55730, now seen corresponding path program 3 times [2025-01-10 07:12:58,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:12:58,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376035176] [2025-01-10 07:12:58,391 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 07:12:58,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:12:58,395 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:12:58,397 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:12:58,397 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 07:12:58,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:12:58,397 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:12:58,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:12:58,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:12:58,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:12:58,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:12:58,400 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:12:58,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:12:58,401 INFO L85 PathProgramCache]: Analyzing trace with hash 845162536, now seen corresponding path program 2 times [2025-01-10 07:12:58,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:12:58,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329351162] [2025-01-10 07:12:58,401 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:12:58,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:12:58,406 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-01-10 07:12:58,413 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 07:12:58,413 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 07:12:58,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:12:58,413 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:12:58,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 07:12:58,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 07:12:58,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:12:58,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:12:58,424 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:12:58,744 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2025-01-10 07:12:58,785 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:12:58,785 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:12:58,785 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:12:58,785 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:12:58,785 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-01-10 07:12:58,785 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:12:58,785 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:12:58,785 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:12:58,785 INFO L132 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca-1.i_Iteration10_Lasso [2025-01-10 07:12:58,785 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:12:58,785 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:12:58,787 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:58,788 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:58,789 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:58,987 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:58,989 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:58,990 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:58,992 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:58,994 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:58,995 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:58,997 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:58,998 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:58,999 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:59,001 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:59,002 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:59,004 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:59,006 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:59,008 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:59,009 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:12:59,237 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:12:59,237 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-01-10 07:12:59,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:12:59,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:12:59,239 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:12:59,241 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:12:59,242 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:12:59,251 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:12:59,251 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:12:59,251 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:12:59,251 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:12:59,251 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:12:59,252 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:12:59,252 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:12:59,253 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:12:59,258 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:12:59,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:12:59,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:12:59,260 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:12:59,262 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:12:59,263 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:12:59,272 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:12:59,273 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:12:59,273 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:12:59,273 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:12:59,273 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:12:59,273 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:12:59,273 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:12:59,274 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:12:59,279 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:12:59,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:12:59,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:12:59,281 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:12:59,282 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:12:59,285 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:12:59,295 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:12:59,295 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:12:59,295 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:12:59,295 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:12:59,299 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:12:59,300 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:12:59,302 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:12:59,308 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:12:59,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:12:59,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:12:59,311 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:12:59,312 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:12:59,313 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:12:59,323 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:12:59,323 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:12:59,323 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:12:59,323 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:12:59,332 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:12:59,332 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:12:59,340 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:12:59,346 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:12:59,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:12:59,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:12:59,348 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:12:59,348 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:12:59,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:12:59,361 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:12:59,361 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:12:59,361 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:12:59,361 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:12:59,362 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:12:59,362 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:12:59,365 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:12:59,370 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:12:59,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:12:59,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:12:59,374 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:12:59,375 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:12:59,376 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:12:59,385 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:12:59,385 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:12:59,385 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:12:59,385 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:12:59,387 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:12:59,387 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:12:59,390 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:12:59,396 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Forceful destruction successful, exit code 0 [2025-01-10 07:12:59,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:12:59,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:12:59,398 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:12:59,399 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:12:59,401 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:12:59,410 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:12:59,410 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:12:59,410 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:12:59,410 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:12:59,414 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:12:59,414 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:12:59,417 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:12:59,423 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:12:59,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:12:59,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:12:59,425 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:12:59,426 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:12:59,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:12:59,436 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:12:59,437 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:12:59,437 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:12:59,437 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:12:59,437 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:12:59,437 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:12:59,437 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:12:59,438 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:12:59,443 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Forceful destruction successful, exit code 0 [2025-01-10 07:12:59,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:12:59,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:12:59,445 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:12:59,447 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:12:59,447 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:12:59,458 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:12:59,458 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:12:59,458 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:12:59,458 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:12:59,462 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:12:59,462 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:12:59,470 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-01-10 07:12:59,500 INFO L443 ModelExtractionUtils]: Simplification made 15 calls to the SMT solver. [2025-01-10 07:12:59,500 INFO L444 ModelExtractionUtils]: 2 out of 22 variables were initially zero. Simplification set additionally 16 variables to zero. [2025-01-10 07:12:59,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:12:59,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:12:59,504 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:12:59,505 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:12:59,508 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-01-10 07:12:59,521 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-01-10 07:12:59,521 INFO L474 LassoAnalysis]: Proved termination. [2025-01-10 07:12:59,521 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sort_~pass~0#1, ULTIMATE.start_sort_~n#1, ULTIMATE.start_sort_~i~0#1) = -1*ULTIMATE.start_sort_~pass~0#1 + 1*ULTIMATE.start_sort_~n#1 - 1*ULTIMATE.start_sort_~i~0#1 Supporting invariants [] [2025-01-10 07:12:59,531 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:12:59,545 INFO L156 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2025-01-10 07:12:59,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:12:59,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 07:12:59,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 07:12:59,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:12:59,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:12:59,580 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 07:12:59,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:12:59,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:12:59,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:12:59,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:12:59,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:12:59,600 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 07:12:59,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:12:59,622 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:12:59,622 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-01-10 07:12:59,622 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 78 states and 111 transitions. cyclomatic complexity: 43 Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:12:59,668 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 78 states and 111 transitions. cyclomatic complexity: 43. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 127 states and 192 transitions. Complement of second has 7 states. [2025-01-10 07:12:59,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-01-10 07:12:59,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:12:59,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2025-01-10 07:12:59,675 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 10 letters. Loop has 3 letters. [2025-01-10 07:12:59,675 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:12:59,675 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 13 letters. Loop has 3 letters. [2025-01-10 07:12:59,675 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:12:59,675 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 10 letters. Loop has 6 letters. [2025-01-10 07:12:59,675 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:12:59,675 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 127 states and 192 transitions. [2025-01-10 07:12:59,676 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2025-01-10 07:12:59,677 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 127 states to 100 states and 145 transitions. [2025-01-10 07:12:59,677 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2025-01-10 07:12:59,677 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2025-01-10 07:12:59,677 INFO L73 IsDeterministic]: Start isDeterministic. Operand 100 states and 145 transitions. [2025-01-10 07:12:59,677 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:12:59,677 INFO L218 hiAutomatonCegarLoop]: Abstraction has 100 states and 145 transitions. [2025-01-10 07:12:59,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states and 145 transitions. [2025-01-10 07:12:59,681 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:12:59,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 79. [2025-01-10 07:12:59,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 79 states have (on average 1.4430379746835442) internal successors, (114), 78 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:12:59,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 114 transitions. [2025-01-10 07:12:59,684 INFO L240 hiAutomatonCegarLoop]: Abstraction has 79 states and 114 transitions. [2025-01-10 07:12:59,684 INFO L432 stractBuchiCegarLoop]: Abstraction has 79 states and 114 transitions. [2025-01-10 07:12:59,684 INFO L338 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2025-01-10 07:12:59,684 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 79 states and 114 transitions. [2025-01-10 07:12:59,684 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2025-01-10 07:12:59,684 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:12:59,684 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:12:59,685 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:12:59,685 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-01-10 07:12:59,685 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~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~post11#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "assume !(main_~i~1#1 < main_~array_size~0#1);havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem2#1, sort_#t~mem3#1, sort_#t~mem4#1, sort_#t~mem5#1, sort_~temp~0#1, sort_#t~post6#1, sort_#t~post7#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1;" "assume sort_~pass~0#1 < sort_~n#1;sort_~i~0#1 := 0;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume !(sort_#t~mem2#1 > sort_#t~mem3#1);havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume sort_#t~mem2#1 > sort_#t~mem3#1;havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem4#1;havoc sort_#t~mem4#1;call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem5#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem5#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);sort_#t~post7#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post7#1;havoc sort_#t~post7#1;" "assume sort_~pass~0#1 < sort_~n#1;sort_~i~0#1 := 0;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" [2025-01-10 07:12:59,685 INFO L754 eck$LassoCheckResult]: Loop: "assume sort_#t~mem2#1 > sort_#t~mem3#1;havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem4#1;havoc sort_#t~mem4#1;call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem5#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem5#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" [2025-01-10 07:12:59,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:12:59,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1594258602, now seen corresponding path program 1 times [2025-01-10 07:12:59,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:12:59,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930077329] [2025-01-10 07:12:59,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:12:59,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:12:59,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 07:12:59,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 07:12:59,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:12:59,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:12:59,701 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:12:59,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 07:12:59,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 07:12:59,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:12:59,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:12:59,713 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:12:59,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:12:59,714 INFO L85 PathProgramCache]: Analyzing trace with hash 55730, now seen corresponding path program 4 times [2025-01-10 07:12:59,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:12:59,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997887496] [2025-01-10 07:12:59,714 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 07:12:59,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:12:59,717 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 3 statements into 2 equivalence classes. [2025-01-10 07:12:59,719 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:12:59,719 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 07:12:59,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:12:59,719 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:12:59,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:12:59,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:12:59,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:12:59,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:12:59,723 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:12:59,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:12:59,723 INFO L85 PathProgramCache]: Analyzing trace with hash -809627075, now seen corresponding path program 2 times [2025-01-10 07:12:59,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:12:59,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380084661] [2025-01-10 07:12:59,724 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:12:59,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:12:59,730 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-01-10 07:12:59,736 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 07:12:59,736 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 07:12:59,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:12:59,854 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 07:12:59,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:12:59,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380084661] [2025-01-10 07:12:59,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380084661] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 07:12:59,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [975405821] [2025-01-10 07:12:59,855 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:12:59,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 07:12:59,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:12:59,858 INFO L229 MonitoredProcess]: Starting monitored process 58 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:12:59,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Waiting until timeout for monitored process [2025-01-10 07:12:59,909 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-01-10 07:12:59,928 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 07:12:59,928 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 07:12:59,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:12:59,930 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-10 07:12:59,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:13:00,020 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 07:13:00,020 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 07:13:00,078 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 07:13:00,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [975405821] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 07:13:00,079 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 07:13:00,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2025-01-10 07:13:00,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106272100] [2025-01-10 07:13:00,079 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 07:13:00,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:13:00,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-10 07:13:00,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2025-01-10 07:13:00,165 INFO L87 Difference]: Start difference. First operand 79 states and 114 transitions. cyclomatic complexity: 46 Second operand has 17 states, 16 states have (on average 2.75) internal successors, (44), 17 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:13:00,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:13:00,228 INFO L93 Difference]: Finished difference Result 140 states and 193 transitions. [2025-01-10 07:13:00,228 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 140 states and 193 transitions. [2025-01-10 07:13:00,229 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2025-01-10 07:13:00,230 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 140 states to 80 states and 115 transitions. [2025-01-10 07:13:00,230 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2025-01-10 07:13:00,230 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2025-01-10 07:13:00,230 INFO L73 IsDeterministic]: Start isDeterministic. Operand 80 states and 115 transitions. [2025-01-10 07:13:00,230 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:13:00,230 INFO L218 hiAutomatonCegarLoop]: Abstraction has 80 states and 115 transitions. [2025-01-10 07:13:00,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states and 115 transitions. [2025-01-10 07:13:00,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2025-01-10 07:13:00,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 80 states have (on average 1.4375) internal successors, (115), 79 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:13:00,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 115 transitions. [2025-01-10 07:13:00,237 INFO L240 hiAutomatonCegarLoop]: Abstraction has 80 states and 115 transitions. [2025-01-10 07:13:00,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 07:13:00,238 INFO L432 stractBuchiCegarLoop]: Abstraction has 80 states and 115 transitions. [2025-01-10 07:13:00,240 INFO L338 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2025-01-10 07:13:00,240 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 80 states and 115 transitions. [2025-01-10 07:13:00,241 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2025-01-10 07:13:00,241 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:13:00,241 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:13:00,241 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-01-10 07:13:00,241 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-01-10 07:13:00,241 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~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~post11#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "assume !(main_~i~1#1 < main_~array_size~0#1);havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem2#1, sort_#t~mem3#1, sort_#t~mem4#1, sort_#t~mem5#1, sort_~temp~0#1, sort_#t~post6#1, sort_#t~post7#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1;" "assume sort_~pass~0#1 < sort_~n#1;sort_~i~0#1 := 0;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume sort_#t~mem2#1 > sort_#t~mem3#1;havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem4#1;havoc sort_#t~mem4#1;call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem5#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem5#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume sort_#t~mem2#1 > sort_#t~mem3#1;havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem4#1;havoc sort_#t~mem4#1;call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem5#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem5#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);sort_#t~post7#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post7#1;havoc sort_#t~post7#1;" "assume sort_~pass~0#1 < sort_~n#1;sort_~i~0#1 := 0;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" [2025-01-10 07:13:00,241 INFO L754 eck$LassoCheckResult]: Loop: "assume sort_#t~mem2#1 > sort_#t~mem3#1;havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem4#1;havoc sort_#t~mem4#1;call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem5#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem5#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" [2025-01-10 07:13:00,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:13:00,242 INFO L85 PathProgramCache]: Analyzing trace with hash 842343739, now seen corresponding path program 3 times [2025-01-10 07:13:00,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:13:00,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963205559] [2025-01-10 07:13:00,242 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 07:13:00,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:13:00,251 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 4 equivalence classes. [2025-01-10 07:13:00,269 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 07:13:00,269 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-01-10 07:13:00,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:13:00,388 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:13:00,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:13:00,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963205559] [2025-01-10 07:13:00,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963205559] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 07:13:00,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2116089708] [2025-01-10 07:13:00,388 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 07:13:00,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 07:13:00,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:13:00,391 INFO L229 MonitoredProcess]: Starting monitored process 59 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:13:00,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Waiting until timeout for monitored process [2025-01-10 07:13:00,433 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 4 equivalence classes. [2025-01-10 07:13:00,452 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 07:13:00,452 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-01-10 07:13:00,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:13:00,453 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-10 07:13:00,454 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:13:00,548 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:13:00,548 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 07:13:00,621 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:13:00,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2116089708] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 07:13:00,621 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 07:13:00,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 20 [2025-01-10 07:13:00,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157162187] [2025-01-10 07:13:00,621 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 07:13:00,621 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 07:13:00,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:13:00,622 INFO L85 PathProgramCache]: Analyzing trace with hash 55730, now seen corresponding path program 5 times [2025-01-10 07:13:00,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:13:00,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820290660] [2025-01-10 07:13:00,622 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 07:13:00,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:13:00,625 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:13:00,626 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:13:00,626 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 07:13:00,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:13:00,627 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:13:00,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:13:00,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:13:00,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:13:00,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:13:00,629 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:13:00,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:13:00,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-01-10 07:13:00,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2025-01-10 07:13:00,723 INFO L87 Difference]: Start difference. First operand 80 states and 115 transitions. cyclomatic complexity: 46 Second operand has 20 states, 20 states have (on average 1.95) internal successors, (39), 20 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:13:00,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:13:00,855 INFO L93 Difference]: Finished difference Result 119 states and 167 transitions. [2025-01-10 07:13:00,855 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 119 states and 167 transitions. [2025-01-10 07:13:00,860 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2025-01-10 07:13:00,861 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 119 states to 111 states and 158 transitions. [2025-01-10 07:13:00,861 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2025-01-10 07:13:00,861 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2025-01-10 07:13:00,862 INFO L73 IsDeterministic]: Start isDeterministic. Operand 111 states and 158 transitions. [2025-01-10 07:13:00,862 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:13:00,862 INFO L218 hiAutomatonCegarLoop]: Abstraction has 111 states and 158 transitions. [2025-01-10 07:13:00,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states and 158 transitions. [2025-01-10 07:13:00,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 86. [2025-01-10 07:13:00,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 86 states have (on average 1.3953488372093024) internal successors, (120), 85 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:13:00,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 120 transitions. [2025-01-10 07:13:00,865 INFO L240 hiAutomatonCegarLoop]: Abstraction has 86 states and 120 transitions. [2025-01-10 07:13:00,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-10 07:13:00,870 INFO L432 stractBuchiCegarLoop]: Abstraction has 86 states and 120 transitions. [2025-01-10 07:13:00,870 INFO L338 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2025-01-10 07:13:00,870 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 86 states and 120 transitions. [2025-01-10 07:13:00,871 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2025-01-10 07:13:00,871 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:13:00,871 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:13:00,871 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2025-01-10 07:13:00,871 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-01-10 07:13:00,871 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~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~post11#1, main_~i~1#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;main_~i~1#1 := 0;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "assume main_~i~1#1 < main_~array_size~0#1;havoc main_#t~nondet10#1;call write~int#0(main_#t~nondet10#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet10#1;main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1;" "assume !(main_~i~1#1 < main_~array_size~0#1);havoc main_~i~1#1;assume { :begin_inline_sort } true;sort_#in~x#1.base, sort_#in~x#1.offset, sort_#in~n#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc sort_#t~mem2#1, sort_#t~mem3#1, sort_#t~mem4#1, sort_#t~mem5#1, sort_~temp~0#1, sort_#t~post6#1, sort_#t~post7#1, sort_~x#1.base, sort_~x#1.offset, sort_~n#1, sort_~pass~0#1, sort_~i~0#1;sort_~x#1.base, sort_~x#1.offset := sort_#in~x#1.base, sort_#in~x#1.offset;sort_~n#1 := sort_#in~n#1;havoc sort_~pass~0#1;havoc sort_~i~0#1;sort_~pass~0#1 := 1;" "assume sort_~pass~0#1 < sort_~n#1;sort_~i~0#1 := 0;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume sort_#t~mem2#1 > sort_#t~mem3#1;havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem4#1;havoc sort_#t~mem4#1;call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem5#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem5#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume sort_#t~mem2#1 > sort_#t~mem3#1;havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem4#1;havoc sort_#t~mem4#1;call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem5#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem5#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" "assume sort_#t~mem2#1 > sort_#t~mem3#1;havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem4#1;havoc sort_#t~mem4#1;call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem5#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem5#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume !(sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1);sort_#t~post7#1 := sort_~pass~0#1;sort_~pass~0#1 := 1 + sort_#t~post7#1;havoc sort_#t~post7#1;" "assume sort_~pass~0#1 < sort_~n#1;sort_~i~0#1 := 0;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" [2025-01-10 07:13:00,872 INFO L754 eck$LassoCheckResult]: Loop: "assume sort_#t~mem2#1 > sort_#t~mem3#1;havoc sort_#t~mem2#1;havoc sort_#t~mem3#1;call sort_#t~mem4#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);sort_~temp~0#1 := sort_#t~mem4#1;havoc sort_#t~mem4#1;call sort_#t~mem5#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);call write~int#0(sort_#t~mem5#1, sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);havoc sort_#t~mem5#1;call write~int#0(sort_~temp~0#1, sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);havoc sort_~temp~0#1;" "sort_#t~post6#1 := sort_~i~0#1;sort_~i~0#1 := 1 + sort_#t~post6#1;havoc sort_#t~post6#1;" "assume sort_~i~0#1 < sort_~n#1 - sort_~pass~0#1;call sort_#t~mem2#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * sort_~i~0#1, 4);call sort_#t~mem3#1 := read~int#0(sort_~x#1.base, sort_~x#1.offset + 4 * (1 + sort_~i~0#1), 4);" [2025-01-10 07:13:00,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:13:00,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1482539790, now seen corresponding path program 4 times [2025-01-10 07:13:00,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:13:00,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429126625] [2025-01-10 07:13:00,872 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 07:13:00,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:13:00,880 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-01-10 07:13:00,894 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 07:13:00,894 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 07:13:00,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:13:00,894 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:13:00,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-10 07:13:00,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 07:13:00,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:13:00,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:13:00,909 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:13:00,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:13:00,909 INFO L85 PathProgramCache]: Analyzing trace with hash 55730, now seen corresponding path program 6 times [2025-01-10 07:13:00,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:13:00,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888550807] [2025-01-10 07:13:00,910 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 07:13:00,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:13:00,916 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:13:00,918 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:13:00,918 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-01-10 07:13:00,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:13:00,918 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:13:00,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:13:00,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:13:00,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:13:00,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:13:00,926 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:13:00,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:13:00,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1194153183, now seen corresponding path program 5 times [2025-01-10 07:13:00,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:13:00,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001002327] [2025-01-10 07:13:00,926 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 07:13:00,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:13:00,942 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 5 equivalence classes. [2025-01-10 07:13:00,971 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 07:13:00,971 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-01-10 07:13:00,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:13:00,972 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:13:00,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-10 07:13:00,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 07:13:00,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:13:00,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:13:00,990 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:13:04,437 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:13:04,437 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:13:04,437 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:13:04,437 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:13:04,437 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-01-10 07:13:04,437 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:13:04,437 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:13:04,437 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:13:04,437 INFO L132 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca-1.i_Iteration13_Lasso [2025-01-10 07:13:04,437 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:13:04,437 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:13:04,438 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:13:04,444 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:13:04,445 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:13:04,446 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:13:04,447 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:13:05,109 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:13:05,110 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:13:05,112 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:13:05,113 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:13:05,114 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:13:05,116 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:13:05,117 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:13:05,118 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:13:05,119 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:13:05,121 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:13:05,123 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:13:05,124 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:13:05,125 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:13:05,482 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:13:05,482 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-01-10 07:13:05,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:13:05,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:13:05,489 INFO L229 MonitoredProcess]: Starting monitored process 60 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:13:05,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2025-01-10 07:13:05,491 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:13:05,501 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:13:05,501 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:13:05,501 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:13:05,501 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:13:05,501 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:13:05,502 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:13:05,502 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:13:05,503 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:13:05,508 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Ended with exit code 0 [2025-01-10 07:13:05,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:13:05,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:13:05,511 INFO L229 MonitoredProcess]: Starting monitored process 61 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:13:05,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2025-01-10 07:13:05,514 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:13:05,524 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:13:05,524 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:13:05,524 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:13:05,524 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:13:05,524 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:13:05,525 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:13:05,525 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:13:05,526 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:13:05,531 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Forceful destruction successful, exit code 0 [2025-01-10 07:13:05,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:13:05,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:13:05,535 INFO L229 MonitoredProcess]: Starting monitored process 62 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:13:05,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2025-01-10 07:13:05,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:13:05,547 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:13:05,547 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:13:05,547 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:13:05,547 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:13:05,549 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:13:05,549 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:13:05,552 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:13:05,560 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Ended with exit code 0 [2025-01-10 07:13:05,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:13:05,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:13:05,566 INFO L229 MonitoredProcess]: Starting monitored process 63 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:13:05,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2025-01-10 07:13:05,571 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:13:05,581 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:13:05,582 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:13:05,582 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:13:05,582 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:13:05,582 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:13:05,582 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:13:05,582 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:13:05,584 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:13:05,591 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Ended with exit code 0 [2025-01-10 07:13:05,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:13:05,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:13:05,594 INFO L229 MonitoredProcess]: Starting monitored process 64 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:13:05,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2025-01-10 07:13:05,597 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:13:05,608 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:13:05,608 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:13:05,608 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:13:05,608 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:13:05,610 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:13:05,610 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:13:05,613 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:13:05,619 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Ended with exit code 0 [2025-01-10 07:13:05,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:13:05,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:13:05,622 INFO L229 MonitoredProcess]: Starting monitored process 65 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:13:05,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2025-01-10 07:13:05,624 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:13:05,637 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:13:05,637 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:13:05,637 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:13:05,637 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:13:05,639 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:13:05,639 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:13:05,644 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:13:05,652 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Forceful destruction successful, exit code 0 [2025-01-10 07:13:05,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:13:05,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:13:05,654 INFO L229 MonitoredProcess]: Starting monitored process 66 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:13:05,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2025-01-10 07:13:05,657 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:13:05,667 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:13:05,667 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:13:05,667 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:13:05,667 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:13:05,669 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:13:05,669 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:13:05,672 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:13:05,678 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Ended with exit code 0 [2025-01-10 07:13:05,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:13:05,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:13:05,680 INFO L229 MonitoredProcess]: Starting monitored process 67 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:13:05,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2025-01-10 07:13:05,683 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:13:05,695 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:13:05,695 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:13:05,695 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:13:05,695 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:13:05,709 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:13:05,709 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:13:05,722 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:13:05,728 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Ended with exit code 0 [2025-01-10 07:13:05,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:13:05,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:13:05,731 INFO L229 MonitoredProcess]: Starting monitored process 68 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:13:05,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2025-01-10 07:13:05,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:13:05,743 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:13:05,743 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:13:05,743 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:13:05,743 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:13:05,750 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:13:05,750 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:13:05,761 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-01-10 07:13:05,783 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2025-01-10 07:13:05,783 INFO L444 ModelExtractionUtils]: 2 out of 22 variables were initially zero. Simplification set additionally 16 variables to zero. [2025-01-10 07:13:05,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:13:05,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:13:05,786 INFO L229 MonitoredProcess]: Starting monitored process 69 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:13:05,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2025-01-10 07:13:05,788 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-01-10 07:13:05,799 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-01-10 07:13:05,799 INFO L474 LassoAnalysis]: Proved termination. [2025-01-10 07:13:05,799 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_sort_~x#1.base)_5, ULTIMATE.start_sort_~x#1.offset, ULTIMATE.start_sort_~i~0#1) = 2*v_rep(select #length ULTIMATE.start_sort_~x#1.base)_5 - 1*ULTIMATE.start_sort_~x#1.offset - 4*ULTIMATE.start_sort_~i~0#1 Supporting invariants [] [2025-01-10 07:13:05,805 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Ended with exit code 0 [2025-01-10 07:13:05,832 INFO L156 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2025-01-10 07:13:05,833 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~x!offset [2025-01-10 07:13:05,834 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-01-10 07:13:05,834 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-01-10 07:13:05,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:13:05,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-10 07:13:05,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 07:13:05,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:13:05,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:13:05,872 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 07:13:05,872 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:13:05,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:13:05,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:13:05,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:13:05,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:13:05,900 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 07:13:05,900 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:13:05,926 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:13:05,927 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:13:05,927 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 86 states and 120 transitions. cyclomatic complexity: 45 Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:13:05,964 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 86 states and 120 transitions. cyclomatic complexity: 45. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 174 states and 250 transitions. Complement of second has 9 states. [2025-01-10 07:13:05,965 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:13:05,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:13:05,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 17 transitions. [2025-01-10 07:13:05,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 22 letters. Loop has 3 letters. [2025-01-10 07:13:05,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:13:05,966 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-01-10 07:13:05,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:13:05,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-10 07:13:06,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 07:13:06,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:13:06,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:13:06,006 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 07:13:06,007 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:13:06,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:13:06,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:13:06,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:13:06,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:13:06,035 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 07:13:06,036 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:13:06,062 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:13:06,062 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2025-01-10 07:13:06,063 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 86 states and 120 transitions. cyclomatic complexity: 45 Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:13:06,093 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 86 states and 120 transitions. cyclomatic complexity: 45. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 174 states and 250 transitions. Complement of second has 9 states. [2025-01-10 07:13:06,094 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:13:06,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:13:06,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 17 transitions. [2025-01-10 07:13:06,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 22 letters. Loop has 3 letters. [2025-01-10 07:13:06,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:13:06,095 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-01-10 07:13:06,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:13:06,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-10 07:13:06,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 07:13:06,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:13:06,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:13:06,138 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 07:13:06,138 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:13:06,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:13:06,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:13:06,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:13:06,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:13:06,167 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 07:13:06,168 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:13:06,194 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:13:06,195 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-01-10 07:13:06,195 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 86 states and 120 transitions. cyclomatic complexity: 45 Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:13:06,239 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 86 states and 120 transitions. cyclomatic complexity: 45. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 330 states and 473 transitions. Complement of second has 21 states. [2025-01-10 07:13:06,242 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:13:06,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:13:06,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 22 transitions. [2025-01-10 07:13:06,243 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 22 letters. Loop has 3 letters. [2025-01-10 07:13:06,243 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:13:06,243 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 25 letters. Loop has 3 letters. [2025-01-10 07:13:06,243 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:13:06,243 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 22 letters. Loop has 6 letters. [2025-01-10 07:13:06,243 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:13:06,243 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 330 states and 473 transitions. [2025-01-10 07:13:06,249 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-01-10 07:13:06,249 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 330 states to 0 states and 0 transitions. [2025-01-10 07:13:06,249 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-01-10 07:13:06,249 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-01-10 07:13:06,249 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-01-10 07:13:06,249 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:13:06,249 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-10 07:13:06,249 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-10 07:13:06,249 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-10 07:13:06,249 INFO L338 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2025-01-10 07:13:06,249 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-01-10 07:13:06,249 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-01-10 07:13:06,249 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-01-10 07:13:06,257 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.01 07:13:06 BoogieIcfgContainer [2025-01-10 07:13:06,257 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-01-10 07:13:06,258 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 07:13:06,258 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 07:13:06,258 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 07:13:06,259 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 07:12:51" (3/4) ... [2025-01-10 07:13:06,261 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-10 07:13:06,262 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 07:13:06,262 INFO L158 Benchmark]: Toolchain (without parser) took 15656.20ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 120.6MB in the beginning and 91.9MB in the end (delta: 28.7MB). Peak memory consumption was 102.6MB. Max. memory is 16.1GB. [2025-01-10 07:13:06,263 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 119.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 07:13:06,263 INFO L158 Benchmark]: CACSL2BoogieTranslator took 339.18ms. Allocated memory is still 167.8MB. Free memory was 120.2MB in the beginning and 103.9MB in the end (delta: 16.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 07:13:06,263 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.74ms. Allocated memory is still 167.8MB. Free memory was 103.9MB in the beginning and 102.5MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 07:13:06,263 INFO L158 Benchmark]: Boogie Preprocessor took 38.82ms. Allocated memory is still 167.8MB. Free memory was 102.1MB in the beginning and 100.8MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 07:13:06,263 INFO L158 Benchmark]: RCFGBuilder took 257.38ms. Allocated memory is still 167.8MB. Free memory was 100.8MB in the beginning and 89.4MB in the end (delta: 11.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-10 07:13:06,263 INFO L158 Benchmark]: BuchiAutomizer took 14970.84ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 89.4MB in the beginning and 92.0MB in the end (delta: -2.6MB). Peak memory consumption was 77.5MB. Max. memory is 16.1GB. [2025-01-10 07:13:06,263 INFO L158 Benchmark]: Witness Printer took 3.57ms. Allocated memory is still 243.3MB. Free memory was 92.0MB in the beginning and 91.9MB in the end (delta: 60.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 07:13:06,265 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 201.3MB. Free memory is still 119.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 339.18ms. Allocated memory is still 167.8MB. Free memory was 120.2MB in the beginning and 103.9MB in the end (delta: 16.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.74ms. Allocated memory is still 167.8MB. Free memory was 103.9MB in the beginning and 102.5MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 38.82ms. Allocated memory is still 167.8MB. Free memory was 102.1MB in the beginning and 100.8MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 257.38ms. Allocated memory is still 167.8MB. Free memory was 100.8MB in the beginning and 89.4MB in the end (delta: 11.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 14970.84ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 89.4MB in the beginning and 92.0MB in the end (delta: -2.6MB). Peak memory consumption was 77.5MB. Max. memory is 16.1GB. * Witness Printer took 3.57ms. Allocated memory is still 243.3MB. Free memory was 92.0MB in the beginning and 91.9MB in the end (delta: 60.0kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~numbers~0!offset - 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[~x!base,]]] - 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[#t~malloc9!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~x!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 13 terminating modules (7 trivial, 5 deterministic, 1 nondeterministic). One deterministic module has affine ranking function null and consists of 2 locations. One deterministic module has affine ranking function null and consists of 6 locations. One deterministic module has affine ranking function (((long long) -1 * pass) + n) and consists of 4 locations. One deterministic module has affine ranking function ((((long long) -1 * pass) + n) + ((long long) -1 * i)) and consists of 4 locations. One deterministic module has affine ranking function ((((long long) -1 * pass) + n) + ((long long) -1 * i)) and consists of 4 locations. One nondeterministic module has affine ranking function null and consists of 5 locations. 7 modules have a trivial ranking function, the largest among these consists of 20 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 14.9s and 14 iterations. TraceHistogramMax:4. Analysis of lassos took 13.3s. Construction of modules took 0.3s. Büchi inclusion checks took 1.1s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 8. Automata minimization 0.0s AutomataMinimizationTime, 12 MinimizatonAttempts, 84 StatesRemovedByMinimization, 7 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 [5, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 5/6 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 202 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 196 mSDsluCounter, 405 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 261 mSDsCounter, 56 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 431 IncrementalHoareTripleChecker+Invalid, 487 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 56 mSolverCounterUnsat, 144 mSDtfsCounter, 431 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc4 concLT0 SILN0 SILU2 SILI1 SILT0 lasso6 LassoPreprocessingBenchmarks: Lassos: inital238 mio100 ax110 hnf100 lsp89 ukn64 mio100 lsp48 div155 bol100 ite100 ukn100 eq162 hnf91 smp78 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 25ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 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:13:06,275 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Ended with exit code 0 [2025-01-10 07:13:06,478 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Forceful destruction successful, exit code 0 [2025-01-10 07:13:06,678 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Forceful destruction successful, exit code 0 [2025-01-10 07:13:06,879 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2025-01-10 07:13:07,101 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2025-01-10 07:13:07,279 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-01-10 07:13:07,481 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE