./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-memsafety/array02-alloca-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- 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/array-memsafety/array02-alloca-2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6376f52a263bde0c709cb35a0d040626ae764c5527f8161f54a95df7802768d2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 19:10:36,092 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 19:10:36,131 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2025-02-06 19:10:36,134 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 19:10:36,134 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 19:10:36,134 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-02-06 19:10:36,147 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 19:10:36,148 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 19:10:36,148 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 19:10:36,148 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 19:10:36,148 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 19:10:36,148 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 19:10:36,148 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 19:10:36,148 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 19:10:36,148 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-02-06 19:10:36,148 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-02-06 19:10:36,148 INFO L153 SettingsManager]: * Use old map elimination=false [2025-02-06 19:10:36,148 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-02-06 19:10:36,149 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-02-06 19:10:36,149 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-02-06 19:10:36,149 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 19:10:36,149 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-02-06 19:10:36,149 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 19:10:36,149 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 19:10:36,149 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 19:10:36,149 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 19:10:36,149 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-02-06 19:10:36,149 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-02-06 19:10:36,149 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-02-06 19:10:36,149 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 19:10:36,149 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 19:10:36,149 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 19:10:36,149 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-02-06 19:10:36,149 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 19:10:36,149 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 19:10:36,149 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 19:10:36,150 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 19:10:36,150 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 19:10:36,150 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 19:10:36,150 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-02-06 19:10:36,150 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6376f52a263bde0c709cb35a0d040626ae764c5527f8161f54a95df7802768d2 [2025-02-06 19:10:36,311 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 19:10:36,316 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 19:10:36,317 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 19:10:36,318 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 19:10:36,318 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 19:10:36,319 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/array02-alloca-2.i [2025-02-06 19:10:37,383 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/84dfa06ba/d251346793f147378d583fa5b884de43/FLAG5c2f97b47 [2025-02-06 19:10:37,643 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 19:10:37,644 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-memsafety/array02-alloca-2.i [2025-02-06 19:10:37,652 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/84dfa06ba/d251346793f147378d583fa5b884de43/FLAG5c2f97b47 [2025-02-06 19:10:37,960 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/84dfa06ba/d251346793f147378d583fa5b884de43 [2025-02-06 19:10:37,962 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 19:10:37,963 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 19:10:37,964 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 19:10:37,964 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 19:10:37,967 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 19:10:37,968 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 07:10:37" (1/1) ... [2025-02-06 19:10:37,969 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65610f99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:10:37, skipping insertion in model container [2025-02-06 19:10:37,969 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 07:10:37" (1/1) ... [2025-02-06 19:10:37,989 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 19:10:38,218 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 19:10:38,227 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 19:10:38,251 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 19:10:38,267 INFO L204 MainTranslator]: Completed translation [2025-02-06 19:10:38,268 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:10:38 WrapperNode [2025-02-06 19:10:38,268 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 19:10:38,269 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 19:10:38,269 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 19:10:38,269 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 19:10:38,273 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:10:38" (1/1) ... [2025-02-06 19:10:38,283 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:10:38" (1/1) ... [2025-02-06 19:10:38,298 INFO L138 Inliner]: procedures = 116, calls = 12, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 61 [2025-02-06 19:10:38,299 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 19:10:38,300 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 19:10:38,300 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 19:10:38,301 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 19:10:38,305 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:10:38" (1/1) ... [2025-02-06 19:10:38,306 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:10:38" (1/1) ... [2025-02-06 19:10:38,307 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:10:38" (1/1) ... [2025-02-06 19:10:38,319 INFO L175 MemorySlicer]: Split 7 memory accesses to 1 slices as follows [7]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 3 writes are split as follows [3]. [2025-02-06 19:10:38,320 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:10:38" (1/1) ... [2025-02-06 19:10:38,320 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:10:38" (1/1) ... [2025-02-06 19:10:38,327 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:10:38" (1/1) ... [2025-02-06 19:10:38,327 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:10:38" (1/1) ... [2025-02-06 19:10:38,328 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:10:38" (1/1) ... [2025-02-06 19:10:38,328 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:10:38" (1/1) ... [2025-02-06 19:10:38,331 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 19:10:38,332 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 19:10:38,332 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 19:10:38,332 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 19:10:38,333 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:10:38" (1/1) ... [2025-02-06 19:10:38,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:38,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:38,362 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:10:38,367 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:10:38,381 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 19:10:38,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 19:10:38,382 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 19:10:38,382 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 19:10:38,382 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 19:10:38,382 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 19:10:38,454 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 19:10:38,456 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 19:10:38,551 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2025-02-06 19:10:38,551 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 19:10:38,556 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 19:10:38,556 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 19:10:38,556 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 07:10:38 BoogieIcfgContainer [2025-02-06 19:10:38,557 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 19:10:38,557 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-02-06 19:10:38,557 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-02-06 19:10:38,561 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-02-06 19:10:38,561 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-06 19:10:38,561 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 06.02 07:10:37" (1/3) ... [2025-02-06 19:10:38,562 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4aaef007 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.02 07:10:38, skipping insertion in model container [2025-02-06 19:10:38,562 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-06 19:10:38,562 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:10:38" (2/3) ... [2025-02-06 19:10:38,563 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4aaef007 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.02 07:10:38, skipping insertion in model container [2025-02-06 19:10:38,563 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-06 19:10:38,563 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 07:10:38" (3/3) ... [2025-02-06 19:10:38,564 INFO L363 chiAutomizerObserver]: Analyzing ICFG array02-alloca-2.i [2025-02-06 19:10:38,602 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-02-06 19:10:38,602 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-02-06 19:10:38,602 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-02-06 19:10:38,602 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-02-06 19:10:38,602 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-02-06 19:10:38,602 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-02-06 19:10:38,602 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-02-06 19:10:38,602 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-02-06 19:10:38,605 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 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:10:38,618 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2025-02-06 19:10:38,618 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:10:38,618 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:10:38,621 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-02-06 19:10:38,621 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-02-06 19:10:38,621 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-02-06 19:10:38,622 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 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:10:38,623 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2025-02-06 19:10:38,623 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:10:38,623 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:10:38,623 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-02-06 19:10:38,623 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-02-06 19:10:38,628 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~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet13#1, main_#t~post14#1, main_~k~0#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet11#1;main_~array_size~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;main_~k~0#1 := 0;" [2025-02-06 19:10:38,629 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" [2025-02-06 19:10:38,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:10:38,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1630526, now seen corresponding path program 1 times [2025-02-06 19:10:38,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:10:38,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489306111] [2025-02-06 19:10:38,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:10:38,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:10:38,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 19:10:38,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 19:10:38,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:38,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:38,712 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:10:38,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 19:10:38,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 19:10:38,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:38,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:38,738 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:10:38,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:10:38,740 INFO L85 PathProgramCache]: Analyzing trace with hash 49, now seen corresponding path program 1 times [2025-02-06 19:10:38,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:10:38,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999340042] [2025-02-06 19:10:38,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:10:38,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:10:38,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-06 19:10:38,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-06 19:10:38,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:38,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:38,754 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:10:38,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-06 19:10:38,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-06 19:10:38,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:38,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:38,759 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:10:38,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:10:38,761 INFO L85 PathProgramCache]: Analyzing trace with hash 50546324, now seen corresponding path program 1 times [2025-02-06 19:10:38,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:10:38,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682530464] [2025-02-06 19:10:38,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:10:38,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:10:38,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 19:10:38,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 19:10:38,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:38,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:38,776 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:10:38,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 19:10:38,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 19:10:38,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:38,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:38,785 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:10:39,020 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:10:39,021 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:10:39,023 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:10:39,023 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:10:39,023 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-06 19:10:39,023 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:39,023 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:10:39,023 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:10:39,023 INFO L132 ssoRankerPreferences]: Filename of dumped script: array02-alloca-2.i_Iteration1_Lasso [2025-02-06 19:10:39,024 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:10:39,024 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:10:39,037 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:39,203 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:39,206 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:39,208 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:39,210 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:39,212 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:39,216 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:39,218 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:39,222 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:39,449 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:10:39,452 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-06 19:10:39,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:39,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:39,455 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:10:39,456 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:10:39,457 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:10:39,468 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:39,469 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:39,469 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:39,469 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:39,474 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:10:39,474 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:10:39,480 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:39,489 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2025-02-06 19:10:39,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:39,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:39,495 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:10:39,496 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:10:39,497 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:10:39,507 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:39,507 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:39,508 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:39,508 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:39,508 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:39,508 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:39,508 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:39,510 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:39,518 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:10:39,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:39,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:39,522 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:10:39,523 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:10:39,523 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:10:39,533 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:39,533 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:39,533 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:39,533 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:39,537 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:10:39,537 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:10:39,541 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:39,550 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:10:39,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:39,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:39,555 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:10:39,556 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:10:39,556 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:10:39,566 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:39,567 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:39,567 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:39,567 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:39,570 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:10:39,570 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:10:39,574 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:39,580 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-02-06 19:10:39,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:39,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:39,582 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:10:39,584 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:10:39,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:10:39,595 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:39,595 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:39,595 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:39,595 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:39,600 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:10:39,600 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:10:39,609 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-06 19:10:39,623 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-02-06 19:10:39,625 INFO L444 ModelExtractionUtils]: 1 out of 19 variables were initially zero. Simplification set additionally 15 variables to zero. [2025-02-06 19:10:39,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:39,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:39,628 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:10:39,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-02-06 19:10:39,637 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-06 19:10:39,649 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-02-06 19:10:39,650 INFO L474 LassoAnalysis]: Proved termination. [2025-02-06 19:10:39,650 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~array_size~0#1, ULTIMATE.start_main_~k~0#1) = 1*ULTIMATE.start_main_~array_size~0#1 - 1*ULTIMATE.start_main_~k~0#1 Supporting invariants [] [2025-02-06 19:10:39,657 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:10:39,665 INFO L156 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2025-02-06 19:10:39,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:10:39,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 19:10:39,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 19:10:39,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:39,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:10:39,703 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 19:10:39,704 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:10:39,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-06 19:10:39,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-06 19:10:39,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:39,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:10:39,723 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 19:10:39,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:10:39,725 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:10:39,750 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:10:39,751 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:10:39,776 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 17 states and 25 transitions. Complement of second has 3 states. [2025-02-06 19:10:39,778 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:10:39,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:10:39,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 6 transitions. [2025-02-06 19:10:39,787 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 6 transitions. Stem has 4 letters. Loop has 1 letters. [2025-02-06 19:10:39,787 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:10:39,788 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 6 transitions. Stem has 5 letters. Loop has 1 letters. [2025-02-06 19:10:39,788 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:10:39,788 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 6 transitions. Stem has 4 letters. Loop has 2 letters. [2025-02-06 19:10:39,788 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:10:39,788 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 25 transitions. [2025-02-06 19:10:39,789 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-02-06 19:10:39,790 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 13 states and 20 transitions. [2025-02-06 19:10:39,791 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2025-02-06 19:10:39,791 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2025-02-06 19:10:39,791 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 20 transitions. [2025-02-06 19:10:39,792 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 19:10:39,792 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13 states and 20 transitions. [2025-02-06 19:10:39,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 20 transitions. [2025-02-06 19:10:39,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2025-02-06 19:10:39,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 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:10:39,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 19 transitions. [2025-02-06 19:10:39,807 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 19 transitions. [2025-02-06 19:10:39,807 INFO L432 stractBuchiCegarLoop]: Abstraction has 12 states and 19 transitions. [2025-02-06 19:10:39,807 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-02-06 19:10:39,807 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 19 transitions. [2025-02-06 19:10:39,807 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-02-06 19:10:39,807 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:10:39,807 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:10:39,808 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-02-06 19:10:39,808 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-02-06 19:10:39,808 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~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet13#1, main_#t~post14#1, main_~k~0#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet11#1;main_~array_size~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;main_~k~0#1 := 0;" "assume !(main_~k~0#1 < main_~array_size~0#1);havoc main_~k~0#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~post8#1, test_fun_#t~post9#1, test_fun_#t~post10#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~pos~0#1, test_fun_~neg~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~pos~0#1 := 0;test_fun_~neg~0#1 := 0;test_fun_~i~0#1 := 0;" [2025-02-06 19:10:39,808 INFO L754 eck$LassoCheckResult]: Loop: "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume !true;" "assume !true;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" [2025-02-06 19:10:39,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:10:39,808 INFO L85 PathProgramCache]: Analyzing trace with hash 50546323, now seen corresponding path program 1 times [2025-02-06 19:10:39,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:10:39,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056309534] [2025-02-06 19:10:39,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:10:39,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:10:39,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 19:10:39,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 19:10:39,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:39,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:10:39,900 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:10:39,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:10:39,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056309534] [2025-02-06 19:10:39,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056309534] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 19:10:39,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 19:10:39,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 19:10:39,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88378277] [2025-02-06 19:10:39,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 19:10:39,902 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-06 19:10:39,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:10:39,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1384090, now seen corresponding path program 1 times [2025-02-06 19:10:39,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:10:39,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866728327] [2025-02-06 19:10:39,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:10:39,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:10:39,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 19:10:39,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 19:10:39,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:39,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:10:39,908 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:10:39,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:10:39,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866728327] [2025-02-06 19:10:39,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866728327] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 19:10:39,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 19:10:39,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 19:10:39,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021504554] [2025-02-06 19:10:39,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 19:10:39,908 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-06 19:10:39,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:10:39,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 19:10:39,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 19:10:39,911 INFO L87 Difference]: Start difference. First operand 12 states and 19 transitions. cyclomatic complexity: 9 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:10:39,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:10:39,913 INFO L93 Difference]: Finished difference Result 12 states and 17 transitions. [2025-02-06 19:10:39,913 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 17 transitions. [2025-02-06 19:10:39,914 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-02-06 19:10:39,914 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 12 states and 17 transitions. [2025-02-06 19:10:39,914 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2025-02-06 19:10:39,914 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2025-02-06 19:10:39,914 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 17 transitions. [2025-02-06 19:10:39,914 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 19:10:39,914 INFO L218 hiAutomatonCegarLoop]: Abstraction has 12 states and 17 transitions. [2025-02-06 19:10:39,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 17 transitions. [2025-02-06 19:10:39,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2025-02-06 19:10:39,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:10:39,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 17 transitions. [2025-02-06 19:10:39,915 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 17 transitions. [2025-02-06 19:10:39,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 19:10:39,916 INFO L432 stractBuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2025-02-06 19:10:39,916 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-02-06 19:10:39,916 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 17 transitions. [2025-02-06 19:10:39,916 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-02-06 19:10:39,916 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:10:39,916 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:10:39,917 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-02-06 19:10:39,917 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-02-06 19:10:39,917 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~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet13#1, main_#t~post14#1, main_~k~0#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet11#1;main_~array_size~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;main_~k~0#1 := 0;" "assume !(main_~k~0#1 < main_~array_size~0#1);havoc main_~k~0#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~post8#1, test_fun_#t~post9#1, test_fun_#t~post10#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~pos~0#1, test_fun_~neg~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~pos~0#1 := 0;test_fun_~neg~0#1 := 0;test_fun_~i~0#1 := 0;" [2025-02-06 19:10:39,917 INFO L754 eck$LassoCheckResult]: Loop: "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" [2025-02-06 19:10:39,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:10:39,917 INFO L85 PathProgramCache]: Analyzing trace with hash 50546323, now seen corresponding path program 2 times [2025-02-06 19:10:39,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:10:39,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750831243] [2025-02-06 19:10:39,918 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:10:39,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:10:39,922 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5 statements into 1 equivalence classes. [2025-02-06 19:10:39,925 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 19:10:39,925 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 19:10:39,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:10:39,953 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:10:39,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:10:39,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750831243] [2025-02-06 19:10:39,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750831243] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 19:10:39,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 19:10:39,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 19:10:39,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090574138] [2025-02-06 19:10:39,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 19:10:39,954 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-06 19:10:39,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:10:39,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1329281304, now seen corresponding path program 1 times [2025-02-06 19:10:39,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:10:39,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105726452] [2025-02-06 19:10:39,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:10:39,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:10:39,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 19:10:39,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 19:10:39,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:39,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:39,961 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:10:39,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 19:10:39,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 19:10:39,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:39,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:39,965 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:10:40,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:10:40,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 19:10:40,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 19:10:40,018 INFO L87 Difference]: Start difference. First operand 12 states and 17 transitions. cyclomatic complexity: 7 Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:10:40,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:10:40,031 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2025-02-06 19:10:40,031 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 16 transitions. [2025-02-06 19:10:40,031 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-02-06 19:10:40,031 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 12 states and 16 transitions. [2025-02-06 19:10:40,031 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2025-02-06 19:10:40,031 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2025-02-06 19:10:40,031 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 16 transitions. [2025-02-06 19:10:40,031 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 19:10:40,031 INFO L218 hiAutomatonCegarLoop]: Abstraction has 12 states and 16 transitions. [2025-02-06 19:10:40,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 16 transitions. [2025-02-06 19:10:40,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2025-02-06 19:10:40,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:10:40,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2025-02-06 19:10:40,032 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 16 transitions. [2025-02-06 19:10:40,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 19:10:40,035 INFO L432 stractBuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2025-02-06 19:10:40,036 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-02-06 19:10:40,036 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2025-02-06 19:10:40,036 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2025-02-06 19:10:40,037 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:10:40,037 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:10:40,037 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-02-06 19:10:40,037 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-02-06 19:10:40,038 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~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet13#1, main_#t~post14#1, main_~k~0#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet11#1;main_~array_size~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;main_~k~0#1 := 0;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume !(main_~k~0#1 < main_~array_size~0#1);havoc main_~k~0#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~post8#1, test_fun_#t~post9#1, test_fun_#t~post10#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~pos~0#1, test_fun_~neg~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~pos~0#1 := 0;test_fun_~neg~0#1 := 0;test_fun_~i~0#1 := 0;" [2025-02-06 19:10:40,038 INFO L754 eck$LassoCheckResult]: Loop: "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" [2025-02-06 19:10:40,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:10:40,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1566936061, now seen corresponding path program 1 times [2025-02-06 19:10:40,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:10:40,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720105716] [2025-02-06 19:10:40,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:10:40,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:10:40,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 19:10:40,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 19:10:40,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:40,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:40,057 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:10:40,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 19:10:40,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 19:10:40,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:40,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:40,072 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:10:40,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:10:40,073 INFO L85 PathProgramCache]: Analyzing trace with hash 1329281304, now seen corresponding path program 2 times [2025-02-06 19:10:40,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:10:40,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850445755] [2025-02-06 19:10:40,073 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:10:40,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:10:40,075 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 6 statements into 1 equivalence classes. [2025-02-06 19:10:40,081 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 19:10:40,082 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 19:10:40,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:40,082 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:10:40,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 19:10:40,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 19:10:40,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:40,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:40,086 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:10:40,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:10:40,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1638848532, now seen corresponding path program 1 times [2025-02-06 19:10:40,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:10:40,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538152955] [2025-02-06 19:10:40,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:10:40,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:10:40,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 19:10:40,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 19:10:40,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:40,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:40,097 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:10:40,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 19:10:40,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 19:10:40,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:40,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:40,133 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:10:40,142 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-02-06 19:10:40,339 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:10:40,339 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:10:40,339 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:10:40,339 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:10:40,339 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-06 19:10:40,339 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:40,340 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:10:40,340 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:10:40,340 INFO L132 ssoRankerPreferences]: Filename of dumped script: array02-alloca-2.i_Iteration4_Lasso [2025-02-06 19:10:40,340 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:10:40,340 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:10:40,341 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:40,343 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:40,345 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:40,346 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:40,348 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:40,349 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:40,351 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:40,353 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:40,354 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:40,356 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:40,358 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:40,359 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:40,432 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:40,434 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:40,436 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:40,438 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:40,439 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:40,441 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:40,443 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:40,444 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:40,446 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:40,447 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:40,449 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:40,451 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:40,604 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:10:40,604 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-06 19:10:40,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:40,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:40,607 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:10:40,609 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:10:40,609 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:10:40,619 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:40,619 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:40,619 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:40,620 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:40,620 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:40,620 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:40,620 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:40,621 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:40,627 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:10:40,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:40,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:40,629 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:10:40,630 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:10:40,630 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:10:40,640 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:40,640 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:40,640 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:40,640 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:40,640 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:40,642 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:40,642 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:40,643 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:40,649 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-02-06 19:10:40,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:40,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:40,652 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:10:40,652 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:10:40,654 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:10:40,666 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:40,667 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:40,667 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:40,667 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:40,668 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:40,668 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:40,668 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:40,669 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:40,675 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:10:40,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:40,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:40,676 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:10:40,677 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:10:40,678 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:10:40,687 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:40,688 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:40,688 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:40,688 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:40,688 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:40,688 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:40,688 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:40,689 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:40,694 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-02-06 19:10:40,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:40,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:40,696 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:10:40,697 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:10:40,698 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:10:40,708 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:40,709 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:40,709 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:40,709 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:40,709 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:40,710 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:40,710 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:40,712 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:40,717 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-02-06 19:10:40,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:40,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:40,721 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:10:40,723 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:10:40,723 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:10:40,733 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:40,733 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:40,733 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:40,733 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:40,733 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:40,733 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:40,733 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:40,734 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:40,740 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-02-06 19:10:40,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:40,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:40,743 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:10:40,743 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:10:40,744 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:10:40,754 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:40,754 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:40,754 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:40,754 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:40,759 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:10:40,759 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:10:40,764 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:40,770 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:10:40,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:40,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:40,772 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:10:40,773 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:10:40,774 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:10:40,784 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:40,784 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:40,784 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:40,784 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:40,784 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:40,785 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:40,785 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:40,786 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:40,792 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:10:40,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:40,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:40,797 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:10:40,800 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:10:40,800 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:10:40,809 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:40,809 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:40,809 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:40,809 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:40,809 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:40,810 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:40,810 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:40,811 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:40,816 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2025-02-06 19:10:40,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:40,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:40,819 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:10:40,830 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:10:40,831 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:10:40,840 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:40,840 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:40,844 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:40,845 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:40,845 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:40,846 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:40,846 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:40,847 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:40,852 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-02-06 19:10:40,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:40,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:40,854 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:10:40,855 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:10:40,857 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:10:40,866 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:40,866 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:40,866 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:40,866 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:40,866 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:40,867 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:40,867 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:40,871 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:40,884 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:10:40,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:40,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:40,889 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:10:40,890 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:10:40,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:10:40,902 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:40,902 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:40,902 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:40,902 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:40,906 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:10:40,906 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:10:40,912 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-06 19:10:40,928 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2025-02-06 19:10:40,928 INFO L444 ModelExtractionUtils]: 6 out of 19 variables were initially zero. Simplification set additionally 10 variables to zero. [2025-02-06 19:10:40,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:40,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:40,930 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:10:40,931 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:10:40,932 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-06 19:10:40,946 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-02-06 19:10:40,946 INFO L474 LassoAnalysis]: Proved termination. [2025-02-06 19:10:40,946 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_test_fun_~i~0#1, ULTIMATE.start_test_fun_~N#1) = -1*ULTIMATE.start_test_fun_~i~0#1 + 1*ULTIMATE.start_test_fun_~N#1 Supporting invariants [] [2025-02-06 19:10:40,955 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:10:40,960 INFO L156 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2025-02-06 19:10:40,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:10:40,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 19:10:40,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 19:10:40,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:40,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:10:40,979 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 19:10:40,979 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:10:40,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 19:10:40,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 19:10:40,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:40,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:10:40,988 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 19:10:40,989 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:10:41,010 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:10:41,010 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-02-06 19:10:41,010 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 6 Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:10:41,029 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 6. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 19 states and 26 transitions. Complement of second has 4 states. [2025-02-06 19:10:41,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-02-06 19:10:41,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:10:41,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2025-02-06 19:10:41,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 6 letters. Loop has 6 letters. [2025-02-06 19:10:41,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:10:41,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 12 letters. Loop has 6 letters. [2025-02-06 19:10:41,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:10:41,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 6 letters. Loop has 12 letters. [2025-02-06 19:10:41,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:10:41,030 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 26 transitions. [2025-02-06 19:10:41,031 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2025-02-06 19:10:41,031 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 18 states and 25 transitions. [2025-02-06 19:10:41,031 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2025-02-06 19:10:41,031 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2025-02-06 19:10:41,031 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2025-02-06 19:10:41,031 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:10:41,031 INFO L218 hiAutomatonCegarLoop]: Abstraction has 18 states and 25 transitions. [2025-02-06 19:10:41,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2025-02-06 19:10:41,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2025-02-06 19:10:41,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.411764705882353) internal successors, (24), 16 states have internal predecessors, (24), 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:10:41,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 24 transitions. [2025-02-06 19:10:41,032 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17 states and 24 transitions. [2025-02-06 19:10:41,032 INFO L432 stractBuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2025-02-06 19:10:41,032 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-02-06 19:10:41,032 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 24 transitions. [2025-02-06 19:10:41,032 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2025-02-06 19:10:41,032 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:10:41,032 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:10:41,032 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:10:41,032 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-06 19:10:41,033 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~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet13#1, main_#t~post14#1, main_~k~0#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet11#1;main_~array_size~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;main_~k~0#1 := 0;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume !(main_~k~0#1 < main_~array_size~0#1);havoc main_~k~0#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~post8#1, test_fun_#t~post9#1, test_fun_#t~post10#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~pos~0#1, test_fun_~neg~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~pos~0#1 := 0;test_fun_~neg~0#1 := 0;test_fun_~i~0#1 := 0;" "assume test_fun_~i~0#1 < test_fun_~N#1;" [2025-02-06 19:10:41,033 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume test_fun_#t~mem2#1 < 0;havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(1 + test_fun_#t~post4#1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~neg~0#1;test_fun_~neg~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1;" [2025-02-06 19:10:41,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:10:41,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1330377650, now seen corresponding path program 1 times [2025-02-06 19:10:41,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:10:41,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707601055] [2025-02-06 19:10:41,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:10:41,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:10:41,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 19:10:41,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 19:10:41,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:41,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:41,041 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:10:41,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 19:10:41,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 19:10:41,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:41,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:41,047 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:10:41,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:10:41,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1376, now seen corresponding path program 1 times [2025-02-06 19:10:41,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:10:41,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055151208] [2025-02-06 19:10:41,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:10:41,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:10:41,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:10:41,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:10:41,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:41,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:41,051 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:10:41,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:10:41,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:10:41,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:41,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:41,062 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:10:41,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:10:41,063 INFO L85 PathProgramCache]: Analyzing trace with hash -1407332143, now seen corresponding path program 1 times [2025-02-06 19:10:41,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:10:41,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716223930] [2025-02-06 19:10:41,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:10:41,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:10:41,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 19:10:41,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 19:10:41,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:41,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:41,076 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:10:41,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 19:10:41,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 19:10:41,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:41,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:41,097 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:10:41,264 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:10:41,264 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:10:41,264 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:10:41,264 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:10:41,264 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-06 19:10:41,264 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:41,264 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:10:41,264 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:10:41,264 INFO L132 ssoRankerPreferences]: Filename of dumped script: array02-alloca-2.i_Iteration5_Lasso [2025-02-06 19:10:41,264 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:10:41,264 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:10:41,266 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:41,267 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:41,269 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:41,270 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:41,272 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:41,273 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:41,274 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:41,276 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:41,278 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:41,279 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:41,280 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:41,282 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:41,285 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:41,286 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:41,359 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:41,360 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:41,362 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:41,364 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:41,366 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:41,367 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:41,368 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:41,370 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:41,371 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:41,373 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:41,374 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:41,514 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:10:41,562 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:10:41,563 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-06 19:10:41,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:41,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:41,568 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:10:41,576 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:10:41,577 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:10:41,588 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:41,588 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:41,588 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:41,588 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:41,588 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:41,588 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:41,588 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:41,589 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:41,595 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2025-02-06 19:10:41,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:41,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:41,597 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:10:41,598 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:10:41,599 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:10:41,609 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:41,609 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:41,609 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:41,609 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:41,609 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:41,609 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:41,609 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:41,612 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:41,617 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2025-02-06 19:10:41,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:41,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:41,619 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:10:41,621 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:10:41,621 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:10:41,631 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:41,631 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:41,631 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:41,631 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:41,631 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:41,632 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:41,632 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:41,633 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:41,638 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:10:41,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:41,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:41,640 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:10:41,641 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:10:41,643 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:10:41,653 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:41,653 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:41,653 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:41,653 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:41,655 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:10:41,655 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:10:41,657 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:41,663 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2025-02-06 19:10:41,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:41,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:41,666 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:10:41,667 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:10:41,668 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:10:41,677 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:41,678 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:41,678 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:41,678 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:41,678 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:41,678 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:41,678 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:41,679 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:41,684 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2025-02-06 19:10:41,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:41,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:41,686 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:10:41,689 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:10:41,690 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:10:41,700 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:41,700 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:41,700 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:41,700 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:41,700 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:41,700 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:41,700 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:41,701 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:41,706 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:10:41,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:41,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:41,709 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:10:41,710 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:10:41,711 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:10:41,722 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:41,722 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:41,722 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:41,722 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:41,722 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:41,723 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:41,723 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:41,724 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:41,729 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:10:41,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:41,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:41,732 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:10:41,733 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:10:41,733 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:10:41,747 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:41,747 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:41,747 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:41,747 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:41,748 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:10:41,748 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:10:41,755 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:41,762 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:10:41,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:41,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:41,765 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:10:41,766 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:10:41,766 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:10:41,776 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:41,777 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:41,777 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:41,777 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:41,777 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:41,777 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:41,777 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:41,778 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:41,784 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:10:41,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:41,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:41,786 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:10:41,786 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:10:41,788 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:10:41,797 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:41,797 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:41,797 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:41,797 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:41,797 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:41,798 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:41,798 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:41,799 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:41,807 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2025-02-06 19:10:41,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:41,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:41,809 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:10:41,811 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:10:41,812 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:10:41,821 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:41,822 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:41,822 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:41,822 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:41,822 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:41,822 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:41,822 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:41,826 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:41,831 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:10:41,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:41,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:41,833 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:10:41,834 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:10:41,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:10:41,844 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:41,844 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:41,844 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:41,844 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:41,845 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:10:41,846 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:10:41,849 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:41,857 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:10:41,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:41,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:41,859 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:10:41,861 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:10:41,861 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:10:41,871 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:41,871 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:41,871 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:41,871 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:41,871 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:41,872 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:41,872 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:41,874 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:41,883 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:10:41,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:41,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:41,885 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:10:41,886 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:10:41,887 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:10:41,896 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:41,896 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:41,896 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:41,896 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:41,898 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:10:41,898 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:10:41,902 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:41,908 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:10:41,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:41,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:41,914 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:10:41,914 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:10:41,916 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:10:41,926 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:41,926 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:41,926 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:41,926 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:41,933 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:10:41,933 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:10:41,940 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-06 19:10:41,960 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2025-02-06 19:10:41,960 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-02-06 19:10:41,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:41,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:41,962 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:10:41,964 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:10:41,964 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-06 19:10:41,975 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-02-06 19:10:41,975 INFO L474 LassoAnalysis]: Proved termination. [2025-02-06 19:10:41,975 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc12#1.base) 0)_2) = -1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc12#1.base) 0)_2 Supporting invariants [] [2025-02-06 19:10:41,981 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2025-02-06 19:10:41,988 INFO L156 tatePredicateManager]: 2 out of 4 supporting invariants were superfluous and have been removed [2025-02-06 19:10:41,992 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-02-06 19:10:41,993 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-02-06 19:10:41,993 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[#t~malloc12!base,]]] [2025-02-06 19:10:42,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:10:42,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 19:10:42,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 19:10:42,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:42,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:10:42,031 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-06 19:10:42,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:10:42,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:10:42,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:10:42,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:42,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:10:42,079 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-06 19:10:42,079 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:10:42,098 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:10:42,098 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2025-02-06 19:10:42,099 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 24 transitions. cyclomatic complexity: 11 Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:10:42,147 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 24 transitions. cyclomatic complexity: 11. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 34 states and 45 transitions. Complement of second has 9 states. [2025-02-06 19:10:42,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2025-02-06 19:10:42,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:10:42,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 13 transitions. [2025-02-06 19:10:42,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 7 letters. Loop has 2 letters. [2025-02-06 19:10:42,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:10:42,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 9 letters. Loop has 2 letters. [2025-02-06 19:10:42,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:10:42,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 7 letters. Loop has 4 letters. [2025-02-06 19:10:42,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:10:42,149 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 45 transitions. [2025-02-06 19:10:42,150 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2025-02-06 19:10:42,150 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 29 states and 40 transitions. [2025-02-06 19:10:42,150 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2025-02-06 19:10:42,150 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2025-02-06 19:10:42,150 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 40 transitions. [2025-02-06 19:10:42,150 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:10:42,150 INFO L218 hiAutomatonCegarLoop]: Abstraction has 29 states and 40 transitions. [2025-02-06 19:10:42,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 40 transitions. [2025-02-06 19:10:42,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 24. [2025-02-06 19:10:42,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 23 states have internal predecessors, (34), 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:10:42,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2025-02-06 19:10:42,152 INFO L240 hiAutomatonCegarLoop]: Abstraction has 24 states and 34 transitions. [2025-02-06 19:10:42,152 INFO L432 stractBuchiCegarLoop]: Abstraction has 24 states and 34 transitions. [2025-02-06 19:10:42,152 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-02-06 19:10:42,152 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 34 transitions. [2025-02-06 19:10:42,152 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2025-02-06 19:10:42,152 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:10:42,153 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:10:42,153 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:10:42,153 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-06 19:10:42,153 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~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet13#1, main_#t~post14#1, main_~k~0#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet11#1;main_~array_size~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;main_~k~0#1 := 0;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume !(main_~k~0#1 < main_~array_size~0#1);havoc main_~k~0#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~post8#1, test_fun_#t~post9#1, test_fun_#t~post10#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~pos~0#1, test_fun_~neg~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~pos~0#1 := 0;test_fun_~neg~0#1 := 0;test_fun_~i~0#1 := 0;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" [2025-02-06 19:10:42,153 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume test_fun_#t~mem6#1 > 0;havoc test_fun_#t~mem6#1;call test_fun_#t~mem7#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post8#1 := test_fun_#t~mem7#1;call write~int#0(test_fun_#t~post8#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem7#1;havoc test_fun_#t~post8#1;test_fun_#t~post9#1 := test_fun_~pos~0#1;test_fun_~pos~0#1 := 1 + test_fun_#t~post9#1;havoc test_fun_#t~post9#1;" [2025-02-06 19:10:42,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:10:42,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1407332144, now seen corresponding path program 1 times [2025-02-06 19:10:42,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:10:42,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702883166] [2025-02-06 19:10:42,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:10:42,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:10:42,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 19:10:42,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 19:10:42,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:42,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:42,161 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:10:42,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 19:10:42,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 19:10:42,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:42,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:42,167 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:10:42,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:10:42,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1184, now seen corresponding path program 1 times [2025-02-06 19:10:42,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:10:42,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306560911] [2025-02-06 19:10:42,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:10:42,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:10:42,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:10:42,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:10:42,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:42,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:42,175 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:10:42,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:10:42,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:10:42,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:42,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:42,177 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:10:42,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:10:42,178 INFO L85 PathProgramCache]: Analyzing trace with hash 468508079, now seen corresponding path program 1 times [2025-02-06 19:10:42,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:10:42,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573042205] [2025-02-06 19:10:42,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:10:42,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:10:42,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 19:10:42,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 19:10:42,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:42,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:42,196 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:10:42,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 19:10:42,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 19:10:42,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:42,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:42,206 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:10:42,383 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:10:42,444 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:10:42,444 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:10:42,444 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:10:42,444 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:10:42,445 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-06 19:10:42,445 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:42,445 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:10:42,445 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:10:42,445 INFO L132 ssoRankerPreferences]: Filename of dumped script: array02-alloca-2.i_Iteration6_Lasso [2025-02-06 19:10:42,445 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:10:42,445 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:10:42,446 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:42,450 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:42,452 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:42,453 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:42,454 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:42,456 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:42,459 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:42,461 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:42,463 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:42,465 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:42,467 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:42,468 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:42,470 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:42,471 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:42,473 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:42,474 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:42,556 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:42,557 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:42,559 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:42,560 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:42,562 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:42,563 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:42,565 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:42,566 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:42,568 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:42,721 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:10:42,721 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-06 19:10:42,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:42,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:42,723 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:10:42,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2025-02-06 19:10:42,725 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:10:42,735 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:42,735 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:42,736 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:42,736 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:42,737 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:10:42,737 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:10:42,739 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:42,745 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2025-02-06 19:10:42,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:42,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:42,748 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:10:42,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2025-02-06 19:10:42,749 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:10:42,759 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:42,759 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:42,759 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:42,759 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:42,760 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:10:42,760 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:10:42,762 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:42,768 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2025-02-06 19:10:42,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:42,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:42,770 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:10:42,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2025-02-06 19:10:42,772 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:10:42,781 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:42,781 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:42,781 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:42,781 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:42,782 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:42,782 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:42,782 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:42,783 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:42,788 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2025-02-06 19:10:42,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:42,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:42,791 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:10:42,791 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:10:42,792 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:10:42,802 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:42,802 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:42,802 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:42,802 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:42,802 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:42,802 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:42,803 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:42,803 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:42,809 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:10:42,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:42,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:42,811 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:10:42,812 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:10:42,813 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:10:42,823 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:42,823 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:42,823 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:42,823 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:42,823 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:42,827 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:42,827 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:42,828 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:42,834 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:10:42,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:42,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:42,837 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:10:42,837 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:10:42,838 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:10:42,848 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:42,848 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:42,848 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:42,848 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:42,848 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:42,849 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:42,849 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:42,850 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:42,855 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2025-02-06 19:10:42,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:42,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:42,859 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:10:42,860 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:10:42,861 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:10:42,870 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:42,870 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:42,870 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:42,870 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:42,870 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:42,871 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:42,871 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:42,872 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:42,877 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:10:42,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:42,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:42,879 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:10:42,880 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:10:42,881 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:10:42,891 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:42,891 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:42,891 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:42,891 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:42,891 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:42,891 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:42,891 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:42,893 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:42,897 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2025-02-06 19:10:42,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:42,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:42,900 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:10:42,901 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:10:42,902 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:10:42,912 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:42,912 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:42,912 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:42,912 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:42,912 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:42,912 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:42,912 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:42,913 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:42,918 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:10:42,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:42,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:42,920 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:10:42,921 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:10:42,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:10:42,932 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:42,932 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:42,932 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:42,932 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:42,932 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:42,932 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:42,932 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:42,933 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:42,938 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2025-02-06 19:10:42,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:42,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:42,941 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:10:42,942 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:10:42,943 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:10:42,953 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:42,953 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:42,953 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:42,953 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:42,953 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:42,953 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:42,953 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:42,954 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:42,960 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2025-02-06 19:10:42,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:42,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:42,962 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:10:42,963 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:10:42,964 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:10:42,973 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:42,973 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:42,973 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:42,973 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:42,975 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:10:42,975 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:10:42,977 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:42,983 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2025-02-06 19:10:42,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:42,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:42,985 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:10:42,986 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:10:42,987 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:10:42,996 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:42,996 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:42,996 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:42,996 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:42,996 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:42,997 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:42,997 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:42,998 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:43,003 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2025-02-06 19:10:43,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:43,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:43,005 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:10:43,006 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:10:43,008 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:10:43,017 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:43,017 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:43,017 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:43,017 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:43,017 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:43,018 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:43,018 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:43,019 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:43,024 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:10:43,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:43,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:43,027 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:10:43,029 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:10:43,031 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:10:43,040 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:43,041 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:43,041 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:43,041 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:43,041 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:43,042 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:43,042 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:43,043 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:43,048 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:10:43,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:43,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:43,050 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:10:43,051 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:10:43,051 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:10:43,061 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:43,061 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:43,061 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:43,061 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:43,063 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:10:43,063 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:10:43,068 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:43,076 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:10:43,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:43,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:43,078 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:10:43,079 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:10:43,079 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:10:43,089 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:43,089 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:43,089 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:43,089 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:43,092 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:10:43,092 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:10:43,098 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-06 19:10:43,104 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-02-06 19:10:43,104 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-02-06 19:10:43,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:43,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:43,106 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:10:43,107 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:10:43,108 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-06 19:10:43,118 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-02-06 19:10:43,119 INFO L474 LassoAnalysis]: Proved termination. [2025-02-06 19:10:43,119 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_test_fun_~a#1.base) ULTIMATE.start_test_fun_~a#1.offset)_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_test_fun_~a#1.base) ULTIMATE.start_test_fun_~a#1.offset)_1 Supporting invariants [] [2025-02-06 19:10:43,125 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:10:43,131 INFO L156 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed [2025-02-06 19:10:43,132 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-02-06 19:10:43,132 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-02-06 19:10:43,132 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~a!base,]]] [2025-02-06 19:10:43,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:10:43,165 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Forceful destruction successful, exit code 0 [2025-02-06 19:10:43,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 19:10:43,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 19:10:43,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:43,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:10:43,171 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 19:10:43,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:10:43,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:10:43,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:10:43,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:43,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:10:43,186 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 19:10:43,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:10:43,199 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:10:43,199 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2025-02-06 19:10:43,199 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 34 transitions. cyclomatic complexity: 16 Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:10:43,226 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 34 transitions. cyclomatic complexity: 16. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 33 states and 45 transitions. Complement of second has 8 states. [2025-02-06 19:10:43,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2025-02-06 19:10:43,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:10:43,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 14 transitions. [2025-02-06 19:10:43,227 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 9 letters. Loop has 2 letters. [2025-02-06 19:10:43,228 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:10:43,228 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 11 letters. Loop has 2 letters. [2025-02-06 19:10:43,228 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:10:43,228 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 9 letters. Loop has 4 letters. [2025-02-06 19:10:43,228 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:10:43,228 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 45 transitions. [2025-02-06 19:10:43,228 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2025-02-06 19:10:43,229 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 24 states and 32 transitions. [2025-02-06 19:10:43,229 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2025-02-06 19:10:43,229 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2025-02-06 19:10:43,229 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 32 transitions. [2025-02-06 19:10:43,229 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:10:43,229 INFO L218 hiAutomatonCegarLoop]: Abstraction has 24 states and 32 transitions. [2025-02-06 19:10:43,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 32 transitions. [2025-02-06 19:10:43,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2025-02-06 19:10:43,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 22 states have internal predecessors, (31), 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:10:43,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2025-02-06 19:10:43,230 INFO L240 hiAutomatonCegarLoop]: Abstraction has 23 states and 31 transitions. [2025-02-06 19:10:43,230 INFO L432 stractBuchiCegarLoop]: Abstraction has 23 states and 31 transitions. [2025-02-06 19:10:43,230 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-02-06 19:10:43,230 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 31 transitions. [2025-02-06 19:10:43,231 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2025-02-06 19:10:43,231 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:10:43,231 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:10:43,231 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:10:43,231 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-06 19:10:43,231 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~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet13#1, main_#t~post14#1, main_~k~0#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet11#1;main_~array_size~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;main_~k~0#1 := 0;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume !(main_~k~0#1 < main_~array_size~0#1);havoc main_~k~0#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~post8#1, test_fun_#t~post9#1, test_fun_#t~post10#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~pos~0#1, test_fun_~neg~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~pos~0#1 := 0;test_fun_~neg~0#1 := 0;test_fun_~i~0#1 := 0;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" [2025-02-06 19:10:43,231 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume test_fun_#t~mem2#1 < 0;havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(1 + test_fun_#t~post4#1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~neg~0#1;test_fun_~neg~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1;" [2025-02-06 19:10:43,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:10:43,231 INFO L85 PathProgramCache]: Analyzing trace with hash -735303045, now seen corresponding path program 2 times [2025-02-06 19:10:43,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:10:43,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674238142] [2025-02-06 19:10:43,231 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:10:43,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:10:43,235 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-02-06 19:10:43,238 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 19:10:43,238 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 19:10:43,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:10:43,313 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:10:43,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:10:43,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674238142] [2025-02-06 19:10:43,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674238142] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:10:43,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1492556242] [2025-02-06 19:10:43,313 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:10:43,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:10:43,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:43,315 INFO L229 MonitoredProcess]: Starting monitored process 55 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:10:43,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Waiting until timeout for monitored process [2025-02-06 19:10:43,349 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-02-06 19:10:43,356 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 19:10:43,356 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 19:10:43,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:10:43,356 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 19:10:43,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:10:43,409 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:10:43,409 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:10:43,442 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:10:43,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1492556242] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:10:43,442 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:10:43,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-02-06 19:10:43,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301604120] [2025-02-06 19:10:43,442 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:10:43,442 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-06 19:10:43,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:10:43,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1376, now seen corresponding path program 2 times [2025-02-06 19:10:43,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:10:43,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737865436] [2025-02-06 19:10:43,442 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:10:43,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:10:43,445 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:10:43,446 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:10:43,446 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 19:10:43,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:43,446 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:10:43,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:10:43,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:10:43,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:43,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:43,448 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:10:43,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:10:43,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 19:10:43,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-02-06 19:10:43,482 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. cyclomatic complexity: 14 Second operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 states have internal predecessors, (30), 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:10:43,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:10:43,519 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2025-02-06 19:10:43,519 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 43 transitions. [2025-02-06 19:10:43,519 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2025-02-06 19:10:43,520 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 24 states and 32 transitions. [2025-02-06 19:10:43,520 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2025-02-06 19:10:43,520 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2025-02-06 19:10:43,520 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 32 transitions. [2025-02-06 19:10:43,520 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:10:43,520 INFO L218 hiAutomatonCegarLoop]: Abstraction has 24 states and 32 transitions. [2025-02-06 19:10:43,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 32 transitions. [2025-02-06 19:10:43,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2025-02-06 19:10:43,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 23 states have internal predecessors, (32), 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:10:43,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 32 transitions. [2025-02-06 19:10:43,521 INFO L240 hiAutomatonCegarLoop]: Abstraction has 24 states and 32 transitions. [2025-02-06 19:10:43,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 19:10:43,523 INFO L432 stractBuchiCegarLoop]: Abstraction has 24 states and 32 transitions. [2025-02-06 19:10:43,523 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-02-06 19:10:43,523 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 32 transitions. [2025-02-06 19:10:43,523 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2025-02-06 19:10:43,523 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:10:43,523 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:10:43,523 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:10:43,523 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-06 19:10:43,523 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~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet13#1, main_#t~post14#1, main_~k~0#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet11#1;main_~array_size~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;main_~k~0#1 := 0;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume !(main_~k~0#1 < main_~array_size~0#1);havoc main_~k~0#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~post8#1, test_fun_#t~post9#1, test_fun_#t~post10#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~pos~0#1, test_fun_~neg~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~pos~0#1 := 0;test_fun_~neg~0#1 := 0;test_fun_~i~0#1 := 0;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" [2025-02-06 19:10:43,523 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume test_fun_#t~mem2#1 < 0;havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(1 + test_fun_#t~post4#1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~neg~0#1;test_fun_~neg~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1;" [2025-02-06 19:10:43,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:10:43,524 INFO L85 PathProgramCache]: Analyzing trace with hash -2100337179, now seen corresponding path program 3 times [2025-02-06 19:10:43,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:10:43,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066706796] [2025-02-06 19:10:43,524 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 19:10:43,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:10:43,530 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 14 statements into 2 equivalence classes. [2025-02-06 19:10:43,542 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 19:10:43,542 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-06 19:10:43,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:43,542 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:10:43,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 19:10:43,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 19:10:43,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:43,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:43,553 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:10:43,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:10:43,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1376, now seen corresponding path program 3 times [2025-02-06 19:10:43,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:10:43,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574938197] [2025-02-06 19:10:43,554 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 19:10:43,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:10:43,558 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:10:43,559 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:10:43,559 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-06 19:10:43,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:43,559 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:10:43,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:10:43,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:10:43,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:43,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:43,562 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:10:43,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:10:43,563 INFO L85 PathProgramCache]: Analyzing trace with hash 210600516, now seen corresponding path program 1 times [2025-02-06 19:10:43,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:10:43,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105189483] [2025-02-06 19:10:43,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:10:43,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:10:43,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 19:10:43,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 19:10:43,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:43,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:43,578 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:10:43,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 19:10:43,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 19:10:43,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:43,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:43,594 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:10:43,852 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:10:43,852 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:10:43,852 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:10:43,852 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:10:43,852 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-06 19:10:43,852 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:43,852 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:10:43,852 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:10:43,852 INFO L132 ssoRankerPreferences]: Filename of dumped script: array02-alloca-2.i_Iteration8_Lasso [2025-02-06 19:10:43,852 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:10:43,852 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:10:43,853 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:43,856 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:43,858 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:43,860 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:43,862 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:43,864 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:43,865 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:43,977 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:43,980 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:43,981 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:43,983 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:43,984 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:43,985 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:43,986 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:43,988 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:43,990 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:43,991 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:43,994 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:43,995 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:43,996 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:43,998 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:43,999 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:44,000 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:44,002 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:44,004 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:44,226 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:10:44,226 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-06 19:10:44,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:44,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:44,230 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:10:44,231 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:10:44,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:10:44,241 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:44,241 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:44,241 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:44,241 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:44,241 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:44,241 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:44,241 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:44,242 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:44,249 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:10:44,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:44,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:44,252 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:10:44,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2025-02-06 19:10:44,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:10:44,263 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:44,263 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:44,263 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:44,263 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:44,263 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:44,263 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:44,263 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:44,264 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:44,269 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2025-02-06 19:10:44,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:44,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:44,271 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:10:44,272 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:10:44,273 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:10:44,282 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:44,283 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:44,283 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:44,283 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:44,283 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:44,283 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:44,283 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:44,284 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:44,290 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:10:44,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:44,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:44,299 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:10:44,300 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:10:44,301 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:10:44,311 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:44,311 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:44,311 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:44,311 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:44,313 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:10:44,313 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:10:44,315 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:44,320 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Forceful destruction successful, exit code 0 [2025-02-06 19:10:44,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:44,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:44,323 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:10:44,323 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:10:44,327 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:10:44,337 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:44,337 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:44,337 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:44,337 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:44,337 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:44,337 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:44,337 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:44,338 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:44,343 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:10:44,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:44,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:44,345 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:10:44,346 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:10:44,347 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:10:44,357 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:44,357 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:44,357 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:44,357 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:44,357 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:44,359 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:44,359 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:44,360 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:44,366 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Forceful destruction successful, exit code 0 [2025-02-06 19:10:44,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:44,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:44,368 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:10:44,369 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:10:44,370 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:10:44,379 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:44,379 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:44,379 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:44,379 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:44,381 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:10:44,381 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:10:44,386 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-06 19:10:44,393 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-02-06 19:10:44,393 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-02-06 19:10:44,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:44,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:44,397 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:10:44,398 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:10:44,399 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-06 19:10:44,409 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-02-06 19:10:44,409 INFO L474 LassoAnalysis]: Proved termination. [2025-02-06 19:10:44,410 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc12#1.base) 4)_1) = -1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc12#1.base) 4)_1 Supporting invariants [] [2025-02-06 19:10:44,415 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Forceful destruction successful, exit code 0 [2025-02-06 19:10:44,428 INFO L156 tatePredicateManager]: 4 out of 6 supporting invariants were superfluous and have been removed [2025-02-06 19:10:44,431 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-02-06 19:10:44,431 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-02-06 19:10:44,431 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[#t~malloc12!base,]]] [2025-02-06 19:10:44,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:10:44,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 19:10:44,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 19:10:44,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:44,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:10:44,462 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-06 19:10:44,462 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:10:44,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:10:44,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:10:44,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:44,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:10:44,561 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-06 19:10:44,562 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:10:44,580 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:10:44,580 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2025-02-06 19:10:44,580 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 14 Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:10:44,604 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 14. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 25 states and 34 transitions. Complement of second has 5 states. [2025-02-06 19:10:44,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2025-02-06 19:10:44,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:10:44,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2025-02-06 19:10:44,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 14 letters. Loop has 2 letters. [2025-02-06 19:10:44,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:10:44,606 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-06 19:10:44,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:10:44,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 19:10:44,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 19:10:44,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:44,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:10:44,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-06 19:10:44,646 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:10:44,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:10:44,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:10:44,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:44,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:10:44,740 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-06 19:10:44,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:10:44,762 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:10:44,763 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.4 stem predicates 2 loop predicates [2025-02-06 19:10:44,763 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 14 Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:10:44,789 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 14. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 25 states and 34 transitions. Complement of second has 5 states. [2025-02-06 19:10:44,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2025-02-06 19:10:44,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:10:44,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2025-02-06 19:10:44,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 14 letters. Loop has 2 letters. [2025-02-06 19:10:44,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:10:44,790 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-06 19:10:44,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:10:44,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 19:10:44,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 19:10:44,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:44,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:10:44,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-06 19:10:44,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:10:44,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:10:44,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:10:44,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:44,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:10:44,923 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-06 19:10:44,924 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:10:44,942 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:10:44,943 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 2 loop predicates [2025-02-06 19:10:44,943 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 14 Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:10:45,021 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 14. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 52 states and 68 transitions. Complement of second has 11 states. [2025-02-06 19:10:45,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 4 stem states 2 non-accepting loop states 2 accepting loop states [2025-02-06 19:10:45,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:10:45,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 39 transitions. [2025-02-06 19:10:45,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 39 transitions. Stem has 14 letters. Loop has 2 letters. [2025-02-06 19:10:45,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:10:45,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 39 transitions. Stem has 16 letters. Loop has 2 letters. [2025-02-06 19:10:45,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:10:45,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 39 transitions. Stem has 14 letters. Loop has 4 letters. [2025-02-06 19:10:45,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:10:45,025 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 52 states and 68 transitions. [2025-02-06 19:10:45,026 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2025-02-06 19:10:45,027 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 52 states to 47 states and 63 transitions. [2025-02-06 19:10:45,027 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2025-02-06 19:10:45,027 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2025-02-06 19:10:45,027 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 63 transitions. [2025-02-06 19:10:45,027 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:10:45,027 INFO L218 hiAutomatonCegarLoop]: Abstraction has 47 states and 63 transitions. [2025-02-06 19:10:45,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 63 transitions. [2025-02-06 19:10:45,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 33. [2025-02-06 19:10:45,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.3636363636363635) internal successors, (45), 32 states have internal predecessors, (45), 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:10:45,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 45 transitions. [2025-02-06 19:10:45,029 INFO L240 hiAutomatonCegarLoop]: Abstraction has 33 states and 45 transitions. [2025-02-06 19:10:45,029 INFO L432 stractBuchiCegarLoop]: Abstraction has 33 states and 45 transitions. [2025-02-06 19:10:45,029 INFO L338 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-02-06 19:10:45,029 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 45 transitions. [2025-02-06 19:10:45,029 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2025-02-06 19:10:45,029 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:10:45,029 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:10:45,030 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:10:45,030 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-06 19:10:45,030 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~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet13#1, main_#t~post14#1, main_~k~0#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet11#1;main_~array_size~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;main_~k~0#1 := 0;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume !(main_~k~0#1 < main_~array_size~0#1);havoc main_~k~0#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~post8#1, test_fun_#t~post9#1, test_fun_#t~post10#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~pos~0#1, test_fun_~neg~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~pos~0#1 := 0;test_fun_~neg~0#1 := 0;test_fun_~i~0#1 := 0;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" [2025-02-06 19:10:45,030 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume test_fun_#t~mem6#1 > 0;havoc test_fun_#t~mem6#1;call test_fun_#t~mem7#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post8#1 := test_fun_#t~mem7#1;call write~int#0(test_fun_#t~post8#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem7#1;havoc test_fun_#t~post8#1;test_fun_#t~post9#1 := test_fun_~pos~0#1;test_fun_~pos~0#1 := 1 + test_fun_#t~post9#1;havoc test_fun_#t~post9#1;" [2025-02-06 19:10:45,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:10:45,031 INFO L85 PathProgramCache]: Analyzing trace with hash 210600515, now seen corresponding path program 4 times [2025-02-06 19:10:45,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:10:45,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466002346] [2025-02-06 19:10:45,031 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 19:10:45,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:10:45,041 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 16 statements into 2 equivalence classes. [2025-02-06 19:10:45,049 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 19:10:45,049 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 19:10:45,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:45,049 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:10:45,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 19:10:45,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 19:10:45,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:45,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:45,056 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:10:45,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:10:45,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1184, now seen corresponding path program 2 times [2025-02-06 19:10:45,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:10:45,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337051538] [2025-02-06 19:10:45,057 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:10:45,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:10:45,059 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:10:45,060 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:10:45,060 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 19:10:45,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:45,060 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:10:45,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:10:45,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:10:45,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:45,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:45,062 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:10:45,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:10:45,063 INFO L85 PathProgramCache]: Analyzing trace with hash 523632226, now seen corresponding path program 1 times [2025-02-06 19:10:45,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:10:45,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52011677] [2025-02-06 19:10:45,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:10:45,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:10:45,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-06 19:10:45,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 19:10:45,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:45,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:45,097 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:10:45,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-06 19:10:45,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 19:10:45,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:45,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:45,111 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:10:45,114 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:10:45,438 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:10:45,438 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:10:45,438 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:10:45,438 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:10:45,438 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-06 19:10:45,438 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:45,438 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:10:45,438 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:10:45,438 INFO L132 ssoRankerPreferences]: Filename of dumped script: array02-alloca-2.i_Iteration9_Lasso [2025-02-06 19:10:45,438 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:10:45,438 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:10:45,439 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:45,444 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:45,446 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:45,448 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:45,449 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:45,450 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:45,452 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:45,453 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:45,454 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:45,456 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:45,457 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:45,458 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:45,459 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:45,462 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:45,463 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:45,464 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:45,466 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:45,467 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:45,469 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:45,472 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:45,479 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:45,628 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:45,632 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:45,633 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:45,880 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:10:45,881 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-06 19:10:45,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:45,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:45,883 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:10:45,884 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:10:45,885 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:10:45,894 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:45,894 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:45,894 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:45,894 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:45,894 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:45,895 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:45,895 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:45,896 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:45,901 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:10:45,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:45,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:45,903 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:10:45,904 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:10:45,905 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:10:45,915 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:45,915 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:45,915 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:45,915 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:45,915 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:45,916 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:45,916 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:45,917 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:45,922 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:10:45,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:45,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:45,925 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:10:45,925 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:10:45,927 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:10:45,936 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:45,936 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:45,936 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:45,936 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:45,936 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:45,937 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:45,937 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:45,938 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:45,943 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Ended with exit code 0 [2025-02-06 19:10:45,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:45,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:45,945 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:10:45,946 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:10:45,948 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:10:45,957 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:45,957 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:45,957 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:45,957 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:45,957 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:45,957 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:45,957 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:45,958 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:45,964 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Forceful destruction successful, exit code 0 [2025-02-06 19:10:45,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:45,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:45,966 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:10:45,967 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:10:45,968 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:10:45,978 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:45,978 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:45,978 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:45,978 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:45,978 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:45,978 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:45,978 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:45,979 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:45,984 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:10:45,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:45,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:45,986 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:10:45,987 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:10:45,988 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:10:45,997 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:45,997 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:45,997 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:45,997 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:45,998 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:10:45,999 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:10:46,001 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:46,006 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:10:46,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:46,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:46,011 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:10:46,012 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:10:46,013 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:10:46,023 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:46,023 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:46,023 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:46,023 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:46,023 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:46,023 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:46,023 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:46,024 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:46,030 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Forceful destruction successful, exit code 0 [2025-02-06 19:10:46,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:46,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:46,032 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:10:46,033 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:10:46,034 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:10:46,043 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:46,043 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:46,043 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:46,043 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:46,043 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:46,044 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:46,044 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:46,048 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:46,057 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Forceful destruction successful, exit code 0 [2025-02-06 19:10:46,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:46,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:46,060 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:10:46,061 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:10:46,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:10:46,072 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:46,072 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:46,072 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:46,072 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:46,072 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:46,072 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:46,072 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:46,073 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:46,078 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Forceful destruction successful, exit code 0 [2025-02-06 19:10:46,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:46,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:46,081 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:10:46,081 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:10:46,082 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:10:46,092 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:46,093 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:46,093 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:46,093 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:46,093 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:46,093 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:46,093 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:46,094 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:46,099 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:10:46,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:46,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:46,101 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:10:46,102 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:10:46,103 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:10:46,112 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:46,112 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:46,112 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:46,113 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:46,113 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:46,113 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:46,113 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:46,114 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:46,119 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:10:46,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:46,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:46,122 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:10:46,122 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:10:46,124 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:10:46,133 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:46,133 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:46,133 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:46,133 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:46,133 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:46,134 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:46,134 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:46,135 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:46,140 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:10:46,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:46,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:46,142 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:10:46,143 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:10:46,143 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:10:46,153 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:46,153 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:46,153 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:46,153 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:46,153 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:46,153 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:46,154 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:46,155 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:46,160 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:10:46,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:46,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:46,162 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:10:46,162 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:10:46,164 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:10:46,173 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:46,173 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:46,173 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:46,173 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:46,175 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:10:46,175 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:10:46,176 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:46,182 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:10:46,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:46,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:46,184 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:10:46,184 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:10:46,186 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:10:46,195 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:46,195 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:46,195 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:46,196 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:46,196 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:46,196 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:46,196 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:46,197 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:46,203 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:10:46,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:46,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:46,205 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:10:46,206 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:10:46,207 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:10:46,216 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:46,216 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:46,216 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:46,216 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:46,216 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:46,217 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:46,217 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:46,218 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:46,223 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:10:46,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:46,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:46,225 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:10:46,225 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:10:46,226 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:10:46,235 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:46,235 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:46,236 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:46,236 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:46,236 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:10:46,236 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:10:46,238 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:46,243 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:10:46,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:46,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:46,245 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:10:46,246 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:10:46,247 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:10:46,257 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:46,257 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:46,257 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:46,257 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:46,257 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:46,257 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:46,257 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:46,258 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:46,264 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Forceful destruction successful, exit code 0 [2025-02-06 19:10:46,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:46,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:46,267 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:10:46,268 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:10:46,268 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:10:46,278 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:46,278 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:46,278 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:46,278 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:46,280 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:10:46,280 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:10:46,283 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:46,288 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Forceful destruction successful, exit code 0 [2025-02-06 19:10:46,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:46,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:46,290 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:10:46,291 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:10:46,292 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:10:46,301 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:46,301 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:46,302 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:46,302 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:46,302 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:46,302 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:46,302 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:46,303 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:46,308 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:10:46,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:46,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:46,310 INFO L229 MonitoredProcess]: Starting monitored process 84 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:10:46,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Waiting until timeout for monitored process [2025-02-06 19:10:46,312 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:10:46,321 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:46,321 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:46,321 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:46,321 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:46,324 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:10:46,324 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:10:46,330 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:46,336 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Forceful destruction successful, exit code 0 [2025-02-06 19:10:46,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:46,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:46,338 INFO L229 MonitoredProcess]: Starting monitored process 85 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:10:46,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Waiting until timeout for monitored process [2025-02-06 19:10:46,339 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:10:46,348 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:46,349 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:46,349 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:46,349 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:46,350 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:10:46,351 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:10:46,354 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:46,359 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Ended with exit code 0 [2025-02-06 19:10:46,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:46,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:46,362 INFO L229 MonitoredProcess]: Starting monitored process 86 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:10:46,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Waiting until timeout for monitored process [2025-02-06 19:10:46,363 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:10:46,372 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:46,372 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:46,372 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:46,372 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:46,375 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:10:46,375 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:10:46,381 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-06 19:10:46,393 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2025-02-06 19:10:46,393 INFO L444 ModelExtractionUtils]: 5 out of 13 variables were initially zero. Simplification set additionally 6 variables to zero. [2025-02-06 19:10:46,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:46,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:46,396 INFO L229 MonitoredProcess]: Starting monitored process 87 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:10:46,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Waiting until timeout for monitored process [2025-02-06 19:10:46,397 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-06 19:10:46,407 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-02-06 19:10:46,408 INFO L474 LassoAnalysis]: Proved termination. [2025-02-06 19:10:46,408 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc12#1.base) (+ ULTIMATE.start_test_fun_~a#1.offset 4))_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc12#1.base) (+ ULTIMATE.start_test_fun_~a#1.offset 4))_1 Supporting invariants [] [2025-02-06 19:10:46,413 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Ended with exit code 0 [2025-02-06 19:10:46,421 INFO L156 tatePredicateManager]: 4 out of 6 supporting invariants were superfluous and have been removed [2025-02-06 19:10:46,424 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-02-06 19:10:46,424 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-02-06 19:10:46,424 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[#t~malloc12!base,]]] [2025-02-06 19:10:46,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:10:46,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 19:10:46,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 19:10:46,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:46,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:10:46,451 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-06 19:10:46,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:10:46,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:10:46,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:10:46,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:46,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:10:46,505 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-06 19:10:46,506 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:10:46,521 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:10:46,522 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2025-02-06 19:10:46,522 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 45 transitions. cyclomatic complexity: 20 Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:10:46,548 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Ended with exit code 0 [2025-02-06 19:10:46,559 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states and 45 transitions. cyclomatic complexity: 20. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 34 states and 47 transitions. Complement of second has 5 states. [2025-02-06 19:10:46,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2025-02-06 19:10:46,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:10:46,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2025-02-06 19:10:46,559 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 16 letters. Loop has 2 letters. [2025-02-06 19:10:46,560 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:10:46,560 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-06 19:10:46,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:10:46,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 19:10:46,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 19:10:46,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:46,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:10:46,586 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-06 19:10:46,587 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:10:46,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:10:46,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:10:46,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:46,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:10:46,642 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-06 19:10:46,643 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:10:46,659 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:10:46,659 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.4 stem predicates 2 loop predicates [2025-02-06 19:10:46,659 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 45 transitions. cyclomatic complexity: 20 Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:10:46,680 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states and 45 transitions. cyclomatic complexity: 20. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 34 states and 47 transitions. Complement of second has 5 states. [2025-02-06 19:10:46,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2025-02-06 19:10:46,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:10:46,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2025-02-06 19:10:46,681 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 16 letters. Loop has 2 letters. [2025-02-06 19:10:46,681 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:10:46,681 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-06 19:10:46,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:10:46,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 19:10:46,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 19:10:46,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:46,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:10:46,709 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-06 19:10:46,709 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:10:46,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:10:46,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:10:46,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:46,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:10:46,764 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-06 19:10:46,765 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:10:46,781 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:10:46,781 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 2 loop predicates [2025-02-06 19:10:46,782 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 45 transitions. cyclomatic complexity: 20 Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:10:46,841 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states and 45 transitions. cyclomatic complexity: 20. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 46 states and 61 transitions. Complement of second has 11 states. [2025-02-06 19:10:46,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 4 stem states 2 non-accepting loop states 2 accepting loop states [2025-02-06 19:10:46,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:10:46,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 37 transitions. [2025-02-06 19:10:46,842 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 37 transitions. Stem has 16 letters. Loop has 2 letters. [2025-02-06 19:10:46,842 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:10:46,842 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 37 transitions. Stem has 18 letters. Loop has 2 letters. [2025-02-06 19:10:46,842 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:10:46,842 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 37 transitions. Stem has 16 letters. Loop has 4 letters. [2025-02-06 19:10:46,842 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:10:46,843 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 61 transitions. [2025-02-06 19:10:46,843 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2025-02-06 19:10:46,843 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 37 states and 48 transitions. [2025-02-06 19:10:46,843 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2025-02-06 19:10:46,843 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2025-02-06 19:10:46,844 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 48 transitions. [2025-02-06 19:10:46,844 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:10:46,844 INFO L218 hiAutomatonCegarLoop]: Abstraction has 37 states and 48 transitions. [2025-02-06 19:10:46,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 48 transitions. [2025-02-06 19:10:46,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 32. [2025-02-06 19:10:46,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.3125) internal successors, (42), 31 states have internal predecessors, (42), 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:10:46,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2025-02-06 19:10:46,845 INFO L240 hiAutomatonCegarLoop]: Abstraction has 32 states and 42 transitions. [2025-02-06 19:10:46,845 INFO L432 stractBuchiCegarLoop]: Abstraction has 32 states and 42 transitions. [2025-02-06 19:10:46,845 INFO L338 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-02-06 19:10:46,845 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 42 transitions. [2025-02-06 19:10:46,845 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2025-02-06 19:10:46,845 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:10:46,845 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:10:46,846 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-02-06 19:10:46,846 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-06 19:10:46,846 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~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet13#1, main_#t~post14#1, main_~k~0#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet11#1;main_~array_size~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;main_~k~0#1 := 0;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume !(main_~k~0#1 < main_~array_size~0#1);havoc main_~k~0#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~post8#1, test_fun_#t~post9#1, test_fun_#t~post10#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~pos~0#1, test_fun_~neg~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~pos~0#1 := 0;test_fun_~neg~0#1 := 0;test_fun_~i~0#1 := 0;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" [2025-02-06 19:10:46,846 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume test_fun_#t~mem2#1 < 0;havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(1 + test_fun_#t~post4#1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~neg~0#1;test_fun_~neg~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1;" [2025-02-06 19:10:46,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:10:46,846 INFO L85 PathProgramCache]: Analyzing trace with hash 699394670, now seen corresponding path program 5 times [2025-02-06 19:10:46,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:10:46,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163145327] [2025-02-06 19:10:46,846 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 19:10:46,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:10:46,853 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 3 equivalence classes. [2025-02-06 19:10:46,858 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 19:10:46,858 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-02-06 19:10:46,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:10:46,936 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:10:46,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:10:46,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163145327] [2025-02-06 19:10:46,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163145327] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:10:46,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1734153648] [2025-02-06 19:10:46,937 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 19:10:46,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:10:46,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:46,939 INFO L229 MonitoredProcess]: Starting monitored process 88 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:10:46,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (88)] Waiting until timeout for monitored process [2025-02-06 19:10:46,977 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 3 equivalence classes. [2025-02-06 19:10:46,987 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 19:10:46,987 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-02-06 19:10:46,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:10:46,988 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-06 19:10:46,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:10:47,049 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:10:47,049 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:10:47,090 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:10:47,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1734153648] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:10:47,090 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:10:47,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2025-02-06 19:10:47,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004481504] [2025-02-06 19:10:47,090 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:10:47,092 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-06 19:10:47,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:10:47,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1376, now seen corresponding path program 4 times [2025-02-06 19:10:47,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:10:47,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766701533] [2025-02-06 19:10:47,092 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 19:10:47,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:10:47,094 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 2 statements into 2 equivalence classes. [2025-02-06 19:10:47,095 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:10:47,096 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 19:10:47,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:47,096 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:10:47,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:10:47,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:10:47,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:47,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:47,098 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:10:47,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:10:47,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 19:10:47,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-02-06 19:10:47,125 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. cyclomatic complexity: 18 Second operand has 11 states, 10 states have (on average 3.4) internal successors, (34), 11 states have internal predecessors, (34), 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:10:47,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:10:47,172 INFO L93 Difference]: Finished difference Result 50 states and 64 transitions. [2025-02-06 19:10:47,172 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 64 transitions. [2025-02-06 19:10:47,173 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2025-02-06 19:10:47,173 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 33 states and 43 transitions. [2025-02-06 19:10:47,173 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2025-02-06 19:10:47,173 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2025-02-06 19:10:47,173 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 43 transitions. [2025-02-06 19:10:47,173 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:10:47,173 INFO L218 hiAutomatonCegarLoop]: Abstraction has 33 states and 43 transitions. [2025-02-06 19:10:47,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 43 transitions. [2025-02-06 19:10:47,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2025-02-06 19:10:47,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.303030303030303) internal successors, (43), 32 states have internal predecessors, (43), 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:10:47,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2025-02-06 19:10:47,175 INFO L240 hiAutomatonCegarLoop]: Abstraction has 33 states and 43 transitions. [2025-02-06 19:10:47,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 19:10:47,177 INFO L432 stractBuchiCegarLoop]: Abstraction has 33 states and 43 transitions. [2025-02-06 19:10:47,177 INFO L338 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2025-02-06 19:10:47,177 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 43 transitions. [2025-02-06 19:10:47,178 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2025-02-06 19:10:47,178 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:10:47,178 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:10:47,178 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-02-06 19:10:47,178 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-06 19:10:47,178 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~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet13#1, main_#t~post14#1, main_~k~0#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet11#1;main_~array_size~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;main_~k~0#1 := 0;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume !(main_~k~0#1 < main_~array_size~0#1);havoc main_~k~0#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~post8#1, test_fun_#t~post9#1, test_fun_#t~post10#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~pos~0#1, test_fun_~neg~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~pos~0#1 := 0;test_fun_~neg~0#1 := 0;test_fun_~i~0#1 := 0;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" [2025-02-06 19:10:47,178 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume test_fun_#t~mem2#1 < 0;havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(1 + test_fun_#t~post4#1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~neg~0#1;test_fun_~neg~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1;" [2025-02-06 19:10:47,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:10:47,179 INFO L85 PathProgramCache]: Analyzing trace with hash 910222276, now seen corresponding path program 6 times [2025-02-06 19:10:47,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:10:47,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260412379] [2025-02-06 19:10:47,179 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 19:10:47,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:10:47,185 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 21 statements into 3 equivalence classes. [2025-02-06 19:10:47,206 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-02-06 19:10:47,206 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-02-06 19:10:47,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:47,206 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:10:47,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-06 19:10:47,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-06 19:10:47,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:47,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:47,213 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:10:47,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:10:47,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1376, now seen corresponding path program 5 times [2025-02-06 19:10:47,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:10:47,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379147091] [2025-02-06 19:10:47,214 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 19:10:47,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:10:47,218 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:10:47,219 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:10:47,219 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 19:10:47,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:47,219 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:10:47,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:10:47,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:10:47,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:47,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:47,221 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:10:47,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:10:47,221 INFO L85 PathProgramCache]: Analyzing trace with hash -1449720733, now seen corresponding path program 2 times [2025-02-06 19:10:47,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:10:47,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013120110] [2025-02-06 19:10:47,222 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:10:47,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:10:47,229 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-02-06 19:10:47,235 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 19:10:47,235 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 19:10:47,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:47,236 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:10:47,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-06 19:10:47,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 19:10:47,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:47,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:47,243 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:10:47,592 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:10:47,592 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:10:47,592 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:10:47,592 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:10:47,593 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-06 19:10:47,593 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:47,593 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:10:47,593 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:10:47,593 INFO L132 ssoRankerPreferences]: Filename of dumped script: array02-alloca-2.i_Iteration11_Lasso [2025-02-06 19:10:47,593 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:10:47,593 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:10:47,595 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:47,596 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:47,598 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:47,599 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:47,600 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:47,602 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:47,716 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:47,718 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:47,720 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:47,721 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:47,722 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:47,724 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:47,725 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:47,726 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:47,727 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:47,728 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:47,729 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:47,731 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:47,732 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:47,733 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:47,734 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:47,736 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:47,738 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:47,739 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:47,740 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:47,965 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:10:47,965 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-06 19:10:47,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:47,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:47,971 INFO L229 MonitoredProcess]: Starting monitored process 89 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:10:47,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Waiting until timeout for monitored process [2025-02-06 19:10:47,972 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:10:47,982 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:47,982 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:47,982 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:47,982 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:47,983 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:10:47,983 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:10:47,986 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:47,992 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Forceful destruction successful, exit code 0 [2025-02-06 19:10:47,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:47,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:47,995 INFO L229 MonitoredProcess]: Starting monitored process 90 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:10:47,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Waiting until timeout for monitored process [2025-02-06 19:10:47,997 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:10:48,006 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:48,006 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:48,006 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:48,006 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:48,006 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:48,007 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:48,007 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:48,008 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:48,013 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Forceful destruction successful, exit code 0 [2025-02-06 19:10:48,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:48,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:48,016 INFO L229 MonitoredProcess]: Starting monitored process 91 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:10:48,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Waiting until timeout for monitored process [2025-02-06 19:10:48,017 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:10:48,026 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:48,026 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:48,026 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:48,026 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:48,026 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:48,026 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:48,027 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:48,027 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:48,034 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Ended with exit code 0 [2025-02-06 19:10:48,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:48,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:48,036 INFO L229 MonitoredProcess]: Starting monitored process 92 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:10:48,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Waiting until timeout for monitored process [2025-02-06 19:10:48,038 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:10:48,048 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:48,048 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:48,048 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:48,048 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:48,048 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:48,048 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:48,048 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:48,049 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:48,054 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Forceful destruction successful, exit code 0 [2025-02-06 19:10:48,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:48,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:48,056 INFO L229 MonitoredProcess]: Starting monitored process 93 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:10:48,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Waiting until timeout for monitored process [2025-02-06 19:10:48,058 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:10:48,068 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:48,068 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:48,068 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:48,068 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:48,069 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:10:48,069 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:10:48,072 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:48,077 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Ended with exit code 0 [2025-02-06 19:10:48,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:48,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:48,079 INFO L229 MonitoredProcess]: Starting monitored process 94 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:10:48,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Waiting until timeout for monitored process [2025-02-06 19:10:48,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:10:48,090 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:48,090 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:48,090 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:48,090 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:48,093 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:10:48,093 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:10:48,096 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:48,102 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Forceful destruction successful, exit code 0 [2025-02-06 19:10:48,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:48,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:48,104 INFO L229 MonitoredProcess]: Starting monitored process 95 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:10:48,105 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Waiting until timeout for monitored process [2025-02-06 19:10:48,106 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:10:48,115 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:48,116 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:48,116 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:48,116 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:48,118 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:10:48,118 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:10:48,122 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-06 19:10:48,133 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-02-06 19:10:48,134 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-02-06 19:10:48,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:48,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:48,136 INFO L229 MonitoredProcess]: Starting monitored process 96 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:10:48,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Waiting until timeout for monitored process [2025-02-06 19:10:48,138 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-06 19:10:48,148 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-02-06 19:10:48,148 INFO L474 LassoAnalysis]: Proved termination. [2025-02-06 19:10:48,148 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc12#1.base) 8)_1) = -1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc12#1.base) 8)_1 Supporting invariants [] [2025-02-06 19:10:48,155 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Ended with exit code 0 [2025-02-06 19:10:48,163 INFO L156 tatePredicateManager]: 5 out of 7 supporting invariants were superfluous and have been removed [2025-02-06 19:10:48,165 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-02-06 19:10:48,166 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-02-06 19:10:48,166 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[#t~malloc12!base,]]] [2025-02-06 19:10:48,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:10:48,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-06 19:10:48,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-06 19:10:48,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:48,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:10:48,192 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-02-06 19:10:48,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:10:48,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:10:48,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:10:48,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:48,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:10:48,352 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-06 19:10:48,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:10:48,367 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:10:48,367 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.5 stem predicates 2 loop predicates [2025-02-06 19:10:48,368 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 43 transitions. cyclomatic complexity: 18 Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 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:10:48,399 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states and 43 transitions. cyclomatic complexity: 18. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 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 34 states and 45 transitions. Complement of second has 5 states. [2025-02-06 19:10:48,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2025-02-06 19:10:48,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 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:10:48,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2025-02-06 19:10:48,401 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 21 letters. Loop has 2 letters. [2025-02-06 19:10:48,401 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:10:48,401 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-06 19:10:48,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:10:48,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-06 19:10:48,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-06 19:10:48,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:48,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:10:48,429 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-02-06 19:10:48,433 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:10:48,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:10:48,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:10:48,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:48,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:10:48,555 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-06 19:10:48,556 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:10:48,572 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:10:48,572 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.5 stem predicates 2 loop predicates [2025-02-06 19:10:48,572 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 43 transitions. cyclomatic complexity: 18 Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 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:10:48,595 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states and 43 transitions. cyclomatic complexity: 18. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 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 34 states and 45 transitions. Complement of second has 5 states. [2025-02-06 19:10:48,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2025-02-06 19:10:48,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 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:10:48,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2025-02-06 19:10:48,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 21 letters. Loop has 2 letters. [2025-02-06 19:10:48,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:10:48,596 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-06 19:10:48,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:10:48,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-06 19:10:48,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-06 19:10:48,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:48,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:10:48,634 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-02-06 19:10:48,635 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:10:48,730 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Ended with exit code 0 [2025-02-06 19:10:48,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:10:48,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:10:48,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:48,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:10:48,772 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-06 19:10:48,773 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:10:48,791 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:10:48,792 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.5 stem predicates 2 loop predicates [2025-02-06 19:10:48,792 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 43 transitions. cyclomatic complexity: 18 Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 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:10:48,881 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states and 43 transitions. cyclomatic complexity: 18. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 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 62 states and 81 transitions. Complement of second has 13 states. [2025-02-06 19:10:48,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 5 stem states 2 non-accepting loop states 2 accepting loop states [2025-02-06 19:10:48,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 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:10:48,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 48 transitions. [2025-02-06 19:10:48,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 48 transitions. Stem has 21 letters. Loop has 2 letters. [2025-02-06 19:10:48,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:10:48,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 48 transitions. Stem has 23 letters. Loop has 2 letters. [2025-02-06 19:10:48,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:10:48,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 48 transitions. Stem has 21 letters. Loop has 4 letters. [2025-02-06 19:10:48,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:10:48,882 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 62 states and 81 transitions. [2025-02-06 19:10:48,883 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2025-02-06 19:10:48,883 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 62 states to 57 states and 76 transitions. [2025-02-06 19:10:48,883 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2025-02-06 19:10:48,883 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2025-02-06 19:10:48,883 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 76 transitions. [2025-02-06 19:10:48,883 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:10:48,883 INFO L218 hiAutomatonCegarLoop]: Abstraction has 57 states and 76 transitions. [2025-02-06 19:10:48,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states and 76 transitions. [2025-02-06 19:10:48,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 42. [2025-02-06 19:10:48,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 41 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:10:48,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 56 transitions. [2025-02-06 19:10:48,885 INFO L240 hiAutomatonCegarLoop]: Abstraction has 42 states and 56 transitions. [2025-02-06 19:10:48,885 INFO L432 stractBuchiCegarLoop]: Abstraction has 42 states and 56 transitions. [2025-02-06 19:10:48,885 INFO L338 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2025-02-06 19:10:48,885 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 56 transitions. [2025-02-06 19:10:48,886 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2025-02-06 19:10:48,886 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:10:48,886 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:10:48,886 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1] [2025-02-06 19:10:48,886 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-06 19:10:48,886 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~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet13#1, main_#t~post14#1, main_~k~0#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet11#1;main_~array_size~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;main_~k~0#1 := 0;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume !(main_~k~0#1 < main_~array_size~0#1);havoc main_~k~0#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~post8#1, test_fun_#t~post9#1, test_fun_#t~post10#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~pos~0#1, test_fun_~neg~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~pos~0#1 := 0;test_fun_~neg~0#1 := 0;test_fun_~i~0#1 := 0;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" [2025-02-06 19:10:48,886 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume test_fun_#t~mem6#1 > 0;havoc test_fun_#t~mem6#1;call test_fun_#t~mem7#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post8#1 := test_fun_#t~mem7#1;call write~int#0(test_fun_#t~post8#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem7#1;havoc test_fun_#t~post8#1;test_fun_#t~post9#1 := test_fun_~pos~0#1;test_fun_~pos~0#1 := 1 + test_fun_#t~post9#1;havoc test_fun_#t~post9#1;" [2025-02-06 19:10:48,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:10:48,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1449720734, now seen corresponding path program 7 times [2025-02-06 19:10:48,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:10:48,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360611189] [2025-02-06 19:10:48,887 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-06 19:10:48,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:10:48,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-06 19:10:48,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 19:10:48,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:48,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:48,896 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:10:48,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-06 19:10:48,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 19:10:48,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:48,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:48,903 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:10:48,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:10:48,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1184, now seen corresponding path program 3 times [2025-02-06 19:10:48,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:10:48,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803304185] [2025-02-06 19:10:48,903 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 19:10:48,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:10:48,905 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:10:48,906 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:10:48,906 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-06 19:10:48,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:48,906 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:10:48,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:10:48,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:10:48,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:48,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:48,908 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:10:48,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:10:48,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1612221247, now seen corresponding path program 2 times [2025-02-06 19:10:48,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:10:48,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768981972] [2025-02-06 19:10:48,909 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:10:48,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:10:48,912 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-02-06 19:10:48,917 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-02-06 19:10:48,918 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 19:10:48,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:48,918 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:10:48,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-06 19:10:48,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-06 19:10:48,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:48,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:48,925 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:10:49,366 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:10:49,367 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:10:49,367 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:10:49,367 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:10:49,367 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-06 19:10:49,367 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:49,367 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:10:49,367 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:10:49,367 INFO L132 ssoRankerPreferences]: Filename of dumped script: array02-alloca-2.i_Iteration12_Lasso [2025-02-06 19:10:49,367 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:10:49,367 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:10:49,368 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:49,372 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:49,373 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:49,374 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:49,375 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:49,377 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:49,378 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:49,379 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:49,381 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:49,382 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:49,383 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:49,384 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:49,385 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:49,388 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:49,389 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:49,390 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:49,391 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:49,393 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:49,394 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:49,395 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:49,398 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:49,399 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:49,556 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:49,558 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:49,806 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:10:49,806 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-06 19:10:49,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:49,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:49,808 INFO L229 MonitoredProcess]: Starting monitored process 97 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:10:49,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Waiting until timeout for monitored process [2025-02-06 19:10:49,810 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:10:49,820 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:49,820 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:49,821 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:49,821 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:49,821 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:49,822 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:49,822 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:49,823 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:49,828 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Ended with exit code 0 [2025-02-06 19:10:49,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:49,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:49,830 INFO L229 MonitoredProcess]: Starting monitored process 98 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:10:49,830 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Waiting until timeout for monitored process [2025-02-06 19:10:49,832 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:10:49,841 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:49,841 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:49,841 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:49,842 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:49,842 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:49,842 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:49,842 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:49,843 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:49,848 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Forceful destruction successful, exit code 0 [2025-02-06 19:10:49,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:49,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:49,850 INFO L229 MonitoredProcess]: Starting monitored process 99 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:10:49,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Waiting until timeout for monitored process [2025-02-06 19:10:49,851 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:10:49,861 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:49,861 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:49,861 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:49,861 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:49,861 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:49,862 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:49,862 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:49,863 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:49,868 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Ended with exit code 0 [2025-02-06 19:10:49,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:49,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:49,870 INFO L229 MonitoredProcess]: Starting monitored process 100 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:10:49,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Waiting until timeout for monitored process [2025-02-06 19:10:49,872 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:10:49,882 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:49,882 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:49,882 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:49,882 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:49,882 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:49,882 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:49,883 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:49,884 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:49,889 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Forceful destruction successful, exit code 0 [2025-02-06 19:10:49,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:49,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:49,891 INFO L229 MonitoredProcess]: Starting monitored process 101 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:10:49,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Waiting until timeout for monitored process [2025-02-06 19:10:49,893 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:10:49,902 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:49,903 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:49,903 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:49,903 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:49,903 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:49,903 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:49,903 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:49,904 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:49,909 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Forceful destruction successful, exit code 0 [2025-02-06 19:10:49,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:49,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:49,911 INFO L229 MonitoredProcess]: Starting monitored process 102 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:10:49,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Waiting until timeout for monitored process [2025-02-06 19:10:49,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:10:49,923 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:49,923 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:49,923 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:49,923 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:49,923 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:49,923 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:49,923 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:49,924 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:49,930 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Ended with exit code 0 [2025-02-06 19:10:49,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:49,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:49,932 INFO L229 MonitoredProcess]: Starting monitored process 103 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:10:49,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Waiting until timeout for monitored process [2025-02-06 19:10:49,937 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:10:49,946 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:49,946 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:49,947 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:49,947 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:49,948 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:10:49,948 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:10:49,950 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:49,955 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Ended with exit code 0 [2025-02-06 19:10:49,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:49,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:49,958 INFO L229 MonitoredProcess]: Starting monitored process 104 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:10:49,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Waiting until timeout for monitored process [2025-02-06 19:10:49,959 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:10:49,969 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:49,969 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:49,969 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:49,969 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:49,969 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:49,969 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:49,969 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:49,970 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:49,976 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Forceful destruction successful, exit code 0 [2025-02-06 19:10:49,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:49,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:49,977 INFO L229 MonitoredProcess]: Starting monitored process 105 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:10:49,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Waiting until timeout for monitored process [2025-02-06 19:10:49,979 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:10:49,989 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:49,989 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:49,989 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:49,989 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:49,989 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:49,989 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:49,989 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:49,990 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:49,996 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Forceful destruction successful, exit code 0 [2025-02-06 19:10:49,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:49,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:49,998 INFO L229 MonitoredProcess]: Starting monitored process 106 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:10:49,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Waiting until timeout for monitored process [2025-02-06 19:10:49,999 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:10:50,009 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:50,009 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:50,009 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:50,009 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:50,009 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:50,010 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:50,010 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:50,011 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:50,017 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Forceful destruction successful, exit code 0 [2025-02-06 19:10:50,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:50,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:50,019 INFO L229 MonitoredProcess]: Starting monitored process 107 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:10:50,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Waiting until timeout for monitored process [2025-02-06 19:10:50,021 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:10:50,030 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:50,030 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:50,031 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:50,031 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:50,031 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:50,031 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:50,031 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:50,032 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:50,037 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Ended with exit code 0 [2025-02-06 19:10:50,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:50,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:50,039 INFO L229 MonitoredProcess]: Starting monitored process 108 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:10:50,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Waiting until timeout for monitored process [2025-02-06 19:10:50,041 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:10:50,051 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:50,051 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:50,051 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:50,051 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:50,051 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:50,051 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:50,051 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:50,052 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:50,057 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Ended with exit code 0 [2025-02-06 19:10:50,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:50,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:50,059 INFO L229 MonitoredProcess]: Starting monitored process 109 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:10:50,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Waiting until timeout for monitored process [2025-02-06 19:10:50,061 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:10:50,071 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:50,071 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:50,071 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:50,071 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:50,073 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:10:50,073 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:10:50,076 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:50,081 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Forceful destruction successful, exit code 0 [2025-02-06 19:10:50,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:50,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:50,083 INFO L229 MonitoredProcess]: Starting monitored process 110 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:10:50,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Waiting until timeout for monitored process [2025-02-06 19:10:50,086 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:10:50,095 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:50,095 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:50,095 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:50,095 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:50,097 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:10:50,097 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:10:50,099 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:50,104 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Ended with exit code 0 [2025-02-06 19:10:50,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:50,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:50,106 INFO L229 MonitoredProcess]: Starting monitored process 111 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:10:50,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Waiting until timeout for monitored process [2025-02-06 19:10:50,109 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:10:50,118 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:50,118 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:50,118 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:50,118 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:50,118 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:50,119 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:50,119 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:50,120 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:50,125 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Ended with exit code 0 [2025-02-06 19:10:50,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:50,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:50,127 INFO L229 MonitoredProcess]: Starting monitored process 112 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:10:50,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Waiting until timeout for monitored process [2025-02-06 19:10:50,129 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:10:50,139 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:50,139 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:50,139 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:50,139 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:50,139 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:50,140 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:50,140 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:50,141 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:50,146 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Ended with exit code 0 [2025-02-06 19:10:50,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:50,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:50,148 INFO L229 MonitoredProcess]: Starting monitored process 113 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:10:50,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Waiting until timeout for monitored process [2025-02-06 19:10:50,151 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:10:50,160 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:50,161 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:50,161 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:50,161 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:50,162 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:10:50,162 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:10:50,164 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:50,169 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Ended with exit code 0 [2025-02-06 19:10:50,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:50,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:50,172 INFO L229 MonitoredProcess]: Starting monitored process 114 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:10:50,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Waiting until timeout for monitored process [2025-02-06 19:10:50,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:10:50,183 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:50,183 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:50,183 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:50,183 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:50,183 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:50,183 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:50,183 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:50,184 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:50,189 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Ended with exit code 0 [2025-02-06 19:10:50,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:50,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:50,191 INFO L229 MonitoredProcess]: Starting monitored process 115 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:10:50,194 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:10:50,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Waiting until timeout for monitored process [2025-02-06 19:10:50,203 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:50,203 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:50,204 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:50,204 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:50,204 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:50,204 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:50,204 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:50,205 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:50,210 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Forceful destruction successful, exit code 0 [2025-02-06 19:10:50,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:50,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:50,212 INFO L229 MonitoredProcess]: Starting monitored process 116 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:10:50,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Waiting until timeout for monitored process [2025-02-06 19:10:50,214 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:10:50,224 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:50,224 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:50,224 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:50,224 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:50,224 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:50,224 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:50,224 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:50,225 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:50,231 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Forceful destruction successful, exit code 0 [2025-02-06 19:10:50,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:50,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:50,233 INFO L229 MonitoredProcess]: Starting monitored process 117 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:10:50,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Waiting until timeout for monitored process [2025-02-06 19:10:50,234 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:10:50,244 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:50,244 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:50,244 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:50,244 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:50,244 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:50,244 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:50,244 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:50,245 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:50,251 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Ended with exit code 0 [2025-02-06 19:10:50,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:50,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:50,253 INFO L229 MonitoredProcess]: Starting monitored process 118 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:10:50,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Waiting until timeout for monitored process [2025-02-06 19:10:50,255 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:10:50,264 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:50,265 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:50,265 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:50,265 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:50,268 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:10:50,268 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:10:50,271 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:50,277 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Ended with exit code 0 [2025-02-06 19:10:50,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:50,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:50,279 INFO L229 MonitoredProcess]: Starting monitored process 119 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:10:50,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Waiting until timeout for monitored process [2025-02-06 19:10:50,280 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:10:50,290 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:50,290 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:50,290 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:50,290 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:50,297 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:10:50,297 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:10:50,303 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-06 19:10:50,324 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2025-02-06 19:10:50,324 INFO L444 ModelExtractionUtils]: 2 out of 13 variables were initially zero. Simplification set additionally 9 variables to zero. [2025-02-06 19:10:50,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:50,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:50,326 INFO L229 MonitoredProcess]: Starting monitored process 120 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:10:50,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Waiting until timeout for monitored process [2025-02-06 19:10:50,328 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-06 19:10:50,338 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-02-06 19:10:50,338 INFO L474 LassoAnalysis]: Proved termination. [2025-02-06 19:10:50,338 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc12#1.base) 8)_2) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc12#1.base) 8)_2 Supporting invariants [] [2025-02-06 19:10:50,344 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Ended with exit code 0 [2025-02-06 19:10:50,363 INFO L156 tatePredicateManager]: 5 out of 7 supporting invariants were superfluous and have been removed [2025-02-06 19:10:50,367 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-02-06 19:10:50,367 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-02-06 19:10:50,367 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[#t~malloc12!base,]]] [2025-02-06 19:10:50,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:10:50,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-06 19:10:50,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 19:10:50,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:50,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:10:50,401 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-02-06 19:10:50,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:10:50,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:10:50,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:10:50,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:50,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:10:50,531 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-06 19:10:50,531 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:10:50,549 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:10:50,550 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.5 stem predicates 2 loop predicates [2025-02-06 19:10:50,550 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 56 transitions. cyclomatic complexity: 24 Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 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:10:50,575 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 56 transitions. cyclomatic complexity: 24. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 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 43 states and 58 transitions. Complement of second has 5 states. [2025-02-06 19:10:50,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2025-02-06 19:10:50,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 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:10:50,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2025-02-06 19:10:50,576 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 23 letters. Loop has 2 letters. [2025-02-06 19:10:50,576 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:10:50,576 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-06 19:10:50,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:10:50,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-06 19:10:50,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 19:10:50,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:50,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:10:50,609 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-02-06 19:10:50,609 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:10:50,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:10:50,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:10:50,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:50,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:10:50,737 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-06 19:10:50,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:10:50,756 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:10:50,756 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.5 stem predicates 2 loop predicates [2025-02-06 19:10:50,757 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 56 transitions. cyclomatic complexity: 24 Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 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:10:50,782 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 56 transitions. cyclomatic complexity: 24. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 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 43 states and 58 transitions. Complement of second has 5 states. [2025-02-06 19:10:50,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2025-02-06 19:10:50,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 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:10:50,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2025-02-06 19:10:50,782 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 23 letters. Loop has 2 letters. [2025-02-06 19:10:50,783 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:10:50,783 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-06 19:10:50,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:10:50,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-06 19:10:50,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 19:10:50,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:50,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:10:50,815 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-02-06 19:10:50,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:10:50,899 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Forceful destruction successful, exit code 0 [2025-02-06 19:10:50,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:10:50,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:10:50,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:50,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:10:50,952 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-06 19:10:50,952 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:10:50,970 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:10:50,971 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.5 stem predicates 2 loop predicates [2025-02-06 19:10:50,971 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 56 transitions. cyclomatic complexity: 24 Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 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:10:51,062 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 56 transitions. cyclomatic complexity: 24. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 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 56 states and 74 transitions. Complement of second has 13 states. [2025-02-06 19:10:51,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 5 stem states 2 non-accepting loop states 2 accepting loop states [2025-02-06 19:10:51,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 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:10:51,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 46 transitions. [2025-02-06 19:10:51,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 46 transitions. Stem has 23 letters. Loop has 2 letters. [2025-02-06 19:10:51,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:10:51,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 46 transitions. Stem has 25 letters. Loop has 2 letters. [2025-02-06 19:10:51,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:10:51,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 46 transitions. Stem has 23 letters. Loop has 4 letters. [2025-02-06 19:10:51,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:10:51,063 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 74 transitions. [2025-02-06 19:10:51,063 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2025-02-06 19:10:51,064 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 47 states and 61 transitions. [2025-02-06 19:10:51,064 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2025-02-06 19:10:51,064 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2025-02-06 19:10:51,064 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 61 transitions. [2025-02-06 19:10:51,064 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:10:51,064 INFO L218 hiAutomatonCegarLoop]: Abstraction has 47 states and 61 transitions. [2025-02-06 19:10:51,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 61 transitions. [2025-02-06 19:10:51,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 41. [2025-02-06 19:10:51,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 40 states have internal predecessors, (53), 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:10:51,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 53 transitions. [2025-02-06 19:10:51,065 INFO L240 hiAutomatonCegarLoop]: Abstraction has 41 states and 53 transitions. [2025-02-06 19:10:51,065 INFO L432 stractBuchiCegarLoop]: Abstraction has 41 states and 53 transitions. [2025-02-06 19:10:51,065 INFO L338 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2025-02-06 19:10:51,065 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 53 transitions. [2025-02-06 19:10:51,066 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2025-02-06 19:10:51,066 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:10:51,066 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:10:51,066 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1] [2025-02-06 19:10:51,066 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-06 19:10:51,066 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~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet13#1, main_#t~post14#1, main_~k~0#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet11#1;main_~array_size~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;main_~k~0#1 := 0;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume !(main_~k~0#1 < main_~array_size~0#1);havoc main_~k~0#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~post8#1, test_fun_#t~post9#1, test_fun_#t~post10#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~pos~0#1, test_fun_~neg~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~pos~0#1 := 0;test_fun_~neg~0#1 := 0;test_fun_~i~0#1 := 0;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" [2025-02-06 19:10:51,066 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume test_fun_#t~mem2#1 < 0;havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(1 + test_fun_#t~post4#1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~neg~0#1;test_fun_~neg~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1;" [2025-02-06 19:10:51,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:10:51,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1138574605, now seen corresponding path program 8 times [2025-02-06 19:10:51,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:10:51,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799990440] [2025-02-06 19:10:51,066 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:10:51,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:10:51,071 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-02-06 19:10:51,076 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 19:10:51,076 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 19:10:51,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:10:51,211 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 8 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:10:51,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:10:51,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799990440] [2025-02-06 19:10:51,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799990440] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:10:51,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [88451366] [2025-02-06 19:10:51,211 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:10:51,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:10:51,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:51,213 INFO L229 MonitoredProcess]: Starting monitored process 121 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:10:51,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (121)] Waiting until timeout for monitored process [2025-02-06 19:10:51,262 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-02-06 19:10:51,274 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 19:10:51,274 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 19:10:51,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:10:51,275 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-06 19:10:51,276 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:10:51,401 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 21 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:10:51,401 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:10:51,447 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 21 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:10:51,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [88451366] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:10:51,447 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:10:51,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2025-02-06 19:10:51,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994618360] [2025-02-06 19:10:51,447 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:10:51,447 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-06 19:10:51,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:10:51,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1376, now seen corresponding path program 6 times [2025-02-06 19:10:51,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:10:51,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107736037] [2025-02-06 19:10:51,448 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 19:10:51,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:10:51,451 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:10:51,452 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:10:51,452 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-02-06 19:10:51,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:51,452 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:10:51,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:10:51,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:10:51,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:51,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:51,454 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:10:51,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:10:51,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-06 19:10:51,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2025-02-06 19:10:51,503 INFO L87 Difference]: Start difference. First operand 41 states and 53 transitions. cyclomatic complexity: 22 Second operand has 16 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 16 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:10:51,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:10:51,578 INFO L93 Difference]: Finished difference Result 67 states and 85 transitions. [2025-02-06 19:10:51,578 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 85 transitions. [2025-02-06 19:10:51,579 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2025-02-06 19:10:51,579 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 42 states and 54 transitions. [2025-02-06 19:10:51,579 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2025-02-06 19:10:51,579 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2025-02-06 19:10:51,579 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 54 transitions. [2025-02-06 19:10:51,579 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:10:51,579 INFO L218 hiAutomatonCegarLoop]: Abstraction has 42 states and 54 transitions. [2025-02-06 19:10:51,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 54 transitions. [2025-02-06 19:10:51,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2025-02-06 19:10:51,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 1.2857142857142858) internal successors, (54), 41 states have internal predecessors, (54), 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:10:51,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 54 transitions. [2025-02-06 19:10:51,581 INFO L240 hiAutomatonCegarLoop]: Abstraction has 42 states and 54 transitions. [2025-02-06 19:10:51,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 19:10:51,586 INFO L432 stractBuchiCegarLoop]: Abstraction has 42 states and 54 transitions. [2025-02-06 19:10:51,586 INFO L338 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2025-02-06 19:10:51,586 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 54 transitions. [2025-02-06 19:10:51,586 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2025-02-06 19:10:51,586 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:10:51,586 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:10:51,587 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1] [2025-02-06 19:10:51,587 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-06 19:10:51,587 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet13#1, main_#t~post14#1, main_~k~0#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet11#1;main_~array_size~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;main_~k~0#1 := 0;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume !(main_~k~0#1 < main_~array_size~0#1);havoc main_~k~0#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~post8#1, test_fun_#t~post9#1, test_fun_#t~post10#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~pos~0#1, test_fun_~neg~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~pos~0#1 := 0;test_fun_~neg~0#1 := 0;test_fun_~i~0#1 := 0;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" [2025-02-06 19:10:51,587 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume test_fun_#t~mem2#1 < 0;havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(1 + test_fun_#t~post4#1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~neg~0#1;test_fun_~neg~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1;" [2025-02-06 19:10:51,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:10:51,587 INFO L85 PathProgramCache]: Analyzing trace with hash -543736073, now seen corresponding path program 9 times [2025-02-06 19:10:51,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:10:51,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513961161] [2025-02-06 19:10:51,588 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 19:10:51,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:10:51,594 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 4 equivalence classes. [2025-02-06 19:10:51,606 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 28 of 28 statements. [2025-02-06 19:10:51,607 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-02-06 19:10:51,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:51,607 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:10:51,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-06 19:10:51,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-06 19:10:51,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:51,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:51,614 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:10:51,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:10:51,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1376, now seen corresponding path program 7 times [2025-02-06 19:10:51,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:10:51,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73247832] [2025-02-06 19:10:51,615 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-06 19:10:51,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:10:51,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:10:51,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:10:51,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:51,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:51,619 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:10:51,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:10:51,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:10:51,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:51,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:51,620 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:10:51,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:10:51,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1455644374, now seen corresponding path program 3 times [2025-02-06 19:10:51,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:10:51,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913473332] [2025-02-06 19:10:51,621 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 19:10:51,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:10:51,629 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 4 equivalence classes. [2025-02-06 19:10:51,641 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 19:10:51,641 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-02-06 19:10:51,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:51,641 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:10:51,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 19:10:51,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 19:10:51,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:51,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:51,649 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:10:52,271 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:10:52,272 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:10:52,272 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:10:52,272 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:10:52,272 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-06 19:10:52,272 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:52,272 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:10:52,272 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:10:52,272 INFO L132 ssoRankerPreferences]: Filename of dumped script: array02-alloca-2.i_Iteration14_Lasso [2025-02-06 19:10:52,272 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:10:52,272 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:10:52,273 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:52,274 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:52,275 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:52,276 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:52,278 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:52,279 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:52,280 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:52,282 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:52,283 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:52,285 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:52,287 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:52,291 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:52,292 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:52,294 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:52,295 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:52,301 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:52,302 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:52,447 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:52,448 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:52,449 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:52,451 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:52,452 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:52,453 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:52,456 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:52,654 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:10:52,654 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-06 19:10:52,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:52,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:52,656 INFO L229 MonitoredProcess]: Starting monitored process 122 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:10:52,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Waiting until timeout for monitored process [2025-02-06 19:10:52,658 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:10:52,668 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:52,668 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:52,668 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:52,668 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:52,668 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:52,668 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:52,668 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:52,669 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:52,675 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Forceful destruction successful, exit code 0 [2025-02-06 19:10:52,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:52,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:52,677 INFO L229 MonitoredProcess]: Starting monitored process 123 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:10:52,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Waiting until timeout for monitored process [2025-02-06 19:10:52,678 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:10:52,688 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:52,688 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:52,688 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:52,688 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:52,688 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:52,688 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:52,688 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:52,689 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:52,695 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Ended with exit code 0 [2025-02-06 19:10:52,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:52,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:52,697 INFO L229 MonitoredProcess]: Starting monitored process 124 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:10:52,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Waiting until timeout for monitored process [2025-02-06 19:10:52,698 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:10:52,709 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:52,709 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:52,709 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:52,709 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:52,709 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:52,709 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:52,709 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:52,710 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:52,715 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Forceful destruction successful, exit code 0 [2025-02-06 19:10:52,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:52,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:52,718 INFO L229 MonitoredProcess]: Starting monitored process 125 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:10:52,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Waiting until timeout for monitored process [2025-02-06 19:10:52,720 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:10:52,729 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:52,729 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:52,729 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:52,729 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:52,730 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:10:52,730 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:10:52,733 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:52,738 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Ended with exit code 0 [2025-02-06 19:10:52,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:52,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:52,740 INFO L229 MonitoredProcess]: Starting monitored process 126 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:10:52,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Waiting until timeout for monitored process [2025-02-06 19:10:52,742 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:10:52,752 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:52,752 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:52,752 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:52,752 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:52,752 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:52,752 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:52,752 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:52,753 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:52,758 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Forceful destruction successful, exit code 0 [2025-02-06 19:10:52,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:52,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:52,760 INFO L229 MonitoredProcess]: Starting monitored process 127 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:10:52,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Waiting until timeout for monitored process [2025-02-06 19:10:52,762 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:10:52,772 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:52,772 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:52,772 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:52,772 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:52,772 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:52,773 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:52,773 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:52,774 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:52,779 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Ended with exit code 0 [2025-02-06 19:10:52,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:52,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:52,783 INFO L229 MonitoredProcess]: Starting monitored process 128 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:10:52,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Waiting until timeout for monitored process [2025-02-06 19:10:52,785 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:10:52,795 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:52,795 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:52,795 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:52,795 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:52,795 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:52,795 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:52,795 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:52,796 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:52,801 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Forceful destruction successful, exit code 0 [2025-02-06 19:10:52,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:52,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:52,803 INFO L229 MonitoredProcess]: Starting monitored process 129 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:10:52,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Waiting until timeout for monitored process [2025-02-06 19:10:52,805 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:10:52,814 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:52,815 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:52,815 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:52,815 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:52,815 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:52,815 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:52,815 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:52,816 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:52,821 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Forceful destruction successful, exit code 0 [2025-02-06 19:10:52,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:52,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:52,823 INFO L229 MonitoredProcess]: Starting monitored process 130 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:10:52,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Waiting until timeout for monitored process [2025-02-06 19:10:52,825 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:10:52,834 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:52,835 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:52,835 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:52,835 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:52,836 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:10:52,836 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:10:52,839 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:52,844 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Forceful destruction successful, exit code 0 [2025-02-06 19:10:52,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:52,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:52,848 INFO L229 MonitoredProcess]: Starting monitored process 131 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:10:52,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Waiting until timeout for monitored process [2025-02-06 19:10:52,849 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:10:52,859 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:52,859 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:52,859 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:52,859 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:52,861 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:10:52,861 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:10:52,863 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:52,868 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Ended with exit code 0 [2025-02-06 19:10:52,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:52,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:52,870 INFO L229 MonitoredProcess]: Starting monitored process 132 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:10:52,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Waiting until timeout for monitored process [2025-02-06 19:10:52,871 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:10:52,881 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:52,881 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:52,881 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:52,881 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:52,881 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:52,881 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:52,881 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:52,882 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:52,890 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Forceful destruction successful, exit code 0 [2025-02-06 19:10:52,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:52,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:52,893 INFO L229 MonitoredProcess]: Starting monitored process 133 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:10:52,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Waiting until timeout for monitored process [2025-02-06 19:10:52,894 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:10:52,904 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:52,904 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:52,904 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:52,904 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:52,904 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:52,905 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:52,905 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:52,906 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:52,911 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Forceful destruction successful, exit code 0 [2025-02-06 19:10:52,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:52,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:52,913 INFO L229 MonitoredProcess]: Starting monitored process 134 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:10:52,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Waiting until timeout for monitored process [2025-02-06 19:10:52,915 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:10:52,924 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:52,924 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:52,924 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:52,924 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:52,924 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:52,925 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:52,925 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:52,926 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:52,931 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Ended with exit code 0 [2025-02-06 19:10:52,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:52,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:52,934 INFO L229 MonitoredProcess]: Starting monitored process 135 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:10:52,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Waiting until timeout for monitored process [2025-02-06 19:10:52,935 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:10:52,944 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:52,945 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:52,945 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:52,945 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:52,945 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:52,945 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:52,945 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:52,946 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:52,951 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Ended with exit code 0 [2025-02-06 19:10:52,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:52,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:52,953 INFO L229 MonitoredProcess]: Starting monitored process 136 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:10:52,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Waiting until timeout for monitored process [2025-02-06 19:10:52,955 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:10:52,964 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:52,964 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:52,964 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:52,964 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:52,965 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:10:52,965 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:10:52,967 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:52,973 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Ended with exit code 0 [2025-02-06 19:10:52,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:52,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:52,975 INFO L229 MonitoredProcess]: Starting monitored process 137 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:10:52,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (137)] Waiting until timeout for monitored process [2025-02-06 19:10:52,976 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:10:52,986 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:52,986 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:52,986 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:52,986 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:52,986 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:52,987 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:52,987 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:52,988 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:52,993 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (137)] Ended with exit code 0 [2025-02-06 19:10:52,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:52,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:52,995 INFO L229 MonitoredProcess]: Starting monitored process 138 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:10:52,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (138)] Waiting until timeout for monitored process [2025-02-06 19:10:52,997 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:10:53,007 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:53,007 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:53,007 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:53,007 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:53,008 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:10:53,008 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:10:53,010 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:53,016 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (138)] Forceful destruction successful, exit code 0 [2025-02-06 19:10:53,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:53,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:53,018 INFO L229 MonitoredProcess]: Starting monitored process 139 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:10:53,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (139)] Waiting until timeout for monitored process [2025-02-06 19:10:53,020 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:10:53,030 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:53,030 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:53,030 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:53,030 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:53,032 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:10:53,032 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:10:53,036 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-06 19:10:53,040 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-02-06 19:10:53,041 INFO L444 ModelExtractionUtils]: 5 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-02-06 19:10:53,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:53,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:53,043 INFO L229 MonitoredProcess]: Starting monitored process 140 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:10:53,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (140)] Waiting until timeout for monitored process [2025-02-06 19:10:53,044 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-06 19:10:53,054 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-02-06 19:10:53,055 INFO L474 LassoAnalysis]: Proved termination. [2025-02-06 19:10:53,055 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_test_fun_~a#1.base) 12)_1) = -1*v_rep(select (select #memory_int#0 ULTIMATE.start_test_fun_~a#1.base) 12)_1 Supporting invariants [] [2025-02-06 19:10:53,060 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (139)] Forceful destruction successful, exit code 0 [2025-02-06 19:10:53,076 INFO L156 tatePredicateManager]: 7 out of 8 supporting invariants were superfluous and have been removed [2025-02-06 19:10:53,078 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-02-06 19:10:53,078 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-02-06 19:10:53,078 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~a!base,]]] [2025-02-06 19:10:53,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:10:53,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-06 19:10:53,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-06 19:10:53,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:53,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:10:53,113 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-06 19:10:53,113 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:10:53,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:10:53,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:10:53,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:53,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:10:53,216 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 19:10:53,216 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:10:53,230 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:10:53,231 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.6 stem predicates 2 loop predicates [2025-02-06 19:10:53,231 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 54 transitions. cyclomatic complexity: 22 Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:10:53,247 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 54 transitions. cyclomatic complexity: 22. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 43 states and 56 transitions. Complement of second has 5 states. [2025-02-06 19:10:53,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2025-02-06 19:10:53,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:10:53,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2025-02-06 19:10:53,250 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 28 letters. Loop has 2 letters. [2025-02-06 19:10:53,250 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:10:53,250 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-06 19:10:53,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:10:53,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-06 19:10:53,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-06 19:10:53,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:53,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:10:53,282 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-06 19:10:53,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:10:53,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:10:53,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:10:53,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:53,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:10:53,419 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 19:10:53,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:10:53,433 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:10:53,434 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.6 stem predicates 2 loop predicates [2025-02-06 19:10:53,434 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 54 transitions. cyclomatic complexity: 22 Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:10:53,452 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 54 transitions. cyclomatic complexity: 22. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 43 states and 56 transitions. Complement of second has 5 states. [2025-02-06 19:10:53,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2025-02-06 19:10:53,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:10:53,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2025-02-06 19:10:53,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 28 letters. Loop has 2 letters. [2025-02-06 19:10:53,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:10:53,453 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-06 19:10:53,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:10:53,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-06 19:10:53,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-06 19:10:53,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:53,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:10:53,489 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-06 19:10:53,489 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:10:53,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:10:53,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:10:53,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:53,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:10:53,614 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 19:10:53,614 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:10:53,642 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (140)] Ended with exit code 0 [2025-02-06 19:10:53,654 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:10:53,655 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.6 stem predicates 2 loop predicates [2025-02-06 19:10:53,655 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 54 transitions. cyclomatic complexity: 22 Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:10:53,760 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 54 transitions. cyclomatic complexity: 22. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 72 states and 94 transitions. Complement of second has 15 states. [2025-02-06 19:10:53,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 6 stem states 2 non-accepting loop states 2 accepting loop states [2025-02-06 19:10:53,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:10:53,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 57 transitions. [2025-02-06 19:10:53,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 57 transitions. Stem has 28 letters. Loop has 2 letters. [2025-02-06 19:10:53,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:10:53,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 57 transitions. Stem has 30 letters. Loop has 2 letters. [2025-02-06 19:10:53,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:10:53,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 57 transitions. Stem has 28 letters. Loop has 4 letters. [2025-02-06 19:10:53,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:10:53,762 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72 states and 94 transitions. [2025-02-06 19:10:53,763 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2025-02-06 19:10:53,763 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72 states to 67 states and 89 transitions. [2025-02-06 19:10:53,763 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2025-02-06 19:10:53,764 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2025-02-06 19:10:53,764 INFO L73 IsDeterministic]: Start isDeterministic. Operand 67 states and 89 transitions. [2025-02-06 19:10:53,764 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:10:53,764 INFO L218 hiAutomatonCegarLoop]: Abstraction has 67 states and 89 transitions. [2025-02-06 19:10:53,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states and 89 transitions. [2025-02-06 19:10:53,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 51. [2025-02-06 19:10:53,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 51 states have (on average 1.3137254901960784) internal successors, (67), 50 states have internal predecessors, (67), 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:10:53,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 67 transitions. [2025-02-06 19:10:53,768 INFO L240 hiAutomatonCegarLoop]: Abstraction has 51 states and 67 transitions. [2025-02-06 19:10:53,768 INFO L432 stractBuchiCegarLoop]: Abstraction has 51 states and 67 transitions. [2025-02-06 19:10:53,768 INFO L338 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2025-02-06 19:10:53,768 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 67 transitions. [2025-02-06 19:10:53,768 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2025-02-06 19:10:53,769 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:10:53,769 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:10:53,769 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1] [2025-02-06 19:10:53,769 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-06 19:10:53,769 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~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet13#1, main_#t~post14#1, main_~k~0#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet11#1;main_~array_size~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;main_~k~0#1 := 0;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume !(main_~k~0#1 < main_~array_size~0#1);havoc main_~k~0#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~post8#1, test_fun_#t~post9#1, test_fun_#t~post10#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~pos~0#1, test_fun_~neg~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~pos~0#1 := 0;test_fun_~neg~0#1 := 0;test_fun_~i~0#1 := 0;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" [2025-02-06 19:10:53,769 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume test_fun_#t~mem6#1 > 0;havoc test_fun_#t~mem6#1;call test_fun_#t~mem7#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post8#1 := test_fun_#t~mem7#1;call write~int#0(test_fun_#t~post8#1 - 1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem7#1;havoc test_fun_#t~post8#1;test_fun_#t~post9#1 := test_fun_~pos~0#1;test_fun_~pos~0#1 := 1 + test_fun_#t~post9#1;havoc test_fun_#t~post9#1;" [2025-02-06 19:10:53,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:10:53,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1455644373, now seen corresponding path program 10 times [2025-02-06 19:10:53,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:10:53,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959140497] [2025-02-06 19:10:53,770 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 19:10:53,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:10:53,776 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-02-06 19:10:53,782 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 19:10:53,782 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 19:10:53,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:53,783 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:10:53,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 19:10:53,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 19:10:53,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:53,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:53,789 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:10:53,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:10:53,790 INFO L85 PathProgramCache]: Analyzing trace with hash 1184, now seen corresponding path program 4 times [2025-02-06 19:10:53,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:10:53,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807860302] [2025-02-06 19:10:53,790 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 19:10:53,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:10:53,792 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 2 statements into 2 equivalence classes. [2025-02-06 19:10:53,793 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:10:53,793 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 19:10:53,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:53,793 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:10:53,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:10:53,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:10:53,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:53,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:53,795 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:10:53,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:10:53,795 INFO L85 PathProgramCache]: Analyzing trace with hash -1285095820, now seen corresponding path program 3 times [2025-02-06 19:10:53,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:10:53,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94797389] [2025-02-06 19:10:53,795 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 19:10:53,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:10:53,799 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 32 statements into 4 equivalence classes. [2025-02-06 19:10:53,808 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 32 of 32 statements. [2025-02-06 19:10:53,808 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-02-06 19:10:53,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:53,808 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:10:53,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-06 19:10:53,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-06 19:10:53,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:53,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:53,815 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:10:54,815 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:10:54,816 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:10:54,816 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:10:54,816 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:10:54,816 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-06 19:10:54,816 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:54,816 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:10:54,816 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:10:54,816 INFO L132 ssoRankerPreferences]: Filename of dumped script: array02-alloca-2.i_Iteration15_Lasso [2025-02-06 19:10:54,816 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:10:54,816 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:10:54,817 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:54,820 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:54,821 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:54,822 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:54,824 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:54,825 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:54,827 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:54,828 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:54,829 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:54,831 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:54,832 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:54,833 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:54,835 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:54,836 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:54,838 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:54,839 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:54,840 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:54,842 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:54,843 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:54,844 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:54,845 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:54,847 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:55,107 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:55,108 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:55,396 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:10:55,396 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-06 19:10:55,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:55,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:55,398 INFO L229 MonitoredProcess]: Starting monitored process 141 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:10:55,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (141)] Waiting until timeout for monitored process [2025-02-06 19:10:55,400 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:10:55,410 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:55,411 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:55,411 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:55,411 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:55,412 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:10:55,412 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:10:55,415 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:55,420 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (141)] Forceful destruction successful, exit code 0 [2025-02-06 19:10:55,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:55,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:55,422 INFO L229 MonitoredProcess]: Starting monitored process 142 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:10:55,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (142)] Waiting until timeout for monitored process [2025-02-06 19:10:55,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:10:55,433 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:55,434 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:55,434 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:55,434 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:55,434 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:55,434 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:55,434 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:55,435 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:55,441 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (142)] Ended with exit code 0 [2025-02-06 19:10:55,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:55,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:55,443 INFO L229 MonitoredProcess]: Starting monitored process 143 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:10:55,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (143)] Waiting until timeout for monitored process [2025-02-06 19:10:55,444 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:10:55,454 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:55,454 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:55,454 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:55,454 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:55,454 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:55,455 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:55,455 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:55,457 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:55,462 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (143)] Forceful destruction successful, exit code 0 [2025-02-06 19:10:55,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:55,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:55,464 INFO L229 MonitoredProcess]: Starting monitored process 144 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:10:55,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (144)] Waiting until timeout for monitored process [2025-02-06 19:10:55,465 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:10:55,475 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:55,475 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:55,475 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:55,475 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:55,477 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:10:55,477 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:10:55,479 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:55,484 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (144)] Forceful destruction successful, exit code 0 [2025-02-06 19:10:55,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:55,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:55,486 INFO L229 MonitoredProcess]: Starting monitored process 145 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:10:55,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (145)] Waiting until timeout for monitored process [2025-02-06 19:10:55,487 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:10:55,497 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:55,497 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:55,497 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:55,497 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:55,497 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:55,497 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:55,498 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:55,498 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:55,504 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (145)] Forceful destruction successful, exit code 0 [2025-02-06 19:10:55,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:55,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:55,506 INFO L229 MonitoredProcess]: Starting monitored process 146 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:10:55,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (146)] Waiting until timeout for monitored process [2025-02-06 19:10:55,508 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:10:55,518 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:55,518 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:55,518 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:55,518 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:55,518 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:55,518 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:55,518 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:55,519 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:55,525 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (146)] Forceful destruction successful, exit code 0 [2025-02-06 19:10:55,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:55,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:55,527 INFO L229 MonitoredProcess]: Starting monitored process 147 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:10:55,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (147)] Waiting until timeout for monitored process [2025-02-06 19:10:55,528 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:10:55,538 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:55,539 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:55,539 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:55,539 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:55,539 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:55,539 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:55,539 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:55,540 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:55,546 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (147)] Ended with exit code 0 [2025-02-06 19:10:55,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:55,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:55,548 INFO L229 MonitoredProcess]: Starting monitored process 148 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:10:55,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (148)] Waiting until timeout for monitored process [2025-02-06 19:10:55,550 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:10:55,559 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:55,560 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:55,560 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:55,560 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:55,561 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:10:55,561 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:10:55,563 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:55,568 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (148)] Ended with exit code 0 [2025-02-06 19:10:55,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:55,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:55,570 INFO L229 MonitoredProcess]: Starting monitored process 149 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:10:55,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (149)] Waiting until timeout for monitored process [2025-02-06 19:10:55,572 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:10:55,581 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:55,581 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:55,581 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:55,581 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:55,581 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:55,581 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:55,581 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:55,582 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:55,588 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (149)] Forceful destruction successful, exit code 0 [2025-02-06 19:10:55,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:55,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:55,590 INFO L229 MonitoredProcess]: Starting monitored process 150 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:10:55,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (150)] Waiting until timeout for monitored process [2025-02-06 19:10:55,592 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:10:55,601 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:55,601 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:55,601 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:55,601 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:55,602 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:55,602 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:55,602 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:55,603 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:55,608 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (150)] Forceful destruction successful, exit code 0 [2025-02-06 19:10:55,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:55,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:55,611 INFO L229 MonitoredProcess]: Starting monitored process 151 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:10:55,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (151)] Waiting until timeout for monitored process [2025-02-06 19:10:55,612 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:10:55,621 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:55,622 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:55,622 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:55,622 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:55,622 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:55,622 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:55,622 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:55,623 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:55,628 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (151)] Ended with exit code 0 [2025-02-06 19:10:55,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:55,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:55,631 INFO L229 MonitoredProcess]: Starting monitored process 152 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:10:55,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (152)] Waiting until timeout for monitored process [2025-02-06 19:10:55,632 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:10:55,642 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:55,642 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:55,642 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:55,642 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:55,642 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:55,642 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:55,642 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:55,643 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:55,650 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (152)] Forceful destruction successful, exit code 0 [2025-02-06 19:10:55,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:55,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:55,652 INFO L229 MonitoredProcess]: Starting monitored process 153 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:10:55,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (153)] Waiting until timeout for monitored process [2025-02-06 19:10:55,654 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:10:55,664 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:55,664 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:55,664 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:55,664 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:55,666 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:10:55,666 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:10:55,668 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:55,674 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (153)] Ended with exit code 0 [2025-02-06 19:10:55,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:55,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:55,676 INFO L229 MonitoredProcess]: Starting monitored process 154 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:10:55,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (154)] Waiting until timeout for monitored process [2025-02-06 19:10:55,677 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:10:55,687 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:55,687 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:55,687 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:55,687 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:55,687 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:55,687 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:55,687 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:55,688 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:55,694 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (154)] Ended with exit code 0 [2025-02-06 19:10:55,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:55,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:55,696 INFO L229 MonitoredProcess]: Starting monitored process 155 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:10:55,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (155)] Waiting until timeout for monitored process [2025-02-06 19:10:55,697 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:10:55,706 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:55,706 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:55,707 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:55,707 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:55,707 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:55,707 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:55,707 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:55,708 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:55,713 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (155)] Ended with exit code 0 [2025-02-06 19:10:55,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:55,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:55,715 INFO L229 MonitoredProcess]: Starting monitored process 156 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:10:55,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (156)] Waiting until timeout for monitored process [2025-02-06 19:10:55,716 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:10:55,726 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:55,726 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:55,726 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:55,726 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:55,726 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:55,727 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:55,727 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:55,728 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:55,734 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (156)] Ended with exit code 0 [2025-02-06 19:10:55,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:55,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:55,736 INFO L229 MonitoredProcess]: Starting monitored process 157 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:10:55,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (157)] Waiting until timeout for monitored process [2025-02-06 19:10:55,737 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:10:55,747 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:55,747 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:55,747 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:55,747 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:55,747 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:55,747 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:55,748 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:55,749 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:55,754 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (157)] Forceful destruction successful, exit code 0 [2025-02-06 19:10:55,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:55,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:55,756 INFO L229 MonitoredProcess]: Starting monitored process 158 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:10:55,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (158)] Waiting until timeout for monitored process [2025-02-06 19:10:55,757 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:10:55,767 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:55,767 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:55,767 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:55,767 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:55,767 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:55,767 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:55,767 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:55,768 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:55,774 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (158)] Ended with exit code 0 [2025-02-06 19:10:55,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:55,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:55,776 INFO L229 MonitoredProcess]: Starting monitored process 159 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:10:55,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (159)] Waiting until timeout for monitored process [2025-02-06 19:10:55,777 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:10:55,787 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:55,787 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:55,787 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:55,787 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:55,787 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:55,787 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:55,788 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:55,788 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:55,794 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (159)] Ended with exit code 0 [2025-02-06 19:10:55,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:55,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:55,796 INFO L229 MonitoredProcess]: Starting monitored process 160 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:10:55,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (160)] Waiting until timeout for monitored process [2025-02-06 19:10:55,798 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:10:55,807 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:55,807 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:55,807 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:55,808 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:55,808 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:55,808 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:55,808 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:55,809 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:55,814 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (160)] Ended with exit code 0 [2025-02-06 19:10:55,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:55,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:55,817 INFO L229 MonitoredProcess]: Starting monitored process 161 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:10:55,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (161)] Waiting until timeout for monitored process [2025-02-06 19:10:55,819 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:10:55,829 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:55,829 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:55,829 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:55,829 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:55,830 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:10:55,830 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:10:55,832 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:55,838 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (161)] Ended with exit code 0 [2025-02-06 19:10:55,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:55,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:55,840 INFO L229 MonitoredProcess]: Starting monitored process 162 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:10:55,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (162)] Waiting until timeout for monitored process [2025-02-06 19:10:55,842 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:10:55,852 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:55,852 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:55,852 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:55,852 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:55,858 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:10:55,858 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:10:55,871 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:55,881 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (162)] Ended with exit code 0 [2025-02-06 19:10:55,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:55,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:55,883 INFO L229 MonitoredProcess]: Starting monitored process 163 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:10:55,885 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:10:55,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (163)] Waiting until timeout for monitored process [2025-02-06 19:10:55,902 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:55,902 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:55,902 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:55,902 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:55,906 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:10:55,906 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:10:55,910 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:55,922 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (163)] Ended with exit code 0 [2025-02-06 19:10:55,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:55,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:55,926 INFO L229 MonitoredProcess]: Starting monitored process 164 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:10:55,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (164)] Waiting until timeout for monitored process [2025-02-06 19:10:55,930 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:10:55,940 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:55,940 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:55,940 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:55,940 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:55,942 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:10:55,942 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:10:55,946 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:55,954 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (164)] Forceful destruction successful, exit code 0 [2025-02-06 19:10:55,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:55,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:55,958 INFO L229 MonitoredProcess]: Starting monitored process 165 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:10:55,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (165)] Waiting until timeout for monitored process [2025-02-06 19:10:55,959 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:10:55,969 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:55,969 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:55,969 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:55,969 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:55,973 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:10:55,973 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:10:55,978 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-06 19:10:55,990 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2025-02-06 19:10:55,990 INFO L444 ModelExtractionUtils]: 4 out of 13 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-02-06 19:10:55,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:55,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:55,996 INFO L229 MonitoredProcess]: Starting monitored process 166 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:10:55,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (166)] Waiting until timeout for monitored process [2025-02-06 19:10:55,997 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-06 19:10:56,008 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-02-06 19:10:56,008 INFO L474 LassoAnalysis]: Proved termination. [2025-02-06 19:10:56,008 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_test_fun_~a#1.base) (* ULTIMATE.start_test_fun_~i~0#1 4))_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_test_fun_~a#1.base) (* ULTIMATE.start_test_fun_~i~0#1 4))_1 Supporting invariants [] [2025-02-06 19:10:56,014 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (165)] Ended with exit code 0 [2025-02-06 19:10:56,081 INFO L156 tatePredicateManager]: 18 out of 19 supporting invariants were superfluous and have been removed [2025-02-06 19:10:56,082 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-02-06 19:10:56,082 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-02-06 19:10:56,082 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~a!base,]]] [2025-02-06 19:10:56,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:10:56,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 19:10:56,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 19:10:56,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:56,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:10:56,109 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 19:10:56,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:10:56,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:10:56,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:10:56,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:56,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:10:56,178 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 19:10:56,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:10:56,190 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:10:56,191 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2025-02-06 19:10:56,191 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 51 states and 67 transitions. cyclomatic complexity: 28 Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:10:56,231 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 51 states and 67 transitions. cyclomatic complexity: 28. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 55 states and 72 transitions. Complement of second has 10 states. [2025-02-06 19:10:56,231 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:10:56,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:10:56,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 15 transitions. [2025-02-06 19:10:56,231 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 30 letters. Loop has 2 letters. [2025-02-06 19:10:56,231 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:10:56,232 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-06 19:10:56,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:10:56,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 19:10:56,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 19:10:56,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:56,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:10:56,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 19:10:56,272 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:10:56,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:10:56,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:10:56,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:56,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:10:56,355 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 19:10:56,356 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:10:56,369 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:10:56,370 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.4 stem predicates 2 loop predicates [2025-02-06 19:10:56,370 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 51 states and 67 transitions. cyclomatic complexity: 28 Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:10:56,417 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 51 states and 67 transitions. cyclomatic complexity: 28. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 55 states and 72 transitions. Complement of second has 10 states. [2025-02-06 19:10:56,417 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:10:56,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:10:56,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 15 transitions. [2025-02-06 19:10:56,417 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 15 transitions. Stem has 30 letters. Loop has 2 letters. [2025-02-06 19:10:56,417 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:10:56,417 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-06 19:10:56,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:10:56,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 19:10:56,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 19:10:56,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:56,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:10:56,454 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 19:10:56,455 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:10:56,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:10:56,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:10:56,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:56,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:10:56,528 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 19:10:56,528 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:10:56,541 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:10:56,542 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 2 loop predicates [2025-02-06 19:10:56,542 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 51 states and 67 transitions. cyclomatic complexity: 28 Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:10:56,598 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 51 states and 67 transitions. cyclomatic complexity: 28. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 65 states and 83 transitions. Complement of second has 15 states. [2025-02-06 19:10:56,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 5 stem states 2 non-accepting loop states 1 accepting loop states [2025-02-06 19:10:56,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:10:56,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 29 transitions. [2025-02-06 19:10:56,599 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 29 transitions. Stem has 30 letters. Loop has 2 letters. [2025-02-06 19:10:56,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:10:56,599 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 29 transitions. Stem has 32 letters. Loop has 2 letters. [2025-02-06 19:10:56,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:10:56,599 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 29 transitions. Stem has 30 letters. Loop has 4 letters. [2025-02-06 19:10:56,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:10:56,600 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 83 transitions. [2025-02-06 19:10:56,601 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-06 19:10:56,602 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 47 states and 60 transitions. [2025-02-06 19:10:56,602 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-02-06 19:10:56,602 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2025-02-06 19:10:56,602 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 60 transitions. [2025-02-06 19:10:56,602 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:10:56,602 INFO L218 hiAutomatonCegarLoop]: Abstraction has 47 states and 60 transitions. [2025-02-06 19:10:56,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 60 transitions. [2025-02-06 19:10:56,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2025-02-06 19:10:56,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 45 states have internal predecessors, (58), 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:10:56,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 58 transitions. [2025-02-06 19:10:56,603 INFO L240 hiAutomatonCegarLoop]: Abstraction has 46 states and 58 transitions. [2025-02-06 19:10:56,603 INFO L432 stractBuchiCegarLoop]: Abstraction has 46 states and 58 transitions. [2025-02-06 19:10:56,603 INFO L338 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2025-02-06 19:10:56,604 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 58 transitions. [2025-02-06 19:10:56,604 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-06 19:10:56,604 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:10:56,604 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:10:56,604 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2025-02-06 19:10:56,604 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-06 19:10:56,604 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~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet13#1, main_#t~post14#1, main_~k~0#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet11#1;main_~array_size~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;main_~k~0#1 := 0;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume !(main_~k~0#1 < main_~array_size~0#1);havoc main_~k~0#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~post8#1, test_fun_#t~post9#1, test_fun_#t~post10#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~pos~0#1, test_fun_~neg~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~pos~0#1 := 0;test_fun_~neg~0#1 := 0;test_fun_~i~0#1 := 0;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" [2025-02-06 19:10:56,604 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume test_fun_#t~mem2#1 < 0;havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(1 + test_fun_#t~post4#1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~neg~0#1;test_fun_~neg~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1;" [2025-02-06 19:10:56,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:10:56,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1973497344, now seen corresponding path program 11 times [2025-02-06 19:10:56,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:10:56,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978412478] [2025-02-06 19:10:56,607 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 19:10:56,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:10:56,612 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 34 statements into 5 equivalence classes. [2025-02-06 19:10:56,617 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 34 of 34 statements. [2025-02-06 19:10:56,617 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-02-06 19:10:56,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:10:56,709 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (166)] Ended with exit code 0 [2025-02-06 19:10:56,743 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 40 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:10:56,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:10:56,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978412478] [2025-02-06 19:10:56,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978412478] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:10:56,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1812531989] [2025-02-06 19:10:56,744 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 19:10:56,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:10:56,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:56,745 INFO L229 MonitoredProcess]: Starting monitored process 167 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:10:56,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (167)] Waiting until timeout for monitored process [2025-02-06 19:10:56,799 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 34 statements into 5 equivalence classes. [2025-02-06 19:10:56,815 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 34 of 34 statements. [2025-02-06 19:10:56,815 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-02-06 19:10:56,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:10:56,816 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-06 19:10:56,817 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:10:56,912 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 40 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:10:56,913 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:10:56,973 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 40 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:10:56,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1812531989] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:10:56,973 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:10:56,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 16 [2025-02-06 19:10:56,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960276619] [2025-02-06 19:10:56,973 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:10:56,973 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-06 19:10:56,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:10:56,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1376, now seen corresponding path program 8 times [2025-02-06 19:10:56,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:10:56,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911049838] [2025-02-06 19:10:56,974 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:10:56,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:10:56,976 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:10:56,976 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:10:56,976 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 19:10:56,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:56,976 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:10:56,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:10:56,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:10:56,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:56,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:56,978 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:10:57,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:10:57,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-06 19:10:57,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2025-02-06 19:10:57,007 INFO L87 Difference]: Start difference. First operand 46 states and 58 transitions. cyclomatic complexity: 22 Second operand has 17 states, 16 states have (on average 3.75) internal successors, (60), 17 states have internal predecessors, (60), 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:10:57,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:10:57,074 INFO L93 Difference]: Finished difference Result 80 states and 100 transitions. [2025-02-06 19:10:57,074 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 80 states and 100 transitions. [2025-02-06 19:10:57,075 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-06 19:10:57,075 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 80 states to 47 states and 59 transitions. [2025-02-06 19:10:57,075 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-02-06 19:10:57,076 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2025-02-06 19:10:57,076 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 59 transitions. [2025-02-06 19:10:57,076 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:10:57,076 INFO L218 hiAutomatonCegarLoop]: Abstraction has 47 states and 59 transitions. [2025-02-06 19:10:57,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 59 transitions. [2025-02-06 19:10:57,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2025-02-06 19:10:57,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 47 states have (on average 1.2553191489361701) internal successors, (59), 46 states have internal predecessors, (59), 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:10:57,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 59 transitions. [2025-02-06 19:10:57,080 INFO L240 hiAutomatonCegarLoop]: Abstraction has 47 states and 59 transitions. [2025-02-06 19:10:57,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 19:10:57,081 INFO L432 stractBuchiCegarLoop]: Abstraction has 47 states and 59 transitions. [2025-02-06 19:10:57,081 INFO L338 stractBuchiCegarLoop]: ======== Iteration 17 ============ [2025-02-06 19:10:57,081 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 59 transitions. [2025-02-06 19:10:57,081 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-06 19:10:57,081 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:10:57,081 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:10:57,082 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2025-02-06 19:10:57,082 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-06 19:10:57,082 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~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet13#1, main_#t~post14#1, main_~k~0#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet11#1;main_~array_size~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;main_~k~0#1 := 0;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume !(main_~k~0#1 < main_~array_size~0#1);havoc main_~k~0#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~post8#1, test_fun_#t~post9#1, test_fun_#t~post10#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~pos~0#1, test_fun_~neg~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~pos~0#1 := 0;test_fun_~neg~0#1 := 0;test_fun_~i~0#1 := 0;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" [2025-02-06 19:10:57,082 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume test_fun_#t~mem2#1 < 0;havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(1 + test_fun_#t~post4#1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~neg~0#1;test_fun_~neg~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1;" [2025-02-06 19:10:57,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:10:57,083 INFO L85 PathProgramCache]: Analyzing trace with hash -532670250, now seen corresponding path program 12 times [2025-02-06 19:10:57,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:10:57,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286806431] [2025-02-06 19:10:57,083 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 19:10:57,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:10:57,089 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 35 statements into 5 equivalence classes. [2025-02-06 19:10:57,100 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 35 of 35 statements. [2025-02-06 19:10:57,100 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-02-06 19:10:57,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:57,100 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:10:57,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-06 19:10:57,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-06 19:10:57,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:57,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:57,108 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:10:57,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:10:57,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1376, now seen corresponding path program 9 times [2025-02-06 19:10:57,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:10:57,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386418938] [2025-02-06 19:10:57,109 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 19:10:57,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:10:57,111 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:10:57,111 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:10:57,112 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-06 19:10:57,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:57,112 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:10:57,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:10:57,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:10:57,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:57,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:57,113 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:10:57,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:10:57,113 INFO L85 PathProgramCache]: Analyzing trace with hash -795001611, now seen corresponding path program 4 times [2025-02-06 19:10:57,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:10:57,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354860808] [2025-02-06 19:10:57,114 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 19:10:57,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:10:57,118 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 37 statements into 2 equivalence classes. [2025-02-06 19:10:57,126 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-02-06 19:10:57,126 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 19:10:57,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:57,126 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:10:57,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-06 19:10:57,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-06 19:10:57,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:57,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:10:57,134 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:10:58,481 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:10:58,481 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:10:58,481 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:10:58,481 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:10:58,481 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-06 19:10:58,481 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:58,481 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:10:58,481 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:10:58,481 INFO L132 ssoRankerPreferences]: Filename of dumped script: array02-alloca-2.i_Iteration17_Lasso [2025-02-06 19:10:58,481 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:10:58,481 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:10:58,482 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:58,484 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:58,486 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:58,487 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:58,489 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:58,490 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:58,493 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:58,494 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:58,496 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:58,497 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:58,777 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:58,779 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:58,780 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:58,782 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:58,783 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:58,784 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:58,785 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:58,787 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:58,788 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:58,789 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:58,790 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:58,792 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:58,794 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:58,795 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:58,797 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:59,027 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:10:59,027 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-06 19:10:59,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:59,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:59,029 INFO L229 MonitoredProcess]: Starting monitored process 168 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:10:59,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (168)] Waiting until timeout for monitored process [2025-02-06 19:10:59,031 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:10:59,041 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:59,041 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:59,041 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:59,041 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:59,043 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:10:59,043 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:10:59,045 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:59,050 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (168)] Forceful destruction successful, exit code 0 [2025-02-06 19:10:59,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:59,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:59,052 INFO L229 MonitoredProcess]: Starting monitored process 169 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:10:59,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (169)] Waiting until timeout for monitored process [2025-02-06 19:10:59,053 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:10:59,063 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:59,063 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:59,063 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:59,063 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:59,063 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:59,063 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:59,063 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:59,065 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:59,071 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (169)] Forceful destruction successful, exit code 0 [2025-02-06 19:10:59,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:59,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:59,073 INFO L229 MonitoredProcess]: Starting monitored process 170 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:10:59,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (170)] Waiting until timeout for monitored process [2025-02-06 19:10:59,075 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:10:59,085 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:59,086 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:59,086 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:59,086 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:59,086 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:59,086 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:59,086 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:59,087 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:59,092 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (170)] Ended with exit code 0 [2025-02-06 19:10:59,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:59,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:59,094 INFO L229 MonitoredProcess]: Starting monitored process 171 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:10:59,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (171)] Waiting until timeout for monitored process [2025-02-06 19:10:59,095 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:10:59,105 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:59,105 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:59,105 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:59,105 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:59,105 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:59,106 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:59,106 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:59,107 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:59,112 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (171)] Ended with exit code 0 [2025-02-06 19:10:59,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:59,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:59,114 INFO L229 MonitoredProcess]: Starting monitored process 172 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:10:59,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (172)] Waiting until timeout for monitored process [2025-02-06 19:10:59,116 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:10:59,125 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:59,125 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:59,125 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:59,126 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:59,126 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:10:59,126 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:10:59,128 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:59,134 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (172)] Ended with exit code 0 [2025-02-06 19:10:59,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:59,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:59,136 INFO L229 MonitoredProcess]: Starting monitored process 173 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:10:59,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (173)] Waiting until timeout for monitored process [2025-02-06 19:10:59,138 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:10:59,147 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:59,147 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:59,147 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:59,147 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:59,149 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:10:59,149 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:10:59,152 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:59,157 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (173)] Forceful destruction successful, exit code 0 [2025-02-06 19:10:59,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:59,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:59,159 INFO L229 MonitoredProcess]: Starting monitored process 174 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:10:59,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (174)] Waiting until timeout for monitored process [2025-02-06 19:10:59,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:10:59,170 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:59,170 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:59,170 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:59,170 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:59,170 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:59,171 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:59,171 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:59,172 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:59,177 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (174)] Ended with exit code 0 [2025-02-06 19:10:59,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:59,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:59,179 INFO L229 MonitoredProcess]: Starting monitored process 175 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:10:59,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (175)] Waiting until timeout for monitored process [2025-02-06 19:10:59,181 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:10:59,190 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:59,191 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:59,191 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:59,191 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:59,191 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:59,191 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:59,191 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:59,192 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:59,197 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (175)] Ended with exit code 0 [2025-02-06 19:10:59,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:59,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:59,200 INFO L229 MonitoredProcess]: Starting monitored process 176 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:10:59,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (176)] Waiting until timeout for monitored process [2025-02-06 19:10:59,201 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:10:59,211 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:59,211 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:59,211 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:59,211 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:59,211 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:59,211 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:59,211 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:59,212 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:59,217 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (176)] Forceful destruction successful, exit code 0 [2025-02-06 19:10:59,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:59,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:59,219 INFO L229 MonitoredProcess]: Starting monitored process 177 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:10:59,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (177)] Waiting until timeout for monitored process [2025-02-06 19:10:59,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:10:59,230 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:59,230 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:59,230 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:59,230 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:59,232 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:10:59,232 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:10:59,235 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:59,241 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (177)] Forceful destruction successful, exit code 0 [2025-02-06 19:10:59,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:59,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:59,243 INFO L229 MonitoredProcess]: Starting monitored process 178 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:10:59,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (178)] Waiting until timeout for monitored process [2025-02-06 19:10:59,245 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:10:59,254 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:59,255 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:59,255 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:59,255 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:59,256 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:10:59,256 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:10:59,258 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:59,264 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (178)] Forceful destruction successful, exit code 0 [2025-02-06 19:10:59,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:59,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:59,266 INFO L229 MonitoredProcess]: Starting monitored process 179 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:10:59,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (179)] Waiting until timeout for monitored process [2025-02-06 19:10:59,268 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:10:59,278 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:59,278 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:59,278 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:59,278 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:59,279 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:10:59,279 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:10:59,283 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:59,288 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (179)] Forceful destruction successful, exit code 0 [2025-02-06 19:10:59,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:59,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:59,290 INFO L229 MonitoredProcess]: Starting monitored process 180 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:10:59,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (180)] Waiting until timeout for monitored process [2025-02-06 19:10:59,291 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:10:59,301 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:59,302 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:59,302 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:59,302 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:59,304 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:10:59,304 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:10:59,310 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:59,321 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (180)] Forceful destruction successful, exit code 0 [2025-02-06 19:10:59,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:59,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:59,325 INFO L229 MonitoredProcess]: Starting monitored process 181 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:10:59,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (181)] Waiting until timeout for monitored process [2025-02-06 19:10:59,327 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:10:59,337 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:59,337 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:59,337 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:59,337 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:59,339 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:10:59,339 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:10:59,343 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:59,348 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (181)] Forceful destruction successful, exit code 0 [2025-02-06 19:10:59,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:59,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:59,350 INFO L229 MonitoredProcess]: Starting monitored process 182 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:10:59,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (182)] Waiting until timeout for monitored process [2025-02-06 19:10:59,352 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:10:59,362 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:59,363 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:59,363 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:59,363 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:59,367 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:10:59,367 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:10:59,370 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:59,375 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (182)] Forceful destruction successful, exit code 0 [2025-02-06 19:10:59,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:59,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:59,377 INFO L229 MonitoredProcess]: Starting monitored process 183 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:10:59,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (183)] Waiting until timeout for monitored process [2025-02-06 19:10:59,379 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:10:59,388 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:59,388 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:59,388 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:59,388 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:59,391 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:10:59,391 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:10:59,395 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-06 19:10:59,403 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2025-02-06 19:10:59,403 INFO L444 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 6 variables to zero. [2025-02-06 19:10:59,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:59,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:59,406 INFO L229 MonitoredProcess]: Starting monitored process 184 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:10:59,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (184)] Waiting until timeout for monitored process [2025-02-06 19:10:59,407 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-06 19:10:59,417 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-02-06 19:10:59,417 INFO L474 LassoAnalysis]: Proved termination. [2025-02-06 19:10:59,417 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc12#1.base) (+ ULTIMATE.start_test_fun_~a#1.offset 16))_1) = -1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc12#1.base) (+ ULTIMATE.start_test_fun_~a#1.offset 16))_1 Supporting invariants [] [2025-02-06 19:10:59,423 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (183)] Ended with exit code 0 [2025-02-06 19:10:59,441 INFO L156 tatePredicateManager]: 11 out of 13 supporting invariants were superfluous and have been removed [2025-02-06 19:10:59,444 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-02-06 19:10:59,444 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-02-06 19:10:59,444 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[#t~malloc12!base,]]] [2025-02-06 19:10:59,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:10:59,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-06 19:10:59,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-06 19:10:59,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:59,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:10:59,482 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-06 19:10:59,483 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:10:59,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:10:59,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:10:59,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:59,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:10:59,620 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-06 19:10:59,620 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:10:59,635 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:10:59,636 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.7 stem predicates 2 loop predicates [2025-02-06 19:10:59,636 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 47 states and 59 transitions. cyclomatic complexity: 22 Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 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:10:59,655 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 47 states and 59 transitions. cyclomatic complexity: 22. Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 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 48 states and 61 transitions. Complement of second has 5 states. [2025-02-06 19:10:59,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2025-02-06 19:10:59,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 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:10:59,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2025-02-06 19:10:59,656 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 35 letters. Loop has 2 letters. [2025-02-06 19:10:59,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:10:59,657 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-06 19:10:59,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:10:59,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-06 19:10:59,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-06 19:10:59,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:59,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:10:59,698 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-06 19:10:59,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:10:59,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:10:59,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:10:59,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:59,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:10:59,825 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-06 19:10:59,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:10:59,840 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:10:59,840 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.7 stem predicates 2 loop predicates [2025-02-06 19:10:59,841 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 47 states and 59 transitions. cyclomatic complexity: 22 Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 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:10:59,884 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (184)] Forceful destruction successful, exit code 0 [2025-02-06 19:10:59,886 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 47 states and 59 transitions. cyclomatic complexity: 22. Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 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 48 states and 61 transitions. Complement of second has 5 states. [2025-02-06 19:10:59,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2025-02-06 19:10:59,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 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:10:59,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2025-02-06 19:10:59,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 35 letters. Loop has 2 letters. [2025-02-06 19:10:59,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:10:59,887 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-06 19:10:59,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:10:59,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-06 19:10:59,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-06 19:10:59,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:59,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:10:59,928 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-06 19:10:59,929 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:11:00,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:11:00,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:11:00,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:00,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:11:00,067 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-06 19:11:00,067 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:11:00,085 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:11:00,085 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 2 loop predicates [2025-02-06 19:11:00,086 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 47 states and 59 transitions. cyclomatic complexity: 22 Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 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:11:00,218 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 47 states and 59 transitions. cyclomatic complexity: 22. Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 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 78 states and 100 transitions. Complement of second has 17 states. [2025-02-06 19:11:00,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 7 stem states 2 non-accepting loop states 2 accepting loop states [2025-02-06 19:11:00,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 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:11:00,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 66 transitions. [2025-02-06 19:11:00,218 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 66 transitions. Stem has 35 letters. Loop has 2 letters. [2025-02-06 19:11:00,219 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:11:00,219 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 66 transitions. Stem has 37 letters. Loop has 2 letters. [2025-02-06 19:11:00,219 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:11:00,219 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 66 transitions. Stem has 35 letters. Loop has 4 letters. [2025-02-06 19:11:00,219 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:11:00,219 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 100 transitions. [2025-02-06 19:11:00,219 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-06 19:11:00,219 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 70 states and 90 transitions. [2025-02-06 19:11:00,220 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-02-06 19:11:00,220 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2025-02-06 19:11:00,220 INFO L73 IsDeterministic]: Start isDeterministic. Operand 70 states and 90 transitions. [2025-02-06 19:11:00,220 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:11:00,220 INFO L218 hiAutomatonCegarLoop]: Abstraction has 70 states and 90 transitions. [2025-02-06 19:11:00,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states and 90 transitions. [2025-02-06 19:11:00,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 55. [2025-02-06 19:11:00,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 55 states have (on average 1.2545454545454546) internal successors, (69), 54 states have internal predecessors, (69), 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:11:00,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 69 transitions. [2025-02-06 19:11:00,221 INFO L240 hiAutomatonCegarLoop]: Abstraction has 55 states and 69 transitions. [2025-02-06 19:11:00,221 INFO L432 stractBuchiCegarLoop]: Abstraction has 55 states and 69 transitions. [2025-02-06 19:11:00,221 INFO L338 stractBuchiCegarLoop]: ======== Iteration 18 ============ [2025-02-06 19:11:00,221 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 69 transitions. [2025-02-06 19:11:00,221 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-06 19:11:00,222 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:11:00,222 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:11:00,222 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1] [2025-02-06 19:11:00,222 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-06 19:11:00,222 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~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet13#1, main_#t~post14#1, main_~k~0#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet11#1;main_~array_size~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;main_~k~0#1 := 0;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume !(main_~k~0#1 < main_~array_size~0#1);havoc main_~k~0#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~post8#1, test_fun_#t~post9#1, test_fun_#t~post10#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~pos~0#1, test_fun_~neg~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~pos~0#1 := 0;test_fun_~neg~0#1 := 0;test_fun_~i~0#1 := 0;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" [2025-02-06 19:11:00,222 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume test_fun_#t~mem2#1 < 0;havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(1 + test_fun_#t~post4#1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~neg~0#1;test_fun_~neg~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1;" [2025-02-06 19:11:00,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:00,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1794055009, now seen corresponding path program 13 times [2025-02-06 19:11:00,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:11:00,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066039489] [2025-02-06 19:11:00,223 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-06 19:11:00,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:11:00,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-06 19:11:00,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-06 19:11:00,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:00,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:11:00,387 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 40 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:11:00,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:11:00,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066039489] [2025-02-06 19:11:00,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066039489] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:11:00,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1599332530] [2025-02-06 19:11:00,388 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-06 19:11:00,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:11:00,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:00,393 INFO L229 MonitoredProcess]: Starting monitored process 185 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:11:00,394 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (185)] Waiting until timeout for monitored process [2025-02-06 19:11:00,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-06 19:11:00,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-06 19:11:00,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:00,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:11:00,467 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-06 19:11:00,468 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:11:00,600 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 65 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:11:00,601 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:11:00,695 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 65 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:11:00,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1599332530] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:11:00,695 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:11:00,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 21 [2025-02-06 19:11:00,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687785187] [2025-02-06 19:11:00,695 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:11:00,696 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-06 19:11:00,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:00,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1376, now seen corresponding path program 10 times [2025-02-06 19:11:00,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:11:00,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481209431] [2025-02-06 19:11:00,696 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 19:11:00,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:11:00,700 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 2 statements into 2 equivalence classes. [2025-02-06 19:11:00,701 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:11:00,701 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 19:11:00,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:00,701 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:11:00,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:11:00,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:11:00,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:00,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:00,704 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:11:00,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:11:00,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-06 19:11:00,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=347, Unknown=0, NotChecked=0, Total=462 [2025-02-06 19:11:00,733 INFO L87 Difference]: Start difference. First operand 55 states and 69 transitions. cyclomatic complexity: 26 Second operand has 22 states, 21 states have (on average 3.9047619047619047) internal successors, (82), 22 states have internal predecessors, (82), 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:11:00,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:11:00,842 INFO L93 Difference]: Finished difference Result 97 states and 121 transitions. [2025-02-06 19:11:00,843 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 97 states and 121 transitions. [2025-02-06 19:11:00,843 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-06 19:11:00,844 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 97 states to 56 states and 70 transitions. [2025-02-06 19:11:00,844 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-02-06 19:11:00,844 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2025-02-06 19:11:00,844 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 70 transitions. [2025-02-06 19:11:00,844 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:11:00,844 INFO L218 hiAutomatonCegarLoop]: Abstraction has 56 states and 70 transitions. [2025-02-06 19:11:00,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 70 transitions. [2025-02-06 19:11:00,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-02-06 19:11:00,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 56 states have (on average 1.25) internal successors, (70), 55 states have internal predecessors, (70), 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:11:00,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 70 transitions. [2025-02-06 19:11:00,845 INFO L240 hiAutomatonCegarLoop]: Abstraction has 56 states and 70 transitions. [2025-02-06 19:11:00,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 19:11:00,850 INFO L432 stractBuchiCegarLoop]: Abstraction has 56 states and 70 transitions. [2025-02-06 19:11:00,850 INFO L338 stractBuchiCegarLoop]: ======== Iteration 19 ============ [2025-02-06 19:11:00,850 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 70 transitions. [2025-02-06 19:11:00,850 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-06 19:11:00,850 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:11:00,850 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:11:00,850 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1] [2025-02-06 19:11:00,850 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-06 19:11:00,850 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~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet13#1, main_#t~post14#1, main_~k~0#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet11#1;main_~array_size~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;main_~k~0#1 := 0;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume !(main_~k~0#1 < main_~array_size~0#1);havoc main_~k~0#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~post8#1, test_fun_#t~post9#1, test_fun_#t~post10#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~pos~0#1, test_fun_~neg~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~pos~0#1 := 0;test_fun_~neg~0#1 := 0;test_fun_~i~0#1 := 0;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" [2025-02-06 19:11:00,850 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume test_fun_#t~mem2#1 < 0;havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(1 + test_fun_#t~post4#1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~neg~0#1;test_fun_~neg~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1;" [2025-02-06 19:11:00,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:00,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1173503241, now seen corresponding path program 14 times [2025-02-06 19:11:00,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:11:00,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841034454] [2025-02-06 19:11:00,853 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:11:00,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:11:00,857 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-02-06 19:11:00,867 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-02-06 19:11:00,867 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 19:11:00,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:00,867 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:11:00,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-06 19:11:00,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-06 19:11:00,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:00,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:00,881 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:11:00,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:00,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1376, now seen corresponding path program 11 times [2025-02-06 19:11:00,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:11:00,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444260914] [2025-02-06 19:11:00,882 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 19:11:00,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:11:00,884 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:11:00,884 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:11:00,885 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 19:11:00,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:00,885 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:11:00,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:11:00,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:11:00,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:00,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:00,887 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:11:00,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:00,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1839783832, now seen corresponding path program 5 times [2025-02-06 19:11:00,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:11:00,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106643915] [2025-02-06 19:11:00,887 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 19:11:00,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:11:00,893 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 44 statements into 6 equivalence classes. [2025-02-06 19:11:00,904 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 44 of 44 statements. [2025-02-06 19:11:00,904 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-02-06 19:11:00,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:00,905 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:11:00,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-06 19:11:00,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-06 19:11:00,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:00,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:00,945 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:11:03,367 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:11:03,367 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:11:03,367 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:11:03,367 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:11:03,368 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-06 19:11:03,368 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:03,368 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:11:03,368 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:11:03,368 INFO L132 ssoRankerPreferences]: Filename of dumped script: array02-alloca-2.i_Iteration19_Lasso [2025-02-06 19:11:03,368 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:11:03,368 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:11:03,369 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:03,372 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:03,374 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:03,375 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:03,376 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:03,378 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:03,381 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:03,853 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:03,854 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:03,856 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:03,857 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:03,858 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:03,860 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:03,861 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:03,862 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:03,863 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:03,865 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:03,866 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:03,867 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:03,869 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:03,871 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:03,872 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:03,873 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:03,874 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:04,148 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:11:04,148 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-06 19:11:04,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:04,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:04,150 INFO L229 MonitoredProcess]: Starting monitored process 186 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:11:04,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (186)] Waiting until timeout for monitored process [2025-02-06 19:11:04,169 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:11:04,185 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:04,185 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:04,185 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:04,185 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:04,185 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:04,186 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:04,186 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:04,187 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:04,201 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (186)] Forceful destruction successful, exit code 0 [2025-02-06 19:11:04,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:04,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:04,203 INFO L229 MonitoredProcess]: Starting monitored process 187 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:11:04,211 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:11:04,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (187)] Waiting until timeout for monitored process [2025-02-06 19:11:04,229 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:04,229 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:04,229 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:04,229 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:04,229 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:11:04,229 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:11:04,235 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:04,248 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (187)] Ended with exit code 0 [2025-02-06 19:11:04,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:04,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:04,253 INFO L229 MonitoredProcess]: Starting monitored process 188 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:11:04,253 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (188)] Waiting until timeout for monitored process [2025-02-06 19:11:04,254 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:11:04,264 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:04,264 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:04,265 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:04,265 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:04,265 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:04,265 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:04,265 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:04,269 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:04,278 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (188)] Ended with exit code 0 [2025-02-06 19:11:04,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:04,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:04,280 INFO L229 MonitoredProcess]: Starting monitored process 189 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:11:04,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (189)] Waiting until timeout for monitored process [2025-02-06 19:11:04,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:11:04,291 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:04,292 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:04,292 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:04,292 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:04,292 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:04,292 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:04,292 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:04,294 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:04,299 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (189)] Forceful destruction successful, exit code 0 [2025-02-06 19:11:04,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:04,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:04,305 INFO L229 MonitoredProcess]: Starting monitored process 190 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:11:04,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (190)] Waiting until timeout for monitored process [2025-02-06 19:11:04,306 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:11:04,316 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:04,316 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:04,316 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:04,316 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:04,316 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:04,317 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:04,317 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:04,320 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:04,329 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (190)] Ended with exit code 0 [2025-02-06 19:11:04,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:04,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:04,331 INFO L229 MonitoredProcess]: Starting monitored process 191 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:11:04,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (191)] Waiting until timeout for monitored process [2025-02-06 19:11:04,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:11:04,342 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:04,343 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:04,343 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:04,343 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:04,344 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:11:04,344 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:11:04,346 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:04,352 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (191)] Ended with exit code 0 [2025-02-06 19:11:04,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:04,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:04,355 INFO L229 MonitoredProcess]: Starting monitored process 192 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:11:04,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (192)] Waiting until timeout for monitored process [2025-02-06 19:11:04,358 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:11:04,369 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:04,369 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:04,369 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:04,369 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:04,371 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:11:04,371 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:11:04,375 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:04,380 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (192)] Forceful destruction successful, exit code 0 [2025-02-06 19:11:04,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:04,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:04,382 INFO L229 MonitoredProcess]: Starting monitored process 193 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:11:04,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (193)] Waiting until timeout for monitored process [2025-02-06 19:11:04,384 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:11:04,394 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:04,394 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:04,394 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:04,394 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:04,396 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:11:04,397 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:11:04,400 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:04,405 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (193)] Forceful destruction successful, exit code 0 [2025-02-06 19:11:04,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:04,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:04,407 INFO L229 MonitoredProcess]: Starting monitored process 194 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:11:04,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (194)] Waiting until timeout for monitored process [2025-02-06 19:11:04,412 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:11:04,421 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:04,422 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:04,422 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:04,422 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:04,425 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:11:04,425 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:11:04,430 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:04,436 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (194)] Forceful destruction successful, exit code 0 [2025-02-06 19:11:04,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:04,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:04,438 INFO L229 MonitoredProcess]: Starting monitored process 195 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:11:04,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (195)] Waiting until timeout for monitored process [2025-02-06 19:11:04,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:11:04,450 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:04,451 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:04,451 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:04,451 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:04,454 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:11:04,454 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:11:04,457 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:04,463 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (195)] Forceful destruction successful, exit code 0 [2025-02-06 19:11:04,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:04,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:04,465 INFO L229 MonitoredProcess]: Starting monitored process 196 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:11:04,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (196)] Waiting until timeout for monitored process [2025-02-06 19:11:04,467 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:11:04,477 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:04,477 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:04,477 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:04,477 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:04,478 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:11:04,478 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:11:04,482 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:04,487 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (196)] Ended with exit code 0 [2025-02-06 19:11:04,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:04,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:04,489 INFO L229 MonitoredProcess]: Starting monitored process 197 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:11:04,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (197)] Waiting until timeout for monitored process [2025-02-06 19:11:04,491 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:11:04,501 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:04,501 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:04,501 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:04,502 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:04,503 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:11:04,503 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:11:04,511 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:04,519 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (197)] Ended with exit code 0 [2025-02-06 19:11:04,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:04,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:04,521 INFO L229 MonitoredProcess]: Starting monitored process 198 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:11:04,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (198)] Waiting until timeout for monitored process [2025-02-06 19:11:04,524 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:11:04,540 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:04,540 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:04,540 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:04,540 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:04,542 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:11:04,542 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:11:04,547 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-06 19:11:04,557 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2025-02-06 19:11:04,557 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-02-06 19:11:04,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:04,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:04,559 INFO L229 MonitoredProcess]: Starting monitored process 199 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:11:04,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (199)] Waiting until timeout for monitored process [2025-02-06 19:11:04,561 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-06 19:11:04,571 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-02-06 19:11:04,572 INFO L474 LassoAnalysis]: Proved termination. [2025-02-06 19:11:04,572 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc12#1.base) (+ ULTIMATE.start_test_fun_~a#1.offset 20))_1) = -1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc12#1.base) (+ ULTIMATE.start_test_fun_~a#1.offset 20))_1 Supporting invariants [] [2025-02-06 19:11:04,578 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (198)] Ended with exit code 0 [2025-02-06 19:11:04,613 INFO L156 tatePredicateManager]: 13 out of 15 supporting invariants were superfluous and have been removed [2025-02-06 19:11:04,616 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-02-06 19:11:04,616 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-02-06 19:11:04,616 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[#t~malloc12!base,]]] [2025-02-06 19:11:04,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:04,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-06 19:11:04,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-06 19:11:04,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:04,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:11:04,657 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-06 19:11:04,658 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:11:04,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:11:04,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:11:04,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:04,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:11:04,859 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-06 19:11:04,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:11:04,878 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:11:04,878 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.8 stem predicates 2 loop predicates [2025-02-06 19:11:04,878 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 56 states and 70 transitions. cyclomatic complexity: 26 Second operand has 10 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:11:04,915 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 56 states and 70 transitions. cyclomatic complexity: 26. Second operand has 10 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 57 states and 72 transitions. Complement of second has 5 states. [2025-02-06 19:11:04,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2025-02-06 19:11:04,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:11:04,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2025-02-06 19:11:04,916 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 42 letters. Loop has 2 letters. [2025-02-06 19:11:04,916 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:11:04,916 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-06 19:11:04,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:04,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-06 19:11:04,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-06 19:11:04,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:04,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:11:04,976 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-06 19:11:04,977 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:11:05,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:11:05,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:11:05,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:05,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:11:05,237 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-06 19:11:05,240 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:11:05,268 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:11:05,270 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.8 stem predicates 2 loop predicates [2025-02-06 19:11:05,273 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 56 states and 70 transitions. cyclomatic complexity: 26 Second operand has 10 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:11:05,314 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 56 states and 70 transitions. cyclomatic complexity: 26. Second operand has 10 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 57 states and 72 transitions. Complement of second has 5 states. [2025-02-06 19:11:05,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2025-02-06 19:11:05,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:11:05,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2025-02-06 19:11:05,315 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 42 letters. Loop has 2 letters. [2025-02-06 19:11:05,315 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:11:05,315 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-06 19:11:05,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:05,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-06 19:11:05,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-06 19:11:05,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:05,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:11:05,370 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-06 19:11:05,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:11:05,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:11:05,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:11:05,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:05,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:11:05,586 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-06 19:11:05,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:11:05,604 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:11:05,605 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.8 stem predicates 2 loop predicates [2025-02-06 19:11:05,610 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 56 states and 70 transitions. cyclomatic complexity: 26 Second operand has 10 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:11:05,794 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 56 states and 70 transitions. cyclomatic complexity: 26. Second operand has 10 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 88 states and 113 transitions. Complement of second has 19 states. [2025-02-06 19:11:05,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 8 stem states 2 non-accepting loop states 2 accepting loop states [2025-02-06 19:11:05,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:11:05,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 75 transitions. [2025-02-06 19:11:05,798 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 75 transitions. Stem has 42 letters. Loop has 2 letters. [2025-02-06 19:11:05,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:11:05,798 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 75 transitions. Stem has 44 letters. Loop has 2 letters. [2025-02-06 19:11:05,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:11:05,798 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 75 transitions. Stem has 42 letters. Loop has 4 letters. [2025-02-06 19:11:05,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:11:05,798 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 88 states and 113 transitions. [2025-02-06 19:11:05,799 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-06 19:11:05,799 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 88 states to 80 states and 103 transitions. [2025-02-06 19:11:05,799 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-02-06 19:11:05,799 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2025-02-06 19:11:05,799 INFO L73 IsDeterministic]: Start isDeterministic. Operand 80 states and 103 transitions. [2025-02-06 19:11:05,799 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:11:05,799 INFO L218 hiAutomatonCegarLoop]: Abstraction has 80 states and 103 transitions. [2025-02-06 19:11:05,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states and 103 transitions. [2025-02-06 19:11:05,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 64. [2025-02-06 19:11:05,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 64 states have (on average 1.25) internal successors, (80), 63 states have internal predecessors, (80), 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:11:05,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 80 transitions. [2025-02-06 19:11:05,801 INFO L240 hiAutomatonCegarLoop]: Abstraction has 64 states and 80 transitions. [2025-02-06 19:11:05,801 INFO L432 stractBuchiCegarLoop]: Abstraction has 64 states and 80 transitions. [2025-02-06 19:11:05,801 INFO L338 stractBuchiCegarLoop]: ======== Iteration 20 ============ [2025-02-06 19:11:05,801 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 80 transitions. [2025-02-06 19:11:05,801 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-06 19:11:05,801 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:11:05,801 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:11:05,801 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1] [2025-02-06 19:11:05,801 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-06 19:11:05,801 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~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet13#1, main_#t~post14#1, main_~k~0#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet11#1;main_~array_size~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;main_~k~0#1 := 0;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume !(main_~k~0#1 < main_~array_size~0#1);havoc main_~k~0#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~post8#1, test_fun_#t~post9#1, test_fun_#t~post10#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~pos~0#1, test_fun_~neg~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~pos~0#1 := 0;test_fun_~neg~0#1 := 0;test_fun_~i~0#1 := 0;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" [2025-02-06 19:11:05,810 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume test_fun_#t~mem2#1 < 0;havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(1 + test_fun_#t~post4#1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~neg~0#1;test_fun_~neg~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1;" [2025-02-06 19:11:05,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:05,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1467340434, now seen corresponding path program 15 times [2025-02-06 19:11:05,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:11:05,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257007007] [2025-02-06 19:11:05,810 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 19:11:05,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:11:05,823 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 48 statements into 7 equivalence classes. [2025-02-06 19:11:05,856 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 48 of 48 statements. [2025-02-06 19:11:05,856 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-02-06 19:11:05,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:11:05,946 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (199)] Ended with exit code 0 [2025-02-06 19:11:06,223 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 65 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:11:06,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:11:06,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257007007] [2025-02-06 19:11:06,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257007007] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:11:06,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [775368407] [2025-02-06 19:11:06,224 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 19:11:06,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:11:06,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:06,226 INFO L229 MonitoredProcess]: Starting monitored process 200 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:11:06,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (200)] Waiting until timeout for monitored process [2025-02-06 19:11:06,293 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 48 statements into 7 equivalence classes. [2025-02-06 19:11:06,330 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 48 of 48 statements. [2025-02-06 19:11:06,330 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-02-06 19:11:06,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:11:06,331 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-06 19:11:06,332 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:11:06,654 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 96 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:11:06,654 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:11:06,810 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 96 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:11:06,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [775368407] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:11:06,810 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:11:06,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 24 [2025-02-06 19:11:06,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856688831] [2025-02-06 19:11:06,810 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:11:06,810 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-06 19:11:06,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:06,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1376, now seen corresponding path program 12 times [2025-02-06 19:11:06,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:11:06,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115872164] [2025-02-06 19:11:06,810 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 19:11:06,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:11:06,816 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:11:06,821 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:11:06,821 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-02-06 19:11:06,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:06,821 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:11:06,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:11:06,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:11:06,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:06,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:06,823 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:11:06,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:11:06,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-02-06 19:11:06,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=453, Unknown=0, NotChecked=0, Total=600 [2025-02-06 19:11:06,878 INFO L87 Difference]: Start difference. First operand 64 states and 80 transitions. cyclomatic complexity: 30 Second operand has 25 states, 24 states have (on average 3.9583333333333335) internal successors, (95), 25 states have internal predecessors, (95), 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:11:06,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:11:06,984 INFO L93 Difference]: Finished difference Result 114 states and 142 transitions. [2025-02-06 19:11:06,984 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 114 states and 142 transitions. [2025-02-06 19:11:06,984 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-06 19:11:06,985 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 114 states to 65 states and 81 transitions. [2025-02-06 19:11:06,985 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-02-06 19:11:06,985 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2025-02-06 19:11:06,985 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65 states and 81 transitions. [2025-02-06 19:11:06,985 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:11:06,985 INFO L218 hiAutomatonCegarLoop]: Abstraction has 65 states and 81 transitions. [2025-02-06 19:11:06,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states and 81 transitions. [2025-02-06 19:11:06,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2025-02-06 19:11:06,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 65 states have (on average 1.2461538461538462) internal successors, (81), 64 states have internal predecessors, (81), 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:11:06,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 81 transitions. [2025-02-06 19:11:06,990 INFO L240 hiAutomatonCegarLoop]: Abstraction has 65 states and 81 transitions. [2025-02-06 19:11:06,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-06 19:11:06,991 INFO L432 stractBuchiCegarLoop]: Abstraction has 65 states and 81 transitions. [2025-02-06 19:11:06,991 INFO L338 stractBuchiCegarLoop]: ======== Iteration 21 ============ [2025-02-06 19:11:06,991 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states and 81 transitions. [2025-02-06 19:11:06,991 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-06 19:11:06,991 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:11:06,991 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:11:06,992 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1] [2025-02-06 19:11:06,992 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-06 19:11:06,992 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~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet13#1, main_#t~post14#1, main_~k~0#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet11#1;main_~array_size~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;main_~k~0#1 := 0;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume !(main_~k~0#1 < main_~array_size~0#1);havoc main_~k~0#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~post8#1, test_fun_#t~post9#1, test_fun_#t~post10#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~pos~0#1, test_fun_~neg~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~pos~0#1 := 0;test_fun_~neg~0#1 := 0;test_fun_~i~0#1 := 0;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" [2025-02-06 19:11:06,992 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume test_fun_#t~mem2#1 < 0;havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(1 + test_fun_#t~post4#1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~neg~0#1;test_fun_~neg~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1;" [2025-02-06 19:11:06,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:06,993 INFO L85 PathProgramCache]: Analyzing trace with hash -2111958296, now seen corresponding path program 16 times [2025-02-06 19:11:06,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:11:06,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827320341] [2025-02-06 19:11:06,993 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 19:11:06,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:11:07,002 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 49 statements into 2 equivalence classes. [2025-02-06 19:11:07,022 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 49 of 49 statements. [2025-02-06 19:11:07,022 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 19:11:07,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:07,022 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:11:07,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-06 19:11:07,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-06 19:11:07,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:07,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:07,044 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:11:07,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:07,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1376, now seen corresponding path program 13 times [2025-02-06 19:11:07,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:11:07,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307164181] [2025-02-06 19:11:07,049 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-06 19:11:07,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:11:07,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:11:07,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:11:07,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:07,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:07,056 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:11:07,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:11:07,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:11:07,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:07,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:07,058 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:11:07,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:07,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1927608967, now seen corresponding path program 6 times [2025-02-06 19:11:07,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:11:07,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290080729] [2025-02-06 19:11:07,059 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 19:11:07,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:11:07,068 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 51 statements into 7 equivalence classes. [2025-02-06 19:11:07,098 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) and asserted 51 of 51 statements. [2025-02-06 19:11:07,102 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2025-02-06 19:11:07,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:07,103 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:11:07,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-06 19:11:07,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-06 19:11:07,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:07,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:07,129 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:11:11,020 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:11:11,021 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:11:11,021 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:11:11,021 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:11:11,021 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-06 19:11:11,021 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:11,021 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:11:11,021 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:11:11,021 INFO L132 ssoRankerPreferences]: Filename of dumped script: array02-alloca-2.i_Iteration21_Lasso [2025-02-06 19:11:11,021 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:11:11,021 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:11:11,022 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:11,025 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:11,026 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:11,027 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:11,029 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:11,030 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:11,031 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:11,032 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:11,033 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:11,035 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:11,037 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:11,038 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:11,039 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:11,040 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:11,042 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:11,043 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:11,044 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:11,045 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:11,047 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:11,048 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:11,049 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:11,050 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:11,051 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:11,828 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:12,079 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:11:12,079 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-06 19:11:12,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:12,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:12,086 INFO L229 MonitoredProcess]: Starting monitored process 201 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:11:12,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (201)] Waiting until timeout for monitored process [2025-02-06 19:11:12,088 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:11:12,097 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:12,097 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:12,097 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:12,097 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:12,097 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:12,098 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:12,098 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:12,099 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:12,104 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (201)] Forceful destruction successful, exit code 0 [2025-02-06 19:11:12,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:12,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:12,106 INFO L229 MonitoredProcess]: Starting monitored process 202 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:11:12,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (202)] Waiting until timeout for monitored process [2025-02-06 19:11:12,108 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:11:12,118 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:12,118 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:12,118 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:12,118 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:12,118 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:12,119 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:12,119 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:12,120 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:12,125 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (202)] Ended with exit code 0 [2025-02-06 19:11:12,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:12,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:12,127 INFO L229 MonitoredProcess]: Starting monitored process 203 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:11:12,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (203)] Waiting until timeout for monitored process [2025-02-06 19:11:12,129 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:11:12,138 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:12,138 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:12,138 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:12,138 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:12,140 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:11:12,140 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:11:12,142 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:12,147 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (203)] Forceful destruction successful, exit code 0 [2025-02-06 19:11:12,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:12,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:12,149 INFO L229 MonitoredProcess]: Starting monitored process 204 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:11:12,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (204)] Waiting until timeout for monitored process [2025-02-06 19:11:12,151 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:11:12,160 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:12,161 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:12,161 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:12,161 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:12,162 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:11:12,162 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:11:12,164 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:12,169 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (204)] Forceful destruction successful, exit code 0 [2025-02-06 19:11:12,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:12,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:12,179 INFO L229 MonitoredProcess]: Starting monitored process 205 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:11:12,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (205)] Waiting until timeout for monitored process [2025-02-06 19:11:12,181 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:11:12,190 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:12,190 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:12,191 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:12,191 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:12,191 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:12,191 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:12,191 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:12,192 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:12,198 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (205)] Ended with exit code 0 [2025-02-06 19:11:12,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:12,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:12,200 INFO L229 MonitoredProcess]: Starting monitored process 206 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:11:12,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (206)] Waiting until timeout for monitored process [2025-02-06 19:11:12,202 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:11:12,212 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:12,212 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:12,212 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:12,212 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:12,212 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:12,212 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:12,212 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:12,213 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:12,219 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (206)] Forceful destruction successful, exit code 0 [2025-02-06 19:11:12,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:12,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:12,221 INFO L229 MonitoredProcess]: Starting monitored process 207 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:11:12,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (207)] Waiting until timeout for monitored process [2025-02-06 19:11:12,223 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:11:12,232 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:12,233 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:12,233 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:12,233 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:12,233 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:12,233 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:12,233 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:12,234 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:12,239 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (207)] Forceful destruction successful, exit code 0 [2025-02-06 19:11:12,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:12,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:12,241 INFO L229 MonitoredProcess]: Starting monitored process 208 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:11:12,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (208)] Waiting until timeout for monitored process [2025-02-06 19:11:12,244 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:11:12,253 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:12,253 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:12,253 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:12,253 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:12,253 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:12,253 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:12,254 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:12,254 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:12,260 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (208)] Ended with exit code 0 [2025-02-06 19:11:12,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:12,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:12,263 INFO L229 MonitoredProcess]: Starting monitored process 209 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:11:12,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (209)] Waiting until timeout for monitored process [2025-02-06 19:11:12,265 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:11:12,274 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:12,275 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:12,275 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:12,275 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:12,276 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:11:12,276 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:11:12,278 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:12,284 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (209)] Ended with exit code 0 [2025-02-06 19:11:12,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:12,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:12,286 INFO L229 MonitoredProcess]: Starting monitored process 210 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:11:12,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (210)] Waiting until timeout for monitored process [2025-02-06 19:11:12,288 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:11:12,298 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:12,298 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:12,298 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:12,298 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:12,298 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:12,298 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:12,298 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:12,299 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:12,305 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (210)] Ended with exit code 0 [2025-02-06 19:11:12,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:12,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:12,307 INFO L229 MonitoredProcess]: Starting monitored process 211 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:11:12,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (211)] Waiting until timeout for monitored process [2025-02-06 19:11:12,309 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:11:12,318 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:12,318 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:12,318 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:12,318 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:12,318 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:12,319 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:12,319 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:12,320 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:12,325 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (211)] Forceful destruction successful, exit code 0 [2025-02-06 19:11:12,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:12,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:12,327 INFO L229 MonitoredProcess]: Starting monitored process 212 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:11:12,355 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:11:12,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (212)] Waiting until timeout for monitored process [2025-02-06 19:11:12,365 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:12,365 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:12,365 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:12,365 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:12,365 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:12,366 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:12,366 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:12,366 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:12,371 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (212)] Forceful destruction successful, exit code 0 [2025-02-06 19:11:12,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:12,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:12,374 INFO L229 MonitoredProcess]: Starting monitored process 213 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:11:12,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (213)] Waiting until timeout for monitored process [2025-02-06 19:11:12,377 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:11:12,387 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:12,387 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:12,387 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:12,387 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:12,388 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:11:12,388 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:11:12,392 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:12,400 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (213)] Ended with exit code 0 [2025-02-06 19:11:12,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:12,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:12,402 INFO L229 MonitoredProcess]: Starting monitored process 214 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:11:12,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (214)] Waiting until timeout for monitored process [2025-02-06 19:11:12,404 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:11:12,414 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:12,414 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:12,414 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:12,414 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:12,414 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:12,414 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:12,414 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:12,415 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:12,420 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (214)] Forceful destruction successful, exit code 0 [2025-02-06 19:11:12,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:12,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:12,422 INFO L229 MonitoredProcess]: Starting monitored process 215 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:11:12,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (215)] Waiting until timeout for monitored process [2025-02-06 19:11:12,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:11:12,433 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:12,433 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:12,433 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:12,433 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:12,434 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:12,434 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:12,434 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:12,435 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:12,444 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (215)] Ended with exit code 0 [2025-02-06 19:11:12,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:12,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:12,446 INFO L229 MonitoredProcess]: Starting monitored process 216 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:11:12,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (216)] Waiting until timeout for monitored process [2025-02-06 19:11:12,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:11:12,458 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:12,458 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:12,458 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:12,458 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:12,458 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:12,458 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:12,458 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:12,459 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:12,465 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (216)] Forceful destruction successful, exit code 0 [2025-02-06 19:11:12,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:12,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:12,467 INFO L229 MonitoredProcess]: Starting monitored process 217 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:11:12,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (217)] Waiting until timeout for monitored process [2025-02-06 19:11:12,470 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:11:12,479 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:12,480 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:12,480 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:12,480 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:12,480 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:12,480 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:12,480 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:12,481 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:12,487 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (217)] Forceful destruction successful, exit code 0 [2025-02-06 19:11:12,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:12,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:12,489 INFO L229 MonitoredProcess]: Starting monitored process 218 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:11:12,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (218)] Waiting until timeout for monitored process [2025-02-06 19:11:12,491 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:11:12,501 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:12,501 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:12,501 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:12,501 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:12,501 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:12,501 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:12,501 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:12,502 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:12,508 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (218)] Ended with exit code 0 [2025-02-06 19:11:12,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:12,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:12,510 INFO L229 MonitoredProcess]: Starting monitored process 219 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:11:12,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (219)] Waiting until timeout for monitored process [2025-02-06 19:11:12,512 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:11:12,521 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:12,521 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:12,522 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:12,522 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:12,522 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:12,522 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:12,522 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:12,523 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:12,529 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (219)] Forceful destruction successful, exit code 0 [2025-02-06 19:11:12,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:12,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:12,531 INFO L229 MonitoredProcess]: Starting monitored process 220 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:11:12,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (220)] Waiting until timeout for monitored process [2025-02-06 19:11:12,533 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:11:12,543 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:12,543 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:12,543 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:12,543 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:12,545 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:11:12,545 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:11:12,547 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:12,553 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (220)] Forceful destruction successful, exit code 0 [2025-02-06 19:11:12,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:12,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:12,555 INFO L229 MonitoredProcess]: Starting monitored process 221 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:11:12,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (221)] Waiting until timeout for monitored process [2025-02-06 19:11:12,557 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:11:12,566 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:12,567 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:12,567 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:12,567 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:12,567 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:12,567 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:12,567 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:12,568 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:12,574 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (221)] Ended with exit code 0 [2025-02-06 19:11:12,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:12,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:12,576 INFO L229 MonitoredProcess]: Starting monitored process 222 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:11:12,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (222)] Waiting until timeout for monitored process [2025-02-06 19:11:12,578 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:11:12,587 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:12,588 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:12,588 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:12,588 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:12,588 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:12,588 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:12,588 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:12,589 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:12,594 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (222)] Forceful destruction successful, exit code 0 [2025-02-06 19:11:12,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:12,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:12,596 INFO L229 MonitoredProcess]: Starting monitored process 223 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:11:12,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (223)] Waiting until timeout for monitored process [2025-02-06 19:11:12,598 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:11:12,607 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:12,607 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:12,607 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:12,607 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:12,610 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:11:12,610 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:11:12,615 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:12,620 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (223)] Ended with exit code 0 [2025-02-06 19:11:12,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:12,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:12,622 INFO L229 MonitoredProcess]: Starting monitored process 224 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:11:12,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (224)] Waiting until timeout for monitored process [2025-02-06 19:11:12,623 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:11:12,633 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:12,633 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:12,633 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:12,633 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:12,636 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:11:12,636 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:11:12,639 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:12,644 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (224)] Ended with exit code 0 [2025-02-06 19:11:12,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:12,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:12,646 INFO L229 MonitoredProcess]: Starting monitored process 225 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:11:12,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (225)] Waiting until timeout for monitored process [2025-02-06 19:11:12,649 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:11:12,658 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:12,659 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:12,659 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:12,659 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:12,661 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:11:12,661 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:11:12,666 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:12,672 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (225)] Forceful destruction successful, exit code 0 [2025-02-06 19:11:12,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:12,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:12,673 INFO L229 MonitoredProcess]: Starting monitored process 226 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:11:12,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (226)] Waiting until timeout for monitored process [2025-02-06 19:11:12,675 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:11:12,685 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:12,685 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:12,685 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:12,686 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:12,688 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:11:12,688 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:11:12,691 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:12,697 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (226)] Ended with exit code 0 [2025-02-06 19:11:12,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:12,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:12,698 INFO L229 MonitoredProcess]: Starting monitored process 227 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:11:12,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (227)] Waiting until timeout for monitored process [2025-02-06 19:11:12,701 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:11:12,711 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:12,711 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:12,711 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:12,711 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:12,713 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:11:12,713 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:11:12,716 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:12,722 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (227)] Forceful destruction successful, exit code 0 [2025-02-06 19:11:12,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:12,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:12,724 INFO L229 MonitoredProcess]: Starting monitored process 228 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:11:12,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (228)] Waiting until timeout for monitored process [2025-02-06 19:11:12,726 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:11:12,736 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:12,736 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:12,736 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:12,736 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:12,738 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:11:12,738 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:11:12,741 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:12,747 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (228)] Forceful destruction successful, exit code 0 [2025-02-06 19:11:12,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:12,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:12,749 INFO L229 MonitoredProcess]: Starting monitored process 229 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:11:12,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (229)] Waiting until timeout for monitored process [2025-02-06 19:11:12,751 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:11:12,761 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:12,761 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:12,761 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:12,761 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:12,763 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:11:12,763 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:11:12,767 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-06 19:11:12,775 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-02-06 19:11:12,775 INFO L444 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 6 variables to zero. [2025-02-06 19:11:12,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:12,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:12,777 INFO L229 MonitoredProcess]: Starting monitored process 230 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:11:12,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (230)] Waiting until timeout for monitored process [2025-02-06 19:11:12,779 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-06 19:11:12,790 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-02-06 19:11:12,790 INFO L474 LassoAnalysis]: Proved termination. [2025-02-06 19:11:12,790 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc12#1.base) (+ ULTIMATE.start_test_fun_~a#1.offset 24))_1) = -1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc12#1.base) (+ ULTIMATE.start_test_fun_~a#1.offset 24))_1 Supporting invariants [] [2025-02-06 19:11:12,795 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (229)] Forceful destruction successful, exit code 0 [2025-02-06 19:11:12,839 INFO L156 tatePredicateManager]: 15 out of 17 supporting invariants were superfluous and have been removed [2025-02-06 19:11:12,842 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-02-06 19:11:12,842 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-02-06 19:11:12,842 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[#t~malloc12!base,]]] [2025-02-06 19:11:12,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:12,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-06 19:11:12,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-06 19:11:12,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:12,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:11:12,881 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-02-06 19:11:12,882 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:11:13,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:11:13,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:11:13,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:13,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:11:13,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-06 19:11:13,088 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:11:13,106 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:11:13,106 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.9 stem predicates 2 loop predicates [2025-02-06 19:11:13,107 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 65 states and 81 transitions. cyclomatic complexity: 30 Second operand has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 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:11:13,130 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 65 states and 81 transitions. cyclomatic complexity: 30. Second operand has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 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 66 states and 83 transitions. Complement of second has 5 states. [2025-02-06 19:11:13,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2025-02-06 19:11:13,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 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:11:13,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2025-02-06 19:11:13,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 49 letters. Loop has 2 letters. [2025-02-06 19:11:13,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:11:13,131 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-06 19:11:13,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:13,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-06 19:11:13,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-06 19:11:13,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:13,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:11:13,170 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-02-06 19:11:13,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:11:13,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:11:13,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:11:13,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:13,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:11:13,368 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-06 19:11:13,370 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:11:13,387 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:11:13,388 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.9 stem predicates 2 loop predicates [2025-02-06 19:11:13,388 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 65 states and 81 transitions. cyclomatic complexity: 30 Second operand has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 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:11:13,414 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 65 states and 81 transitions. cyclomatic complexity: 30. Second operand has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 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 66 states and 83 transitions. Complement of second has 5 states. [2025-02-06 19:11:13,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2025-02-06 19:11:13,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 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:11:13,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2025-02-06 19:11:13,418 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 49 letters. Loop has 2 letters. [2025-02-06 19:11:13,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:11:13,418 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-06 19:11:13,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:13,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-06 19:11:13,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-06 19:11:13,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:13,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:11:13,465 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-02-06 19:11:13,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:11:13,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:11:13,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:11:13,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:13,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:11:13,690 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-06 19:11:13,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:11:13,761 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:11:13,761 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.9 stem predicates 2 loop predicates [2025-02-06 19:11:13,761 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 65 states and 81 transitions. cyclomatic complexity: 30 Second operand has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 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:11:13,999 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 65 states and 81 transitions. cyclomatic complexity: 30. Second operand has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 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 98 states and 126 transitions. Complement of second has 21 states. [2025-02-06 19:11:13,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 13 states 9 stem states 2 non-accepting loop states 2 accepting loop states [2025-02-06 19:11:13,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 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:11:14,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 84 transitions. [2025-02-06 19:11:14,000 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 84 transitions. Stem has 49 letters. Loop has 2 letters. [2025-02-06 19:11:14,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:11:14,000 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 84 transitions. Stem has 51 letters. Loop has 2 letters. [2025-02-06 19:11:14,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:11:14,000 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 84 transitions. Stem has 49 letters. Loop has 4 letters. [2025-02-06 19:11:14,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:11:14,000 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 98 states and 126 transitions. [2025-02-06 19:11:14,001 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-06 19:11:14,001 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 98 states to 90 states and 116 transitions. [2025-02-06 19:11:14,001 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-02-06 19:11:14,001 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2025-02-06 19:11:14,001 INFO L73 IsDeterministic]: Start isDeterministic. Operand 90 states and 116 transitions. [2025-02-06 19:11:14,001 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:11:14,001 INFO L218 hiAutomatonCegarLoop]: Abstraction has 90 states and 116 transitions. [2025-02-06 19:11:14,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states and 116 transitions. [2025-02-06 19:11:14,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 73. [2025-02-06 19:11:14,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 73 states have (on average 1.2465753424657535) internal successors, (91), 72 states have internal predecessors, (91), 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:11:14,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 91 transitions. [2025-02-06 19:11:14,006 INFO L240 hiAutomatonCegarLoop]: Abstraction has 73 states and 91 transitions. [2025-02-06 19:11:14,006 INFO L432 stractBuchiCegarLoop]: Abstraction has 73 states and 91 transitions. [2025-02-06 19:11:14,006 INFO L338 stractBuchiCegarLoop]: ======== Iteration 22 ============ [2025-02-06 19:11:14,006 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 73 states and 91 transitions. [2025-02-06 19:11:14,006 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-06 19:11:14,006 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:11:14,006 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:11:14,007 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1] [2025-02-06 19:11:14,007 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-06 19:11:14,007 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~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet13#1, main_#t~post14#1, main_~k~0#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet11#1;main_~array_size~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;main_~k~0#1 := 0;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume !(main_~k~0#1 < main_~array_size~0#1);havoc main_~k~0#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~post8#1, test_fun_#t~post9#1, test_fun_#t~post10#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~pos~0#1, test_fun_~neg~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~pos~0#1 := 0;test_fun_~neg~0#1 := 0;test_fun_~i~0#1 := 0;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" [2025-02-06 19:11:14,007 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume test_fun_#t~mem2#1 < 0;havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(1 + test_fun_#t~post4#1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~neg~0#1;test_fun_~neg~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1;" [2025-02-06 19:11:14,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:14,010 INFO L85 PathProgramCache]: Analyzing trace with hash 725322033, now seen corresponding path program 17 times [2025-02-06 19:11:14,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:11:14,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027609725] [2025-02-06 19:11:14,010 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 19:11:14,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:11:14,016 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 55 statements into 8 equivalence classes. [2025-02-06 19:11:14,023 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) and asserted 55 of 55 statements. [2025-02-06 19:11:14,023 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2025-02-06 19:11:14,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:11:14,090 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (230)] Ended with exit code 0 [2025-02-06 19:11:14,271 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 133 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:11:14,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:11:14,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027609725] [2025-02-06 19:11:14,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027609725] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:11:14,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [563172604] [2025-02-06 19:11:14,271 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 19:11:14,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:11:14,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:14,277 INFO L229 MonitoredProcess]: Starting monitored process 231 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:11:14,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (231)] Waiting until timeout for monitored process [2025-02-06 19:11:14,355 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 55 statements into 8 equivalence classes. [2025-02-06 19:11:14,387 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) and asserted 55 of 55 statements. [2025-02-06 19:11:14,387 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2025-02-06 19:11:14,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:11:14,388 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-06 19:11:14,389 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:11:14,589 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 133 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:11:14,589 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:11:14,719 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 133 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:11:14,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [563172604] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:11:14,720 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:11:14,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 25 [2025-02-06 19:11:14,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954037126] [2025-02-06 19:11:14,720 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:11:14,720 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-06 19:11:14,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:14,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1376, now seen corresponding path program 14 times [2025-02-06 19:11:14,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:11:14,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444951158] [2025-02-06 19:11:14,720 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:11:14,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:11:14,723 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:11:14,724 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:11:14,724 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 19:11:14,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:14,724 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:11:14,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:11:14,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:11:14,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:14,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:14,726 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:11:14,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:11:14,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-02-06 19:11:14,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=481, Unknown=0, NotChecked=0, Total=650 [2025-02-06 19:11:14,754 INFO L87 Difference]: Start difference. First operand 73 states and 91 transitions. cyclomatic complexity: 34 Second operand has 26 states, 25 states have (on average 3.96) internal successors, (99), 26 states have internal predecessors, (99), 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:11:14,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:11:14,877 INFO L93 Difference]: Finished difference Result 131 states and 163 transitions. [2025-02-06 19:11:14,877 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 131 states and 163 transitions. [2025-02-06 19:11:14,877 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-06 19:11:14,878 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 131 states to 74 states and 92 transitions. [2025-02-06 19:11:14,878 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-02-06 19:11:14,878 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2025-02-06 19:11:14,878 INFO L73 IsDeterministic]: Start isDeterministic. Operand 74 states and 92 transitions. [2025-02-06 19:11:14,878 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:11:14,878 INFO L218 hiAutomatonCegarLoop]: Abstraction has 74 states and 92 transitions. [2025-02-06 19:11:14,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states and 92 transitions. [2025-02-06 19:11:14,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2025-02-06 19:11:14,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 74 states have (on average 1.2432432432432432) internal successors, (92), 73 states have internal predecessors, (92), 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:11:14,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 92 transitions. [2025-02-06 19:11:14,879 INFO L240 hiAutomatonCegarLoop]: Abstraction has 74 states and 92 transitions. [2025-02-06 19:11:14,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-06 19:11:14,880 INFO L432 stractBuchiCegarLoop]: Abstraction has 74 states and 92 transitions. [2025-02-06 19:11:14,880 INFO L338 stractBuchiCegarLoop]: ======== Iteration 23 ============ [2025-02-06 19:11:14,880 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 74 states and 92 transitions. [2025-02-06 19:11:14,880 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-06 19:11:14,880 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:11:14,880 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:11:14,880 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1] [2025-02-06 19:11:14,880 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-06 19:11:14,881 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~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet13#1, main_#t~post14#1, main_~k~0#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet11#1;main_~array_size~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;main_~k~0#1 := 0;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume !(main_~k~0#1 < main_~array_size~0#1);havoc main_~k~0#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~post8#1, test_fun_#t~post9#1, test_fun_#t~post10#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~pos~0#1, test_fun_~neg~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~pos~0#1 := 0;test_fun_~neg~0#1 := 0;test_fun_~i~0#1 := 0;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" [2025-02-06 19:11:14,881 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume test_fun_#t~mem2#1 < 0;havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(1 + test_fun_#t~post4#1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~neg~0#1;test_fun_~neg~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1;" [2025-02-06 19:11:14,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:14,881 INFO L85 PathProgramCache]: Analyzing trace with hash -541269989, now seen corresponding path program 18 times [2025-02-06 19:11:14,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:11:14,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053877493] [2025-02-06 19:11:14,881 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 19:11:14,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:11:14,887 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 56 statements into 8 equivalence classes. [2025-02-06 19:11:14,898 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) and asserted 56 of 56 statements. [2025-02-06 19:11:14,898 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2025-02-06 19:11:14,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:14,898 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:11:14,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-06 19:11:14,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-06 19:11:14,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:14,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:14,909 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:11:14,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:14,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1376, now seen corresponding path program 15 times [2025-02-06 19:11:14,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:11:14,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982939494] [2025-02-06 19:11:14,910 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 19:11:14,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:11:14,912 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:11:14,912 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:11:14,913 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-06 19:11:14,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:14,913 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:11:14,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:11:14,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:11:14,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:14,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:14,914 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:11:14,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:14,915 INFO L85 PathProgramCache]: Analyzing trace with hash -469416198, now seen corresponding path program 7 times [2025-02-06 19:11:14,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:11:14,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970084588] [2025-02-06 19:11:14,915 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-06 19:11:14,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:11:14,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-06 19:11:14,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-06 19:11:14,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:14,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:14,927 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:11:14,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-06 19:11:14,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-06 19:11:14,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:14,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:14,938 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:11:18,158 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:11:18,158 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:11:18,158 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:11:18,158 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:11:18,158 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-06 19:11:18,158 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:18,158 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:11:18,158 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:11:18,159 INFO L132 ssoRankerPreferences]: Filename of dumped script: array02-alloca-2.i_Iteration23_Lasso [2025-02-06 19:11:18,159 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:11:18,159 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:11:18,160 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:18,162 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:18,163 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:18,164 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:18,165 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:18,166 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:18,168 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:18,169 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:18,177 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:18,188 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:18,191 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:18,612 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:18,614 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:18,615 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:18,617 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:18,618 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:18,620 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:18,621 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:18,622 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:18,623 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:18,624 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:18,626 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:18,627 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:18,628 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:18,924 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:11:18,925 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-06 19:11:18,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:18,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:18,930 INFO L229 MonitoredProcess]: Starting monitored process 232 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:11:18,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (232)] Waiting until timeout for monitored process [2025-02-06 19:11:18,933 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:11:18,943 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:18,943 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:18,943 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:18,943 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:18,943 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:18,943 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:18,943 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:18,947 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:18,953 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (232)] Forceful destruction successful, exit code 0 [2025-02-06 19:11:18,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:18,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:18,955 INFO L229 MonitoredProcess]: Starting monitored process 233 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:11:18,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (233)] Waiting until timeout for monitored process [2025-02-06 19:11:18,956 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:11:18,966 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:18,966 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:18,966 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:18,966 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:18,966 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:18,967 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:18,967 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:18,968 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:18,973 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (233)] Ended with exit code 0 [2025-02-06 19:11:18,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:18,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:18,975 INFO L229 MonitoredProcess]: Starting monitored process 234 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:11:18,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (234)] Waiting until timeout for monitored process [2025-02-06 19:11:18,977 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:11:18,986 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:18,986 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:18,987 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:18,987 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:18,987 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:18,987 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:18,987 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:18,988 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:18,993 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (234)] Forceful destruction successful, exit code 0 [2025-02-06 19:11:18,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:18,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:18,995 INFO L229 MonitoredProcess]: Starting monitored process 235 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:11:18,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (235)] Waiting until timeout for monitored process [2025-02-06 19:11:18,996 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:11:19,006 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:19,007 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:19,007 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:19,007 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:19,007 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:19,007 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:19,007 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:19,008 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:19,014 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (235)] Forceful destruction successful, exit code 0 [2025-02-06 19:11:19,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:19,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:19,016 INFO L229 MonitoredProcess]: Starting monitored process 236 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:11:19,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (236)] Waiting until timeout for monitored process [2025-02-06 19:11:19,018 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:11:19,027 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:19,028 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:19,028 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:19,028 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:19,028 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:19,028 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:19,028 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:19,029 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:19,034 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (236)] Ended with exit code 0 [2025-02-06 19:11:19,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:19,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:19,036 INFO L229 MonitoredProcess]: Starting monitored process 237 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:11:19,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (237)] Waiting until timeout for monitored process [2025-02-06 19:11:19,038 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:11:19,047 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:19,048 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:19,048 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:19,048 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:19,048 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:19,048 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:19,048 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:19,049 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:19,054 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (237)] Forceful destruction successful, exit code 0 [2025-02-06 19:11:19,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:19,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:19,056 INFO L229 MonitoredProcess]: Starting monitored process 238 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:11:19,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (238)] Waiting until timeout for monitored process [2025-02-06 19:11:19,058 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:11:19,067 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:19,068 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:19,068 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:19,068 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:19,068 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:19,068 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:19,068 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:19,069 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:19,074 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (238)] Forceful destruction successful, exit code 0 [2025-02-06 19:11:19,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:19,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:19,076 INFO L229 MonitoredProcess]: Starting monitored process 239 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:11:19,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (239)] Waiting until timeout for monitored process [2025-02-06 19:11:19,079 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:11:19,088 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:19,088 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:19,088 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:19,088 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:19,088 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:19,089 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:19,089 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:19,090 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:19,095 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (239)] Forceful destruction successful, exit code 0 [2025-02-06 19:11:19,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:19,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:19,097 INFO L229 MonitoredProcess]: Starting monitored process 240 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:11:19,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (240)] Waiting until timeout for monitored process [2025-02-06 19:11:19,099 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:11:19,108 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:19,108 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:19,108 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:19,109 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:19,109 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:19,109 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:19,109 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:19,110 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:19,115 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (240)] Ended with exit code 0 [2025-02-06 19:11:19,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:19,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:19,117 INFO L229 MonitoredProcess]: Starting monitored process 241 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:11:19,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (241)] Waiting until timeout for monitored process [2025-02-06 19:11:19,119 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:11:19,128 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:19,128 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:19,128 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:19,128 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:19,128 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:19,129 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:19,129 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:19,130 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:19,135 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (241)] Ended with exit code 0 [2025-02-06 19:11:19,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:19,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:19,137 INFO L229 MonitoredProcess]: Starting monitored process 242 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:11:19,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (242)] Waiting until timeout for monitored process [2025-02-06 19:11:19,138 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:11:19,148 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:19,148 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:19,148 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:19,148 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:19,150 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:11:19,151 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:11:19,154 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:19,160 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (242)] Ended with exit code 0 [2025-02-06 19:11:19,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:19,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:19,162 INFO L229 MonitoredProcess]: Starting monitored process 243 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:11:19,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (243)] Waiting until timeout for monitored process [2025-02-06 19:11:19,163 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:11:19,173 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:19,173 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:19,173 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:19,173 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:19,176 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:11:19,176 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:11:19,182 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:19,187 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (243)] Ended with exit code 0 [2025-02-06 19:11:19,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:19,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:19,193 INFO L229 MonitoredProcess]: Starting monitored process 244 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:11:19,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (244)] Waiting until timeout for monitored process [2025-02-06 19:11:19,195 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:11:19,204 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:19,205 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:19,205 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:19,205 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:19,206 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:11:19,206 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:11:19,210 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:19,216 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (244)] Ended with exit code 0 [2025-02-06 19:11:19,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:19,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:19,218 INFO L229 MonitoredProcess]: Starting monitored process 245 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:11:19,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (245)] Waiting until timeout for monitored process [2025-02-06 19:11:19,220 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:11:19,230 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:19,230 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:19,230 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:19,230 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:19,233 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:11:19,233 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:11:19,237 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-06 19:11:19,245 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2025-02-06 19:11:19,245 INFO L444 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 6 variables to zero. [2025-02-06 19:11:19,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:19,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:19,248 INFO L229 MonitoredProcess]: Starting monitored process 246 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:11:19,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (246)] Waiting until timeout for monitored process [2025-02-06 19:11:19,249 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-06 19:11:19,260 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-02-06 19:11:19,260 INFO L474 LassoAnalysis]: Proved termination. [2025-02-06 19:11:19,260 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc12#1.base) (+ ULTIMATE.start_test_fun_~a#1.offset 28))_1) = -1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc12#1.base) (+ ULTIMATE.start_test_fun_~a#1.offset 28))_1 Supporting invariants [] [2025-02-06 19:11:19,266 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (245)] Forceful destruction successful, exit code 0 [2025-02-06 19:11:19,283 INFO L156 tatePredicateManager]: 10 out of 12 supporting invariants were superfluous and have been removed [2025-02-06 19:11:19,286 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-02-06 19:11:19,286 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-02-06 19:11:19,286 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[#t~malloc12!base,]]] [2025-02-06 19:11:19,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:19,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-06 19:11:19,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-06 19:11:19,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:19,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:11:19,327 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-02-06 19:11:19,328 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:11:19,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:11:19,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:11:19,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:19,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:11:19,555 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-06 19:11:19,555 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:11:19,572 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:11:19,573 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.10 stem predicates 2 loop predicates [2025-02-06 19:11:19,573 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 74 states and 92 transitions. cyclomatic complexity: 34 Second operand has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 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:11:19,598 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 74 states and 92 transitions. cyclomatic complexity: 34. Second operand has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 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 75 states and 94 transitions. Complement of second has 5 states. [2025-02-06 19:11:19,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2025-02-06 19:11:19,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 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:11:19,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2025-02-06 19:11:19,599 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 56 letters. Loop has 2 letters. [2025-02-06 19:11:19,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:11:19,599 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-06 19:11:19,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:19,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-06 19:11:19,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-06 19:11:19,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:19,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:11:19,642 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-02-06 19:11:19,643 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:11:19,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:11:19,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:11:19,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:19,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:11:19,839 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-06 19:11:19,840 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:11:19,855 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:11:19,855 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.10 stem predicates 2 loop predicates [2025-02-06 19:11:19,855 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 74 states and 92 transitions. cyclomatic complexity: 34 Second operand has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 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:11:19,879 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 74 states and 92 transitions. cyclomatic complexity: 34. Second operand has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 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 75 states and 94 transitions. Complement of second has 5 states. [2025-02-06 19:11:19,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2025-02-06 19:11:19,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 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:11:19,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2025-02-06 19:11:19,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 56 letters. Loop has 2 letters. [2025-02-06 19:11:19,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:11:19,883 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-06 19:11:19,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:19,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-06 19:11:19,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-06 19:11:19,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:19,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:11:19,951 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-02-06 19:11:19,952 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:11:20,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:11:20,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:11:20,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:20,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:11:20,155 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-06 19:11:20,155 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:11:20,179 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:11:20,181 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.10 stem predicates 2 loop predicates [2025-02-06 19:11:20,181 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 74 states and 92 transitions. cyclomatic complexity: 34 Second operand has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 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:11:20,253 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (246)] Forceful destruction successful, exit code 0 [2025-02-06 19:11:20,415 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 74 states and 92 transitions. cyclomatic complexity: 34. Second operand has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 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 108 states and 139 transitions. Complement of second has 23 states. [2025-02-06 19:11:20,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 10 stem states 2 non-accepting loop states 2 accepting loop states [2025-02-06 19:11:20,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 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:11:20,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 93 transitions. [2025-02-06 19:11:20,416 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 93 transitions. Stem has 56 letters. Loop has 2 letters. [2025-02-06 19:11:20,416 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:11:20,416 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 93 transitions. Stem has 58 letters. Loop has 2 letters. [2025-02-06 19:11:20,416 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:11:20,416 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 93 transitions. Stem has 56 letters. Loop has 4 letters. [2025-02-06 19:11:20,416 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:11:20,416 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 108 states and 139 transitions. [2025-02-06 19:11:20,417 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-06 19:11:20,417 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 108 states to 100 states and 129 transitions. [2025-02-06 19:11:20,417 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-02-06 19:11:20,418 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2025-02-06 19:11:20,418 INFO L73 IsDeterministic]: Start isDeterministic. Operand 100 states and 129 transitions. [2025-02-06 19:11:20,418 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:11:20,418 INFO L218 hiAutomatonCegarLoop]: Abstraction has 100 states and 129 transitions. [2025-02-06 19:11:20,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states and 129 transitions. [2025-02-06 19:11:20,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 82. [2025-02-06 19:11:20,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 82 states have (on average 1.2439024390243902) internal successors, (102), 81 states have internal predecessors, (102), 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:11:20,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 102 transitions. [2025-02-06 19:11:20,420 INFO L240 hiAutomatonCegarLoop]: Abstraction has 82 states and 102 transitions. [2025-02-06 19:11:20,420 INFO L432 stractBuchiCegarLoop]: Abstraction has 82 states and 102 transitions. [2025-02-06 19:11:20,420 INFO L338 stractBuchiCegarLoop]: ======== Iteration 24 ============ [2025-02-06 19:11:20,420 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 82 states and 102 transitions. [2025-02-06 19:11:20,421 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-06 19:11:20,421 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:11:20,421 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:11:20,421 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1] [2025-02-06 19:11:20,421 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-06 19:11:20,421 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~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet13#1, main_#t~post14#1, main_~k~0#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet11#1;main_~array_size~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;main_~k~0#1 := 0;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume !(main_~k~0#1 < main_~array_size~0#1);havoc main_~k~0#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~post8#1, test_fun_#t~post9#1, test_fun_#t~post10#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~pos~0#1, test_fun_~neg~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~pos~0#1 := 0;test_fun_~neg~0#1 := 0;test_fun_~i~0#1 := 0;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" [2025-02-06 19:11:20,421 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume test_fun_#t~mem2#1 < 0;havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(1 + test_fun_#t~post4#1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~neg~0#1;test_fun_~neg~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1;" [2025-02-06 19:11:20,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:20,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1101685796, now seen corresponding path program 19 times [2025-02-06 19:11:20,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:11:20,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584982335] [2025-02-06 19:11:20,422 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-06 19:11:20,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:11:20,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-06 19:11:20,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-06 19:11:20,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:20,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:11:20,686 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 133 proven. 79 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:11:20,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:11:20,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584982335] [2025-02-06 19:11:20,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584982335] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:11:20,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [349759753] [2025-02-06 19:11:20,686 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-06 19:11:20,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:11:20,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:20,689 INFO L229 MonitoredProcess]: Starting monitored process 247 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:11:20,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (247)] Waiting until timeout for monitored process [2025-02-06 19:11:20,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-06 19:11:20,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-06 19:11:20,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:20,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:11:20,797 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-02-06 19:11:20,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:11:21,034 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 176 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:11:21,034 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:11:21,194 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 176 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:11:21,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [349759753] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:11:21,195 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:11:21,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 30 [2025-02-06 19:11:21,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602205290] [2025-02-06 19:11:21,195 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:11:21,195 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-06 19:11:21,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:21,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1376, now seen corresponding path program 16 times [2025-02-06 19:11:21,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:11:21,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393536419] [2025-02-06 19:11:21,196 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 19:11:21,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:11:21,198 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 2 statements into 2 equivalence classes. [2025-02-06 19:11:21,199 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:11:21,199 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 19:11:21,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:21,199 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:11:21,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:11:21,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:11:21,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:21,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:21,202 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:11:21,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:11:21,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-02-06 19:11:21,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=707, Unknown=0, NotChecked=0, Total=930 [2025-02-06 19:11:21,224 INFO L87 Difference]: Start difference. First operand 82 states and 102 transitions. cyclomatic complexity: 38 Second operand has 31 states, 30 states have (on average 4.033333333333333) internal successors, (121), 31 states have internal predecessors, (121), 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:11:21,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:11:21,396 INFO L93 Difference]: Finished difference Result 148 states and 184 transitions. [2025-02-06 19:11:21,396 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 148 states and 184 transitions. [2025-02-06 19:11:21,397 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-06 19:11:21,397 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 148 states to 83 states and 103 transitions. [2025-02-06 19:11:21,397 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-02-06 19:11:21,397 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2025-02-06 19:11:21,397 INFO L73 IsDeterministic]: Start isDeterministic. Operand 83 states and 103 transitions. [2025-02-06 19:11:21,397 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:11:21,397 INFO L218 hiAutomatonCegarLoop]: Abstraction has 83 states and 103 transitions. [2025-02-06 19:11:21,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states and 103 transitions. [2025-02-06 19:11:21,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2025-02-06 19:11:21,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 83 states have (on average 1.2409638554216869) internal successors, (103), 82 states have internal predecessors, (103), 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:11:21,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 103 transitions. [2025-02-06 19:11:21,399 INFO L240 hiAutomatonCegarLoop]: Abstraction has 83 states and 103 transitions. [2025-02-06 19:11:21,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-06 19:11:21,399 INFO L432 stractBuchiCegarLoop]: Abstraction has 83 states and 103 transitions. [2025-02-06 19:11:21,400 INFO L338 stractBuchiCegarLoop]: ======== Iteration 25 ============ [2025-02-06 19:11:21,400 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 83 states and 103 transitions. [2025-02-06 19:11:21,400 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-06 19:11:21,400 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:11:21,400 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:11:21,400 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [9, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1] [2025-02-06 19:11:21,400 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-06 19:11:21,400 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~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet13#1, main_#t~post14#1, main_~k~0#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet11#1;main_~array_size~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;main_~k~0#1 := 0;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume !(main_~k~0#1 < main_~array_size~0#1);havoc main_~k~0#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~post8#1, test_fun_#t~post9#1, test_fun_#t~post10#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~pos~0#1, test_fun_~neg~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~pos~0#1 := 0;test_fun_~neg~0#1 := 0;test_fun_~i~0#1 := 0;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" [2025-02-06 19:11:21,401 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume test_fun_#t~mem2#1 < 0;havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(1 + test_fun_#t~post4#1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~neg~0#1;test_fun_~neg~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1;" [2025-02-06 19:11:21,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:21,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1122980346, now seen corresponding path program 20 times [2025-02-06 19:11:21,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:11:21,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811660680] [2025-02-06 19:11:21,401 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:11:21,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:11:21,408 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 63 statements into 2 equivalence classes. [2025-02-06 19:11:21,420 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 63 of 63 statements. [2025-02-06 19:11:21,420 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 19:11:21,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:21,420 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:11:21,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-06 19:11:21,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-06 19:11:21,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:21,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:21,437 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:11:21,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:21,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1376, now seen corresponding path program 17 times [2025-02-06 19:11:21,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:11:21,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035024641] [2025-02-06 19:11:21,438 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 19:11:21,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:11:21,441 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:11:21,442 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:11:21,442 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 19:11:21,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:21,442 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:11:21,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:11:21,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:11:21,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:21,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:21,444 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:11:21,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:21,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1147321625, now seen corresponding path program 8 times [2025-02-06 19:11:21,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:11:21,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892840994] [2025-02-06 19:11:21,445 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:11:21,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:11:21,451 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 65 statements into 2 equivalence classes. [2025-02-06 19:11:21,467 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 65 of 65 statements. [2025-02-06 19:11:21,467 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 19:11:21,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:21,467 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:11:21,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-06 19:11:21,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-06 19:11:21,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:21,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:21,484 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:11:25,829 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:11:25,829 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:11:25,829 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:11:25,829 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:11:25,829 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-06 19:11:25,829 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:25,829 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:11:25,829 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:11:25,829 INFO L132 ssoRankerPreferences]: Filename of dumped script: array02-alloca-2.i_Iteration25_Lasso [2025-02-06 19:11:25,829 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:11:25,829 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:11:25,830 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:25,832 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:25,833 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:25,834 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:25,835 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:25,836 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:25,838 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:25,839 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:25,840 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:25,841 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:25,842 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:25,843 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:25,844 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:25,845 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:25,846 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:25,848 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:25,850 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:25,851 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:25,852 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:26,300 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:26,301 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:26,303 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:26,304 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:26,305 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:26,648 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:11:26,648 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-06 19:11:26,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:26,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:26,650 INFO L229 MonitoredProcess]: Starting monitored process 248 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:11:26,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (248)] Waiting until timeout for monitored process [2025-02-06 19:11:26,653 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:11:26,663 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:26,663 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:26,663 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:26,663 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:26,663 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:26,663 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:26,663 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:26,664 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:26,669 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (248)] Forceful destruction successful, exit code 0 [2025-02-06 19:11:26,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:26,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:26,672 INFO L229 MonitoredProcess]: Starting monitored process 249 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:11:26,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (249)] Waiting until timeout for monitored process [2025-02-06 19:11:26,673 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:11:26,683 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:26,683 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:26,683 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:26,683 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:26,683 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:26,683 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:26,683 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:26,684 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:26,689 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (249)] Forceful destruction successful, exit code 0 [2025-02-06 19:11:26,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:26,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:26,695 INFO L229 MonitoredProcess]: Starting monitored process 250 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:11:26,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (250)] Waiting until timeout for monitored process [2025-02-06 19:11:26,698 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:11:26,708 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:26,708 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:26,709 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:26,709 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:26,709 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:26,709 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:26,709 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:26,710 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:26,715 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (250)] Forceful destruction successful, exit code 0 [2025-02-06 19:11:26,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:26,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:26,717 INFO L229 MonitoredProcess]: Starting monitored process 251 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:11:26,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (251)] Waiting until timeout for monitored process [2025-02-06 19:11:26,718 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:11:26,728 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:26,728 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:26,728 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:26,729 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:26,729 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:26,729 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:26,729 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:26,730 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:26,735 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (251)] Forceful destruction successful, exit code 0 [2025-02-06 19:11:26,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:26,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:26,739 INFO L229 MonitoredProcess]: Starting monitored process 252 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:11:26,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (252)] Waiting until timeout for monitored process [2025-02-06 19:11:26,742 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:11:26,751 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:26,751 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:26,751 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:26,751 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:26,752 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:11:26,752 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:11:26,754 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:26,759 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (252)] Forceful destruction successful, exit code 0 [2025-02-06 19:11:26,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:26,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:26,761 INFO L229 MonitoredProcess]: Starting monitored process 253 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:11:26,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (253)] Waiting until timeout for monitored process [2025-02-06 19:11:26,763 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:11:26,772 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:26,772 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:26,772 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:26,772 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:26,772 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:26,773 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:26,773 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:26,773 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:26,779 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (253)] Ended with exit code 0 [2025-02-06 19:11:26,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:26,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:26,781 INFO L229 MonitoredProcess]: Starting monitored process 254 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:11:26,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (254)] Waiting until timeout for monitored process [2025-02-06 19:11:26,783 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:11:26,792 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:26,792 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:26,792 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:26,792 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:26,792 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:26,793 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:26,793 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:26,794 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:26,799 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (254)] Ended with exit code 0 [2025-02-06 19:11:26,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:26,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:26,801 INFO L229 MonitoredProcess]: Starting monitored process 255 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:11:26,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (255)] Waiting until timeout for monitored process [2025-02-06 19:11:26,802 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:11:26,812 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:26,812 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:26,812 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:26,812 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:26,812 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:26,813 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:26,813 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:26,814 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:26,819 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (255)] Ended with exit code 0 [2025-02-06 19:11:26,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:26,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:26,821 INFO L229 MonitoredProcess]: Starting monitored process 256 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:11:26,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (256)] Waiting until timeout for monitored process [2025-02-06 19:11:26,823 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:11:26,832 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:26,832 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:26,832 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:26,832 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:26,832 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:26,832 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:26,833 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:26,833 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:26,839 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (256)] Forceful destruction successful, exit code 0 [2025-02-06 19:11:26,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:26,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:26,841 INFO L229 MonitoredProcess]: Starting monitored process 257 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:11:26,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (257)] Waiting until timeout for monitored process [2025-02-06 19:11:26,843 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:11:26,853 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:26,853 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:26,853 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:26,853 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:26,853 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:26,854 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:26,854 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:26,855 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:26,860 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (257)] Ended with exit code 0 [2025-02-06 19:11:26,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:26,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:26,862 INFO L229 MonitoredProcess]: Starting monitored process 258 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:11:26,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (258)] Waiting until timeout for monitored process [2025-02-06 19:11:26,864 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:11:26,874 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:26,874 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:26,874 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:26,874 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:26,874 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:26,874 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:26,875 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:26,876 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:26,881 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (258)] Forceful destruction successful, exit code 0 [2025-02-06 19:11:26,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:26,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:26,883 INFO L229 MonitoredProcess]: Starting monitored process 259 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:11:26,883 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (259)] Waiting until timeout for monitored process [2025-02-06 19:11:26,884 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:11:26,894 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:26,894 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:26,894 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:26,894 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:26,895 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:11:26,895 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:11:26,897 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:26,903 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (259)] Forceful destruction successful, exit code 0 [2025-02-06 19:11:26,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:26,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:26,905 INFO L229 MonitoredProcess]: Starting monitored process 260 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:11:26,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (260)] Waiting until timeout for monitored process [2025-02-06 19:11:26,906 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:11:26,916 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:26,916 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:26,916 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:26,916 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:26,916 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:26,916 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:26,916 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:26,917 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:26,923 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (260)] Ended with exit code 0 [2025-02-06 19:11:26,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:26,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:26,925 INFO L229 MonitoredProcess]: Starting monitored process 261 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:11:26,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (261)] Waiting until timeout for monitored process [2025-02-06 19:11:26,926 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:11:26,936 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:26,936 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:26,936 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:26,936 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:26,936 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:26,936 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:26,936 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:26,937 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:26,942 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (261)] Ended with exit code 0 [2025-02-06 19:11:26,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:26,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:26,944 INFO L229 MonitoredProcess]: Starting monitored process 262 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:11:26,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (262)] Waiting until timeout for monitored process [2025-02-06 19:11:26,946 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:11:26,955 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:26,955 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:26,955 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:26,955 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:26,956 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:11:26,956 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:11:26,958 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:26,963 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (262)] Ended with exit code 0 [2025-02-06 19:11:26,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:26,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:26,964 INFO L229 MonitoredProcess]: Starting monitored process 263 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:11:26,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (263)] Waiting until timeout for monitored process [2025-02-06 19:11:26,966 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:11:26,975 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:26,976 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:26,976 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:26,976 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:26,977 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:11:26,977 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:11:26,979 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:26,984 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (263)] Forceful destruction successful, exit code 0 [2025-02-06 19:11:26,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:26,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:26,986 INFO L229 MonitoredProcess]: Starting monitored process 264 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:11:26,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (264)] Waiting until timeout for monitored process [2025-02-06 19:11:26,988 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:11:26,998 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:26,998 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:26,998 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:26,998 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:26,998 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:26,998 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:26,998 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:26,999 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:27,004 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (264)] Forceful destruction successful, exit code 0 [2025-02-06 19:11:27,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:27,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:27,006 INFO L229 MonitoredProcess]: Starting monitored process 265 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:11:27,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (265)] Waiting until timeout for monitored process [2025-02-06 19:11:27,008 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:11:27,018 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:27,018 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:27,018 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:27,018 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:27,018 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:27,018 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:27,018 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:27,019 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:27,026 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (265)] Ended with exit code 0 [2025-02-06 19:11:27,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:27,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:27,030 INFO L229 MonitoredProcess]: Starting monitored process 266 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:11:27,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (266)] Waiting until timeout for monitored process [2025-02-06 19:11:27,033 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:11:27,043 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:27,043 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:27,043 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:27,043 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:27,045 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:11:27,045 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:11:27,049 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:27,054 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (266)] Forceful destruction successful, exit code 0 [2025-02-06 19:11:27,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:27,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:27,056 INFO L229 MonitoredProcess]: Starting monitored process 267 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:11:27,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (267)] Waiting until timeout for monitored process [2025-02-06 19:11:27,058 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:11:27,067 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:27,068 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:27,068 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:27,068 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:27,070 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:11:27,070 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:11:27,073 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:27,079 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (267)] Ended with exit code 0 [2025-02-06 19:11:27,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:27,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:27,080 INFO L229 MonitoredProcess]: Starting monitored process 268 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:11:27,081 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (268)] Waiting until timeout for monitored process [2025-02-06 19:11:27,082 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:11:27,091 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:27,092 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:27,092 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:27,092 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:27,093 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:11:27,093 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:11:27,096 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:27,101 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (268)] Ended with exit code 0 [2025-02-06 19:11:27,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:27,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:27,103 INFO L229 MonitoredProcess]: Starting monitored process 269 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:11:27,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (269)] Waiting until timeout for monitored process [2025-02-06 19:11:27,105 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:11:27,115 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:27,115 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:27,115 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:27,115 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:27,117 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:11:27,118 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:11:27,121 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:27,126 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (269)] Ended with exit code 0 [2025-02-06 19:11:27,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:27,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:27,128 INFO L229 MonitoredProcess]: Starting monitored process 270 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:11:27,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (270)] Waiting until timeout for monitored process [2025-02-06 19:11:27,132 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:11:27,142 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:27,142 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:27,142 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:27,142 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:27,144 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:11:27,144 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:11:27,148 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:27,154 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (270)] Forceful destruction successful, exit code 0 [2025-02-06 19:11:27,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:27,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:27,156 INFO L229 MonitoredProcess]: Starting monitored process 271 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:11:27,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (271)] Waiting until timeout for monitored process [2025-02-06 19:11:27,157 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:11:27,167 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:27,167 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:27,167 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:27,167 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:27,170 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:11:27,170 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:11:27,173 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:27,178 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (271)] Ended with exit code 0 [2025-02-06 19:11:27,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:27,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:27,180 INFO L229 MonitoredProcess]: Starting monitored process 272 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:11:27,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (272)] Waiting until timeout for monitored process [2025-02-06 19:11:27,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:11:27,191 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:27,191 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:27,191 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:27,191 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:27,193 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:11:27,194 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:11:27,198 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-06 19:11:27,207 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-02-06 19:11:27,207 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-02-06 19:11:27,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:27,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:27,209 INFO L229 MonitoredProcess]: Starting monitored process 273 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:11:27,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (273)] Waiting until timeout for monitored process [2025-02-06 19:11:27,211 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-06 19:11:27,221 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-02-06 19:11:27,221 INFO L474 LassoAnalysis]: Proved termination. [2025-02-06 19:11:27,221 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc12#1.base) (+ 32 ULTIMATE.start_test_fun_~a#1.offset))_1) = -1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc12#1.base) (+ 32 ULTIMATE.start_test_fun_~a#1.offset))_1 Supporting invariants [] [2025-02-06 19:11:27,227 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (272)] Ended with exit code 0 [2025-02-06 19:11:27,244 INFO L156 tatePredicateManager]: 11 out of 13 supporting invariants were superfluous and have been removed [2025-02-06 19:11:27,247 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-02-06 19:11:27,247 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-02-06 19:11:27,247 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[#t~malloc12!base,]]] [2025-02-06 19:11:27,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:27,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-06 19:11:27,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-06 19:11:27,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:27,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:11:27,288 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-02-06 19:11:27,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:11:27,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:11:27,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:11:27,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:27,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:11:27,524 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-06 19:11:27,524 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:11:27,541 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:11:27,541 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.11 stem predicates 2 loop predicates [2025-02-06 19:11:27,542 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 83 states and 103 transitions. cyclomatic complexity: 38 Second operand has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:11:27,567 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 83 states and 103 transitions. cyclomatic complexity: 38. Second operand has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 84 states and 105 transitions. Complement of second has 5 states. [2025-02-06 19:11:27,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2025-02-06 19:11:27,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:11:27,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2025-02-06 19:11:27,567 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 63 letters. Loop has 2 letters. [2025-02-06 19:11:27,568 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:11:27,568 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-06 19:11:27,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:27,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-06 19:11:27,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-06 19:11:27,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:27,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:11:27,618 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-02-06 19:11:27,619 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:11:27,891 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (273)] Ended with exit code 0 [2025-02-06 19:11:27,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:11:27,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:11:27,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:27,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:11:27,938 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-06 19:11:27,939 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:11:27,958 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:11:27,959 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.11 stem predicates 2 loop predicates [2025-02-06 19:11:27,959 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 83 states and 103 transitions. cyclomatic complexity: 38 Second operand has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:11:28,003 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 83 states and 103 transitions. cyclomatic complexity: 38. Second operand has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 84 states and 105 transitions. Complement of second has 5 states. [2025-02-06 19:11:28,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2025-02-06 19:11:28,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:11:28,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2025-02-06 19:11:28,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 63 letters. Loop has 2 letters. [2025-02-06 19:11:28,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:11:28,004 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-06 19:11:28,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:28,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-06 19:11:28,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-06 19:11:28,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:28,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:11:28,082 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-02-06 19:11:28,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:11:28,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:11:28,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:11:28,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:28,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:11:28,350 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-06 19:11:28,350 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:11:28,370 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:11:28,370 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.11 stem predicates 2 loop predicates [2025-02-06 19:11:28,370 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 83 states and 103 transitions. cyclomatic complexity: 38 Second operand has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:11:28,657 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 83 states and 103 transitions. cyclomatic complexity: 38. Second operand has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 118 states and 152 transitions. Complement of second has 25 states. [2025-02-06 19:11:28,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 15 states 11 stem states 2 non-accepting loop states 2 accepting loop states [2025-02-06 19:11:28,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:11:28,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 102 transitions. [2025-02-06 19:11:28,658 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 102 transitions. Stem has 63 letters. Loop has 2 letters. [2025-02-06 19:11:28,658 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:11:28,658 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 102 transitions. Stem has 65 letters. Loop has 2 letters. [2025-02-06 19:11:28,658 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:11:28,658 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 102 transitions. Stem has 63 letters. Loop has 4 letters. [2025-02-06 19:11:28,658 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:11:28,658 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 118 states and 152 transitions. [2025-02-06 19:11:28,659 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-06 19:11:28,660 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 118 states to 110 states and 142 transitions. [2025-02-06 19:11:28,660 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-02-06 19:11:28,660 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2025-02-06 19:11:28,660 INFO L73 IsDeterministic]: Start isDeterministic. Operand 110 states and 142 transitions. [2025-02-06 19:11:28,660 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:11:28,660 INFO L218 hiAutomatonCegarLoop]: Abstraction has 110 states and 142 transitions. [2025-02-06 19:11:28,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states and 142 transitions. [2025-02-06 19:11:28,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 91. [2025-02-06 19:11:28,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 91 states have (on average 1.2417582417582418) internal successors, (113), 90 states have internal predecessors, (113), 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:11:28,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 113 transitions. [2025-02-06 19:11:28,661 INFO L240 hiAutomatonCegarLoop]: Abstraction has 91 states and 113 transitions. [2025-02-06 19:11:28,662 INFO L432 stractBuchiCegarLoop]: Abstraction has 91 states and 113 transitions. [2025-02-06 19:11:28,662 INFO L338 stractBuchiCegarLoop]: ======== Iteration 26 ============ [2025-02-06 19:11:28,662 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 91 states and 113 transitions. [2025-02-06 19:11:28,662 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-06 19:11:28,662 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:11:28,662 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:11:28,662 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1] [2025-02-06 19:11:28,662 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-06 19:11:28,663 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~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet13#1, main_#t~post14#1, main_~k~0#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet11#1;main_~array_size~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;main_~k~0#1 := 0;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume !(main_~k~0#1 < main_~array_size~0#1);havoc main_~k~0#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~post8#1, test_fun_#t~post9#1, test_fun_#t~post10#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~pos~0#1, test_fun_~neg~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~pos~0#1 := 0;test_fun_~neg~0#1 := 0;test_fun_~i~0#1 := 0;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" [2025-02-06 19:11:28,663 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume test_fun_#t~mem2#1 < 0;havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(1 + test_fun_#t~post4#1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~neg~0#1;test_fun_~neg~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1;" [2025-02-06 19:11:28,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:28,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1408126269, now seen corresponding path program 21 times [2025-02-06 19:11:28,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:11:28,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775055564] [2025-02-06 19:11:28,663 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 19:11:28,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:11:28,673 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 69 statements into 10 equivalence classes. [2025-02-06 19:11:28,701 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) and asserted 69 of 69 statements. [2025-02-06 19:11:28,701 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2025-02-06 19:11:28,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:11:28,955 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 176 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:11:28,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:11:28,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775055564] [2025-02-06 19:11:28,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775055564] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:11:28,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [726407292] [2025-02-06 19:11:28,955 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 19:11:28,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:11:28,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:28,958 INFO L229 MonitoredProcess]: Starting monitored process 274 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:11:28,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (274)] Waiting until timeout for monitored process [2025-02-06 19:11:29,047 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 69 statements into 10 equivalence classes. [2025-02-06 19:11:29,105 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) and asserted 69 of 69 statements. [2025-02-06 19:11:29,105 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2025-02-06 19:11:29,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:11:29,107 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-02-06 19:11:29,108 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:11:29,414 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 225 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:11:29,414 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:11:29,612 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 225 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:11:29,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [726407292] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:11:29,613 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:11:29,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 33 [2025-02-06 19:11:29,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276977100] [2025-02-06 19:11:29,613 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:11:29,613 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-06 19:11:29,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:29,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1376, now seen corresponding path program 18 times [2025-02-06 19:11:29,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:11:29,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56106158] [2025-02-06 19:11:29,613 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 19:11:29,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:11:29,617 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:11:29,617 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:11:29,617 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-02-06 19:11:29,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:29,618 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:11:29,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:11:29,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:11:29,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:29,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:29,620 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:11:29,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:11:29,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-02-06 19:11:29,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=267, Invalid=855, Unknown=0, NotChecked=0, Total=1122 [2025-02-06 19:11:29,652 INFO L87 Difference]: Start difference. First operand 91 states and 113 transitions. cyclomatic complexity: 42 Second operand has 34 states, 33 states have (on average 4.0606060606060606) internal successors, (134), 34 states have internal predecessors, (134), 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:11:29,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:11:29,864 INFO L93 Difference]: Finished difference Result 165 states and 205 transitions. [2025-02-06 19:11:29,864 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 165 states and 205 transitions. [2025-02-06 19:11:29,865 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-06 19:11:29,865 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 165 states to 92 states and 114 transitions. [2025-02-06 19:11:29,865 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-02-06 19:11:29,865 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2025-02-06 19:11:29,865 INFO L73 IsDeterministic]: Start isDeterministic. Operand 92 states and 114 transitions. [2025-02-06 19:11:29,865 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:11:29,865 INFO L218 hiAutomatonCegarLoop]: Abstraction has 92 states and 114 transitions. [2025-02-06 19:11:29,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states and 114 transitions. [2025-02-06 19:11:29,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2025-02-06 19:11:29,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 92 states have (on average 1.2391304347826086) internal successors, (114), 91 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:11:29,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 114 transitions. [2025-02-06 19:11:29,867 INFO L240 hiAutomatonCegarLoop]: Abstraction has 92 states and 114 transitions. [2025-02-06 19:11:29,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-06 19:11:29,868 INFO L432 stractBuchiCegarLoop]: Abstraction has 92 states and 114 transitions. [2025-02-06 19:11:29,868 INFO L338 stractBuchiCegarLoop]: ======== Iteration 27 ============ [2025-02-06 19:11:29,868 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 92 states and 114 transitions. [2025-02-06 19:11:29,868 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-06 19:11:29,869 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:11:29,869 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:11:29,869 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1] [2025-02-06 19:11:29,869 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-06 19:11:29,869 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~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet13#1, main_#t~post14#1, main_~k~0#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet11#1;main_~array_size~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;main_~k~0#1 := 0;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume !(main_~k~0#1 < main_~array_size~0#1);havoc main_~k~0#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~post8#1, test_fun_#t~post9#1, test_fun_#t~post10#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~pos~0#1, test_fun_~neg~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~pos~0#1 := 0;test_fun_~neg~0#1 := 0;test_fun_~i~0#1 := 0;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" [2025-02-06 19:11:29,869 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume test_fun_#t~mem2#1 < 0;havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(1 + test_fun_#t~post4#1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~neg~0#1;test_fun_~neg~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1;" [2025-02-06 19:11:29,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:29,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1022121939, now seen corresponding path program 22 times [2025-02-06 19:11:29,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:11:29,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911341958] [2025-02-06 19:11:29,870 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 19:11:29,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:11:29,879 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 70 statements into 2 equivalence classes. [2025-02-06 19:11:29,902 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 70 of 70 statements. [2025-02-06 19:11:29,903 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 19:11:29,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:29,903 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:11:29,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-06 19:11:29,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-06 19:11:29,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:29,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:29,921 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:11:29,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:29,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1376, now seen corresponding path program 19 times [2025-02-06 19:11:29,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:11:29,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374204015] [2025-02-06 19:11:29,922 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-06 19:11:29,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:11:29,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:11:29,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:11:29,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:29,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:29,926 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:11:29,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:11:29,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:11:29,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:29,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:29,928 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:11:29,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:29,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1288327820, now seen corresponding path program 9 times [2025-02-06 19:11:29,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:11:29,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134675055] [2025-02-06 19:11:29,928 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 19:11:29,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:11:29,937 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 72 statements into 10 equivalence classes. [2025-02-06 19:11:29,974 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) and asserted 72 of 72 statements. [2025-02-06 19:11:29,974 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2025-02-06 19:11:29,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:29,974 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:11:29,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-02-06 19:11:29,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-02-06 19:11:29,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:29,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:29,989 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:11:42,952 WARN L286 SmtUtils]: Spent 12.93s on a formula simplification. DAG size of input: 361 DAG size of output: 272 (called from [L 276] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2025-02-06 19:11:43,248 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:11:43,248 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:11:43,249 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:11:43,249 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:11:43,249 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-06 19:11:43,249 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:43,249 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:11:43,249 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:11:43,249 INFO L132 ssoRankerPreferences]: Filename of dumped script: array02-alloca-2.i_Iteration27_Lasso [2025-02-06 19:11:43,249 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:11:43,249 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:11:43,250 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:43,253 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:43,254 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:43,256 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:43,257 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:43,258 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:43,260 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:43,262 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:43,263 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:43,264 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:43,266 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:43,267 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:43,269 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:43,270 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:43,275 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:44,129 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:44,131 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:44,132 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:44,134 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:44,135 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:44,137 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:44,139 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:44,140 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:44,141 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:11:44,517 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:11:44,517 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-06 19:11:44,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:44,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:44,521 INFO L229 MonitoredProcess]: Starting monitored process 275 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:11:44,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (275)] Waiting until timeout for monitored process [2025-02-06 19:11:44,525 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:11:44,535 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:44,535 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:44,535 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:44,536 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:44,536 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:44,536 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:44,536 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:44,537 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:44,542 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (275)] Ended with exit code 0 [2025-02-06 19:11:44,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:44,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:44,544 INFO L229 MonitoredProcess]: Starting monitored process 276 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:11:44,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (276)] Waiting until timeout for monitored process [2025-02-06 19:11:44,546 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:11:44,555 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:44,555 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:44,555 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:44,555 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:44,555 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:44,556 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:44,556 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:44,557 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:44,561 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (276)] Ended with exit code 0 [2025-02-06 19:11:44,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:44,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:44,563 INFO L229 MonitoredProcess]: Starting monitored process 277 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:11:44,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (277)] Waiting until timeout for monitored process [2025-02-06 19:11:44,565 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:11:44,575 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:44,575 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:44,575 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:44,575 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:44,575 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:44,575 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:44,576 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:44,576 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:44,582 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (277)] Forceful destruction successful, exit code 0 [2025-02-06 19:11:44,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:44,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:44,584 INFO L229 MonitoredProcess]: Starting monitored process 278 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:11:44,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (278)] Waiting until timeout for monitored process [2025-02-06 19:11:44,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:11:44,595 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:44,595 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:44,595 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:44,595 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:44,595 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:44,596 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:44,596 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:44,597 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:44,602 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (278)] Ended with exit code 0 [2025-02-06 19:11:44,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:44,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:44,604 INFO L229 MonitoredProcess]: Starting monitored process 279 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:11:44,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (279)] Waiting until timeout for monitored process [2025-02-06 19:11:44,606 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:11:44,616 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:44,616 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:44,616 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:44,616 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:44,616 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:44,616 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:44,616 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:44,617 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:44,622 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (279)] Ended with exit code 0 [2025-02-06 19:11:44,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:44,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:44,624 INFO L229 MonitoredProcess]: Starting monitored process 280 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:11:44,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (280)] Waiting until timeout for monitored process [2025-02-06 19:11:44,626 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:11:44,635 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:44,635 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:44,635 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:44,635 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:44,637 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:11:44,637 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:11:44,639 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:44,646 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (280)] Ended with exit code 0 [2025-02-06 19:11:44,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:44,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:44,650 INFO L229 MonitoredProcess]: Starting monitored process 281 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:11:44,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (281)] Waiting until timeout for monitored process [2025-02-06 19:11:44,652 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:11:44,661 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:44,661 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:44,661 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:44,661 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:44,661 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:44,662 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:44,662 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:44,663 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:44,668 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (281)] Ended with exit code 0 [2025-02-06 19:11:44,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:44,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:44,670 INFO L229 MonitoredProcess]: Starting monitored process 282 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:11:44,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (282)] Waiting until timeout for monitored process [2025-02-06 19:11:44,671 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:11:44,681 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:44,681 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:44,681 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:44,681 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:44,681 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:44,682 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:44,682 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:44,683 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:44,688 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (282)] Ended with exit code 0 [2025-02-06 19:11:44,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:44,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:44,690 INFO L229 MonitoredProcess]: Starting monitored process 283 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:11:44,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (283)] Waiting until timeout for monitored process [2025-02-06 19:11:44,692 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:11:44,702 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:44,702 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:44,702 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:44,702 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:44,702 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:44,702 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:44,702 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:44,703 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:44,709 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (283)] Ended with exit code 0 [2025-02-06 19:11:44,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:44,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:44,711 INFO L229 MonitoredProcess]: Starting monitored process 284 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:11:44,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (284)] Waiting until timeout for monitored process [2025-02-06 19:11:44,713 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:11:44,723 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:44,723 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:44,723 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:44,723 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:44,723 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:44,723 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:44,723 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:44,724 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:44,729 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (284)] Forceful destruction successful, exit code 0 [2025-02-06 19:11:44,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:44,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:44,731 INFO L229 MonitoredProcess]: Starting monitored process 285 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:11:44,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (285)] Waiting until timeout for monitored process [2025-02-06 19:11:44,733 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:11:44,742 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:44,743 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:44,743 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:44,743 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:44,743 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:44,743 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:44,743 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:44,744 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:44,749 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (285)] Ended with exit code 0 [2025-02-06 19:11:44,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:44,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:44,752 INFO L229 MonitoredProcess]: Starting monitored process 286 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:11:44,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (286)] Waiting until timeout for monitored process [2025-02-06 19:11:44,753 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:11:44,763 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:44,763 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:44,763 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:44,763 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:44,763 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:44,763 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:44,763 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:44,764 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:44,769 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (286)] Ended with exit code 0 [2025-02-06 19:11:44,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:44,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:44,772 INFO L229 MonitoredProcess]: Starting monitored process 287 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:11:44,773 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (287)] Waiting until timeout for monitored process [2025-02-06 19:11:44,773 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:11:44,783 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:44,783 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:44,783 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:44,783 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:44,783 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:44,783 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:44,783 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:44,784 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:44,790 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (287)] Ended with exit code 0 [2025-02-06 19:11:44,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:44,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:44,792 INFO L229 MonitoredProcess]: Starting monitored process 288 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:11:44,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (288)] Waiting until timeout for monitored process [2025-02-06 19:11:44,793 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:11:44,803 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:44,803 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:11:44,803 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:44,803 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:44,803 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:44,804 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:11:44,804 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:11:44,805 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:44,810 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (288)] Ended with exit code 0 [2025-02-06 19:11:44,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:44,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:44,813 INFO L229 MonitoredProcess]: Starting monitored process 289 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:11:44,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (289)] Waiting until timeout for monitored process [2025-02-06 19:11:44,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:11:44,824 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:44,824 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:44,824 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:44,824 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:44,826 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:11:44,826 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:11:44,830 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:44,835 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (289)] Forceful destruction successful, exit code 0 [2025-02-06 19:11:44,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:44,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:44,837 INFO L229 MonitoredProcess]: Starting monitored process 290 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:11:44,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (290)] Waiting until timeout for monitored process [2025-02-06 19:11:44,839 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:11:44,849 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:44,849 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:44,849 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:44,849 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:44,852 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:11:44,852 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:11:44,855 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:44,861 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (290)] Forceful destruction successful, exit code 0 [2025-02-06 19:11:44,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:44,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:44,863 INFO L229 MonitoredProcess]: Starting monitored process 291 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:11:44,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (291)] Waiting until timeout for monitored process [2025-02-06 19:11:44,865 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:11:44,876 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:44,877 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:44,877 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:44,877 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:44,879 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:11:44,879 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:11:44,882 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:44,888 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (291)] Ended with exit code 0 [2025-02-06 19:11:44,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:44,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:44,890 INFO L229 MonitoredProcess]: Starting monitored process 292 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:11:44,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (292)] Waiting until timeout for monitored process [2025-02-06 19:11:44,892 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:11:44,901 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:44,902 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:44,902 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:44,902 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:44,903 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:11:44,903 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:11:44,905 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:44,911 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (292)] Forceful destruction successful, exit code 0 [2025-02-06 19:11:44,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:44,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:44,913 INFO L229 MonitoredProcess]: Starting monitored process 293 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:11:44,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (293)] Waiting until timeout for monitored process [2025-02-06 19:11:44,915 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:11:44,924 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:44,924 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:44,924 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:44,924 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:44,925 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:11:44,925 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:11:44,928 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:44,933 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (293)] Ended with exit code 0 [2025-02-06 19:11:44,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:44,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:44,935 INFO L229 MonitoredProcess]: Starting monitored process 294 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:11:44,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (294)] Waiting until timeout for monitored process [2025-02-06 19:11:44,937 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:11:44,946 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:44,947 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:44,947 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:44,947 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:44,948 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:11:44,948 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:11:44,952 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:44,957 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (294)] Ended with exit code 0 [2025-02-06 19:11:44,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:44,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:44,959 INFO L229 MonitoredProcess]: Starting monitored process 295 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:11:44,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (295)] Waiting until timeout for monitored process [2025-02-06 19:11:44,961 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:11:44,970 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:44,970 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:44,970 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:44,970 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:44,973 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:11:44,973 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:11:44,976 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:44,981 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (295)] Ended with exit code 0 [2025-02-06 19:11:44,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:44,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:44,983 INFO L229 MonitoredProcess]: Starting monitored process 296 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:11:44,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (296)] Waiting until timeout for monitored process [2025-02-06 19:11:44,985 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:11:44,995 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:44,995 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:44,995 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:44,995 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:44,997 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:11:44,998 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:11:45,002 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:45,009 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (296)] Forceful destruction successful, exit code 0 [2025-02-06 19:11:45,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:45,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:45,011 INFO L229 MonitoredProcess]: Starting monitored process 297 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:11:45,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (297)] Waiting until timeout for monitored process [2025-02-06 19:11:45,013 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:11:45,022 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:45,023 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:45,023 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:45,023 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:45,024 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:11:45,024 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:11:45,028 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:45,033 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (297)] Ended with exit code 0 [2025-02-06 19:11:45,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:45,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:45,035 INFO L229 MonitoredProcess]: Starting monitored process 298 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:11:45,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (298)] Waiting until timeout for monitored process [2025-02-06 19:11:45,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:11:45,059 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:45,059 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:45,059 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:45,059 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:45,062 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:11:45,062 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:11:45,072 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:45,081 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (298)] Ended with exit code 0 [2025-02-06 19:11:45,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:45,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:45,087 INFO L229 MonitoredProcess]: Starting monitored process 299 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:11:45,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (299)] Waiting until timeout for monitored process [2025-02-06 19:11:45,088 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:11:45,109 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:45,109 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:45,109 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:45,109 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:45,111 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:11:45,111 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:11:45,117 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:45,127 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (299)] Ended with exit code 0 [2025-02-06 19:11:45,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:45,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:45,132 INFO L229 MonitoredProcess]: Starting monitored process 300 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:11:45,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (300)] Waiting until timeout for monitored process [2025-02-06 19:11:45,135 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:11:45,145 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:45,145 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:45,145 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:45,146 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:45,148 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:11:45,148 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:11:45,152 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:11:45,158 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (300)] Forceful destruction successful, exit code 0 [2025-02-06 19:11:45,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:45,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:45,160 INFO L229 MonitoredProcess]: Starting monitored process 301 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:11:45,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (301)] Waiting until timeout for monitored process [2025-02-06 19:11:45,162 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:11:45,171 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:11:45,171 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:11:45,171 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:11:45,171 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:11:45,174 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:11:45,174 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:11:45,181 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-06 19:11:45,185 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2025-02-06 19:11:45,185 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-02-06 19:11:45,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:11:45,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:45,188 INFO L229 MonitoredProcess]: Starting monitored process 302 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:11:45,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (302)] Waiting until timeout for monitored process [2025-02-06 19:11:45,190 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-06 19:11:45,200 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-02-06 19:11:45,201 INFO L474 LassoAnalysis]: Proved termination. [2025-02-06 19:11:45,201 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc12#1.base) 36)_1) = -1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_#t~malloc12#1.base) 36)_1 Supporting invariants [] [2025-02-06 19:11:45,206 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (301)] Ended with exit code 0 [2025-02-06 19:11:45,386 INFO L156 tatePredicateManager]: 39 out of 41 supporting invariants were superfluous and have been removed [2025-02-06 19:11:45,392 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-02-06 19:11:45,392 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-02-06 19:11:45,392 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[#t~malloc12!base,]]] [2025-02-06 19:11:45,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:45,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-06 19:11:45,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-06 19:11:45,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:45,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:11:45,491 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-02-06 19:11:45,492 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:11:45,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:11:45,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:11:45,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:45,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:11:45,855 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-06 19:11:45,855 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:11:45,873 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:11:45,873 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.12 stem predicates 2 loop predicates [2025-02-06 19:11:45,873 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 92 states and 114 transitions. cyclomatic complexity: 42 Second operand has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 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:11:45,899 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 92 states and 114 transitions. cyclomatic complexity: 42. Second operand has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 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 93 states and 116 transitions. Complement of second has 5 states. [2025-02-06 19:11:45,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2025-02-06 19:11:45,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 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:11:45,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2025-02-06 19:11:45,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 70 letters. Loop has 2 letters. [2025-02-06 19:11:45,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:11:45,901 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-06 19:11:45,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:45,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-06 19:11:45,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-06 19:11:45,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:45,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:11:45,948 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-02-06 19:11:45,949 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:11:46,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:11:46,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:11:46,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:46,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:11:46,371 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-06 19:11:46,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:11:46,393 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:11:46,393 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.12 stem predicates 2 loop predicates [2025-02-06 19:11:46,393 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 92 states and 114 transitions. cyclomatic complexity: 42 Second operand has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 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:11:46,425 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 92 states and 114 transitions. cyclomatic complexity: 42. Second operand has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 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 93 states and 116 transitions. Complement of second has 5 states. [2025-02-06 19:11:46,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2025-02-06 19:11:46,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 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:11:46,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2025-02-06 19:11:46,426 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 70 letters. Loop has 2 letters. [2025-02-06 19:11:46,426 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:11:46,426 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-06 19:11:46,469 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (302)] Ended with exit code 0 [2025-02-06 19:11:46,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:46,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-06 19:11:46,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-06 19:11:46,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:46,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:11:46,520 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-02-06 19:11:46,521 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:11:46,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:11:46,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:11:46,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:46,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:11:46,963 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-06 19:11:46,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:11:46,986 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:11:46,987 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.12 stem predicates 2 loop predicates [2025-02-06 19:11:46,987 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 92 states and 114 transitions. cyclomatic complexity: 42 Second operand has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 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:11:47,395 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 92 states and 114 transitions. cyclomatic complexity: 42. Second operand has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 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 128 states and 165 transitions. Complement of second has 27 states. [2025-02-06 19:11:47,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 16 states 12 stem states 2 non-accepting loop states 2 accepting loop states [2025-02-06 19:11:47,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 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:11:47,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 111 transitions. [2025-02-06 19:11:47,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 111 transitions. Stem has 70 letters. Loop has 2 letters. [2025-02-06 19:11:47,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:11:47,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 111 transitions. Stem has 72 letters. Loop has 2 letters. [2025-02-06 19:11:47,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:11:47,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 111 transitions. Stem has 70 letters. Loop has 4 letters. [2025-02-06 19:11:47,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:11:47,396 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 128 states and 165 transitions. [2025-02-06 19:11:47,397 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-06 19:11:47,397 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 128 states to 120 states and 155 transitions. [2025-02-06 19:11:47,397 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-02-06 19:11:47,397 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2025-02-06 19:11:47,397 INFO L73 IsDeterministic]: Start isDeterministic. Operand 120 states and 155 transitions. [2025-02-06 19:11:47,397 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:11:47,397 INFO L218 hiAutomatonCegarLoop]: Abstraction has 120 states and 155 transitions. [2025-02-06 19:11:47,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states and 155 transitions. [2025-02-06 19:11:47,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 100. [2025-02-06 19:11:47,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 100 states have (on average 1.24) internal successors, (124), 99 states have internal predecessors, (124), 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:11:47,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 124 transitions. [2025-02-06 19:11:47,399 INFO L240 hiAutomatonCegarLoop]: Abstraction has 100 states and 124 transitions. [2025-02-06 19:11:47,399 INFO L432 stractBuchiCegarLoop]: Abstraction has 100 states and 124 transitions. [2025-02-06 19:11:47,399 INFO L338 stractBuchiCegarLoop]: ======== Iteration 28 ============ [2025-02-06 19:11:47,399 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 100 states and 124 transitions. [2025-02-06 19:11:47,399 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-06 19:11:47,399 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:11:47,399 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:11:47,399 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1] [2025-02-06 19:11:47,399 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-06 19:11:47,400 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~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet13#1, main_#t~post14#1, main_~k~0#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet11#1;main_~array_size~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;main_~k~0#1 := 0;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume !(main_~k~0#1 < main_~array_size~0#1);havoc main_~k~0#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~post8#1, test_fun_#t~post9#1, test_fun_#t~post10#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~pos~0#1, test_fun_~neg~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~pos~0#1 := 0;test_fun_~neg~0#1 := 0;test_fun_~i~0#1 := 0;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" [2025-02-06 19:11:47,400 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume test_fun_#t~mem2#1 < 0;havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(1 + test_fun_#t~post4#1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~neg~0#1;test_fun_~neg~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1;" [2025-02-06 19:11:47,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:47,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1660638902, now seen corresponding path program 23 times [2025-02-06 19:11:47,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:11:47,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238630711] [2025-02-06 19:11:47,400 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 19:11:47,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:11:47,408 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 76 statements into 11 equivalence classes. [2025-02-06 19:11:47,418 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 76 of 76 statements. [2025-02-06 19:11:47,418 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-02-06 19:11:47,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:11:47,722 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 280 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:11:47,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:11:47,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238630711] [2025-02-06 19:11:47,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238630711] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:11:47,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [949950826] [2025-02-06 19:11:47,722 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 19:11:47,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:11:47,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:11:47,725 INFO L229 MonitoredProcess]: Starting monitored process 303 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:11:47,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (303)] Waiting until timeout for monitored process [2025-02-06 19:11:47,828 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 76 statements into 11 equivalence classes. [2025-02-06 19:11:47,875 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 76 of 76 statements. [2025-02-06 19:11:47,875 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-02-06 19:11:47,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:11:47,877 INFO L256 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-02-06 19:11:47,878 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:11:48,197 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 280 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:11:48,198 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:11:48,487 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 280 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:11:48,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [949950826] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:11:48,487 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:11:48,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 34 [2025-02-06 19:11:48,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160086309] [2025-02-06 19:11:48,488 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:11:48,488 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-06 19:11:48,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:48,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1376, now seen corresponding path program 20 times [2025-02-06 19:11:48,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:11:48,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369074526] [2025-02-06 19:11:48,488 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:11:48,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:11:48,494 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:11:48,495 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:11:48,495 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 19:11:48,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:48,495 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:11:48,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:11:48,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:11:48,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:48,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:48,501 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:11:48,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:11:48,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-02-06 19:11:48,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=298, Invalid=892, Unknown=0, NotChecked=0, Total=1190 [2025-02-06 19:11:48,548 INFO L87 Difference]: Start difference. First operand 100 states and 124 transitions. cyclomatic complexity: 46 Second operand has 35 states, 34 states have (on average 4.0588235294117645) internal successors, (138), 35 states have internal predecessors, (138), 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:11:48,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:11:48,727 INFO L93 Difference]: Finished difference Result 182 states and 226 transitions. [2025-02-06 19:11:48,727 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 182 states and 226 transitions. [2025-02-06 19:11:48,727 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-06 19:11:48,728 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 182 states to 101 states and 125 transitions. [2025-02-06 19:11:48,728 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-02-06 19:11:48,728 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2025-02-06 19:11:48,728 INFO L73 IsDeterministic]: Start isDeterministic. Operand 101 states and 125 transitions. [2025-02-06 19:11:48,728 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:11:48,728 INFO L218 hiAutomatonCegarLoop]: Abstraction has 101 states and 125 transitions. [2025-02-06 19:11:48,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states and 125 transitions. [2025-02-06 19:11:48,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2025-02-06 19:11:48,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 101 states have (on average 1.2376237623762376) internal successors, (125), 100 states have internal predecessors, (125), 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:11:48,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 125 transitions. [2025-02-06 19:11:48,729 INFO L240 hiAutomatonCegarLoop]: Abstraction has 101 states and 125 transitions. [2025-02-06 19:11:48,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-02-06 19:11:48,730 INFO L432 stractBuchiCegarLoop]: Abstraction has 101 states and 125 transitions. [2025-02-06 19:11:48,730 INFO L338 stractBuchiCegarLoop]: ======== Iteration 29 ============ [2025-02-06 19:11:48,730 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 101 states and 125 transitions. [2025-02-06 19:11:48,730 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-06 19:11:48,730 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:11:48,730 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:11:48,731 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [11, 11, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1] [2025-02-06 19:11:48,731 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-06 19:11:48,731 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~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet13#1, main_#t~post14#1, main_~k~0#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet11#1;main_~array_size~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;main_~k~0#1 := 0;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume !(main_~k~0#1 < main_~array_size~0#1);havoc main_~k~0#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~post8#1, test_fun_#t~post9#1, test_fun_#t~post10#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~pos~0#1, test_fun_~neg~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~pos~0#1 := 0;test_fun_~neg~0#1 := 0;test_fun_~i~0#1 := 0;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" [2025-02-06 19:11:48,731 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume test_fun_#t~mem2#1 < 0;havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(1 + test_fun_#t~post4#1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~neg~0#1;test_fun_~neg~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1;" [2025-02-06 19:11:48,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:48,731 INFO L85 PathProgramCache]: Analyzing trace with hash 470308364, now seen corresponding path program 24 times [2025-02-06 19:11:48,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:11:48,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67725935] [2025-02-06 19:11:48,732 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 19:11:48,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:11:48,739 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 77 statements into 11 equivalence classes. [2025-02-06 19:11:48,762 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) and asserted 77 of 77 statements. [2025-02-06 19:11:48,762 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2025-02-06 19:11:48,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:48,762 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:11:48,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-06 19:11:48,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-06 19:11:48,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:48,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:48,778 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:11:48,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:48,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1376, now seen corresponding path program 21 times [2025-02-06 19:11:48,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:11:48,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88163540] [2025-02-06 19:11:48,779 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 19:11:48,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:11:48,783 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:11:48,784 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:11:48,784 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-06 19:11:48,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:48,784 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:11:48,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:11:48,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:11:48,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:48,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:48,786 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:11:48,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:11:48,787 INFO L85 PathProgramCache]: Analyzing trace with hash 994772139, now seen corresponding path program 10 times [2025-02-06 19:11:48,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:11:48,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111600855] [2025-02-06 19:11:48,787 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 19:11:48,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:11:48,795 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 79 statements into 2 equivalence classes. [2025-02-06 19:11:48,810 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 79 of 79 statements. [2025-02-06 19:11:48,810 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 19:11:48,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:48,810 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:11:48,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-02-06 19:11:48,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-02-06 19:11:48,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:11:48,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:11:48,826 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:12:03,582 WARN L286 SmtUtils]: Spent 14.72s on a formula simplification. DAG size of input: 392 DAG size of output: 298 (called from [L 276] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2025-02-06 19:12:04,532 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:12:04,532 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:12:04,532 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:12:04,532 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:12:04,532 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-06 19:12:04,532 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:04,532 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:12:04,532 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:12:04,532 INFO L132 ssoRankerPreferences]: Filename of dumped script: array02-alloca-2.i_Iteration29_Lasso [2025-02-06 19:12:04,532 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:12:04,532 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:12:04,533 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:12:04,535 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:12:04,536 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:12:04,538 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:12:07,889 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:12:07,891 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:12:07,892 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:12:07,893 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:12:07,895 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:12:07,897 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:12:07,898 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:12:07,899 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:12:07,900 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:12:07,902 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:12:07,903 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:12:07,905 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:12:07,906 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:12:07,907 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:12:07,909 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:12:07,910 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:12:07,911 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:12:07,912 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:12:07,914 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:12:07,915 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:12:08,276 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:12:08,277 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-06 19:12:08,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:08,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:08,279 INFO L229 MonitoredProcess]: Starting monitored process 304 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:12:08,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (304)] Waiting until timeout for monitored process [2025-02-06 19:12:08,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:12:08,292 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:12:08,292 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:12:08,292 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:08,292 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:08,292 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:12:08,292 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:12:08,292 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:12:08,294 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:08,298 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (304)] Ended with exit code 0 [2025-02-06 19:12:08,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:08,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:08,301 INFO L229 MonitoredProcess]: Starting monitored process 305 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:12:08,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (305)] Waiting until timeout for monitored process [2025-02-06 19:12:08,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:12:08,312 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:12:08,312 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:12:08,312 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:08,312 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:08,313 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:12:08,313 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:12:08,313 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:12:08,314 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:08,319 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (305)] Ended with exit code 0 [2025-02-06 19:12:08,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:08,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:08,321 INFO L229 MonitoredProcess]: Starting monitored process 306 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:12:08,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (306)] Waiting until timeout for monitored process [2025-02-06 19:12:08,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:12:08,332 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:12:08,332 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:08,332 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:08,332 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:12:08,333 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:12:08,333 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:12:08,335 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:08,341 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (306)] Forceful destruction successful, exit code 0 [2025-02-06 19:12:08,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:08,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:08,342 INFO L229 MonitoredProcess]: Starting monitored process 307 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:12:08,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (307)] Waiting until timeout for monitored process [2025-02-06 19:12:08,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:12:08,354 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:12:08,354 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:08,354 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:08,354 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:12:08,357 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:12:08,357 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:12:08,360 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:08,365 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (307)] Forceful destruction successful, exit code 0 [2025-02-06 19:12:08,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:08,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:08,367 INFO L229 MonitoredProcess]: Starting monitored process 308 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:12:08,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (308)] Waiting until timeout for monitored process [2025-02-06 19:12:08,369 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:12:08,378 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:12:08,379 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:08,379 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:08,379 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:12:08,380 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:12:08,380 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:12:08,384 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:08,390 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (308)] Ended with exit code 0 [2025-02-06 19:12:08,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:08,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:08,392 INFO L229 MonitoredProcess]: Starting monitored process 309 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:12:08,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (309)] Waiting until timeout for monitored process [2025-02-06 19:12:08,394 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:12:08,404 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:12:08,404 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:08,404 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:08,404 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:12:08,407 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:12:08,407 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:12:08,411 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-06 19:12:08,421 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-02-06 19:12:08,421 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-02-06 19:12:08,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:08,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:08,424 INFO L229 MonitoredProcess]: Starting monitored process 310 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:12:08,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (310)] Waiting until timeout for monitored process [2025-02-06 19:12:08,425 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-06 19:12:08,435 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-02-06 19:12:08,436 INFO L474 LassoAnalysis]: Proved termination. [2025-02-06 19:12:08,436 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_test_fun_~a#1.base) (+ 40 ULTIMATE.start_test_fun_~a#1.offset))_1) = -1*v_rep(select (select #memory_int#0 ULTIMATE.start_test_fun_~a#1.base) (+ 40 ULTIMATE.start_test_fun_~a#1.offset))_1 Supporting invariants [] [2025-02-06 19:12:08,441 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (309)] Ended with exit code 0 [2025-02-06 19:12:08,528 INFO L156 tatePredicateManager]: 24 out of 25 supporting invariants were superfluous and have been removed [2025-02-06 19:12:08,529 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2025-02-06 19:12:08,529 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2025-02-06 19:12:08,529 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~a!base,]]] [2025-02-06 19:12:08,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:12:08,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-06 19:12:08,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-06 19:12:08,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:12:08,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:12:08,583 INFO L256 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-02-06 19:12:08,584 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:12:08,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:12:08,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:12:08,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:12:08,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:12:08,804 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 19:12:08,805 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:12:08,821 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:12:08,821 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.12 stem predicates 2 loop predicates [2025-02-06 19:12:08,821 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 101 states and 125 transitions. cyclomatic complexity: 46 Second operand has 14 states, 14 states have (on average 4.928571428571429) internal successors, (69), 14 states have internal predecessors, (69), 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:12:08,838 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 101 states and 125 transitions. cyclomatic complexity: 46. Second operand has 14 states, 14 states have (on average 4.928571428571429) internal successors, (69), 14 states have internal predecessors, (69), 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 102 states and 127 transitions. Complement of second has 4 states. [2025-02-06 19:12:08,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2025-02-06 19:12:08,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 4.928571428571429) internal successors, (69), 14 states have internal predecessors, (69), 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:12:08,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2025-02-06 19:12:08,839 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 77 letters. Loop has 2 letters. [2025-02-06 19:12:08,840 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:12:08,840 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-06 19:12:08,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:12:08,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-06 19:12:08,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-06 19:12:08,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:12:08,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:12:08,891 INFO L256 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-02-06 19:12:08,892 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:12:09,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:12:09,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:12:09,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:12:09,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:12:09,106 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 19:12:09,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:12:09,122 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:12:09,123 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.12 stem predicates 2 loop predicates [2025-02-06 19:12:09,123 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 101 states and 125 transitions. cyclomatic complexity: 46 Second operand has 14 states, 14 states have (on average 4.928571428571429) internal successors, (69), 14 states have internal predecessors, (69), 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:12:09,141 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 101 states and 125 transitions. cyclomatic complexity: 46. Second operand has 14 states, 14 states have (on average 4.928571428571429) internal successors, (69), 14 states have internal predecessors, (69), 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 102 states and 127 transitions. Complement of second has 4 states. [2025-02-06 19:12:09,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2025-02-06 19:12:09,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 4.928571428571429) internal successors, (69), 14 states have internal predecessors, (69), 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:12:09,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2025-02-06 19:12:09,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 77 letters. Loop has 2 letters. [2025-02-06 19:12:09,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:12:09,142 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-06 19:12:09,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:12:09,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-06 19:12:09,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-06 19:12:09,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:12:09,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:12:09,197 INFO L256 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-02-06 19:12:09,197 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:12:09,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:12:09,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:12:09,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:12:09,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:12:09,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 19:12:09,418 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:12:09,435 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:12:09,435 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.12 stem predicates 2 loop predicates [2025-02-06 19:12:09,435 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 101 states and 125 transitions. cyclomatic complexity: 46 Second operand has 14 states, 14 states have (on average 4.928571428571429) internal successors, (69), 14 states have internal predecessors, (69), 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:12:09,760 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 101 states and 125 transitions. cyclomatic complexity: 46. Second operand has 14 states, 14 states have (on average 4.928571428571429) internal successors, (69), 14 states have internal predecessors, (69), 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 138 states and 178 transitions. Complement of second has 28 states. [2025-02-06 19:12:09,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 16 states 12 stem states 2 non-accepting loop states 2 accepting loop states [2025-02-06 19:12:09,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 4.928571428571429) internal successors, (69), 14 states have internal predecessors, (69), 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:12:09,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 120 transitions. [2025-02-06 19:12:09,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 120 transitions. Stem has 77 letters. Loop has 2 letters. [2025-02-06 19:12:09,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:12:09,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 120 transitions. Stem has 79 letters. Loop has 2 letters. [2025-02-06 19:12:09,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:12:09,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 120 transitions. Stem has 77 letters. Loop has 4 letters. [2025-02-06 19:12:09,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:12:09,762 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 138 states and 178 transitions. [2025-02-06 19:12:09,763 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-06 19:12:09,763 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 138 states to 130 states and 168 transitions. [2025-02-06 19:12:09,763 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-02-06 19:12:09,763 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2025-02-06 19:12:09,763 INFO L73 IsDeterministic]: Start isDeterministic. Operand 130 states and 168 transitions. [2025-02-06 19:12:09,763 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:12:09,763 INFO L218 hiAutomatonCegarLoop]: Abstraction has 130 states and 168 transitions. [2025-02-06 19:12:09,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states and 168 transitions. [2025-02-06 19:12:09,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 109. [2025-02-06 19:12:09,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 109 states have (on average 1.238532110091743) internal successors, (135), 108 states have internal predecessors, (135), 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:12:09,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 135 transitions. [2025-02-06 19:12:09,765 INFO L240 hiAutomatonCegarLoop]: Abstraction has 109 states and 135 transitions. [2025-02-06 19:12:09,765 INFO L432 stractBuchiCegarLoop]: Abstraction has 109 states and 135 transitions. [2025-02-06 19:12:09,765 INFO L338 stractBuchiCegarLoop]: ======== Iteration 30 ============ [2025-02-06 19:12:09,765 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 109 states and 135 transitions. [2025-02-06 19:12:09,765 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-06 19:12:09,765 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:12:09,765 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:12:09,766 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1] [2025-02-06 19:12:09,766 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-06 19:12:09,766 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~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet13#1, main_#t~post14#1, main_~k~0#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet11#1;main_~array_size~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;main_~k~0#1 := 0;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume !(main_~k~0#1 < main_~array_size~0#1);havoc main_~k~0#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~post8#1, test_fun_#t~post9#1, test_fun_#t~post10#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~pos~0#1, test_fun_~neg~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~pos~0#1 := 0;test_fun_~neg~0#1 := 0;test_fun_~i~0#1 := 0;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" [2025-02-06 19:12:09,766 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume test_fun_#t~mem2#1 < 0;havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(1 + test_fun_#t~post4#1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~neg~0#1;test_fun_~neg~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1;" [2025-02-06 19:12:09,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:12:09,766 INFO L85 PathProgramCache]: Analyzing trace with hash -544743083, now seen corresponding path program 25 times [2025-02-06 19:12:09,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:12:09,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875568759] [2025-02-06 19:12:09,766 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-06 19:12:09,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:12:09,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-02-06 19:12:09,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-02-06 19:12:09,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:12:09,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:12:09,941 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (310)] Ended with exit code 0 [2025-02-06 19:12:10,134 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 280 proven. 127 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:12:10,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:12:10,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875568759] [2025-02-06 19:12:10,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875568759] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:12:10,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1234869740] [2025-02-06 19:12:10,135 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-06 19:12:10,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:12:10,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:10,137 INFO L229 MonitoredProcess]: Starting monitored process 311 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:12:10,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (311)] Waiting until timeout for monitored process [2025-02-06 19:12:10,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-02-06 19:12:10,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-02-06 19:12:10,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:12:10,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:12:10,270 INFO L256 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-02-06 19:12:10,271 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:12:10,635 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 341 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:12:10,635 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:12:10,975 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 341 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:12:10,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1234869740] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:12:10,976 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:12:10,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 39 [2025-02-06 19:12:10,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109128522] [2025-02-06 19:12:10,976 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:12:10,977 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-06 19:12:10,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:12:10,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1376, now seen corresponding path program 22 times [2025-02-06 19:12:10,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:12:10,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70405444] [2025-02-06 19:12:10,978 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 19:12:10,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:12:10,988 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 2 statements into 2 equivalence classes. [2025-02-06 19:12:10,988 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:12:10,989 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 19:12:10,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:12:10,989 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:12:10,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:12:10,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:12:10,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:12:10,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:12:10,996 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:12:11,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:12:11,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-02-06 19:12:11,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=367, Invalid=1193, Unknown=0, NotChecked=0, Total=1560 [2025-02-06 19:12:11,046 INFO L87 Difference]: Start difference. First operand 109 states and 135 transitions. cyclomatic complexity: 50 Second operand has 40 states, 39 states have (on average 4.102564102564102) internal successors, (160), 40 states have internal predecessors, (160), 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:12:11,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:12:11,373 INFO L93 Difference]: Finished difference Result 199 states and 247 transitions. [2025-02-06 19:12:11,373 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 199 states and 247 transitions. [2025-02-06 19:12:11,377 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-06 19:12:11,377 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 199 states to 110 states and 136 transitions. [2025-02-06 19:12:11,381 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-02-06 19:12:11,381 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2025-02-06 19:12:11,381 INFO L73 IsDeterministic]: Start isDeterministic. Operand 110 states and 136 transitions. [2025-02-06 19:12:11,382 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:12:11,382 INFO L218 hiAutomatonCegarLoop]: Abstraction has 110 states and 136 transitions. [2025-02-06 19:12:11,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states and 136 transitions. [2025-02-06 19:12:11,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2025-02-06 19:12:11,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 110 states have (on average 1.2363636363636363) internal successors, (136), 109 states have internal predecessors, (136), 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:12:11,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 136 transitions. [2025-02-06 19:12:11,383 INFO L240 hiAutomatonCegarLoop]: Abstraction has 110 states and 136 transitions. [2025-02-06 19:12:11,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-02-06 19:12:11,384 INFO L432 stractBuchiCegarLoop]: Abstraction has 110 states and 136 transitions. [2025-02-06 19:12:11,384 INFO L338 stractBuchiCegarLoop]: ======== Iteration 31 ============ [2025-02-06 19:12:11,384 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 110 states and 136 transitions. [2025-02-06 19:12:11,384 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-06 19:12:11,384 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:12:11,384 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:12:11,385 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [12, 12, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1] [2025-02-06 19:12:11,385 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-06 19:12:11,385 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~nondet11#1, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet13#1, main_#t~post14#1, main_~k~0#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet11#1;main_~array_size~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;" "assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911);" "call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;main_~k~0#1 := 0;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~k~0#1 < main_~array_size~0#1;havoc main_#t~nondet13#1;call write~int#0(main_#t~nondet13#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~k~0#1, 4);havoc main_#t~nondet13#1;main_#t~post14#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume !(main_~k~0#1 < main_~array_size~0#1);havoc main_~k~0#1;assume { :begin_inline_test_fun } true;test_fun_#in~a#1.base, test_fun_#in~a#1.offset, test_fun_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc test_fun_#t~mem2#1, test_fun_#t~mem3#1, test_fun_#t~post4#1, test_fun_#t~post5#1, test_fun_#t~mem6#1, test_fun_#t~mem7#1, test_fun_#t~post8#1, test_fun_#t~post9#1, test_fun_#t~post10#1, test_fun_~a#1.base, test_fun_~a#1.offset, test_fun_~N#1, test_fun_~i~0#1, test_fun_~pos~0#1, test_fun_~neg~0#1;test_fun_~a#1.base, test_fun_~a#1.offset := test_fun_#in~a#1.base, test_fun_#in~a#1.offset;test_fun_~N#1 := test_fun_#in~N#1;havoc test_fun_~i~0#1;test_fun_~pos~0#1 := 0;test_fun_~neg~0#1 := 0;test_fun_~i~0#1 := 0;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem2#1 < 0);havoc test_fun_#t~mem2#1;" "assume true;call test_fun_#t~mem6#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume !(test_fun_#t~mem6#1 > 0);havoc test_fun_#t~mem6#1;" "test_fun_#t~post10#1 := test_fun_~i~0#1;test_fun_~i~0#1 := 1 + test_fun_#t~post10#1;havoc test_fun_#t~post10#1;" "assume test_fun_~i~0#1 < test_fun_~N#1;" [2025-02-06 19:12:11,385 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call test_fun_#t~mem2#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);" "assume test_fun_#t~mem2#1 < 0;havoc test_fun_#t~mem2#1;call test_fun_#t~mem3#1 := read~int#0(test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);test_fun_#t~post4#1 := test_fun_#t~mem3#1;call write~int#0(1 + test_fun_#t~post4#1, test_fun_~a#1.base, test_fun_~a#1.offset + 4 * test_fun_~i~0#1, 4);havoc test_fun_#t~mem3#1;havoc test_fun_#t~post4#1;test_fun_#t~post5#1 := test_fun_~neg~0#1;test_fun_~neg~0#1 := 1 + test_fun_#t~post5#1;havoc test_fun_#t~post5#1;" [2025-02-06 19:12:11,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:12:11,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1381176639, now seen corresponding path program 26 times [2025-02-06 19:12:11,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:12:11,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686242489] [2025-02-06 19:12:11,389 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:12:11,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:12:11,400 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 84 statements into 2 equivalence classes. [2025-02-06 19:12:11,428 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 84 of 84 statements. [2025-02-06 19:12:11,429 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 19:12:11,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:12:11,429 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:12:11,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-06 19:12:11,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-06 19:12:11,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:12:11,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:12:11,462 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:12:11,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:12:11,462 INFO L85 PathProgramCache]: Analyzing trace with hash 1376, now seen corresponding path program 23 times [2025-02-06 19:12:11,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:12:11,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868576474] [2025-02-06 19:12:11,466 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 19:12:11,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:12:11,469 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:12:11,469 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:12:11,469 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 19:12:11,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:12:11,470 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:12:11,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:12:11,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:12:11,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:12:11,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:12:11,476 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:12:11,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:12:11,476 INFO L85 PathProgramCache]: Analyzing trace with hash 165856030, now seen corresponding path program 11 times [2025-02-06 19:12:11,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:12:11,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418227158] [2025-02-06 19:12:11,476 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 19:12:11,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:12:11,486 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 86 statements into 12 equivalence classes. [2025-02-06 19:12:11,529 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) and asserted 86 of 86 statements. [2025-02-06 19:12:11,532 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2025-02-06 19:12:11,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:12:11,532 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:12:11,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-02-06 19:12:11,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-02-06 19:12:11,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:12:11,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:12:11,566 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace