./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-recursive-malloc/insertionSort_recursive.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-recursive-malloc/insertionSort_recursive.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 1ae4a3f744c0a8577333c2c3dfb4ecaabbd2cf6e1675b06577194a98b8d1aee1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 19:08:34,723 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 19:08:34,808 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2025-02-06 19:08:34,816 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 19:08:34,817 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 19:08:34,817 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-02-06 19:08:34,844 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 19:08:34,845 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 19:08:34,845 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 19:08:34,845 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 19:08:34,845 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 19:08:34,846 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 19:08:34,846 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 19:08:34,846 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 19:08:34,846 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-02-06 19:08:34,846 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-02-06 19:08:34,846 INFO L153 SettingsManager]: * Use old map elimination=false [2025-02-06 19:08:34,847 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-02-06 19:08:34,847 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-02-06 19:08:34,847 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-02-06 19:08:34,847 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 19:08:34,847 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-02-06 19:08:34,847 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 19:08:34,847 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 19:08:34,847 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-02-06 19:08:34,847 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-02-06 19:08:34,847 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-02-06 19:08:34,847 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 19:08:34,848 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 19:08:34,848 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-02-06 19:08:34,848 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 19:08:34,848 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 19:08:34,848 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 19:08:34,848 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 19:08:34,848 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 19:08:34,848 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 19:08:34,848 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-02-06 19:08:34,848 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1ae4a3f744c0a8577333c2c3dfb4ecaabbd2cf6e1675b06577194a98b8d1aee1 [2025-02-06 19:08:35,158 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 19:08:35,168 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 19:08:35,170 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 19:08:35,172 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 19:08:35,172 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 19:08:35,173 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-recursive-malloc/insertionSort_recursive.i [2025-02-06 19:08:36,501 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8a1f10300/39469749049a465a8b7bfffcf10f48d7/FLAG17ba7efd9 [2025-02-06 19:08:36,745 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 19:08:36,745 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/termination-recursive-malloc/insertionSort_recursive.i [2025-02-06 19:08:36,751 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8a1f10300/39469749049a465a8b7bfffcf10f48d7/FLAG17ba7efd9 [2025-02-06 19:08:36,768 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8a1f10300/39469749049a465a8b7bfffcf10f48d7 [2025-02-06 19:08:36,770 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 19:08:36,771 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 19:08:36,773 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 19:08:36,773 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 19:08:36,776 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 19:08:36,777 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 07:08:36" (1/1) ... [2025-02-06 19:08:36,778 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9872689 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:08:36, skipping insertion in model container [2025-02-06 19:08:36,778 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 07:08:36" (1/1) ... [2025-02-06 19:08:36,795 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 19:08:36,932 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 19:08:36,945 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 19:08:36,959 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 19:08:36,972 INFO L204 MainTranslator]: Completed translation [2025-02-06 19:08:36,972 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:08:36 WrapperNode [2025-02-06 19:08:36,972 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 19:08:36,973 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 19:08:36,973 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 19:08:36,973 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 19:08:36,979 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:08:36" (1/1) ... [2025-02-06 19:08:36,985 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:08:36" (1/1) ... [2025-02-06 19:08:37,001 INFO L138 Inliner]: procedures = 11, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 24 [2025-02-06 19:08:37,002 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 19:08:37,002 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 19:08:37,003 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 19:08:37,003 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 19:08:37,009 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:08:36" (1/1) ... [2025-02-06 19:08:37,010 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:08:36" (1/1) ... [2025-02-06 19:08:37,016 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:08:36" (1/1) ... [2025-02-06 19:08:37,030 INFO L175 MemorySlicer]: Split 6 memory accesses to 1 slices as follows [6]. 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-02-06 19:08:37,030 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:08:36" (1/1) ... [2025-02-06 19:08:37,030 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:08:36" (1/1) ... [2025-02-06 19:08:37,034 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:08:36" (1/1) ... [2025-02-06 19:08:37,035 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:08:36" (1/1) ... [2025-02-06 19:08:37,038 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:08:36" (1/1) ... [2025-02-06 19:08:37,039 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:08:36" (1/1) ... [2025-02-06 19:08:37,040 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 19:08:37,041 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 19:08:37,041 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 19:08:37,041 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 19:08:37,042 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:08:36" (1/1) ... [2025-02-06 19:08:37,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:37,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:37,078 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-02-06 19:08:37,081 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-02-06 19:08:37,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 19:08:37,101 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 19:08:37,101 INFO L130 BoogieDeclarations]: Found specification of procedure insertionSort [2025-02-06 19:08:37,101 INFO L138 BoogieDeclarations]: Found implementation of procedure insertionSort [2025-02-06 19:08:37,101 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 19:08:37,101 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 19:08:37,101 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 19:08:37,101 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 19:08:37,162 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 19:08:37,163 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 19:08:37,320 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2025-02-06 19:08:37,321 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 19:08:37,328 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 19:08:37,329 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 19:08:37,329 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 07:08:37 BoogieIcfgContainer [2025-02-06 19:08:37,330 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 19:08:37,331 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-02-06 19:08:37,331 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-02-06 19:08:37,336 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-02-06 19:08:37,337 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-06 19:08:37,338 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 06.02 07:08:36" (1/3) ... [2025-02-06 19:08:37,339 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3b35e873 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.02 07:08:37, skipping insertion in model container [2025-02-06 19:08:37,339 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-06 19:08:37,340 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:08:36" (2/3) ... [2025-02-06 19:08:37,340 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3b35e873 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.02 07:08:37, skipping insertion in model container [2025-02-06 19:08:37,340 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-06 19:08:37,340 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 07:08:37" (3/3) ... [2025-02-06 19:08:37,342 INFO L363 chiAutomizerObserver]: Analyzing ICFG insertionSort_recursive.i [2025-02-06 19:08:37,387 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-02-06 19:08:37,387 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-02-06 19:08:37,387 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-02-06 19:08:37,387 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-02-06 19:08:37,388 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-02-06 19:08:37,388 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-02-06 19:08:37,388 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-02-06 19:08:37,389 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-02-06 19:08:37,395 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 19 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 19:08:37,409 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2025-02-06 19:08:37,410 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:08:37,410 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:08:37,414 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-02-06 19:08:37,414 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-02-06 19:08:37,414 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-02-06 19:08:37,414 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 19 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 19:08:37,416 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2025-02-06 19:08:37,416 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:08:37,417 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:08:37,417 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-02-06 19:08:37,417 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-02-06 19:08:37,423 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~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~i~0#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet7#1;main_~n~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;" "assume !(main_~n~0#1 < 1);call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~0#1 := 0;" [2025-02-06 19:08:37,423 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < main_~n~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" [2025-02-06 19:08:37,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:08:37,431 INFO L85 PathProgramCache]: Analyzing trace with hash 55576, now seen corresponding path program 1 times [2025-02-06 19:08:37,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:08:37,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297066988] [2025-02-06 19:08:37,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:08:37,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:08:37,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 19:08:37,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:08:37,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:37,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:37,518 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:08:37,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 19:08:37,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:08:37,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:37,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:37,544 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:08:37,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:08:37,546 INFO L85 PathProgramCache]: Analyzing trace with hash 50, now seen corresponding path program 1 times [2025-02-06 19:08:37,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:08:37,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658524794] [2025-02-06 19:08:37,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:08:37,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:08:37,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-06 19:08:37,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-06 19:08:37,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:37,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:37,560 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:08:37,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-06 19:08:37,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-06 19:08:37,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:37,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:37,572 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:08:37,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:08:37,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1722875, now seen corresponding path program 1 times [2025-02-06 19:08:37,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:08:37,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703441540] [2025-02-06 19:08:37,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:08:37,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:08:37,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 19:08:37,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 19:08:37,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:37,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:37,606 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:08:37,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 19:08:37,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 19:08:37,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:37,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:37,630 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:08:37,889 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:08:37,889 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:08:37,889 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:08:37,890 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:08:37,890 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-06 19:08:37,890 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:37,890 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:08:37,893 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:08:37,893 INFO L132 ssoRankerPreferences]: Filename of dumped script: insertionSort_recursive.i_Iteration1_Lasso [2025-02-06 19:08:37,893 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:08:37,893 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:08:37,908 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:37,916 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:37,922 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:37,925 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:38,048 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:38,052 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:38,056 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:38,281 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:08:38,285 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-06 19:08:38,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:38,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:38,291 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-02-06 19:08:38,292 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-02-06 19:08:38,293 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-02-06 19:08:38,307 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:38,307 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:38,308 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:38,308 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:38,308 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:38,311 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:38,312 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:38,314 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:38,322 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-02-06 19:08:38,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:38,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:38,328 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-02-06 19:08:38,331 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-02-06 19:08:38,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-02-06 19:08:38,347 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:38,348 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:38,348 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:38,348 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:38,348 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:38,348 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:38,349 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:38,350 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:38,358 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-02-06 19:08:38,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:38,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:38,361 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-02-06 19:08:38,373 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-02-06 19:08:38,381 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-02-06 19:08:38,386 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:38,387 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:38,387 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:38,387 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:38,388 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:38,389 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:38,389 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:38,392 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:38,399 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-02-06 19:08:38,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:38,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:38,402 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-02-06 19:08:38,404 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-02-06 19:08:38,405 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-02-06 19:08:38,418 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:38,418 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:38,418 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:38,418 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:38,429 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:08:38,429 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:08:38,443 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-06 19:08:38,467 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2025-02-06 19:08:38,469 INFO L444 ModelExtractionUtils]: 6 out of 16 variables were initially zero. Simplification set additionally 4 variables to zero. [2025-02-06 19:08:38,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:38,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:38,475 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-02-06 19:08:38,476 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-02-06 19:08:38,477 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-06 19:08:38,488 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-02-06 19:08:38,488 INFO L474 LassoAnalysis]: Proved termination. [2025-02-06 19:08:38,489 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -4*ULTIMATE.start_main_~i~0#1 + 18446744073709551609 Supporting invariants [1*ULTIMATE.start_main_~a~0#1.offset - 1*v_rep(select #length ULTIMATE.start_main_~a~0#1.base)_1 + 18446744073709551612 >= 0] [2025-02-06 19:08:38,495 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-02-06 19:08:38,508 INFO L156 tatePredicateManager]: 1 out of 2 supporting invariants were superfluous and have been removed [2025-02-06 19:08:38,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:08:38,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 19:08:38,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:08:38,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:38,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:08:38,563 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 19:08:38,564 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:08:38,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-06 19:08:38,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-06 19:08:38,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:38,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:08:38,579 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 19:08:38,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:08:38,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:08:38,607 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-02-06 19:08:38,609 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 19 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:08:38,662 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 19 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2). Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 23 states and 29 transitions. Complement of second has 3 states. [2025-02-06 19:08:38,664 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-02-06 19:08:38,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:08:38,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 7 transitions. [2025-02-06 19:08:38,677 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 7 transitions. Stem has 3 letters. Loop has 1 letters. [2025-02-06 19:08:38,678 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:08:38,678 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 7 transitions. Stem has 4 letters. Loop has 1 letters. [2025-02-06 19:08:38,678 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:08:38,679 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 7 transitions. Stem has 3 letters. Loop has 2 letters. [2025-02-06 19:08:38,679 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:08:38,679 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 29 transitions. [2025-02-06 19:08:38,681 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2025-02-06 19:08:38,685 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 13 states and 18 transitions. [2025-02-06 19:08:38,685 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2025-02-06 19:08:38,685 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2025-02-06 19:08:38,686 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 18 transitions. [2025-02-06 19:08:38,686 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 19:08:38,686 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13 states and 18 transitions. [2025-02-06 19:08:38,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 18 transitions. [2025-02-06 19:08:38,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2025-02-06 19:08:38,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 11 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:08:38,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2025-02-06 19:08:38,702 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13 states and 18 transitions. [2025-02-06 19:08:38,703 INFO L432 stractBuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2025-02-06 19:08:38,703 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-02-06 19:08:38,703 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions. [2025-02-06 19:08:38,703 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2025-02-06 19:08:38,703 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:08:38,703 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:08:38,705 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-02-06 19:08:38,705 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-02-06 19:08:38,705 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~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~i~0#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet7#1;main_~n~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;" "assume !(main_~n~0#1 < 1);call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~0#1 := 0;" "assume !(main_~i~0#1 < main_~n~0#1);havoc main_~i~0#1;" "call insertionSort(0, main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);"< [2025-02-06 19:08:38,705 INFO L754 eck$LassoCheckResult]: Loop: "~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size;" "assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int#0(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i;" "assume !true;" "call write~int#0(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i;" "call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);"< [2025-02-06 19:08:38,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:08:38,708 INFO L85 PathProgramCache]: Analyzing trace with hash 53409124, now seen corresponding path program 1 times [2025-02-06 19:08:38,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:08:38,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151513385] [2025-02-06 19:08:38,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:08:38,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:08:38,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 19:08:38,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 19:08:38,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:38,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:08:38,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:08:38,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:08:38,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151513385] [2025-02-06 19:08:38,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151513385] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 19:08:38,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 19:08:38,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 19:08:38,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173650666] [2025-02-06 19:08:38,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 19:08:38,806 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-06 19:08:38,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:08:38,807 INFO L85 PathProgramCache]: Analyzing trace with hash 40972325, now seen corresponding path program 1 times [2025-02-06 19:08:38,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:08:38,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559682422] [2025-02-06 19:08:38,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:08:38,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:08:38,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 19:08:38,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 19:08:38,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:38,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:08:38,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:08:38,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:08:38,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559682422] [2025-02-06 19:08:38,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559682422] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 19:08:38,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 19:08:38,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 19:08:38,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62860632] [2025-02-06 19:08:38,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 19:08:38,829 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-06 19:08:38,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:08:38,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 19:08:38,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 19:08:38,832 INFO L87 Difference]: Start difference. First operand 13 states and 18 transitions. cyclomatic complexity: 7 Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:08:38,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:08:38,836 INFO L93 Difference]: Finished difference Result 13 states and 17 transitions. [2025-02-06 19:08:38,836 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 17 transitions. [2025-02-06 19:08:38,836 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2025-02-06 19:08:38,837 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 17 transitions. [2025-02-06 19:08:38,837 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2025-02-06 19:08:38,837 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2025-02-06 19:08:38,837 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17 transitions. [2025-02-06 19:08:38,838 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 19:08:38,838 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13 states and 17 transitions. [2025-02-06 19:08:38,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 17 transitions. [2025-02-06 19:08:38,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2025-02-06 19:08:38,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:08:38,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2025-02-06 19:08:38,839 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13 states and 17 transitions. [2025-02-06 19:08:38,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 19:08:38,840 INFO L432 stractBuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2025-02-06 19:08:38,840 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-02-06 19:08:38,840 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2025-02-06 19:08:38,841 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2025-02-06 19:08:38,841 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:08:38,841 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:08:38,841 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-02-06 19:08:38,841 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:08:38,842 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~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~i~0#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet7#1;main_~n~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;" "assume !(main_~n~0#1 < 1);call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~0#1 := 0;" "assume !(main_~i~0#1 < main_~n~0#1);havoc main_~i~0#1;" "call insertionSort(0, main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);"< [2025-02-06 19:08:38,842 INFO L754 eck$LassoCheckResult]: Loop: "~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size;" "assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int#0(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i;" "assume true;#t~short3 := ~j~0 > 0;" "assume #t~short3;call #t~mem2 := read~int#0(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short3 := #t~mem2 > ~temp~0;" "assume !#t~short3;havoc #t~mem2;havoc #t~short3;" "call write~int#0(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i;" "call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);"< [2025-02-06 19:08:38,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:08:38,842 INFO L85 PathProgramCache]: Analyzing trace with hash 53409124, now seen corresponding path program 2 times [2025-02-06 19:08:38,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:08:38,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081435217] [2025-02-06 19:08:38,843 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:08:38,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:08:38,847 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5 statements into 1 equivalence classes. [2025-02-06 19:08:38,854 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 19:08:38,855 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 19:08:38,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:08:38,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:08:38,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:08:38,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081435217] [2025-02-06 19:08:38,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081435217] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 19:08:38,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 19:08:38,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 19:08:38,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425703699] [2025-02-06 19:08:38,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 19:08:38,896 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-06 19:08:38,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:08:38,897 INFO L85 PathProgramCache]: Analyzing trace with hash 718902082, now seen corresponding path program 1 times [2025-02-06 19:08:38,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:08:38,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761533464] [2025-02-06 19:08:38,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:08:38,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:08:38,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 19:08:38,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 19:08:38,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:38,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:38,923 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:08:38,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 19:08:38,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 19:08:38,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:38,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:38,937 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:08:39,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:08:39,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 19:08:39,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 19:08:39,275 INFO L87 Difference]: Start difference. First operand 13 states and 17 transitions. cyclomatic complexity: 6 Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:08:39,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:08:39,281 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2025-02-06 19:08:39,282 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 16 transitions. [2025-02-06 19:08:39,282 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2025-02-06 19:08:39,283 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 16 transitions. [2025-02-06 19:08:39,283 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2025-02-06 19:08:39,283 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2025-02-06 19:08:39,283 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 16 transitions. [2025-02-06 19:08:39,283 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 19:08:39,283 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13 states and 16 transitions. [2025-02-06 19:08:39,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 16 transitions. [2025-02-06 19:08:39,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2025-02-06 19:08:39,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:08:39,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 16 transitions. [2025-02-06 19:08:39,285 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13 states and 16 transitions. [2025-02-06 19:08:39,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 19:08:39,286 INFO L432 stractBuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2025-02-06 19:08:39,286 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-02-06 19:08:39,286 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 16 transitions. [2025-02-06 19:08:39,286 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2025-02-06 19:08:39,286 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:08:39,286 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:08:39,286 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-02-06 19:08:39,286 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:08:39,286 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~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~i~0#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet7#1;main_~n~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;" "assume !(main_~n~0#1 < 1);call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~n~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume !(main_~i~0#1 < main_~n~0#1);havoc main_~i~0#1;" "call insertionSort(0, main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);"< [2025-02-06 19:08:39,287 INFO L754 eck$LassoCheckResult]: Loop: "~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size;" "assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int#0(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i;" "assume true;#t~short3 := ~j~0 > 0;" "assume #t~short3;call #t~mem2 := read~int#0(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short3 := #t~mem2 > ~temp~0;" "assume !#t~short3;havoc #t~mem2;havoc #t~short3;" "call write~int#0(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i;" "call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);"< [2025-02-06 19:08:39,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:08:39,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1655683463, now seen corresponding path program 1 times [2025-02-06 19:08:39,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:08:39,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306844681] [2025-02-06 19:08:39,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:08:39,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:08:39,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 19:08:39,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 19:08:39,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:39,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:39,297 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:08:39,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 19:08:39,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 19:08:39,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:39,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:39,315 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:08:39,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:08:39,315 INFO L85 PathProgramCache]: Analyzing trace with hash 718902082, now seen corresponding path program 2 times [2025-02-06 19:08:39,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:08:39,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144722328] [2025-02-06 19:08:39,316 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:08:39,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:08:39,321 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 7 statements into 1 equivalence classes. [2025-02-06 19:08:39,329 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 19:08:39,330 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 19:08:39,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:39,330 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:08:39,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 19:08:39,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 19:08:39,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:39,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:39,342 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:08:39,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:08:39,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1318401788, now seen corresponding path program 1 times [2025-02-06 19:08:39,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:08:39,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566752529] [2025-02-06 19:08:39,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:08:39,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:08:39,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 19:08:39,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 19:08:39,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:39,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:08:39,402 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-02-06 19:08:39,549 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 19:08:39,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:08:39,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566752529] [2025-02-06 19:08:39,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566752529] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 19:08:39,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 19:08:39,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 19:08:39,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418867059] [2025-02-06 19:08:39,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 19:08:39,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:08:39,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 19:08:39,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 19:08:39,887 INFO L87 Difference]: Start difference. First operand 13 states and 16 transitions. cyclomatic complexity: 5 Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:08:39,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:08:39,941 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2025-02-06 19:08:39,942 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 23 transitions. [2025-02-06 19:08:39,942 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2025-02-06 19:08:39,943 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 23 transitions. [2025-02-06 19:08:39,943 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2025-02-06 19:08:39,943 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2025-02-06 19:08:39,943 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 23 transitions. [2025-02-06 19:08:39,943 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 19:08:39,943 INFO L218 hiAutomatonCegarLoop]: Abstraction has 20 states and 23 transitions. [2025-02-06 19:08:39,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 23 transitions. [2025-02-06 19:08:39,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2025-02-06 19:08:39,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:08:39,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2025-02-06 19:08:39,945 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18 states and 21 transitions. [2025-02-06 19:08:39,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 19:08:39,946 INFO L432 stractBuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2025-02-06 19:08:39,946 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-02-06 19:08:39,946 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 21 transitions. [2025-02-06 19:08:39,946 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2025-02-06 19:08:39,947 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:08:39,947 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:08:39,947 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:08:39,947 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:08:39,947 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~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~i~0#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet7#1;main_~n~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;" "assume !(main_~n~0#1 < 1);call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~n~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume !(main_~i~0#1 < main_~n~0#1);havoc main_~i~0#1;" "call insertionSort(0, main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);"< "~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size;" "assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int#0(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i;" "assume true;#t~short3 := ~j~0 > 0;" "assume !#t~short3;" "assume !#t~short3;havoc #t~mem2;havoc #t~short3;" [2025-02-06 19:08:39,947 INFO L754 eck$LassoCheckResult]: Loop: "call write~int#0(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i;" "call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);"< "~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size;" "assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int#0(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i;" "assume true;#t~short3 := ~j~0 > 0;" "assume #t~short3;call #t~mem2 := read~int#0(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short3 := #t~mem2 > ~temp~0;" "assume !#t~short3;havoc #t~mem2;havoc #t~short3;" [2025-02-06 19:08:39,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:08:39,948 INFO L85 PathProgramCache]: Analyzing trace with hash -1974044863, now seen corresponding path program 1 times [2025-02-06 19:08:39,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:08:39,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837794040] [2025-02-06 19:08:39,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:08:39,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:08:39,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 19:08:39,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 19:08:39,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:39,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:39,964 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:08:39,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 19:08:39,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 19:08:39,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:39,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:39,978 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:08:39,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:08:39,983 INFO L85 PathProgramCache]: Analyzing trace with hash 36808974, now seen corresponding path program 3 times [2025-02-06 19:08:39,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:08:39,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317883015] [2025-02-06 19:08:39,983 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 19:08:39,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:08:39,988 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 7 statements into 1 equivalence classes. [2025-02-06 19:08:39,992 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 19:08:39,992 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-06 19:08:39,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:39,992 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:08:39,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 19:08:39,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 19:08:39,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:39,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:39,998 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:08:39,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:08:39,999 INFO L85 PathProgramCache]: Analyzing trace with hash -280852018, now seen corresponding path program 1 times [2025-02-06 19:08:39,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:08:39,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733940245] [2025-02-06 19:08:39,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:08:39,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:08:40,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-06 19:08:40,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 19:08:40,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:40,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:08:40,220 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:08:40,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:08:40,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733940245] [2025-02-06 19:08:40,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733940245] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:08:40,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1036190109] [2025-02-06 19:08:40,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:08:40,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:08:40,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:40,223 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 19:08:40,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-06 19:08:40,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-06 19:08:40,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 19:08:40,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:40,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:08:40,275 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-06 19:08:40,276 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:08:40,408 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:08:40,409 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:08:40,507 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:08:40,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1036190109] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:08:40,507 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:08:40,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 18 [2025-02-06 19:08:40,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237261357] [2025-02-06 19:08:40,508 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:08:41,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:08:41,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-06 19:08:41,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2025-02-06 19:08:41,041 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. cyclomatic complexity: 5 Second operand has 18 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 13 states have internal predecessors, (32), 3 states have call successors, (5), 5 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:08:41,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:08:41,140 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2025-02-06 19:08:41,140 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 32 transitions. [2025-02-06 19:08:41,141 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2025-02-06 19:08:41,141 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 19 states and 22 transitions. [2025-02-06 19:08:41,142 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2025-02-06 19:08:41,142 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2025-02-06 19:08:41,142 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 22 transitions. [2025-02-06 19:08:41,142 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 19:08:41,142 INFO L218 hiAutomatonCegarLoop]: Abstraction has 19 states and 22 transitions. [2025-02-06 19:08:41,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 22 transitions. [2025-02-06 19:08:41,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2025-02-06 19:08:41,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 16 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:08:41,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2025-02-06 19:08:41,144 INFO L240 hiAutomatonCegarLoop]: Abstraction has 19 states and 22 transitions. [2025-02-06 19:08:41,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 19:08:41,144 INFO L432 stractBuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2025-02-06 19:08:41,145 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-02-06 19:08:41,145 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 22 transitions. [2025-02-06 19:08:41,145 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2025-02-06 19:08:41,145 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:08:41,145 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:08:41,145 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:08:41,145 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:08:41,146 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~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~i~0#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet7#1;main_~n~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;" "assume !(main_~n~0#1 < 1);call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~n~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~0#1 < main_~n~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume !(main_~i~0#1 < main_~n~0#1);havoc main_~i~0#1;" "call insertionSort(0, main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);"< "~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size;" "assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int#0(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i;" "assume true;#t~short3 := ~j~0 > 0;" "assume !#t~short3;" "assume !#t~short3;havoc #t~mem2;havoc #t~short3;" [2025-02-06 19:08:41,146 INFO L754 eck$LassoCheckResult]: Loop: "call write~int#0(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i;" "call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);"< "~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size;" "assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int#0(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i;" "assume true;#t~short3 := ~j~0 > 0;" "assume #t~short3;call #t~mem2 := read~int#0(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short3 := #t~mem2 > ~temp~0;" "assume !#t~short3;havoc #t~mem2;havoc #t~short3;" [2025-02-06 19:08:41,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:08:41,146 INFO L85 PathProgramCache]: Analyzing trace with hash -894544604, now seen corresponding path program 2 times [2025-02-06 19:08:41,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:08:41,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14409289] [2025-02-06 19:08:41,146 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:08:41,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:08:41,151 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-02-06 19:08:41,165 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 19:08:41,166 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 19:08:41,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:41,166 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:08:41,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 19:08:41,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 19:08:41,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:41,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:41,177 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:08:41,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:08:41,177 INFO L85 PathProgramCache]: Analyzing trace with hash 36808974, now seen corresponding path program 4 times [2025-02-06 19:08:41,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:08:41,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052365751] [2025-02-06 19:08:41,178 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 19:08:41,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:08:41,183 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 7 statements into 2 equivalence classes. [2025-02-06 19:08:41,187 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 19:08:41,187 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 19:08:41,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:41,187 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:08:41,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 19:08:41,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 19:08:41,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:41,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:41,200 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:08:41,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:08:41,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1869797003, now seen corresponding path program 2 times [2025-02-06 19:08:41,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:08:41,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220563701] [2025-02-06 19:08:41,202 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:08:41,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:08:41,209 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-02-06 19:08:41,226 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 19:08:41,228 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 19:08:41,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:41,228 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:08:41,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-06 19:08:41,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 19:08:41,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:41,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:41,249 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:08:42,199 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:08:42,199 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:08:42,199 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:08:42,199 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:08:42,199 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-06 19:08:42,199 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:42,199 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:08:42,199 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:08:42,199 INFO L132 ssoRankerPreferences]: Filename of dumped script: insertionSort_recursive.i_Iteration6_Lasso [2025-02-06 19:08:42,199 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:08:42,200 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:08:42,202 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:42,205 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:42,207 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:42,212 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:42,214 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:42,215 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:42,217 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:42,219 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:42,221 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:42,223 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:42,925 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:42,928 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:42,930 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:42,932 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:42,933 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:42,935 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:42,937 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:43,419 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:08:43,419 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-06 19:08:43,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:43,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:43,423 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-02-06 19:08:43,424 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-02-06 19:08:43,424 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-02-06 19:08:43,434 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:43,434 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:43,434 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:43,434 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:43,434 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:43,435 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:43,435 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:43,437 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:43,443 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-02-06 19:08:43,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:43,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:43,446 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-02-06 19:08:43,448 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-02-06 19:08:43,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-02-06 19:08:43,458 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:43,458 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:43,458 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:43,458 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:43,458 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:43,459 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:43,459 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:43,462 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:43,467 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-02-06 19:08:43,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:43,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:43,469 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-02-06 19:08:43,470 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-02-06 19:08:43,471 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-02-06 19:08:43,481 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:43,481 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:43,481 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:43,481 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:43,481 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:43,482 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:43,482 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:43,484 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:43,491 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-02-06 19:08:43,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:43,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:43,493 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-02-06 19:08:43,494 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-02-06 19:08:43,495 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-02-06 19:08:43,505 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:43,505 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:43,505 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:43,505 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:43,505 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:43,505 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:43,505 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:43,506 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:43,512 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-02-06 19:08:43,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:43,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:43,514 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:08:43,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-02-06 19:08:43,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-02-06 19:08:43,525 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:43,526 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:43,526 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:43,526 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:43,526 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:43,526 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:43,526 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:43,529 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:43,537 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-02-06 19:08:43,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:43,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:43,539 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-02-06 19:08:43,540 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-02-06 19:08:43,540 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-02-06 19:08:43,550 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:43,551 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:43,551 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:43,551 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:43,551 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:43,551 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:43,551 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:43,552 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:43,558 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-02-06 19:08:43,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:43,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:43,560 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-02-06 19:08:43,561 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-02-06 19:08:43,562 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-02-06 19:08:43,572 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:43,572 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:43,573 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:43,573 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:43,573 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:43,573 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:43,573 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:43,576 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:43,581 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-02-06 19:08:43,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:43,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:43,583 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-02-06 19:08:43,584 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-02-06 19:08:43,585 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-02-06 19:08:43,594 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:43,595 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:43,595 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:43,595 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:43,597 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:08:43,597 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:08:43,604 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:43,610 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-02-06 19:08:43,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:43,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:43,612 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-02-06 19:08:43,613 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-02-06 19:08:43,614 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-02-06 19:08:43,623 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:43,624 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:43,624 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:43,624 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:43,626 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:08:43,626 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:08:43,629 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:43,635 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-02-06 19:08:43,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:43,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:43,637 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-02-06 19:08:43,639 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-02-06 19:08:43,640 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-02-06 19:08:43,653 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:43,654 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-02-06 19:08:43,654 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:43,654 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:43,660 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2025-02-06 19:08:43,660 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:08:43,667 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:43,675 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-02-06 19:08:43,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:43,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:43,678 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-02-06 19:08:43,681 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-02-06 19:08:43,682 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-02-06 19:08:43,694 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:43,694 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:43,694 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:43,694 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:43,696 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:08:43,696 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:08:43,700 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:43,708 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2025-02-06 19:08:43,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:43,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:43,710 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-02-06 19:08:43,713 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-02-06 19:08:43,714 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-02-06 19:08:43,727 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:43,727 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:43,727 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:43,727 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:43,740 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:08:43,740 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:08:43,758 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-06 19:08:43,791 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2025-02-06 19:08:43,791 INFO L444 ModelExtractionUtils]: 2 out of 31 variables were initially zero. Simplification set additionally 24 variables to zero. [2025-02-06 19:08:43,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:43,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:43,793 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-02-06 19:08:43,794 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-02-06 19:08:43,795 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-06 19:08:43,805 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-02-06 19:08:43,805 INFO L474 LassoAnalysis]: Proved termination. [2025-02-06 19:08:43,806 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length insertionSort_~array.base)_1, insertionSort_~j~0) = 1*v_rep(select #length insertionSort_~array.base)_1 - 16*insertionSort_~j~0 Supporting invariants [-1*insertionSort_~size + 2 >= 0] [2025-02-06 19:08:43,813 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-02-06 19:08:43,830 INFO L156 tatePredicateManager]: 4 out of 6 supporting invariants were superfluous and have been removed [2025-02-06 19:08:43,834 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-02-06 19:08:43,834 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-02-06 19:08:43,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:08:43,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 19:08:43,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 19:08:43,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:43,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:08:43,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-06 19:08:43,879 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:08:43,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 19:08:44,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 19:08:44,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:44,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:08:44,004 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-06 19:08:44,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:08:44,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:08:44,234 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.8 stem predicates 5 loop predicates [2025-02-06 19:08:44,234 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 22 transitions. cyclomatic complexity: 5 Second operand has 13 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:08:44,240 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-02-06 19:08:44,424 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 22 transitions. cyclomatic complexity: 5. Second operand has 13 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 44 states and 52 transitions. Complement of second has 23 states. [2025-02-06 19:08:44,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 8 stem states 4 non-accepting loop states 2 accepting loop states [2025-02-06 19:08:44,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:08:44,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 30 transitions. [2025-02-06 19:08:44,426 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 30 transitions. Stem has 12 letters. Loop has 7 letters. [2025-02-06 19:08:44,427 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:08:44,427 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 30 transitions. Stem has 19 letters. Loop has 7 letters. [2025-02-06 19:08:44,427 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:08:44,427 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 30 transitions. Stem has 12 letters. Loop has 14 letters. [2025-02-06 19:08:44,427 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:08:44,427 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 52 transitions. [2025-02-06 19:08:44,428 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2025-02-06 19:08:44,429 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 39 states and 46 transitions. [2025-02-06 19:08:44,429 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2025-02-06 19:08:44,430 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2025-02-06 19:08:44,430 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 46 transitions. [2025-02-06 19:08:44,430 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:08:44,430 INFO L218 hiAutomatonCegarLoop]: Abstraction has 39 states and 46 transitions. [2025-02-06 19:08:44,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 46 transitions. [2025-02-06 19:08:44,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2025-02-06 19:08:44,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 32 states have (on average 1.21875) internal successors, (39), 31 states have internal predecessors, (39), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:08:44,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2025-02-06 19:08:44,433 INFO L240 hiAutomatonCegarLoop]: Abstraction has 36 states and 43 transitions. [2025-02-06 19:08:44,433 INFO L432 stractBuchiCegarLoop]: Abstraction has 36 states and 43 transitions. [2025-02-06 19:08:44,433 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-02-06 19:08:44,433 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 43 transitions. [2025-02-06 19:08:44,433 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2025-02-06 19:08:44,434 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:08:44,434 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:08:44,434 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:08:44,434 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:08:44,434 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~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~i~0#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet7#1;main_~n~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;" "assume !(main_~n~0#1 < 1);call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~n~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~0#1 < main_~n~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~0#1 < main_~n~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume !(main_~i~0#1 < main_~n~0#1);havoc main_~i~0#1;" "call insertionSort(0, main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);"< "~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size;" "assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int#0(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i;" "assume true;#t~short3 := ~j~0 > 0;" "assume !#t~short3;" "assume !#t~short3;havoc #t~mem2;havoc #t~short3;" [2025-02-06 19:08:44,434 INFO L754 eck$LassoCheckResult]: Loop: "call write~int#0(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i;" "call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);"< "~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size;" "assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int#0(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i;" "assume true;#t~short3 := ~j~0 > 0;" "assume #t~short3;call #t~mem2 := read~int#0(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short3 := #t~mem2 > ~temp~0;" "assume !#t~short3;havoc #t~mem2;havoc #t~short3;" [2025-02-06 19:08:44,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:08:44,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1789774943, now seen corresponding path program 3 times [2025-02-06 19:08:44,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:08:44,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942864631] [2025-02-06 19:08:44,435 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 19:08:44,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:08:44,441 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 13 statements into 3 equivalence classes. [2025-02-06 19:08:44,449 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 19:08:44,450 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-06 19:08:44,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:44,450 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:08:44,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 19:08:44,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 19:08:44,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:44,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:44,459 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:08:44,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:08:44,463 INFO L85 PathProgramCache]: Analyzing trace with hash 36808974, now seen corresponding path program 5 times [2025-02-06 19:08:44,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:08:44,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631476613] [2025-02-06 19:08:44,463 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 19:08:44,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:08:44,471 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 7 statements into 1 equivalence classes. [2025-02-06 19:08:44,474 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 19:08:44,476 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 19:08:44,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:44,477 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:08:44,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 19:08:44,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 19:08:44,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:44,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:44,487 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:08:44,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:08:44,490 INFO L85 PathProgramCache]: Analyzing trace with hash -179560082, now seen corresponding path program 3 times [2025-02-06 19:08:44,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:08:44,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020364005] [2025-02-06 19:08:44,491 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 19:08:44,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:08:44,497 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 3 equivalence classes. [2025-02-06 19:08:44,513 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 19:08:44,514 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-06 19:08:44,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:44,514 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:08:44,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-06 19:08:44,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 19:08:44,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:44,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:44,527 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:08:45,608 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:08:45,608 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:08:45,608 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:08:45,608 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:08:45,608 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-06 19:08:45,608 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:45,608 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:08:45,608 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:08:45,608 INFO L132 ssoRankerPreferences]: Filename of dumped script: insertionSort_recursive.i_Iteration7_Lasso [2025-02-06 19:08:45,609 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:08:45,609 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:08:45,611 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:45,617 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:45,619 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:45,621 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:45,623 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:45,625 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:45,628 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:45,629 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:45,630 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:45,632 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:45,633 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:45,639 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:45,641 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:45,644 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:46,331 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:46,332 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:46,334 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:46,781 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:08:46,781 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-06 19:08:46,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:46,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:46,788 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-02-06 19:08:46,790 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-02-06 19:08:46,791 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-02-06 19:08:46,802 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:46,802 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:46,802 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:46,802 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:46,802 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:46,802 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:46,802 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:46,805 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:46,811 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-02-06 19:08:46,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:46,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:46,813 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-02-06 19:08:46,814 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-02-06 19:08:46,814 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-02-06 19:08:46,825 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:46,825 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:46,825 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:46,825 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:46,825 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:46,825 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:46,825 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:46,826 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:46,832 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2025-02-06 19:08:46,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:46,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:46,834 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:08:46,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-02-06 19:08:46,835 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-02-06 19:08:46,845 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:46,845 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:46,846 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:46,846 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:46,846 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:46,846 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:46,846 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:46,847 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:46,852 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2025-02-06 19:08:46,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:46,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:46,854 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-02-06 19:08:46,855 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-02-06 19:08:46,856 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-02-06 19:08:46,865 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:46,866 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:46,866 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:46,866 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:46,866 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:46,866 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:46,866 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:46,867 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:46,872 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-02-06 19:08:46,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:46,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:46,875 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-02-06 19:08:46,876 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-02-06 19:08:46,877 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-02-06 19:08:46,886 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:46,886 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:46,886 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:46,886 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:46,886 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:46,887 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:46,887 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:46,888 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:46,893 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2025-02-06 19:08:46,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:46,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:46,895 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-02-06 19:08:46,897 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-02-06 19:08:46,897 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-02-06 19:08:46,907 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:46,908 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:46,908 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:46,908 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:46,908 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:46,908 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:46,908 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:46,909 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:46,917 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-02-06 19:08:46,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:46,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:46,919 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-02-06 19:08:46,921 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-02-06 19:08:46,922 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-02-06 19:08:46,934 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:46,934 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:46,935 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:46,935 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:46,935 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:46,935 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:46,935 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:46,938 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:46,946 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-02-06 19:08:46,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:46,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:46,949 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-02-06 19:08:46,950 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-02-06 19:08:46,951 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-02-06 19:08:46,961 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:46,961 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:46,961 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:46,961 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:46,961 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:46,961 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:46,961 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:46,962 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:46,969 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2025-02-06 19:08:46,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:46,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:46,971 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-02-06 19:08:46,972 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-02-06 19:08:46,973 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-02-06 19:08:46,983 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:46,983 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:46,983 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:46,983 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:46,983 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:46,984 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:46,984 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:46,985 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:46,990 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-02-06 19:08:46,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:46,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:46,992 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-02-06 19:08:46,993 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-02-06 19:08:46,994 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-02-06 19:08:47,004 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:47,004 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:47,004 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:47,004 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:47,004 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:47,004 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:47,004 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:47,005 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:47,011 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-02-06 19:08:47,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:47,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:47,013 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-02-06 19:08:47,015 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-02-06 19:08:47,016 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-02-06 19:08:47,026 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:47,026 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:47,026 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:47,026 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:47,026 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:47,026 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:47,027 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:47,027 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:47,033 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-02-06 19:08:47,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:47,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:47,035 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-02-06 19:08:47,036 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-02-06 19:08:47,037 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-02-06 19:08:47,047 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:47,047 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:47,047 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:47,047 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:47,048 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:08:47,048 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:08:47,052 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:47,058 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-02-06 19:08:47,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:47,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:47,060 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-02-06 19:08:47,061 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-02-06 19:08:47,062 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-02-06 19:08:47,074 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:47,074 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:47,074 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:47,074 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:47,085 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:08:47,086 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:08:47,102 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:47,110 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2025-02-06 19:08:47,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:47,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:47,113 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-02-06 19:08:47,114 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-02-06 19:08:47,115 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-02-06 19:08:47,128 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:47,128 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:47,128 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:47,128 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:47,130 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:08:47,130 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:08:47,133 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:47,139 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-02-06 19:08:47,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:47,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:47,141 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-02-06 19:08:47,141 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-02-06 19:08:47,142 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-02-06 19:08:47,153 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:47,153 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:47,153 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:47,153 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:47,161 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:08:47,161 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:08:47,172 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-06 19:08:47,198 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2025-02-06 19:08:47,199 INFO L444 ModelExtractionUtils]: 2 out of 25 variables were initially zero. Simplification set additionally 20 variables to zero. [2025-02-06 19:08:47,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:47,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:47,200 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-02-06 19:08:47,201 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-02-06 19:08:47,202 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-06 19:08:47,212 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-02-06 19:08:47,212 INFO L474 LassoAnalysis]: Proved termination. [2025-02-06 19:08:47,212 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(insertionSort_~j~0, v_rep(select #length insertionSort_#in~array.base)_2) = -4*insertionSort_~j~0 + 1*v_rep(select #length insertionSort_#in~array.base)_2 Supporting invariants [] [2025-02-06 19:08:47,219 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2025-02-06 19:08:47,237 INFO L156 tatePredicateManager]: 3 out of 6 supporting invariants were superfluous and have been removed [2025-02-06 19:08:47,244 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-02-06 19:08:47,244 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-02-06 19:08:47,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:08:47,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 19:08:47,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 19:08:47,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:47,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:08:47,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-06 19:08:47,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:08:47,393 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-02-06 19:08:47,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 19:08:47,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 19:08:47,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:47,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:08:47,419 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-02-06 19:08:47,420 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:08:47,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:08:47,543 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.5 stem predicates 5 loop predicates [2025-02-06 19:08:47,543 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 36 states and 43 transitions. cyclomatic complexity: 10 Second operand has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 8 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:08:47,667 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 36 states and 43 transitions. cyclomatic complexity: 10. Second operand has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 8 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 62 states and 76 transitions. Complement of second has 18 states. [2025-02-06 19:08:47,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 5 stem states 4 non-accepting loop states 1 accepting loop states [2025-02-06 19:08:47,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 8 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:08:47,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 20 transitions. [2025-02-06 19:08:47,668 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 20 transitions. Stem has 13 letters. Loop has 7 letters. [2025-02-06 19:08:47,669 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:08:47,669 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 20 transitions. Stem has 20 letters. Loop has 7 letters. [2025-02-06 19:08:47,670 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:08:47,670 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 20 transitions. Stem has 13 letters. Loop has 14 letters. [2025-02-06 19:08:47,670 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:08:47,670 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 62 states and 76 transitions. [2025-02-06 19:08:47,671 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2025-02-06 19:08:47,673 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 62 states to 48 states and 58 transitions. [2025-02-06 19:08:47,673 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2025-02-06 19:08:47,673 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2025-02-06 19:08:47,673 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 58 transitions. [2025-02-06 19:08:47,673 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:08:47,673 INFO L218 hiAutomatonCegarLoop]: Abstraction has 48 states and 58 transitions. [2025-02-06 19:08:47,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 58 transitions. [2025-02-06 19:08:47,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 29. [2025-02-06 19:08:47,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 25 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:08:47,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2025-02-06 19:08:47,677 INFO L240 hiAutomatonCegarLoop]: Abstraction has 29 states and 35 transitions. [2025-02-06 19:08:47,677 INFO L432 stractBuchiCegarLoop]: Abstraction has 29 states and 35 transitions. [2025-02-06 19:08:47,678 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-02-06 19:08:47,678 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 35 transitions. [2025-02-06 19:08:47,679 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2025-02-06 19:08:47,679 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:08:47,679 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:08:47,679 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:08:47,679 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-06 19:08:47,679 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~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~i~0#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet7#1;main_~n~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;" "assume !(main_~n~0#1 < 1);call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~n~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~0#1 < main_~n~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume !(main_~i~0#1 < main_~n~0#1);havoc main_~i~0#1;" "call insertionSort(0, main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);"< "~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size;" "assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int#0(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i;" "assume true;#t~short3 := ~j~0 > 0;" "assume !#t~short3;" "assume !#t~short3;havoc #t~mem2;havoc #t~short3;" "call write~int#0(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i;" "call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);"< "~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size;" "assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int#0(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i;" "assume true;#t~short3 := ~j~0 > 0;" "assume !#t~short3;" "assume #t~short3;havoc #t~mem2;havoc #t~short3;call #t~mem4 := read~int#0(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);call write~int#0(#t~mem4, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~post5 := ~j~0;~j~0 := #t~post5 - 1;havoc #t~post5;" [2025-02-06 19:08:47,679 INFO L754 eck$LassoCheckResult]: Loop: "assume true;#t~short3 := ~j~0 > 0;" "assume #t~short3;call #t~mem2 := read~int#0(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short3 := #t~mem2 > ~temp~0;" "assume #t~short3;havoc #t~mem2;havoc #t~short3;call #t~mem4 := read~int#0(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);call write~int#0(#t~mem4, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~post5 := ~j~0;~j~0 := #t~post5 - 1;havoc #t~post5;" [2025-02-06 19:08:47,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:08:47,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1869797035, now seen corresponding path program 1 times [2025-02-06 19:08:47,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:08:47,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456572176] [2025-02-06 19:08:47,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:08:47,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:08:47,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-06 19:08:47,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 19:08:47,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:47,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:08:47,708 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-06 19:08:47,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:08:47,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456572176] [2025-02-06 19:08:47,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456572176] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 19:08:47,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 19:08:47,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 19:08:47,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330342091] [2025-02-06 19:08:47,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 19:08:47,709 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-06 19:08:47,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:08:47,709 INFO L85 PathProgramCache]: Analyzing trace with hash 38663, now seen corresponding path program 1 times [2025-02-06 19:08:47,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:08:47,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615239682] [2025-02-06 19:08:47,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:08:47,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:08:47,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 19:08:47,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:08:47,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:47,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:47,715 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:08:47,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 19:08:47,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:08:47,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:47,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:47,720 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:08:47,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:08:47,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 19:08:47,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 19:08:47,800 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. cyclomatic complexity: 9 Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:08:47,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:08:47,805 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2025-02-06 19:08:47,805 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 37 transitions. [2025-02-06 19:08:47,806 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2025-02-06 19:08:47,806 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 31 states and 36 transitions. [2025-02-06 19:08:47,806 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2025-02-06 19:08:47,806 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2025-02-06 19:08:47,806 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 36 transitions. [2025-02-06 19:08:47,806 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:08:47,806 INFO L218 hiAutomatonCegarLoop]: Abstraction has 31 states and 36 transitions. [2025-02-06 19:08:47,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 36 transitions. [2025-02-06 19:08:47,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2025-02-06 19:08:47,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 26 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:08:47,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2025-02-06 19:08:47,808 INFO L240 hiAutomatonCegarLoop]: Abstraction has 30 states and 35 transitions. [2025-02-06 19:08:47,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 19:08:47,810 INFO L432 stractBuchiCegarLoop]: Abstraction has 30 states and 35 transitions. [2025-02-06 19:08:47,810 INFO L338 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-02-06 19:08:47,810 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 35 transitions. [2025-02-06 19:08:47,810 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2025-02-06 19:08:47,810 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:08:47,810 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:08:47,811 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:08:47,811 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-06 19:08:47,811 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~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~i~0#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet7#1;main_~n~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;" "assume !(main_~n~0#1 < 1);call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~n~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~0#1 < main_~n~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume !(main_~i~0#1 < main_~n~0#1);havoc main_~i~0#1;" "call insertionSort(0, main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);"< "~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size;" "assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int#0(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i;" "assume true;#t~short3 := ~j~0 > 0;" "assume !#t~short3;" "assume !#t~short3;havoc #t~mem2;havoc #t~short3;" "call write~int#0(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i;" "call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);"< "~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size;" "assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int#0(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i;" "assume true;#t~short3 := ~j~0 > 0;" "assume #t~short3;call #t~mem2 := read~int#0(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short3 := #t~mem2 > ~temp~0;" "assume #t~short3;havoc #t~mem2;havoc #t~short3;call #t~mem4 := read~int#0(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);call write~int#0(#t~mem4, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~post5 := ~j~0;~j~0 := #t~post5 - 1;havoc #t~post5;" [2025-02-06 19:08:47,811 INFO L754 eck$LassoCheckResult]: Loop: "assume true;#t~short3 := ~j~0 > 0;" "assume #t~short3;call #t~mem2 := read~int#0(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short3 := #t~mem2 > ~temp~0;" "assume #t~short3;havoc #t~mem2;havoc #t~short3;call #t~mem4 := read~int#0(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);call write~int#0(#t~mem4, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~post5 := ~j~0;~j~0 := #t~post5 - 1;havoc #t~post5;" [2025-02-06 19:08:47,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:08:47,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1869797004, now seen corresponding path program 1 times [2025-02-06 19:08:47,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:08:47,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636688478] [2025-02-06 19:08:47,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:08:47,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:08:47,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-06 19:08:47,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 19:08:47,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:47,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:47,830 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:08:47,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-06 19:08:47,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 19:08:47,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:47,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:47,848 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:08:47,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:08:47,848 INFO L85 PathProgramCache]: Analyzing trace with hash 38663, now seen corresponding path program 2 times [2025-02-06 19:08:47,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:08:47,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210606955] [2025-02-06 19:08:47,849 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:08:47,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:08:47,854 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-02-06 19:08:47,857 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:08:47,858 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 19:08:47,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:47,858 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:08:47,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 19:08:47,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:08:47,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:47,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:47,861 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:08:47,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:08:47,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1691693212, now seen corresponding path program 2 times [2025-02-06 19:08:47,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:08:47,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438102239] [2025-02-06 19:08:47,862 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:08:47,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:08:47,873 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-02-06 19:08:47,880 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 19:08:47,880 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 19:08:47,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:08:48,097 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 19:08:48,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:08:48,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438102239] [2025-02-06 19:08:48,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438102239] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:08:48,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1880367601] [2025-02-06 19:08:48,098 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:08:48,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:08:48,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:48,100 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 19:08:48,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2025-02-06 19:08:48,146 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-02-06 19:08:48,169 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 19:08:48,170 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 19:08:48,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:08:48,171 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 19:08:48,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:08:48,246 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 19:08:48,246 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:08:48,329 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 19:08:48,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1880367601] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:08:48,329 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:08:48,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 16 [2025-02-06 19:08:48,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613058216] [2025-02-06 19:08:48,329 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:08:48,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:08:48,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-06 19:08:48,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2025-02-06 19:08:48,450 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. cyclomatic complexity: 8 Second operand has 16 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 4 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:08:48,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:08:48,831 INFO L93 Difference]: Finished difference Result 93 states and 107 transitions. [2025-02-06 19:08:48,831 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 93 states and 107 transitions. [2025-02-06 19:08:48,833 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2025-02-06 19:08:48,834 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 93 states to 93 states and 107 transitions. [2025-02-06 19:08:48,834 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 56 [2025-02-06 19:08:48,834 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 56 [2025-02-06 19:08:48,834 INFO L73 IsDeterministic]: Start isDeterministic. Operand 93 states and 107 transitions. [2025-02-06 19:08:48,834 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:08:48,834 INFO L218 hiAutomatonCegarLoop]: Abstraction has 93 states and 107 transitions. [2025-02-06 19:08:48,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states and 107 transitions. [2025-02-06 19:08:48,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 65. [2025-02-06 19:08:48,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 58 states have (on average 1.1896551724137931) internal successors, (69), 57 states have internal predecessors, (69), 7 states have call successors, (7), 7 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:08:48,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 76 transitions. [2025-02-06 19:08:48,838 INFO L240 hiAutomatonCegarLoop]: Abstraction has 65 states and 76 transitions. [2025-02-06 19:08:48,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-02-06 19:08:48,839 INFO L432 stractBuchiCegarLoop]: Abstraction has 65 states and 76 transitions. [2025-02-06 19:08:48,839 INFO L338 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-02-06 19:08:48,839 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states and 76 transitions. [2025-02-06 19:08:48,839 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2025-02-06 19:08:48,839 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:08:48,840 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:08:48,840 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:08:48,840 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:08:48,840 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~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~i~0#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet7#1;main_~n~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;" "assume !(main_~n~0#1 < 1);call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~n~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~0#1 < main_~n~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume !(main_~i~0#1 < main_~n~0#1);havoc main_~i~0#1;" "call insertionSort(0, main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);"< "~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size;" "assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int#0(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i;" "assume true;#t~short3 := ~j~0 > 0;" "assume !#t~short3;" "assume !#t~short3;havoc #t~mem2;havoc #t~short3;" "call write~int#0(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i;" "call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);"< "~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size;" "assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int#0(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i;" "assume true;#t~short3 := ~j~0 > 0;" "assume #t~short3;call #t~mem2 := read~int#0(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short3 := #t~mem2 > ~temp~0;" "assume #t~short3;havoc #t~mem2;havoc #t~short3;call #t~mem4 := read~int#0(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);call write~int#0(#t~mem4, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~post5 := ~j~0;~j~0 := #t~post5 - 1;havoc #t~post5;" [2025-02-06 19:08:48,840 INFO L754 eck$LassoCheckResult]: Loop: "assume true;#t~short3 := ~j~0 > 0;" "assume !#t~short3;" "assume !#t~short3;havoc #t~mem2;havoc #t~short3;" "call write~int#0(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i;" "call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);"< "~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size;" "assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int#0(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i;" "assume true;#t~short3 := ~j~0 > 0;" "assume #t~short3;call #t~mem2 := read~int#0(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short3 := #t~mem2 > ~temp~0;" "assume #t~short3;havoc #t~mem2;havoc #t~short3;call #t~mem4 := read~int#0(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);call write~int#0(#t~mem4, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~post5 := ~j~0;~j~0 := #t~post5 - 1;havoc #t~post5;" [2025-02-06 19:08:48,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:08:48,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1869797004, now seen corresponding path program 3 times [2025-02-06 19:08:48,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:08:48,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906908287] [2025-02-06 19:08:48,841 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 19:08:48,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:08:48,847 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 2 equivalence classes. [2025-02-06 19:08:48,864 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 19:08:48,865 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-06 19:08:48,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:48,865 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:08:48,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-06 19:08:48,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 19:08:48,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:48,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:48,879 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:08:48,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:08:48,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1867743595, now seen corresponding path program 1 times [2025-02-06 19:08:48,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:08:48,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565432931] [2025-02-06 19:08:48,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:08:48,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:08:48,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 19:08:48,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 19:08:48,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:48,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:48,886 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:08:48,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 19:08:48,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 19:08:48,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:48,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:48,891 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:08:48,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:08:48,891 INFO L85 PathProgramCache]: Analyzing trace with hash -1109400010, now seen corresponding path program 4 times [2025-02-06 19:08:48,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:08:48,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354783937] [2025-02-06 19:08:48,892 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 19:08:48,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:08:48,898 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-02-06 19:08:48,910 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 19:08:48,910 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 19:08:48,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:08:49,135 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 19:08:49,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:08:49,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354783937] [2025-02-06 19:08:49,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354783937] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:08:49,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [357216939] [2025-02-06 19:08:49,136 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 19:08:49,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:08:49,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:49,138 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 19:08:49,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2025-02-06 19:08:49,188 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-02-06 19:08:49,219 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 19:08:49,220 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 19:08:49,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:08:49,221 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-02-06 19:08:49,222 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:08:49,426 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 23 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 19:08:49,426 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:08:49,537 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 23 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 19:08:49,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [357216939] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:08:49,538 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:08:49,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 24 [2025-02-06 19:08:49,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670496797] [2025-02-06 19:08:49,538 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:08:50,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:08:50,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-06 19:08:50,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=471, Unknown=0, NotChecked=0, Total=552 [2025-02-06 19:08:50,039 INFO L87 Difference]: Start difference. First operand 65 states and 76 transitions. cyclomatic complexity: 16 Second operand has 24 states, 19 states have (on average 2.473684210526316) internal successors, (47), 17 states have internal predecessors, (47), 5 states have call successors, (7), 7 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:08:50,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:08:50,185 INFO L93 Difference]: Finished difference Result 65 states and 72 transitions. [2025-02-06 19:08:50,185 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 72 transitions. [2025-02-06 19:08:50,185 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2025-02-06 19:08:50,186 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 39 states and 45 transitions. [2025-02-06 19:08:50,186 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2025-02-06 19:08:50,186 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2025-02-06 19:08:50,186 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 45 transitions. [2025-02-06 19:08:50,186 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:08:50,186 INFO L218 hiAutomatonCegarLoop]: Abstraction has 39 states and 45 transitions. [2025-02-06 19:08:50,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 45 transitions. [2025-02-06 19:08:50,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2025-02-06 19:08:50,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 34 states have internal predecessors, (41), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:08:50,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2025-02-06 19:08:50,188 INFO L240 hiAutomatonCegarLoop]: Abstraction has 39 states and 45 transitions. [2025-02-06 19:08:50,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 19:08:50,189 INFO L432 stractBuchiCegarLoop]: Abstraction has 39 states and 45 transitions. [2025-02-06 19:08:50,189 INFO L338 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2025-02-06 19:08:50,189 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 45 transitions. [2025-02-06 19:08:50,189 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2025-02-06 19:08:50,189 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:08:50,189 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:08:50,190 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:08:50,190 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:08:50,190 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~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~i~0#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet7#1;main_~n~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;" "assume !(main_~n~0#1 < 1);call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~n~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~0#1 < main_~n~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~0#1 < main_~n~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume !(main_~i~0#1 < main_~n~0#1);havoc main_~i~0#1;" "call insertionSort(0, main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);"< "~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size;" "assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int#0(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i;" "assume true;#t~short3 := ~j~0 > 0;" "assume !#t~short3;" "assume !#t~short3;havoc #t~mem2;havoc #t~short3;" "call write~int#0(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i;" "call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);"< "~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size;" "assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int#0(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i;" "assume true;#t~short3 := ~j~0 > 0;" "assume #t~short3;call #t~mem2 := read~int#0(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short3 := #t~mem2 > ~temp~0;" "assume #t~short3;havoc #t~mem2;havoc #t~short3;call #t~mem4 := read~int#0(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);call write~int#0(#t~mem4, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~post5 := ~j~0;~j~0 := #t~post5 - 1;havoc #t~post5;" "assume true;#t~short3 := ~j~0 > 0;" "assume !#t~short3;" [2025-02-06 19:08:50,190 INFO L754 eck$LassoCheckResult]: Loop: "assume !#t~short3;havoc #t~mem2;havoc #t~short3;" "call write~int#0(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i;" "call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);"< "~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size;" "assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int#0(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i;" "assume true;#t~short3 := ~j~0 > 0;" "assume !#t~short3;" [2025-02-06 19:08:50,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:08:50,190 INFO L85 PathProgramCache]: Analyzing trace with hash -758545714, now seen corresponding path program 5 times [2025-02-06 19:08:50,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:08:50,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159583557] [2025-02-06 19:08:50,190 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 19:08:50,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:08:50,197 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 3 equivalence classes. [2025-02-06 19:08:50,209 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 19:08:50,210 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-02-06 19:08:50,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:50,211 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:08:50,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 19:08:50,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 19:08:50,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:50,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:50,231 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:08:50,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:08:50,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1968876475, now seen corresponding path program 1 times [2025-02-06 19:08:50,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:08:50,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401030908] [2025-02-06 19:08:50,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:08:50,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:08:50,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 19:08:50,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 19:08:50,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:50,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:50,237 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:08:50,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 19:08:50,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 19:08:50,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:50,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:50,241 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:08:50,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:08:50,241 INFO L85 PathProgramCache]: Analyzing trace with hash 646699086, now seen corresponding path program 6 times [2025-02-06 19:08:50,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:08:50,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802720278] [2025-02-06 19:08:50,242 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 19:08:50,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:08:50,248 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 29 statements into 3 equivalence classes. [2025-02-06 19:08:50,262 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 19:08:50,262 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-02-06 19:08:50,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:08:50,434 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-06 19:08:50,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:08:50,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802720278] [2025-02-06 19:08:50,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802720278] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:08:50,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [933180365] [2025-02-06 19:08:50,435 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 19:08:50,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:08:50,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:50,439 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-02-06 19:08:50,441 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-02-06 19:08:50,486 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 29 statements into 3 equivalence classes. [2025-02-06 19:08:50,526 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 19:08:50,526 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-02-06 19:08:50,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:08:50,528 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-06 19:08:50,529 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:08:50,633 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-06 19:08:50,633 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:08:50,788 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-06 19:08:50,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [933180365] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:08:50,788 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:08:50,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 13] total 22 [2025-02-06 19:08:50,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956610756] [2025-02-06 19:08:50,788 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:08:51,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:08:51,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-06 19:08:51,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=444, Unknown=0, NotChecked=0, Total=506 [2025-02-06 19:08:51,181 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. cyclomatic complexity: 9 Second operand has 23 states, 19 states have (on average 2.473684210526316) internal successors, (47), 17 states have internal predecessors, (47), 6 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:08:51,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:08:51,449 INFO L93 Difference]: Finished difference Result 53 states and 59 transitions. [2025-02-06 19:08:51,449 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 59 transitions. [2025-02-06 19:08:51,449 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2025-02-06 19:08:51,450 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 53 states and 59 transitions. [2025-02-06 19:08:51,450 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2025-02-06 19:08:51,450 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2025-02-06 19:08:51,450 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 59 transitions. [2025-02-06 19:08:51,450 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:08:51,450 INFO L218 hiAutomatonCegarLoop]: Abstraction has 53 states and 59 transitions. [2025-02-06 19:08:51,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states and 59 transitions. [2025-02-06 19:08:51,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 44. [2025-02-06 19:08:51,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 40 states have (on average 1.15) internal successors, (46), 39 states have internal predecessors, (46), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:08:51,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2025-02-06 19:08:51,453 INFO L240 hiAutomatonCegarLoop]: Abstraction has 44 states and 50 transitions. [2025-02-06 19:08:51,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-06 19:08:51,454 INFO L432 stractBuchiCegarLoop]: Abstraction has 44 states and 50 transitions. [2025-02-06 19:08:51,454 INFO L338 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2025-02-06 19:08:51,454 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 50 transitions. [2025-02-06 19:08:51,454 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2025-02-06 19:08:51,454 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:08:51,454 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:08:51,455 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:08:51,455 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 2, 2, 1, 1, 1, 1, 1, 1] [2025-02-06 19:08:51,455 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~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~i~0#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet7#1;main_~n~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;" "assume !(main_~n~0#1 < 1);call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~n~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~0#1 < main_~n~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~0#1 < main_~n~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume !(main_~i~0#1 < main_~n~0#1);havoc main_~i~0#1;" "call insertionSort(0, main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);"< "~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size;" "assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int#0(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i;" "assume true;#t~short3 := ~j~0 > 0;" "assume !#t~short3;" "assume !#t~short3;havoc #t~mem2;havoc #t~short3;" "call write~int#0(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i;" "call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);"< "~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size;" "assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int#0(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i;" "assume true;#t~short3 := ~j~0 > 0;" "assume #t~short3;call #t~mem2 := read~int#0(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short3 := #t~mem2 > ~temp~0;" "assume #t~short3;havoc #t~mem2;havoc #t~short3;call #t~mem4 := read~int#0(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);call write~int#0(#t~mem4, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~post5 := ~j~0;~j~0 := #t~post5 - 1;havoc #t~post5;" "assume true;#t~short3 := ~j~0 > 0;" "assume !#t~short3;" [2025-02-06 19:08:51,455 INFO L754 eck$LassoCheckResult]: Loop: "assume !#t~short3;havoc #t~mem2;havoc #t~short3;" "call write~int#0(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i;" "call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);"< "~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size;" "assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int#0(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i;" "assume true;#t~short3 := ~j~0 > 0;" "assume #t~short3;call #t~mem2 := read~int#0(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short3 := #t~mem2 > ~temp~0;" "assume #t~short3;havoc #t~mem2;havoc #t~short3;call #t~mem4 := read~int#0(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);call write~int#0(#t~mem4, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~post5 := ~j~0;~j~0 := #t~post5 - 1;havoc #t~post5;" "assume true;#t~short3 := ~j~0 > 0;" "assume #t~short3;call #t~mem2 := read~int#0(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short3 := #t~mem2 > ~temp~0;" "assume #t~short3;havoc #t~mem2;havoc #t~short3;call #t~mem4 := read~int#0(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);call write~int#0(#t~mem4, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~post5 := ~j~0;~j~0 := #t~post5 - 1;havoc #t~post5;" "assume true;#t~short3 := ~j~0 > 0;" "assume !#t~short3;" [2025-02-06 19:08:51,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:08:51,455 INFO L85 PathProgramCache]: Analyzing trace with hash -758545714, now seen corresponding path program 7 times [2025-02-06 19:08:51,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:08:51,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001462642] [2025-02-06 19:08:51,456 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-06 19:08:51,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:08:51,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 19:08:51,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 19:08:51,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:51,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:51,471 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:08:51,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 19:08:51,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 19:08:51,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:51,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:51,483 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:08:51,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:08:51,483 INFO L85 PathProgramCache]: Analyzing trace with hash -847993413, now seen corresponding path program 2 times [2025-02-06 19:08:51,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:08:51,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065921574] [2025-02-06 19:08:51,483 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:08:51,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:08:51,487 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-02-06 19:08:51,492 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 19:08:51,492 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 19:08:51,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:51,492 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:08:51,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 19:08:51,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 19:08:51,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:51,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:51,503 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:08:51,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:08:51,503 INFO L85 PathProgramCache]: Analyzing trace with hash 138991630, now seen corresponding path program 8 times [2025-02-06 19:08:51,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:08:51,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186573030] [2025-02-06 19:08:51,508 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:08:51,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:08:51,516 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-02-06 19:08:51,534 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-02-06 19:08:51,535 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 19:08:51,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:51,535 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:08:51,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-06 19:08:51,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-06 19:08:51,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:51,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:51,567 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:08:53,466 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:08:53,467 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:08:53,467 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:08:53,467 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:08:53,467 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-06 19:08:53,467 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:53,467 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:08:53,467 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:08:53,467 INFO L132 ssoRankerPreferences]: Filename of dumped script: insertionSort_recursive.i_Iteration12_Lasso [2025-02-06 19:08:53,467 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:08:53,467 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:08:53,469 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:53,471 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:53,473 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:53,474 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:53,476 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:53,478 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:53,480 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:53,481 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:53,483 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:53,485 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:53,487 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:53,488 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:53,490 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:53,492 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:53,496 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:53,498 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:53,499 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:55,074 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:08:55,075 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-06 19:08:55,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:55,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:55,078 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-02-06 19:08:55,080 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-02-06 19:08:55,081 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-02-06 19:08:55,091 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:55,091 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:55,091 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:55,091 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:55,091 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:55,091 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:55,091 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:55,092 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:55,097 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-02-06 19:08:55,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:55,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:55,099 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-02-06 19:08:55,100 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-02-06 19:08:55,101 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-02-06 19:08:55,110 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:55,110 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:55,110 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:55,110 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:55,110 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:55,111 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:55,111 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:55,112 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:55,117 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-02-06 19:08:55,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:55,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:55,119 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-02-06 19:08:55,120 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-02-06 19:08:55,121 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-02-06 19:08:55,130 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:55,130 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:55,130 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:55,130 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:55,130 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:55,130 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:55,131 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:55,131 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:55,137 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2025-02-06 19:08:55,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:55,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:55,139 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-02-06 19:08:55,139 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-02-06 19:08:55,140 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-02-06 19:08:55,150 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:55,150 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:55,150 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:55,150 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:55,150 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:55,150 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:55,150 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:55,151 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:55,157 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-02-06 19:08:55,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:55,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:55,159 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-02-06 19:08:55,160 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-02-06 19:08:55,161 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-02-06 19:08:55,170 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:55,170 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:55,170 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:55,170 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:55,170 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:55,171 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:55,171 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:55,172 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:55,177 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2025-02-06 19:08:55,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:55,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:55,179 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-02-06 19:08:55,179 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-02-06 19:08:55,180 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-02-06 19:08:55,190 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:55,190 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:55,190 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:55,190 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:55,190 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:55,191 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:55,191 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:55,191 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:55,196 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-02-06 19:08:55,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:55,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:55,199 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-02-06 19:08:55,200 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-02-06 19:08:55,200 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-02-06 19:08:55,210 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:55,210 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:55,210 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:55,210 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:55,210 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:55,210 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:55,210 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:55,211 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:55,217 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2025-02-06 19:08:55,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:55,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:55,219 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-02-06 19:08:55,220 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-02-06 19:08:55,221 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-02-06 19:08:55,230 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:55,230 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:55,230 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:55,230 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:55,230 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:55,230 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:55,230 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:55,231 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:55,237 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2025-02-06 19:08:55,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:55,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:55,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-02-06 19:08:55,240 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-02-06 19:08:55,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-02-06 19:08:55,250 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:55,250 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:55,250 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:55,250 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:55,250 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:55,251 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:55,251 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:55,252 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:55,259 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-02-06 19:08:55,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:55,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:55,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-02-06 19:08:55,261 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-02-06 19:08:55,262 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-02-06 19:08:55,272 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:55,272 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:55,272 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:55,272 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:55,272 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:55,272 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:55,272 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:55,273 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:55,278 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-02-06 19:08:55,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:55,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:55,280 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-02-06 19:08:55,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-02-06 19:08:55,282 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-02-06 19:08:55,292 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:55,292 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:55,292 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:55,292 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:55,292 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:55,292 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:55,292 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:55,293 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:55,298 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-02-06 19:08:55,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:55,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:55,300 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-02-06 19:08:55,301 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-02-06 19:08:55,302 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-02-06 19:08:55,311 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:55,312 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:55,312 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:55,312 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:55,313 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:08:55,313 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:08:55,315 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:55,321 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2025-02-06 19:08:55,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:55,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:55,323 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-02-06 19:08:55,324 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-02-06 19:08:55,325 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-02-06 19:08:55,334 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:55,334 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:55,334 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:55,335 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:55,335 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:55,335 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:55,335 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:55,336 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:55,341 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-02-06 19:08:55,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:55,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:55,343 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-02-06 19:08:55,344 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-02-06 19:08:55,345 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-02-06 19:08:55,355 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:55,355 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:55,355 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:55,355 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:55,355 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:55,355 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:55,355 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:55,356 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:55,361 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2025-02-06 19:08:55,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:55,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:55,364 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-02-06 19:08:55,375 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-02-06 19:08:55,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-02-06 19:08:55,386 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:55,386 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:55,386 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:55,386 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:55,388 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:08:55,388 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:08:55,393 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:55,400 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-02-06 19:08:55,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:55,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:55,403 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-02-06 19:08:55,405 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-02-06 19:08:55,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-02-06 19:08:55,419 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:55,419 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:55,419 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:55,419 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:55,438 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:08:55,438 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:08:55,465 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-06 19:08:55,591 INFO L443 ModelExtractionUtils]: Simplification made 34 calls to the SMT solver. [2025-02-06 19:08:55,591 INFO L444 ModelExtractionUtils]: 6 out of 61 variables were initially zero. Simplification set additionally 47 variables to zero. [2025-02-06 19:08:55,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:55,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:55,593 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-02-06 19:08:55,594 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-02-06 19:08:55,595 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-06 19:08:55,605 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-02-06 19:08:55,606 INFO L474 LassoAnalysis]: Proved termination. [2025-02-06 19:08:55,606 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(insertionSort_~temp~0, v_rep(select (select old(#memory_int#0) insertionSort_#in~array.base) 4)_3) = 2*insertionSort_~temp~0 - 2*v_rep(select (select old(#memory_int#0) insertionSort_#in~array.base) 4)_3 + 1 Supporting invariants [-1*v_rep(select (select old(#memory_int#0) insertionSort_~array.base) (+ insertionSort_~array.offset (* insertionSort_~i 4)))_3 + 1*insertionSort_~temp~0 >= 0] [2025-02-06 19:08:55,612 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2025-02-06 19:08:55,660 INFO L156 tatePredicateManager]: 9 out of 12 supporting invariants were superfluous and have been removed [2025-02-06 19:08:55,667 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-02-06 19:08:55,667 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#0,GLOBAL]] [2025-02-06 19:08:55,667 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#0,GLOBAL]],[IdentifierExpression[#in~array!base,]]] [2025-02-06 19:08:55,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:08:55,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 19:08:55,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 19:08:55,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:55,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:08:55,733 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-02-06 19:08:55,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:08:55,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 19:08:55,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 19:08:55,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:55,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:08:55,926 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-02-06 19:08:55,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:08:55,946 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 19:08:55,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2025-02-06 19:08:56,385 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:08:56,385 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.7 stem predicates 12 loop predicates [2025-02-06 19:08:56,385 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 44 states and 50 transitions. cyclomatic complexity: 9 Second operand has 19 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 16 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:08:56,640 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-02-06 19:08:56,663 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 44 states and 50 transitions. cyclomatic complexity: 9. Second operand has 19 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 16 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 63 states and 69 transitions. Complement of second has 23 states. [2025-02-06 19:08:56,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 5 stem states 8 non-accepting loop states 1 accepting loop states [2025-02-06 19:08:56,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 16 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:08:56,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 22 transitions. [2025-02-06 19:08:56,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 22 transitions. Stem has 22 letters. Loop has 13 letters. [2025-02-06 19:08:56,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:08:56,665 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-06 19:08:56,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:08:56,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 19:08:56,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 19:08:56,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:56,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:08:56,714 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-02-06 19:08:56,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:08:56,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 19:08:56,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 19:08:56,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:56,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:08:56,880 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-02-06 19:08:56,881 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:08:56,892 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 19:08:56,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2025-02-06 19:08:57,276 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:08:57,277 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.7 stem predicates 12 loop predicates [2025-02-06 19:08:57,277 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 44 states and 50 transitions. cyclomatic complexity: 9 Second operand has 19 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 16 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:08:57,537 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 44 states and 50 transitions. cyclomatic complexity: 9. Second operand has 19 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 16 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 63 states and 69 transitions. Complement of second has 23 states. [2025-02-06 19:08:57,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 5 stem states 8 non-accepting loop states 1 accepting loop states [2025-02-06 19:08:57,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 16 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:08:57,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 22 transitions. [2025-02-06 19:08:57,539 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 22 transitions. Stem has 22 letters. Loop has 13 letters. [2025-02-06 19:08:57,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:08:57,540 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-06 19:08:57,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:08:57,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 19:08:57,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 19:08:57,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:57,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:08:57,589 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-02-06 19:08:57,590 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:08:57,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 19:08:57,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 19:08:57,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:57,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:08:57,753 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-02-06 19:08:57,754 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:08:57,764 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 19:08:57,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2025-02-06 19:08:58,157 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:08:58,157 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.7 stem predicates 12 loop predicates [2025-02-06 19:08:58,158 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 44 states and 50 transitions. cyclomatic complexity: 9 Second operand has 19 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 16 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:08:58,736 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 44 states and 50 transitions. cyclomatic complexity: 9. Second operand has 19 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 16 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 119 states and 138 transitions. Complement of second has 58 states. [2025-02-06 19:08:58,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 20 states 7 stem states 12 non-accepting loop states 1 accepting loop states [2025-02-06 19:08:58,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 16 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:08:58,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 51 transitions. [2025-02-06 19:08:58,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 51 transitions. Stem has 22 letters. Loop has 13 letters. [2025-02-06 19:08:58,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:08:58,738 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 51 transitions. Stem has 35 letters. Loop has 13 letters. [2025-02-06 19:08:58,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:08:58,738 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 51 transitions. Stem has 22 letters. Loop has 26 letters. [2025-02-06 19:08:58,739 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:08:58,739 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 119 states and 138 transitions. [2025-02-06 19:08:58,740 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 64 [2025-02-06 19:08:58,741 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 119 states to 101 states and 120 transitions. [2025-02-06 19:08:58,741 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 53 [2025-02-06 19:08:58,741 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 57 [2025-02-06 19:08:58,741 INFO L73 IsDeterministic]: Start isDeterministic. Operand 101 states and 120 transitions. [2025-02-06 19:08:58,741 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:08:58,742 INFO L218 hiAutomatonCegarLoop]: Abstraction has 101 states and 120 transitions. [2025-02-06 19:08:58,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states and 120 transitions. [2025-02-06 19:08:58,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 77. [2025-02-06 19:08:58,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 71 states have (on average 1.2253521126760563) internal successors, (87), 70 states have internal predecessors, (87), 6 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:08:58,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 93 transitions. [2025-02-06 19:08:58,746 INFO L240 hiAutomatonCegarLoop]: Abstraction has 77 states and 93 transitions. [2025-02-06 19:08:58,746 INFO L432 stractBuchiCegarLoop]: Abstraction has 77 states and 93 transitions. [2025-02-06 19:08:58,746 INFO L338 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2025-02-06 19:08:58,746 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 77 states and 93 transitions. [2025-02-06 19:08:58,747 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 46 [2025-02-06 19:08:58,747 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:08:58,747 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:08:58,747 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:08:58,748 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 3, 2, 2, 2, 2, 2, 2, 1] [2025-02-06 19:08:58,748 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~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~i~0#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet7#1;main_~n~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;" "assume !(main_~n~0#1 < 1);call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~n~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~0#1 < main_~n~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~0#1 < main_~n~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume !(main_~i~0#1 < main_~n~0#1);havoc main_~i~0#1;" "call insertionSort(0, main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);"< "~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size;" "assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int#0(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i;" "assume true;#t~short3 := ~j~0 > 0;" "assume !#t~short3;" "assume !#t~short3;havoc #t~mem2;havoc #t~short3;" "call write~int#0(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i;" "call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);"< "~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size;" "assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int#0(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i;" "assume true;#t~short3 := ~j~0 > 0;" "assume #t~short3;call #t~mem2 := read~int#0(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short3 := #t~mem2 > ~temp~0;" "assume #t~short3;havoc #t~mem2;havoc #t~short3;call #t~mem4 := read~int#0(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);call write~int#0(#t~mem4, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~post5 := ~j~0;~j~0 := #t~post5 - 1;havoc #t~post5;" "assume true;#t~short3 := ~j~0 > 0;" "assume !#t~short3;" [2025-02-06 19:08:58,748 INFO L754 eck$LassoCheckResult]: Loop: "assume !#t~short3;havoc #t~mem2;havoc #t~short3;" "call write~int#0(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i;" "call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);"< "~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size;" "assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int#0(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i;" "assume true;#t~short3 := ~j~0 > 0;" "assume #t~short3;call #t~mem2 := read~int#0(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short3 := #t~mem2 > ~temp~0;" "assume !#t~short3;havoc #t~mem2;havoc #t~short3;" "call write~int#0(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i;" "call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);"< "~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size;" "assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int#0(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i;" "assume true;#t~short3 := ~j~0 > 0;" "assume #t~short3;call #t~mem2 := read~int#0(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short3 := #t~mem2 > ~temp~0;" "assume #t~short3;havoc #t~mem2;havoc #t~short3;call #t~mem4 := read~int#0(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);call write~int#0(#t~mem4, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~post5 := ~j~0;~j~0 := #t~post5 - 1;havoc #t~post5;" "assume true;#t~short3 := ~j~0 > 0;" "assume #t~short3;call #t~mem2 := read~int#0(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short3 := #t~mem2 > ~temp~0;" "assume #t~short3;havoc #t~mem2;havoc #t~short3;call #t~mem4 := read~int#0(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);call write~int#0(#t~mem4, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~post5 := ~j~0;~j~0 := #t~post5 - 1;havoc #t~post5;" "assume true;#t~short3 := ~j~0 > 0;" "assume !#t~short3;" [2025-02-06 19:08:58,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:08:58,748 INFO L85 PathProgramCache]: Analyzing trace with hash -758545714, now seen corresponding path program 9 times [2025-02-06 19:08:58,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:08:58,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593843329] [2025-02-06 19:08:58,749 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 19:08:58,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:08:58,756 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 3 equivalence classes. [2025-02-06 19:08:58,767 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 19:08:58,768 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-06 19:08:58,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:58,768 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:08:58,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 19:08:58,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 19:08:58,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:58,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:58,782 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:08:58,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:08:58,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1186034014, now seen corresponding path program 3 times [2025-02-06 19:08:58,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:08:58,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354496302] [2025-02-06 19:08:58,783 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 19:08:58,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:08:58,788 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 3 equivalence classes. [2025-02-06 19:08:58,793 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 19:08:58,793 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-06 19:08:58,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:58,793 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:08:58,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-06 19:08:58,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 19:08:58,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:58,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:58,803 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:08:58,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:08:58,803 INFO L85 PathProgramCache]: Analyzing trace with hash 280996079, now seen corresponding path program 10 times [2025-02-06 19:08:58,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:08:58,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81258320] [2025-02-06 19:08:58,803 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 19:08:58,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:08:58,813 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 42 statements into 2 equivalence classes. [2025-02-06 19:08:58,824 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 41 of 42 statements. [2025-02-06 19:08:58,824 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-06 19:08:58,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:08:59,108 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 16 proven. 56 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-06 19:08:59,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:08:59,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81258320] [2025-02-06 19:08:59,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81258320] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:08:59,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [10699867] [2025-02-06 19:08:59,109 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 19:08:59,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:08:59,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:59,111 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 19:08:59,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Waiting until timeout for monitored process [2025-02-06 19:08:59,164 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 42 statements into 2 equivalence classes. [2025-02-06 19:08:59,188 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 41 of 42 statements. [2025-02-06 19:08:59,189 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-06 19:08:59,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:08:59,190 INFO L256 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-06 19:08:59,191 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:08:59,256 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 33 proven. 39 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-06 19:08:59,256 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:08:59,381 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 33 proven. 39 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-06 19:08:59,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [10699867] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:08:59,381 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:08:59,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 18 [2025-02-06 19:08:59,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895862172] [2025-02-06 19:08:59,382 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:09:00,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:09:00,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-06 19:09:00,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2025-02-06 19:09:00,755 INFO L87 Difference]: Start difference. First operand 77 states and 93 transitions. cyclomatic complexity: 19 Second operand has 19 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 14 states have internal predecessors, (41), 4 states have call successors, (5), 5 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:09:01,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:09:01,029 INFO L93 Difference]: Finished difference Result 153 states and 186 transitions. [2025-02-06 19:09:01,029 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 153 states and 186 transitions. [2025-02-06 19:09:01,030 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 45 [2025-02-06 19:09:01,031 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 153 states to 127 states and 149 transitions. [2025-02-06 19:09:01,031 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 88 [2025-02-06 19:09:01,031 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 101 [2025-02-06 19:09:01,031 INFO L73 IsDeterministic]: Start isDeterministic. Operand 127 states and 149 transitions. [2025-02-06 19:09:01,031 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:09:01,031 INFO L218 hiAutomatonCegarLoop]: Abstraction has 127 states and 149 transitions. [2025-02-06 19:09:01,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states and 149 transitions. [2025-02-06 19:09:01,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 69. [2025-02-06 19:09:01,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 63 states have (on average 1.1428571428571428) internal successors, (72), 62 states have internal predecessors, (72), 6 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:09:01,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 78 transitions. [2025-02-06 19:09:01,035 INFO L240 hiAutomatonCegarLoop]: Abstraction has 69 states and 78 transitions. [2025-02-06 19:09:01,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-02-06 19:09:01,038 INFO L432 stractBuchiCegarLoop]: Abstraction has 69 states and 78 transitions. [2025-02-06 19:09:01,038 INFO L338 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2025-02-06 19:09:01,038 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 69 states and 78 transitions. [2025-02-06 19:09:01,038 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2025-02-06 19:09:01,038 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:09:01,038 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:09:01,039 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:09:01,039 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:09:01,039 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~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~i~0#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet7#1;main_~n~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;" "assume !(main_~n~0#1 < 1);call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~n~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~0#1 < main_~n~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~0#1 < main_~n~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume !(main_~i~0#1 < main_~n~0#1);havoc main_~i~0#1;" "call insertionSort(0, main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);"< "~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size;" "assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int#0(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i;" "assume true;#t~short3 := ~j~0 > 0;" "assume !#t~short3;" "assume !#t~short3;havoc #t~mem2;havoc #t~short3;" "call write~int#0(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i;" "call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);"< "~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size;" "assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int#0(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i;" "assume true;#t~short3 := ~j~0 > 0;" "assume #t~short3;call #t~mem2 := read~int#0(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short3 := #t~mem2 > ~temp~0;" "assume #t~short3;havoc #t~mem2;havoc #t~short3;call #t~mem4 := read~int#0(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);call write~int#0(#t~mem4, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~post5 := ~j~0;~j~0 := #t~post5 - 1;havoc #t~post5;" "assume true;#t~short3 := ~j~0 > 0;" "assume !#t~short3;" "assume !#t~short3;havoc #t~mem2;havoc #t~short3;" [2025-02-06 19:09:01,039 INFO L754 eck$LassoCheckResult]: Loop: "call write~int#0(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i;" "call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);"< "~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size;" "assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int#0(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i;" "assume true;#t~short3 := ~j~0 > 0;" "assume #t~short3;call #t~mem2 := read~int#0(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short3 := #t~mem2 > ~temp~0;" "assume !#t~short3;havoc #t~mem2;havoc #t~short3;" [2025-02-06 19:09:01,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:09:01,039 INFO L85 PathProgramCache]: Analyzing trace with hash -2040080649, now seen corresponding path program 11 times [2025-02-06 19:09:01,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:09:01,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075158538] [2025-02-06 19:09:01,040 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 19:09:01,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:09:01,046 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 23 statements into 3 equivalence classes. [2025-02-06 19:09:01,052 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 19:09:01,052 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-02-06 19:09:01,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:09:01,052 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:09:01,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-06 19:09:01,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 19:09:01,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:09:01,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:09:01,062 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:09:01,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:09:01,063 INFO L85 PathProgramCache]: Analyzing trace with hash 36808974, now seen corresponding path program 6 times [2025-02-06 19:09:01,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:09:01,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214053257] [2025-02-06 19:09:01,063 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 19:09:01,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:09:01,067 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 7 statements into 1 equivalence classes. [2025-02-06 19:09:01,069 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 19:09:01,069 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-02-06 19:09:01,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:09:01,069 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:09:01,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 19:09:01,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 19:09:01,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:09:01,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:09:01,073 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:09:01,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:09:01,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1427164840, now seen corresponding path program 12 times [2025-02-06 19:09:01,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:09:01,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073650574] [2025-02-06 19:09:01,075 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 19:09:01,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:09:01,081 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 30 statements into 3 equivalence classes. [2025-02-06 19:09:01,094 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 19:09:01,095 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-02-06 19:09:01,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:09:01,095 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:09:01,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 19:09:01,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 19:09:01,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:09:01,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:09:01,109 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:09:02,701 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:09:02,702 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:09:02,702 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:09:02,702 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:09:02,702 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-06 19:09:02,702 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:09:02,702 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:09:02,702 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:09:02,702 INFO L132 ssoRankerPreferences]: Filename of dumped script: insertionSort_recursive.i_Iteration14_Lasso [2025-02-06 19:09:02,702 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:09:02,702 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:09:02,703 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:02,706 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:02,707 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:02,716 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:03,381 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:03,383 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:03,386 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:03,388 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:03,389 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:03,390 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:03,392 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:03,393 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:03,394 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:03,395 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:03,397 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:03,398 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:03,399 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:03,887 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:09:03,887 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-06 19:09:03,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:09:03,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:09:03,889 INFO L229 MonitoredProcess]: Starting monitored process 58 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-02-06 19:09:03,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2025-02-06 19:09:03,891 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-02-06 19:09:03,901 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:09:03,901 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:09:03,901 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:09:03,901 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:09:03,901 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:09:03,902 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:09:03,902 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:09:03,903 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:09:03,910 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Ended with exit code 0 [2025-02-06 19:09:03,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:09:03,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:09:03,912 INFO L229 MonitoredProcess]: Starting monitored process 59 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-02-06 19:09:03,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2025-02-06 19:09:03,914 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-02-06 19:09:03,924 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:09:03,924 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:09:03,924 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:09:03,924 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:09:03,924 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:09:03,924 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:09:03,924 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:09:03,925 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:09:03,932 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2025-02-06 19:09:03,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:09:03,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:09:03,935 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-02-06 19:09:03,936 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-02-06 19:09:03,936 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-02-06 19:09:03,947 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:09:03,948 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:09:03,948 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:09:03,948 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:09:03,963 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:09:03,963 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:09:03,983 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:09:03,991 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-02-06 19:09:03,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:09:03,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:09:03,994 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-02-06 19:09:03,996 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-02-06 19:09:03,998 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-02-06 19:09:04,010 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:09:04,010 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:09:04,010 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:09:04,010 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:09:04,011 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:09:04,012 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:09:04,016 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:09:04,023 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Ended with exit code 0 [2025-02-06 19:09:04,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:09:04,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:09:04,026 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-02-06 19:09:04,027 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-02-06 19:09:04,028 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-02-06 19:09:04,040 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:09:04,041 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:09:04,041 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:09:04,041 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:09:04,043 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:09:04,043 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:09:04,048 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:09:04,056 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-02-06 19:09:04,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:09:04,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:09:04,058 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-02-06 19:09:04,061 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-02-06 19:09:04,062 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-02-06 19:09:04,074 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:09:04,075 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:09:04,075 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:09:04,075 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:09:04,078 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:09:04,078 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:09:04,082 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:09:04,089 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Forceful destruction successful, exit code 0 [2025-02-06 19:09:04,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:09:04,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:09:04,092 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-02-06 19:09:04,094 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-02-06 19:09:04,096 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-02-06 19:09:04,108 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:09:04,108 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-02-06 19:09:04,108 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:09:04,108 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:09:04,111 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2025-02-06 19:09:04,112 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:09:04,118 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:09:04,127 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Forceful destruction successful, exit code 0 [2025-02-06 19:09:04,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:09:04,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:09:04,129 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-02-06 19:09:04,132 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-02-06 19:09:04,133 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-02-06 19:09:04,145 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:09:04,146 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:09:04,146 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:09:04,146 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:09:04,147 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:09:04,148 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:09:04,151 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:09:04,166 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-02-06 19:09:04,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:09:04,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:09:04,170 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-02-06 19:09:04,173 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-02-06 19:09:04,173 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-02-06 19:09:04,186 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:09:04,186 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:09:04,186 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:09:04,186 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:09:04,197 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:09:04,197 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:09:04,215 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-06 19:09:04,248 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2025-02-06 19:09:04,248 INFO L444 ModelExtractionUtils]: 11 out of 31 variables were initially zero. Simplification set additionally 17 variables to zero. [2025-02-06 19:09:04,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:09:04,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:09:04,251 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-02-06 19:09:04,255 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-02-06 19:09:04,256 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-06 19:09:04,269 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-02-06 19:09:04,269 INFO L474 LassoAnalysis]: Proved termination. [2025-02-06 19:09:04,269 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(insertionSort_~i, insertionSort_~size) = -1*insertionSort_~i + 1*insertionSort_~size Supporting invariants [] [2025-02-06 19:09:04,278 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Forceful destruction successful, exit code 0 [2025-02-06 19:09:04,291 INFO L156 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2025-02-06 19:09:04,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:09:04,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-06 19:09:04,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 19:09:04,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:09:04,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:09:04,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 19:09:04,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:09:04,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 19:09:04,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 19:09:04,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:09:04,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:09:04,379 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-06 19:09:04,379 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:09:04,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:09:04,414 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2025-02-06 19:09:04,415 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 69 states and 78 transitions. cyclomatic complexity: 12 Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:09:04,455 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 69 states and 78 transitions. cyclomatic complexity: 12. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 119 states and 137 transitions. Complement of second has 14 states. [2025-02-06 19:09:04,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2025-02-06 19:09:04,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:09:04,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2025-02-06 19:09:04,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 23 letters. Loop has 7 letters. [2025-02-06 19:09:04,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:09:04,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 30 letters. Loop has 7 letters. [2025-02-06 19:09:04,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:09:04,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 23 letters. Loop has 14 letters. [2025-02-06 19:09:04,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:09:04,460 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 119 states and 137 transitions. [2025-02-06 19:09:04,461 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-02-06 19:09:04,464 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 119 states to 83 states and 95 transitions. [2025-02-06 19:09:04,464 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2025-02-06 19:09:04,465 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2025-02-06 19:09:04,465 INFO L73 IsDeterministic]: Start isDeterministic. Operand 83 states and 95 transitions. [2025-02-06 19:09:04,466 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:09:04,466 INFO L218 hiAutomatonCegarLoop]: Abstraction has 83 states and 95 transitions. [2025-02-06 19:09:04,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states and 95 transitions. [2025-02-06 19:09:04,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 72. [2025-02-06 19:09:04,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 66 states have (on average 1.1818181818181819) internal successors, (78), 65 states have internal predecessors, (78), 6 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:09:04,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 84 transitions. [2025-02-06 19:09:04,470 INFO L240 hiAutomatonCegarLoop]: Abstraction has 72 states and 84 transitions. [2025-02-06 19:09:04,470 INFO L432 stractBuchiCegarLoop]: Abstraction has 72 states and 84 transitions. [2025-02-06 19:09:04,470 INFO L338 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2025-02-06 19:09:04,470 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 72 states and 84 transitions. [2025-02-06 19:09:04,473 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-02-06 19:09:04,473 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:09:04,473 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:09:04,474 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:09:04,474 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-06 19:09:04,474 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~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~i~0#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet7#1;main_~n~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;" "assume !(main_~n~0#1 < 1);call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~n~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~0#1 < main_~n~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~0#1 < main_~n~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume !(main_~i~0#1 < main_~n~0#1);havoc main_~i~0#1;" "call insertionSort(0, main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);"< "~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size;" "assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int#0(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i;" "assume true;#t~short3 := ~j~0 > 0;" "assume !#t~short3;" "assume !#t~short3;havoc #t~mem2;havoc #t~short3;" "call write~int#0(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i;" "call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);"< "~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size;" "assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int#0(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i;" "assume true;#t~short3 := ~j~0 > 0;" "assume #t~short3;call #t~mem2 := read~int#0(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short3 := #t~mem2 > ~temp~0;" "assume !#t~short3;havoc #t~mem2;havoc #t~short3;" "call write~int#0(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i;" "call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);"< "~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size;" "assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int#0(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i;" "assume true;#t~short3 := ~j~0 > 0;" [2025-02-06 19:09:04,474 INFO L754 eck$LassoCheckResult]: Loop: "assume #t~short3;call #t~mem2 := read~int#0(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short3 := #t~mem2 > ~temp~0;" "assume #t~short3;havoc #t~mem2;havoc #t~short3;call #t~mem4 := read~int#0(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);call write~int#0(#t~mem4, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~post5 := ~j~0;~j~0 := #t~post5 - 1;havoc #t~post5;" "assume true;#t~short3 := ~j~0 > 0;" [2025-02-06 19:09:04,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:09:04,474 INFO L85 PathProgramCache]: Analyzing trace with hash -2046906653, now seen corresponding path program 4 times [2025-02-06 19:09:04,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:09:04,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700272981] [2025-02-06 19:09:04,475 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 19:09:04,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:09:04,484 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-02-06 19:09:04,502 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-02-06 19:09:04,503 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 19:09:04,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:09:04,503 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:09:04,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-06 19:09:04,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-06 19:09:04,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:09:04,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:09:04,522 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:09:04,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:09:04,523 INFO L85 PathProgramCache]: Analyzing trace with hash 36713, now seen corresponding path program 3 times [2025-02-06 19:09:04,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:09:04,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914684060] [2025-02-06 19:09:04,524 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 19:09:04,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:09:04,526 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 3 statements into 1 equivalence classes. [2025-02-06 19:09:04,528 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:09:04,528 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-06 19:09:04,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:09:04,528 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:09:04,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 19:09:04,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:09:04,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:09:04,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:09:04,531 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:09:04,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:09:04,532 INFO L85 PathProgramCache]: Analyzing trace with hash 549576007, now seen corresponding path program 13 times [2025-02-06 19:09:04,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:09:04,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235132463] [2025-02-06 19:09:04,532 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-06 19:09:04,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:09:04,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-06 19:09:04,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-06 19:09:04,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:09:04,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:09:04,551 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:09:04,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-06 19:09:04,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-06 19:09:04,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:09:04,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:09:04,564 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:09:04,933 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-02-06 19:09:06,313 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:09:06,314 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:09:06,314 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:09:06,314 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:09:06,314 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-06 19:09:06,314 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:09:06,314 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:09:06,314 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:09:06,314 INFO L132 ssoRankerPreferences]: Filename of dumped script: insertionSort_recursive.i_Iteration15_Lasso [2025-02-06 19:09:06,314 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:09:06,314 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:09:06,315 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:06,317 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:06,319 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:06,321 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:06,323 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:06,324 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:06,326 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:06,328 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:06,330 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:06,331 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:06,739 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:06,743 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:06,745 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:06,747 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:06,749 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:06,751 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:06,753 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:06,755 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:07,155 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:09:07,156 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-06 19:09:07,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:09:07,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:09:07,158 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-02-06 19:09:07,159 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-02-06 19:09:07,160 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-02-06 19:09:07,170 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:09:07,170 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:09:07,170 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:09:07,170 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:09:07,170 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:09:07,170 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:09:07,170 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:09:07,171 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:09:07,178 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-02-06 19:09:07,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:09:07,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:09:07,180 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-02-06 19:09:07,181 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-02-06 19:09:07,182 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-02-06 19:09:07,193 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:09:07,193 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:09:07,193 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:09:07,193 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:09:07,194 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:09:07,194 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:09:07,197 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:09:07,204 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-02-06 19:09:07,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:09:07,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:09:07,206 INFO L229 MonitoredProcess]: Starting monitored process 70 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-02-06 19:09:07,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2025-02-06 19:09:07,208 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:09:07,218 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:09:07,218 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:09:07,218 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:09:07,218 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:09:07,218 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:09:07,219 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:09:07,219 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:09:07,220 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:09:07,226 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Ended with exit code 0 [2025-02-06 19:09:07,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:09:07,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:09:07,229 INFO L229 MonitoredProcess]: Starting monitored process 71 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-02-06 19:09:07,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2025-02-06 19:09:07,231 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:09:07,241 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:09:07,241 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:09:07,241 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:09:07,241 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:09:07,241 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:09:07,241 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:09:07,241 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:09:07,242 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:09:07,249 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Ended with exit code 0 [2025-02-06 19:09:07,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:09:07,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:09:07,251 INFO L229 MonitoredProcess]: Starting monitored process 72 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-02-06 19:09:07,253 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2025-02-06 19:09:07,253 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:09:07,264 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:09:07,264 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:09:07,264 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:09:07,264 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:09:07,264 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:09:07,264 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:09:07,264 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:09:07,265 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:09:07,272 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Ended with exit code 0 [2025-02-06 19:09:07,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:09:07,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:09:07,275 INFO L229 MonitoredProcess]: Starting monitored process 73 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-02-06 19:09:07,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2025-02-06 19:09:07,277 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-02-06 19:09:07,287 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:09:07,287 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:09:07,287 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:09:07,287 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:09:07,288 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:09:07,288 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:09:07,291 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:09:07,296 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Ended with exit code 0 [2025-02-06 19:09:07,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:09:07,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:09:07,298 INFO L229 MonitoredProcess]: Starting monitored process 74 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-02-06 19:09:07,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2025-02-06 19:09:07,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-02-06 19:09:07,310 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:09:07,310 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:09:07,310 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:09:07,310 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:09:07,310 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:09:07,311 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:09:07,311 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:09:07,312 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:09:07,317 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Ended with exit code 0 [2025-02-06 19:09:07,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:09:07,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:09:07,320 INFO L229 MonitoredProcess]: Starting monitored process 75 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-02-06 19:09:07,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Waiting until timeout for monitored process [2025-02-06 19:09:07,322 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-02-06 19:09:07,332 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:09:07,332 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:09:07,332 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:09:07,332 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:09:07,332 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:09:07,333 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:09:07,333 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:09:07,334 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:09:07,340 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Ended with exit code 0 [2025-02-06 19:09:07,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:09:07,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:09:07,342 INFO L229 MonitoredProcess]: Starting monitored process 76 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-02-06 19:09:07,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Waiting until timeout for monitored process [2025-02-06 19:09:07,344 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-02-06 19:09:07,354 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:09:07,354 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:09:07,354 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:09:07,354 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:09:07,354 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:09:07,354 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:09:07,354 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:09:07,355 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:09:07,361 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Ended with exit code 0 [2025-02-06 19:09:07,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:09:07,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:09:07,364 INFO L229 MonitoredProcess]: Starting monitored process 77 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-02-06 19:09:07,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Waiting until timeout for monitored process [2025-02-06 19:09:07,366 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:09:07,377 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:09:07,377 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:09:07,377 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:09:07,377 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:09:07,378 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:09:07,378 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:09:07,381 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:09:07,387 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Ended with exit code 0 [2025-02-06 19:09:07,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:09:07,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:09:07,389 INFO L229 MonitoredProcess]: Starting monitored process 78 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-02-06 19:09:07,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Waiting until timeout for monitored process [2025-02-06 19:09:07,391 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-02-06 19:09:07,401 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:09:07,401 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:09:07,401 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:09:07,401 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:09:07,402 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:09:07,402 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:09:07,405 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:09:07,410 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Ended with exit code 0 [2025-02-06 19:09:07,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:09:07,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:09:07,413 INFO L229 MonitoredProcess]: Starting monitored process 79 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-02-06 19:09:07,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Waiting until timeout for monitored process [2025-02-06 19:09:07,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-02-06 19:09:07,424 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:09:07,425 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-02-06 19:09:07,425 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:09:07,425 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:09:07,427 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2025-02-06 19:09:07,427 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:09:07,431 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:09:07,437 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Ended with exit code 0 [2025-02-06 19:09:07,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:09:07,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:09:07,439 INFO L229 MonitoredProcess]: Starting monitored process 80 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-02-06 19:09:07,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Waiting until timeout for monitored process [2025-02-06 19:09:07,441 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-02-06 19:09:07,451 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:09:07,451 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:09:07,451 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:09:07,451 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:09:07,453 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:09:07,453 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:09:07,456 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:09:07,462 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Ended with exit code 0 [2025-02-06 19:09:07,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:09:07,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:09:07,464 INFO L229 MonitoredProcess]: Starting monitored process 81 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-02-06 19:09:07,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Waiting until timeout for monitored process [2025-02-06 19:09:07,466 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-02-06 19:09:07,477 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:09:07,478 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:09:07,478 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:09:07,478 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:09:07,485 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:09:07,485 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:09:07,499 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:09:07,505 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Ended with exit code 0 [2025-02-06 19:09:07,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:09:07,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:09:07,507 INFO L229 MonitoredProcess]: Starting monitored process 82 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-02-06 19:09:07,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Waiting until timeout for monitored process [2025-02-06 19:09:07,509 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-02-06 19:09:07,519 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:09:07,520 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:09:07,520 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-02-06 19:09:07,520 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:09:07,531 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2025-02-06 19:09:07,531 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-02-06 19:09:07,571 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-06 19:09:07,614 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2025-02-06 19:09:07,615 INFO L444 ModelExtractionUtils]: 19 out of 36 variables were initially zero. Simplification set additionally 15 variables to zero. [2025-02-06 19:09:07,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:09:07,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:09:07,617 INFO L229 MonitoredProcess]: Starting monitored process 83 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-02-06 19:09:07,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Waiting until timeout for monitored process [2025-02-06 19:09:07,620 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-06 19:09:07,636 INFO L438 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2025-02-06 19:09:07,636 INFO L474 LassoAnalysis]: Proved termination. [2025-02-06 19:09:07,636 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(insertionSort_~j~0) = 1*insertionSort_~j~0 Supporting invariants [] [2025-02-06 19:09:07,645 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Ended with exit code 0 [2025-02-06 19:09:07,655 INFO L156 tatePredicateManager]: 6 out of 7 supporting invariants were superfluous and have been removed [2025-02-06 19:09:07,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:09:07,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-06 19:09:07,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-06 19:09:07,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:09:07,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:09:07,708 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-02-06 19:09:07,709 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:09:07,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 19:09:07,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:09:07,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:09:07,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:09:07,803 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 19:09:07,803 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:09:07,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:09:07,838 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 3 loop predicates [2025-02-06 19:09:07,838 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 72 states and 84 transitions. cyclomatic complexity: 16 Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:09:07,885 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 72 states and 84 transitions. cyclomatic complexity: 16. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 74 states and 86 transitions. Complement of second has 8 states. [2025-02-06 19:09:07,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 4 stem states 1 non-accepting loop states 1 accepting loop states [2025-02-06 19:09:07,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:09:07,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 11 transitions. [2025-02-06 19:09:07,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 11 transitions. Stem has 25 letters. Loop has 3 letters. [2025-02-06 19:09:07,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:09:07,887 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-06 19:09:07,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:09:07,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-06 19:09:07,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-06 19:09:07,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:09:07,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:09:07,947 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-02-06 19:09:07,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:09:08,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 19:09:08,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:09:08,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:09:08,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:09:08,030 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 19:09:08,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:09:08,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:09:08,064 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.4 stem predicates 3 loop predicates [2025-02-06 19:09:08,065 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 72 states and 84 transitions. cyclomatic complexity: 16 Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:09:08,108 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 72 states and 84 transitions. cyclomatic complexity: 16. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 74 states and 86 transitions. Complement of second has 8 states. [2025-02-06 19:09:08,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 4 stem states 1 non-accepting loop states 1 accepting loop states [2025-02-06 19:09:08,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:09:08,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 11 transitions. [2025-02-06 19:09:08,112 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 11 transitions. Stem has 25 letters. Loop has 3 letters. [2025-02-06 19:09:08,113 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:09:08,113 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-06 19:09:08,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:09:08,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-06 19:09:08,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-06 19:09:08,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:09:08,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:09:08,175 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-02-06 19:09:08,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:09:08,223 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Forceful destruction successful, exit code 0 [2025-02-06 19:09:08,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 19:09:08,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:09:08,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:09:08,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:09:08,265 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 19:09:08,265 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:09:08,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:09:08,295 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.4 stem predicates 3 loop predicates [2025-02-06 19:09:08,295 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 72 states and 84 transitions. cyclomatic complexity: 16 Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:09:08,348 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 72 states and 84 transitions. cyclomatic complexity: 16. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 116 states and 138 transitions. Complement of second has 16 states. [2025-02-06 19:09:08,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 4 stem states 2 non-accepting loop states 1 accepting loop states [2025-02-06 19:09:08,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:09:08,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 24 transitions. [2025-02-06 19:09:08,349 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 24 transitions. Stem has 25 letters. Loop has 3 letters. [2025-02-06 19:09:08,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:09:08,349 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 24 transitions. Stem has 28 letters. Loop has 3 letters. [2025-02-06 19:09:08,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:09:08,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 24 transitions. Stem has 25 letters. Loop has 6 letters. [2025-02-06 19:09:08,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:09:08,350 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 116 states and 138 transitions. [2025-02-06 19:09:08,351 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-06 19:09:08,351 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 116 states to 0 states and 0 transitions. [2025-02-06 19:09:08,351 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-02-06 19:09:08,351 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-02-06 19:09:08,351 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-02-06 19:09:08,351 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 19:09:08,351 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-06 19:09:08,351 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-06 19:09:08,351 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-06 19:09:08,351 INFO L338 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2025-02-06 19:09:08,351 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-02-06 19:09:08,351 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-06 19:09:08,351 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-02-06 19:09:08,358 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 06.02 07:09:08 BoogieIcfgContainer [2025-02-06 19:09:08,358 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-02-06 19:09:08,358 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 19:09:08,359 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 19:09:08,359 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 19:09:08,359 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 07:08:37" (3/4) ... [2025-02-06 19:09:08,361 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 19:09:08,361 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 19:09:08,362 INFO L158 Benchmark]: Toolchain (without parser) took 31590.58ms. Allocated memory was 142.6MB in the beginning and 394.3MB in the end (delta: 251.7MB). Free memory was 111.5MB in the beginning and 326.3MB in the end (delta: -214.7MB). Peak memory consumption was 36.4MB. Max. memory is 16.1GB. [2025-02-06 19:09:08,362 INFO L158 Benchmark]: CDTParser took 0.99ms. Allocated memory is still 201.3MB. Free memory is still 124.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 19:09:08,362 INFO L158 Benchmark]: CACSL2BoogieTranslator took 200.27ms. Allocated memory is still 142.6MB. Free memory was 111.1MB in the beginning and 100.5MB in the end (delta: 10.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 19:09:08,362 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.52ms. Allocated memory is still 142.6MB. Free memory was 100.5MB in the beginning and 99.6MB in the end (delta: 945.9kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 19:09:08,363 INFO L158 Benchmark]: Boogie Preprocessor took 37.69ms. Allocated memory is still 142.6MB. Free memory was 99.6MB in the beginning and 98.6MB in the end (delta: 949.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 19:09:08,363 INFO L158 Benchmark]: IcfgBuilder took 289.05ms. Allocated memory is still 142.6MB. Free memory was 98.6MB in the beginning and 86.2MB in the end (delta: 12.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 19:09:08,363 INFO L158 Benchmark]: BuchiAutomizer took 31027.05ms. Allocated memory was 142.6MB in the beginning and 394.3MB in the end (delta: 251.7MB). Free memory was 86.2MB in the beginning and 326.4MB in the end (delta: -240.2MB). Peak memory consumption was 11.2MB. Max. memory is 16.1GB. [2025-02-06 19:09:08,363 INFO L158 Benchmark]: Witness Printer took 2.74ms. Allocated memory is still 394.3MB. Free memory was 326.4MB in the beginning and 326.3MB in the end (delta: 78.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 19:09:08,364 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.99ms. Allocated memory is still 201.3MB. Free memory is still 124.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 200.27ms. Allocated memory is still 142.6MB. Free memory was 111.1MB in the beginning and 100.5MB in the end (delta: 10.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.52ms. Allocated memory is still 142.6MB. Free memory was 100.5MB in the beginning and 99.6MB in the end (delta: 945.9kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 37.69ms. Allocated memory is still 142.6MB. Free memory was 99.6MB in the beginning and 98.6MB in the end (delta: 949.6kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 289.05ms. Allocated memory is still 142.6MB. Free memory was 98.6MB in the beginning and 86.2MB in the end (delta: 12.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 31027.05ms. Allocated memory was 142.6MB in the beginning and 394.3MB in the end (delta: 251.7MB). Free memory was 86.2MB in the beginning and 326.4MB in the end (delta: -240.2MB). Peak memory consumption was 11.2MB. Max. memory is 16.1GB. * Witness Printer took 2.74ms. Allocated memory is still 394.3MB. Free memory was 326.4MB in the beginning and 326.3MB in the end (delta: 78.1kB). 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: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#0,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#0,GLOBAL]],[IdentifierExpression[#in~array!base,]]] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 15 terminating modules (9 trivial, 4 deterministic, 2 nondeterministic). One deterministic module has affine ranking function ((__int128) 18446744073709551609U + ((long) -4 * i)) and consists of 2 locations. One deterministic module has affine ranking function null and consists of 14 locations. One deterministic module has affine ranking function null and consists of 10 locations. One deterministic module has affine ranking function (size + ((long) -1 * i)) and consists of 6 locations. One nondeterministic module has affine ranking function null and consists of 20 locations. One nondeterministic module has affine ranking function j and consists of 7 locations. 9 modules have a trivial ranking function, the largest among these consists of 24 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 30.9s and 16 iterations. TraceHistogramMax:4. Analysis of lassos took 24.4s. Construction of modules took 0.8s. Büchi inclusion checks took 5.5s. Highest rank in rank-based complementation 3. Minimization of det autom 6. Minimization of nondet autom 9. Automata minimization 0.0s AutomataMinimizationTime, 14 MinimizatonAttempts, 155 StatesRemovedByMinimization, 9 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 [4, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/9 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 677 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 676 mSDsluCounter, 1052 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 836 mSDsCounter, 131 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1555 IncrementalHoareTripleChecker+Invalid, 1686 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 131 mSolverCounterUnsat, 216 mSDtfsCounter, 1555 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc6 concLT0 SILN0 SILU2 SILI1 SILT0 lasso6 LassoPreprocessingBenchmarks: Lassos: inital220 mio100 ax100 hnf100 lsp99 ukn87 mio100 lsp46 div138 bol101 ite100 ukn100 eq172 hnf91 smp83 dnf115 smp93 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 130ms VariablesStem: 8 VariablesLoop: 6 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 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-02-06 19:09:08,377 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Ended with exit code 0 [2025-02-06 19:09:08,577 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-02-06 19:09:08,777 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2025-02-06 19:09:08,977 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Ended with exit code 0 [2025-02-06 19:09:09,177 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-06 19:09:09,380 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