./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/reducercommutativity/max10-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 48c9605d 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/reducercommutativity/max10-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1223a7fef027dae15fda123c8ce40ec49dc779b7d5d627ded9a670697417439e --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 14:29:04,449 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 14:29:04,503 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2025-02-08 14:29:04,507 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 14:29:04,508 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 14:29:04,508 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-02-08 14:29:04,531 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 14:29:04,531 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 14:29:04,531 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 14:29:04,531 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 14:29:04,531 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 14:29:04,532 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 14:29:04,532 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 14:29:04,532 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 14:29:04,532 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-02-08 14:29:04,532 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-02-08 14:29:04,532 INFO L153 SettingsManager]: * Use old map elimination=false [2025-02-08 14:29:04,532 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-02-08 14:29:04,532 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-02-08 14:29:04,532 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-02-08 14:29:04,532 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 14:29:04,532 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-02-08 14:29:04,532 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 14:29:04,532 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 14:29:04,532 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 14:29:04,532 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 14:29:04,532 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-02-08 14:29:04,534 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-02-08 14:29:04,534 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-02-08 14:29:04,534 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 14:29:04,534 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 14:29:04,535 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 14:29:04,535 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-02-08 14:29:04,535 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 14:29:04,535 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 14:29:04,535 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 14:29:04,535 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 14:29:04,535 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 14:29:04,535 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 14:29:04,536 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-02-08 14:29:04,536 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 -> 1223a7fef027dae15fda123c8ce40ec49dc779b7d5d627ded9a670697417439e [2025-02-08 14:29:04,772 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 14:29:04,778 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 14:29:04,780 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 14:29:04,781 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 14:29:04,781 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 14:29:04,782 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/reducercommutativity/max10-1.i [2025-02-08 14:29:06,060 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/66ac5091c/f8e100c567ee4ffcbb36b024b0c7cf37/FLAGd65550aef [2025-02-08 14:29:06,330 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 14:29:06,331 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/reducercommutativity/max10-1.i [2025-02-08 14:29:06,338 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/66ac5091c/f8e100c567ee4ffcbb36b024b0c7cf37/FLAGd65550aef [2025-02-08 14:29:06,353 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/66ac5091c/f8e100c567ee4ffcbb36b024b0c7cf37 [2025-02-08 14:29:06,356 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 14:29:06,357 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 14:29:06,358 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 14:29:06,358 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 14:29:06,362 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 14:29:06,363 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:29:06" (1/1) ... [2025-02-08 14:29:06,364 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78026276 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:29:06, skipping insertion in model container [2025-02-08 14:29:06,364 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:29:06" (1/1) ... [2025-02-08 14:29:06,378 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 14:29:06,499 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 14:29:06,509 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 14:29:06,522 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 14:29:06,534 INFO L204 MainTranslator]: Completed translation [2025-02-08 14:29:06,535 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:29:06 WrapperNode [2025-02-08 14:29:06,535 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 14:29:06,536 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 14:29:06,536 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 14:29:06,536 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 14:29:06,542 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:29:06" (1/1) ... [2025-02-08 14:29:06,548 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:29:06" (1/1) ... [2025-02-08 14:29:06,566 INFO L138 Inliner]: procedures = 16, calls = 24, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 121 [2025-02-08 14:29:06,566 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 14:29:06,567 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 14:29:06,567 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 14:29:06,567 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 14:29:06,576 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:29:06" (1/1) ... [2025-02-08 14:29:06,577 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:29:06" (1/1) ... [2025-02-08 14:29:06,579 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:29:06" (1/1) ... [2025-02-08 14:29:06,591 INFO L175 MemorySlicer]: Split 17 memory accesses to 2 slices as follows [2, 15]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 5 writes are split as follows [0, 5]. [2025-02-08 14:29:06,591 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:29:06" (1/1) ... [2025-02-08 14:29:06,591 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:29:06" (1/1) ... [2025-02-08 14:29:06,597 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:29:06" (1/1) ... [2025-02-08 14:29:06,598 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:29:06" (1/1) ... [2025-02-08 14:29:06,599 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:29:06" (1/1) ... [2025-02-08 14:29:06,600 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:29:06" (1/1) ... [2025-02-08 14:29:06,602 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 14:29:06,603 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 14:29:06,603 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 14:29:06,603 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 14:29:06,604 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:29:06" (1/1) ... [2025-02-08 14:29:06,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:29:06,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:29:06,636 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-08 14:29:06,640 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-08 14:29:06,662 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 14:29:06,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 14:29:06,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 14:29:06,662 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 14:29:06,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 14:29:06,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 14:29:06,663 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 14:29:06,663 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 14:29:06,663 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 14:29:06,663 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 14:29:06,663 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 14:29:06,723 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 14:29:06,725 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 14:29:06,906 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L28: call ULTIMATE.dealloc(main_~#x~0#1.base, main_~#x~0#1.offset);havoc main_~#x~0#1.base, main_~#x~0#1.offset; [2025-02-08 14:29:06,918 INFO L? ?]: Removed 34 outVars from TransFormulas that were not future-live. [2025-02-08 14:29:06,918 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 14:29:06,927 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 14:29:06,927 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 14:29:06,928 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:29:06 BoogieIcfgContainer [2025-02-08 14:29:06,928 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 14:29:06,929 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-02-08 14:29:06,929 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-02-08 14:29:06,934 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-02-08 14:29:06,935 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-08 14:29:06,935 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 08.02 02:29:06" (1/3) ... [2025-02-08 14:29:06,936 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@627925aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.02 02:29:06, skipping insertion in model container [2025-02-08 14:29:06,936 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-08 14:29:06,936 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:29:06" (2/3) ... [2025-02-08 14:29:06,936 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@627925aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.02 02:29:06, skipping insertion in model container [2025-02-08 14:29:06,936 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-08 14:29:06,936 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:29:06" (3/3) ... [2025-02-08 14:29:06,938 INFO L363 chiAutomizerObserver]: Analyzing ICFG max10-1.i [2025-02-08 14:29:06,981 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-02-08 14:29:06,981 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-02-08 14:29:06,981 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-02-08 14:29:06,981 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-02-08 14:29:06,981 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-02-08 14:29:06,982 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-02-08 14:29:06,982 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-02-08 14:29:06,982 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-02-08 14:29:06,987 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 19 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 18 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:29:06,999 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 11 [2025-02-08 14:29:07,000 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:29:07,000 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:29:07,005 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-02-08 14:29:07,005 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-02-08 14:29:07,005 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-02-08 14:29:07,005 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 19 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 18 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:29:07,006 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 11 [2025-02-08 14:29:07,007 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:29:07,007 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:29:07,007 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-02-08 14:29:07,007 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-02-08 14:29:07,012 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post6#1, main_~i~1#1, main_#t~ret7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~ret10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_~i~2#1, main_#t~ret14#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0;" [2025-02-08 14:29:07,012 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~1#1 < 10;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" [2025-02-08 14:29:07,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:29:07,020 INFO L85 PathProgramCache]: Analyzing trace with hash 59, now seen corresponding path program 1 times [2025-02-08 14:29:07,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:29:07,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541833643] [2025-02-08 14:29:07,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:29:07,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:29:07,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:29:07,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:29:07,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:29:07,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:29:07,102 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:29:07,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:29:07,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:29:07,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:29:07,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:29:07,125 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:29:07,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:29:07,128 INFO L85 PathProgramCache]: Analyzing trace with hash 58, now seen corresponding path program 1 times [2025-02-08 14:29:07,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:29:07,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652475127] [2025-02-08 14:29:07,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:29:07,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:29:07,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:29:07,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:29:07,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:29:07,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:29:07,137 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:29:07,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:29:07,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:29:07,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:29:07,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:29:07,147 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:29:07,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:29:07,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1856, now seen corresponding path program 1 times [2025-02-08 14:29:07,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:29:07,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997108661] [2025-02-08 14:29:07,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:29:07,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:29:07,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:29:07,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:29:07,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:29:07,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:29:07,169 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:29:07,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:29:07,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:29:07,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:29:07,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:29:07,187 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:29:07,488 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:29:07,489 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:29:07,489 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:29:07,489 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:29:07,489 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-08 14:29:07,489 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:29:07,489 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:29:07,489 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:29:07,489 INFO L132 ssoRankerPreferences]: Filename of dumped script: max10-1.i_Iteration1_Lasso [2025-02-08 14:29:07,490 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:29:07,490 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:29:07,504 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:29:07,511 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:29:07,532 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:29:07,534 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:29:07,537 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:29:07,539 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:29:07,542 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:29:07,545 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:29:07,548 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:29:07,552 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:29:07,556 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:29:07,689 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:29:07,692 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:29:07,693 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:29:07,695 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:29:07,697 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:29:07,699 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:29:07,701 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:29:07,877 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:29:07,880 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-08 14:29:07,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:29:07,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:29:07,883 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-08 14:29:07,885 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-08 14:29:07,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-08 14:29:07,897 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:29:07,898 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:29:07,898 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:29:07,898 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:29:07,898 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:29:07,901 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:29:07,901 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:29:07,903 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:29:07,910 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-08 14:29:07,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:29:07,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:29:07,912 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-08 14:29:07,914 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-08 14:29:07,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-08 14:29:07,926 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:29:07,927 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:29:07,927 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:29:07,927 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:29:07,929 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:29:07,930 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:29:07,933 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:29:07,939 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-08 14:29:07,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:29:07,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:29:07,941 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-08 14:29:07,943 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-08 14:29:07,944 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:29:07,954 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:29:07,954 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:29:07,954 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:29:07,954 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:29:07,956 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:29:07,956 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:29:07,959 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:29:07,968 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-02-08 14:29:07,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:29:07,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:29:07,973 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-08 14:29:07,974 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-08 14:29:07,975 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:29:07,987 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:29:07,987 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:29:07,987 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:29:07,987 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:29:07,987 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:29:07,990 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:29:07,990 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:29:07,993 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:29:07,999 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-02-08 14:29:08,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:29:08,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:29:08,002 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-08 14:29:08,004 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-08 14:29:08,005 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:29:08,018 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:29:08,018 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:29:08,018 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:29:08,018 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:29:08,018 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:29:08,019 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:29:08,019 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:29:08,021 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:29:08,028 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-08 14:29:08,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:29:08,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:29:08,030 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-08 14:29:08,031 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-08 14:29:08,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-08 14:29:08,041 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:29:08,041 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:29:08,041 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:29:08,041 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:29:08,041 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:29:08,042 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:29:08,042 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:29:08,043 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:29:08,049 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-02-08 14:29:08,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:29:08,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:29:08,051 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-08 14:29:08,054 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-08 14:29:08,055 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:29:08,064 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:29:08,064 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:29:08,064 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:29:08,064 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:29:08,064 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:29:08,065 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:29:08,065 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:29:08,067 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:29:08,072 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-08 14:29:08,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:29:08,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:29:08,074 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-08 14:29:08,075 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-08 14:29:08,076 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:29:08,085 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:29:08,085 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:29:08,085 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:29:08,085 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:29:08,085 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:29:08,086 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:29:08,086 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:29:08,087 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:29:08,092 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-02-08 14:29:08,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:29:08,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:29:08,094 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-08 14:29:08,095 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-08 14:29:08,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-08 14:29:08,105 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:29:08,105 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:29:08,105 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:29:08,105 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:29:08,105 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:29:08,106 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:29:08,106 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:29:08,107 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:29:08,112 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-08 14:29:08,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:29:08,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:29:08,115 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-08 14:29:08,115 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-08 14:29:08,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-08 14:29:08,125 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:29:08,125 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:29:08,125 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:29:08,125 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:29:08,125 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:29:08,126 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:29:08,126 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:29:08,127 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:29:08,132 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-02-08 14:29:08,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:29:08,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:29:08,134 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-08 14:29:08,135 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-08 14:29:08,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-08 14:29:08,145 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:29:08,145 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:29:08,145 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:29:08,146 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:29:08,146 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:29:08,147 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:29:08,147 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:29:08,148 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:29:08,154 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-02-08 14:29:08,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:29:08,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:29:08,161 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-08 14:29:08,162 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-08 14:29:08,165 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:29:08,175 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:29:08,175 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:29:08,176 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:29:08,176 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:29:08,179 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:29:08,179 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:29:08,183 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:29:08,189 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-08 14:29:08,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:29:08,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:29:08,191 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-08 14:29:08,191 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-08 14:29:08,193 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:29:08,203 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:29:08,204 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:29:08,204 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:29:08,204 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:29:08,206 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:29:08,206 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:29:08,212 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:29:08,218 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2025-02-08 14:29:08,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:29:08,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:29:08,220 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-08 14:29:08,220 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-08 14:29:08,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-08 14:29:08,232 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:29:08,232 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:29:08,232 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:29:08,232 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:29:08,235 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:29:08,235 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:29:08,239 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:29:08,244 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-08 14:29:08,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:29:08,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:29:08,246 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-08 14:29:08,248 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-08 14:29:08,249 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:29:08,258 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:29:08,259 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:29:08,259 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:29:08,259 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:29:08,263 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:29:08,263 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:29:08,268 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-08 14:29:08,294 INFO L443 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2025-02-08 14:29:08,296 INFO L444 ModelExtractionUtils]: 0 out of 13 variables were initially zero. Simplification set additionally 10 variables to zero. [2025-02-08 14:29:08,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:29:08,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:29:08,299 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-08 14:29:08,301 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-08 14:29:08,302 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-08 14:29:08,313 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-02-08 14:29:08,313 INFO L474 LassoAnalysis]: Proved termination. [2025-02-08 14:29:08,314 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#x~0#1.base)_1, ULTIMATE.start_main_~i~1#1) = 19*v_rep(select #length ULTIMATE.start_main_~#x~0#1.base)_1 - 8*ULTIMATE.start_main_~i~1#1 Supporting invariants [] [2025-02-08 14:29:08,320 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-08 14:29:08,335 INFO L156 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2025-02-08 14:29:08,343 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-02-08 14:29:08,343 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-02-08 14:29:08,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:29:08,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:29:08,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:29:08,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:29:08,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:29:08,366 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 14:29:08,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:29:08,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:29:08,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:29:08,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:29:08,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:29:08,375 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 14:29:08,375 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:29:08,377 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-08 14:29:08,394 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-08 14:29:08,395 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 19 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 18 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 1.0) internal successors, (2), 1 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:29:08,416 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 19 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 18 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 2 states, 2 states have (on average 1.0) internal successors, (2), 1 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 21 states and 32 transitions. Complement of second has 3 states. [2025-02-08 14:29:08,418 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-08 14:29:08,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 1.0) internal successors, (2), 1 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:29:08,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 2 transitions. [2025-02-08 14:29:08,426 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 1 letters. Loop has 1 letters. [2025-02-08 14:29:08,426 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:29:08,426 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 2 letters. Loop has 1 letters. [2025-02-08 14:29:08,427 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:29:08,427 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 1 letters. Loop has 2 letters. [2025-02-08 14:29:08,427 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:29:08,428 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 32 transitions. [2025-02-08 14:29:08,428 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 10 [2025-02-08 14:29:08,430 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 14 states and 23 transitions. [2025-02-08 14:29:08,430 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2025-02-08 14:29:08,430 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2025-02-08 14:29:08,431 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 23 transitions. [2025-02-08 14:29:08,431 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:29:08,431 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14 states and 23 transitions. [2025-02-08 14:29:08,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 23 transitions. [2025-02-08 14:29:08,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2025-02-08 14:29:08,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 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-08 14:29:08,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 21 transitions. [2025-02-08 14:29:08,445 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13 states and 21 transitions. [2025-02-08 14:29:08,445 INFO L432 stractBuchiCegarLoop]: Abstraction has 13 states and 21 transitions. [2025-02-08 14:29:08,445 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-02-08 14:29:08,445 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 21 transitions. [2025-02-08 14:29:08,445 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 10 [2025-02-08 14:29:08,445 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:29:08,445 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:29:08,445 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-02-08 14:29:08,445 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-08 14:29:08,446 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post6#1, main_~i~1#1, main_#t~ret7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~ret10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_~i~2#1, main_#t~ret14#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0;" "assume !(main_~i~1#1 < 10);havoc main_~i~1#1;assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem1#1, max_#t~ite3#1, max_#t~mem2#1, max_#t~post4#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0;" [2025-02-08 14:29:08,446 INFO L754 eck$LassoCheckResult]: Loop: "assume max_~i~0#1 < 10;call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);" "assume max_~ret~0#1 < max_#t~mem1#1;call max_#t~mem2#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite3#1 := max_#t~mem2#1;" "max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1;" [2025-02-08 14:29:08,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:29:08,446 INFO L85 PathProgramCache]: Analyzing trace with hash 1855, now seen corresponding path program 1 times [2025-02-08 14:29:08,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:29:08,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000945364] [2025-02-08 14:29:08,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:29:08,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:29:08,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:29:08,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:29:08,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:29:08,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:29:08,495 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-08 14:29:08,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:29:08,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000945364] [2025-02-08 14:29:08,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000945364] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:29:08,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:29:08,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 14:29:08,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970362713] [2025-02-08 14:29:08,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:29:08,499 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-08 14:29:08,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:29:08,499 INFO L85 PathProgramCache]: Analyzing trace with hash 54551, now seen corresponding path program 1 times [2025-02-08 14:29:08,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:29:08,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511155083] [2025-02-08 14:29:08,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:29:08,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:29:08,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:29:08,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:29:08,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:29:08,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:29:08,507 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:29:08,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:29:08,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:29:08,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:29:08,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:29:08,511 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:29:08,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:29:08,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:29:08,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 14:29:08,556 INFO L87 Difference]: Start difference. First operand 13 states and 21 transitions. cyclomatic complexity: 13 Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:29:08,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:29:08,562 INFO L93 Difference]: Finished difference Result 13 states and 20 transitions. [2025-02-08 14:29:08,562 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 20 transitions. [2025-02-08 14:29:08,562 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 10 [2025-02-08 14:29:08,562 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 20 transitions. [2025-02-08 14:29:08,562 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2025-02-08 14:29:08,563 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2025-02-08 14:29:08,563 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 20 transitions. [2025-02-08 14:29:08,563 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:29:08,563 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13 states and 20 transitions. [2025-02-08 14:29:08,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 20 transitions. [2025-02-08 14:29:08,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2025-02-08 14:29:08,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 12 states have internal predecessors, (20), 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-08 14:29:08,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 20 transitions. [2025-02-08 14:29:08,564 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13 states and 20 transitions. [2025-02-08 14:29:08,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:29:08,565 INFO L432 stractBuchiCegarLoop]: Abstraction has 13 states and 20 transitions. [2025-02-08 14:29:08,565 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-02-08 14:29:08,565 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 20 transitions. [2025-02-08 14:29:08,565 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 10 [2025-02-08 14:29:08,565 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:29:08,565 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:29:08,565 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-02-08 14:29:08,566 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-08 14:29:08,566 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post6#1, main_~i~1#1, main_#t~ret7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~ret10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_~i~2#1, main_#t~ret14#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0;" "assume main_~i~1#1 < 10;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume !(main_~i~1#1 < 10);havoc main_~i~1#1;assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem1#1, max_#t~ite3#1, max_#t~mem2#1, max_#t~post4#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0;" [2025-02-08 14:29:08,566 INFO L754 eck$LassoCheckResult]: Loop: "assume max_~i~0#1 < 10;call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);" "assume max_~ret~0#1 < max_#t~mem1#1;call max_#t~mem2#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite3#1 := max_#t~mem2#1;" "max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1;" [2025-02-08 14:29:08,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:29:08,566 INFO L85 PathProgramCache]: Analyzing trace with hash 57562, now seen corresponding path program 1 times [2025-02-08 14:29:08,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:29:08,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142026558] [2025-02-08 14:29:08,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:29:08,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:29:08,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:29:08,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:29:08,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:29:08,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:29:08,637 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:29:08,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:29:08,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142026558] [2025-02-08 14:29:08,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142026558] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:29:08,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2111161209] [2025-02-08 14:29:08,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:29:08,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:29:08,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:29:08,640 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-08 14:29:08,642 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 14:29:08,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-02-08 14:29:08,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:29:08,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:29:08,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:29:08,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:29:08,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 14:29:08,679 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:29:08,696 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:29:08,696 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:29:08,707 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:29:08,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2111161209] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:29:08,708 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:29:08,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 5 [2025-02-08 14:29:08,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616911440] [2025-02-08 14:29:08,708 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:29:08,708 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-08 14:29:08,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:29:08,709 INFO L85 PathProgramCache]: Analyzing trace with hash 54551, now seen corresponding path program 2 times [2025-02-08 14:29:08,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:29:08,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442410983] [2025-02-08 14:29:08,709 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:29:08,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:29:08,712 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:29:08,714 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:29:08,714 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 14:29:08,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:29:08,714 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:29:08,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:29:08,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:29:08,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:29:08,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:29:08,727 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:29:08,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:29:08,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 14:29:08,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 14:29:08,779 INFO L87 Difference]: Start difference. First operand 13 states and 20 transitions. cyclomatic complexity: 12 Second operand has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 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-08 14:29:08,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:29:08,795 INFO L93 Difference]: Finished difference Result 16 states and 23 transitions. [2025-02-08 14:29:08,795 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 23 transitions. [2025-02-08 14:29:08,796 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 10 [2025-02-08 14:29:08,796 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 23 transitions. [2025-02-08 14:29:08,796 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2025-02-08 14:29:08,796 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2025-02-08 14:29:08,796 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 23 transitions. [2025-02-08 14:29:08,796 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:29:08,796 INFO L218 hiAutomatonCegarLoop]: Abstraction has 16 states and 23 transitions. [2025-02-08 14:29:08,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 23 transitions. [2025-02-08 14:29:08,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2025-02-08 14:29:08,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.4375) internal successors, (23), 15 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-08 14:29:08,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 23 transitions. [2025-02-08 14:29:08,797 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16 states and 23 transitions. [2025-02-08 14:29:08,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 14:29:08,798 INFO L432 stractBuchiCegarLoop]: Abstraction has 16 states and 23 transitions. [2025-02-08 14:29:08,798 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-02-08 14:29:08,798 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 23 transitions. [2025-02-08 14:29:08,798 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 10 [2025-02-08 14:29:08,798 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:29:08,798 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:29:08,798 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 1, 1] [2025-02-08 14:29:08,798 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-08 14:29:08,799 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post6#1, main_~i~1#1, main_#t~ret7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~ret10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_~i~2#1, main_#t~ret14#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0;" "assume main_~i~1#1 < 10;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume main_~i~1#1 < 10;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume main_~i~1#1 < 10;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume main_~i~1#1 < 10;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume !(main_~i~1#1 < 10);havoc main_~i~1#1;assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem1#1, max_#t~ite3#1, max_#t~mem2#1, max_#t~post4#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0;" [2025-02-08 14:29:08,799 INFO L754 eck$LassoCheckResult]: Loop: "assume max_~i~0#1 < 10;call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);" "assume max_~ret~0#1 < max_#t~mem1#1;call max_#t~mem2#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite3#1 := max_#t~mem2#1;" "max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1;" [2025-02-08 14:29:08,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:29:08,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1714886143, now seen corresponding path program 2 times [2025-02-08 14:29:08,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:29:08,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470959160] [2025-02-08 14:29:08,799 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:29:08,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:29:08,804 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 6 statements into 2 equivalence classes. [2025-02-08 14:29:08,809 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 14:29:08,809 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 14:29:08,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:29:08,872 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:29:08,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:29:08,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470959160] [2025-02-08 14:29:08,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470959160] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:29:08,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [655182015] [2025-02-08 14:29:08,872 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:29:08,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:29:08,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:29:08,874 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 14:29:08,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-02-08 14:29:08,907 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 6 statements into 2 equivalence classes. [2025-02-08 14:29:08,920 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 14:29:08,921 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 14:29:08,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:29:08,922 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 14:29:08,923 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:29:08,939 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:29:08,940 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:29:08,987 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:29:08,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [655182015] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:29:08,987 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:29:08,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-02-08 14:29:08,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450145862] [2025-02-08 14:29:08,987 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:29:08,988 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-08 14:29:08,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:29:08,988 INFO L85 PathProgramCache]: Analyzing trace with hash 54551, now seen corresponding path program 3 times [2025-02-08 14:29:08,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:29:08,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836325738] [2025-02-08 14:29:08,988 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 14:29:08,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:29:08,991 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:29:08,993 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:29:08,993 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-08 14:29:08,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:29:08,993 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:29:08,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:29:08,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:29:08,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:29:08,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:29:08,996 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:29:09,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:29:09,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-08 14:29:09,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-02-08 14:29:09,043 INFO L87 Difference]: Start difference. First operand 16 states and 23 transitions. cyclomatic complexity: 12 Second operand has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:29:09,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:29:09,062 INFO L93 Difference]: Finished difference Result 22 states and 29 transitions. [2025-02-08 14:29:09,062 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 29 transitions. [2025-02-08 14:29:09,062 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 10 [2025-02-08 14:29:09,063 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 29 transitions. [2025-02-08 14:29:09,063 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2025-02-08 14:29:09,063 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2025-02-08 14:29:09,063 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 29 transitions. [2025-02-08 14:29:09,063 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:29:09,063 INFO L218 hiAutomatonCegarLoop]: Abstraction has 22 states and 29 transitions. [2025-02-08 14:29:09,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 29 transitions. [2025-02-08 14:29:09,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2025-02-08 14:29:09,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 21 states have internal predecessors, (29), 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-08 14:29:09,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 29 transitions. [2025-02-08 14:29:09,064 INFO L240 hiAutomatonCegarLoop]: Abstraction has 22 states and 29 transitions. [2025-02-08 14:29:09,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 14:29:09,067 INFO L432 stractBuchiCegarLoop]: Abstraction has 22 states and 29 transitions. [2025-02-08 14:29:09,067 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-02-08 14:29:09,067 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 29 transitions. [2025-02-08 14:29:09,068 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 10 [2025-02-08 14:29:09,068 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:29:09,068 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:29:09,069 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 1, 1] [2025-02-08 14:29:09,069 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-08 14:29:09,069 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post6#1, main_~i~1#1, main_#t~ret7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~ret10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_~i~2#1, main_#t~ret14#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0;" "assume main_~i~1#1 < 10;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume main_~i~1#1 < 10;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume main_~i~1#1 < 10;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume main_~i~1#1 < 10;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume main_~i~1#1 < 10;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume main_~i~1#1 < 10;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume main_~i~1#1 < 10;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume main_~i~1#1 < 10;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume main_~i~1#1 < 10;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume main_~i~1#1 < 10;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume !(main_~i~1#1 < 10);havoc main_~i~1#1;assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem1#1, max_#t~ite3#1, max_#t~mem2#1, max_#t~post4#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0;" [2025-02-08 14:29:09,069 INFO L754 eck$LassoCheckResult]: Loop: "assume max_~i~0#1 < 10;call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);" "assume max_~ret~0#1 < max_#t~mem1#1;call max_#t~mem2#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite3#1 := max_#t~mem2#1;" "max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1;" [2025-02-08 14:29:09,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:29:09,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1716873185, now seen corresponding path program 3 times [2025-02-08 14:29:09,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:29:09,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62408575] [2025-02-08 14:29:09,070 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 14:29:09,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:29:09,078 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 12 statements into 6 equivalence classes. [2025-02-08 14:29:09,107 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 14:29:09,107 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-02-08 14:29:09,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:29:09,108 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:29:09,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 14:29:09,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 14:29:09,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:29:09,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:29:09,131 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:29:09,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:29:09,132 INFO L85 PathProgramCache]: Analyzing trace with hash 54551, now seen corresponding path program 4 times [2025-02-08 14:29:09,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:29:09,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496644817] [2025-02-08 14:29:09,132 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 14:29:09,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:29:09,135 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 3 statements into 2 equivalence classes. [2025-02-08 14:29:09,136 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:29:09,138 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 14:29:09,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:29:09,138 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:29:09,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:29:09,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:29:09,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:29:09,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:29:09,144 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:29:09,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:29:09,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1396498489, now seen corresponding path program 1 times [2025-02-08 14:29:09,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:29:09,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212751979] [2025-02-08 14:29:09,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:29:09,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:29:09,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 14:29:09,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 14:29:09,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:29:09,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:29:09,175 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:29:09,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 14:29:09,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 14:29:09,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:29:09,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:29:09,203 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:29:12,697 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:29:12,698 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:29:12,698 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:29:12,698 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:29:12,698 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-08 14:29:12,698 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:29:12,698 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:29:12,698 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:29:12,698 INFO L132 ssoRankerPreferences]: Filename of dumped script: max10-1.i_Iteration5_Lasso [2025-02-08 14:29:12,698 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:29:12,698 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:29:12,702 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:29:12,705 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:29:12,707 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:29:12,709 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:29:12,710 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:29:12,712 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:29:12,714 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:29:12,716 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:29:12,717 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:29:12,719 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:29:12,721 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:29:12,722 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:29:12,728 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:29:12,736 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:29:12,738 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:29:12,739 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:29:12,742 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:29:12,744 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:29:12,745 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:29:12,747 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:29:13,076 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:29:13,078 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:29:13,080 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:29:13,081 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:29:13,083 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:29:13,292 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:29:13,292 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-08 14:29:13,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:29:13,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:29:13,298 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-08 14:29:13,303 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-08 14:29:13,303 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:29:13,315 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:29:13,315 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:29:13,315 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:29:13,315 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:29:13,315 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:29:13,315 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:29:13,315 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:29:13,316 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:29:13,322 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-08 14:29:13,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:29:13,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:29:13,324 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-08 14:29:13,326 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-08 14:29:13,326 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:29:13,336 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:29:13,336 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:29:13,336 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:29:13,336 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:29:13,336 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:29:13,337 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:29:13,337 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:29:13,338 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:29:13,343 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-02-08 14:29:13,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:29:13,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:29:13,346 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-08 14:29:13,348 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-08 14:29:13,349 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:29:13,360 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:29:13,360 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:29:13,360 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:29:13,360 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:29:13,360 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:29:13,360 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:29:13,360 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:29:13,361 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:29:13,366 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2025-02-08 14:29:13,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:29:13,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:29:13,370 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-08 14:29:13,371 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-08 14:29:13,372 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:29:13,382 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:29:13,382 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:29:13,382 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:29:13,382 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:29:13,382 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:29:13,383 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:29:13,383 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:29:13,384 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:29:13,390 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-08 14:29:13,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:29:13,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:29:13,392 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-08 14:29:13,393 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-08 14:29:13,395 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:29:13,405 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:29:13,406 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:29:13,406 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:29:13,406 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:29:13,406 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:29:13,406 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:29:13,406 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:29:13,409 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:29:13,415 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2025-02-08 14:29:13,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:29:13,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:29:13,419 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-08 14:29:13,420 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-08 14:29:13,421 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:29:13,431 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:29:13,432 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:29:13,432 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:29:13,432 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:29:13,432 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:29:13,432 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:29:13,432 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:29:13,433 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:29:13,440 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2025-02-08 14:29:13,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:29:13,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:29:13,442 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-08 14:29:13,444 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-08 14:29:13,445 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:29:13,456 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:29:13,456 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:29:13,456 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:29:13,456 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:29:13,456 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:29:13,457 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:29:13,457 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:29:13,458 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:29:13,469 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-08 14:29:13,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:29:13,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:29:13,471 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-08 14:29:13,474 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-08 14:29:13,475 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:29:13,486 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:29:13,486 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:29:13,486 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:29:13,486 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:29:13,486 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:29:13,487 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:29:13,487 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:29:13,488 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:29:13,494 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2025-02-08 14:29:13,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:29:13,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:29:13,501 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-08 14:29:13,502 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-08 14:29:13,503 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:29:13,514 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:29:13,514 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:29:13,514 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:29:13,514 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:29:13,514 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:29:13,515 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:29:13,515 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:29:13,519 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:29:13,529 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2025-02-08 14:29:13,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:29:13,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:29:13,531 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-08 14:29:13,533 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-08 14:29:13,534 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:29:13,544 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:29:13,544 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:29:13,544 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:29:13,544 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:29:13,546 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:29:13,546 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:29:13,548 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:29:13,555 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2025-02-08 14:29:13,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:29:13,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:29:13,557 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-08 14:29:13,559 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-08 14:29:13,560 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:29:13,569 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:29:13,570 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:29:13,570 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:29:13,570 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:29:13,570 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:29:13,570 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:29:13,570 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:29:13,571 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:29:13,576 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-08 14:29:13,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:29:13,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:29:13,579 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-08 14:29:13,580 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-08 14:29:13,581 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:29:13,590 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:29:13,590 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:29:13,590 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:29:13,590 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:29:13,590 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:29:13,591 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:29:13,591 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:29:13,592 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:29:13,597 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-08 14:29:13,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:29:13,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:29:13,599 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-08 14:29:13,600 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-08 14:29:13,601 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:29:13,612 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:29:13,613 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:29:13,613 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:29:13,613 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:29:13,614 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:29:13,614 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:29:13,617 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:29:13,622 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-08 14:29:13,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:29:13,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:29:13,625 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-08 14:29:13,627 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-08 14:29:13,628 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:29:13,637 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:29:13,637 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:29:13,637 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:29:13,637 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:29:13,640 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:29:13,640 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:29:13,642 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:29:13,648 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2025-02-08 14:29:13,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:29:13,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:29:13,650 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-08 14:29:13,652 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-08 14:29:13,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-08 14:29:13,663 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:29:13,663 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:29:13,664 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:29:13,664 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:29:13,664 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:29:13,664 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:29:13,664 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:29:13,665 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:29:13,670 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2025-02-08 14:29:13,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:29:13,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:29:13,672 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-08 14:29:13,673 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-08 14:29:13,674 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:29:13,683 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:29:13,683 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:29:13,684 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:29:13,684 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:29:13,684 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:29:13,684 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:29:13,684 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:29:13,685 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:29:13,690 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2025-02-08 14:29:13,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:29:13,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:29:13,692 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-08 14:29:13,693 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-08 14:29:13,694 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:29:13,704 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:29:13,704 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:29:13,704 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:29:13,704 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:29:13,705 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:29:13,705 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:29:13,705 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:29:13,706 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:29:13,711 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-08 14:29:13,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:29:13,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:29:13,713 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-08 14:29:13,714 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-08 14:29:13,715 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:29:13,725 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:29:13,725 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:29:13,725 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:29:13,725 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:29:13,725 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:29:13,725 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:29:13,725 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:29:13,726 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:29:13,732 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-08 14:29:13,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:29:13,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:29:13,736 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-08 14:29:13,737 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-08 14:29:13,739 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:29:13,750 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:29:13,750 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:29:13,750 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:29:13,750 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:29:13,750 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:29:13,750 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:29:13,750 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:29:13,751 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:29:13,756 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-08 14:29:13,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:29:13,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:29:13,758 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-08 14:29:13,760 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-08 14:29:13,760 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:29:13,771 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:29:13,771 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:29:13,771 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:29:13,771 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:29:13,771 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:29:13,772 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:29:13,772 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:29:13,776 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:29:13,783 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-08 14:29:13,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:29:13,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:29:13,785 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-08 14:29:13,787 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-08 14:29:13,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-08 14:29:13,798 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:29:13,798 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:29:13,798 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:29:13,798 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:29:13,800 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:29:13,800 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:29:13,802 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:29:13,807 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-08 14:29:13,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:29:13,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:29:13,809 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-08 14:29:13,811 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-08 14:29:13,811 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:29:13,821 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:29:13,821 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:29:13,821 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:29:13,821 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:29:13,822 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:29:13,822 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:29:13,826 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:29:13,833 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-08 14:29:13,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:29:13,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:29:13,836 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-08 14:29:13,838 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-08 14:29:13,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-08 14:29:13,849 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:29:13,849 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:29:13,849 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:29:13,849 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:29:13,852 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:29:13,852 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:29:13,869 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-08 14:29:13,878 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2025-02-08 14:29:13,878 INFO L444 ModelExtractionUtils]: 4 out of 16 variables were initially zero. Simplification set additionally 9 variables to zero. [2025-02-08 14:29:13,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:29:13,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:29:13,880 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-08 14:29:13,882 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-08 14:29:13,883 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-08 14:29:13,897 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-02-08 14:29:13,898 INFO L474 LassoAnalysis]: Proved termination. [2025-02-08 14:29:13,898 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_max_~i~0#1) = -2*ULTIMATE.start_max_~i~0#1 + 19 Supporting invariants [] [2025-02-08 14:29:13,905 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2025-02-08 14:29:13,920 INFO L156 tatePredicateManager]: 8 out of 8 supporting invariants were superfluous and have been removed [2025-02-08 14:29:13,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:29:13,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 14:29:13,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 14:29:13,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:29:13,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:29:13,959 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 14:29:13,960 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:29:13,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:29:13,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:29:13,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:29:13,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:29:13,981 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 14:29:13,981 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:29:13,996 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-08 14:29:13,997 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-08 14:29:13,997 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 29 transitions. cyclomatic complexity: 12 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:29:14,023 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 29 transitions. cyclomatic complexity: 12. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 26 states and 37 transitions. Complement of second has 5 states. [2025-02-08 14:29:14,023 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-08 14:29:14,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:29:14,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2025-02-08 14:29:14,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 12 letters. Loop has 3 letters. [2025-02-08 14:29:14,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:29:14,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 15 letters. Loop has 3 letters. [2025-02-08 14:29:14,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:29:14,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 12 letters. Loop has 6 letters. [2025-02-08 14:29:14,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:29:14,025 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 37 transitions. [2025-02-08 14:29:14,026 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2025-02-08 14:29:14,026 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 24 states and 33 transitions. [2025-02-08 14:29:14,026 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2025-02-08 14:29:14,026 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2025-02-08 14:29:14,029 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 33 transitions. [2025-02-08 14:29:14,029 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:29:14,029 INFO L218 hiAutomatonCegarLoop]: Abstraction has 24 states and 33 transitions. [2025-02-08 14:29:14,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 33 transitions. [2025-02-08 14:29:14,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2025-02-08 14:29:14,030 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-08 14:29:14,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2025-02-08 14:29:14,030 INFO L240 hiAutomatonCegarLoop]: Abstraction has 23 states and 31 transitions. [2025-02-08 14:29:14,030 INFO L432 stractBuchiCegarLoop]: Abstraction has 23 states and 31 transitions. [2025-02-08 14:29:14,030 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-02-08 14:29:14,030 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 31 transitions. [2025-02-08 14:29:14,031 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2025-02-08 14:29:14,031 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:29:14,031 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:29:14,031 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 1, 1, 1] [2025-02-08 14:29:14,031 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-08 14:29:14,031 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post6#1, main_~i~1#1, main_#t~ret7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~ret10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_~i~2#1, main_#t~ret14#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0;" "assume main_~i~1#1 < 10;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume main_~i~1#1 < 10;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume main_~i~1#1 < 10;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume main_~i~1#1 < 10;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume main_~i~1#1 < 10;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume main_~i~1#1 < 10;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume main_~i~1#1 < 10;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume main_~i~1#1 < 10;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume main_~i~1#1 < 10;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume main_~i~1#1 < 10;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume !(main_~i~1#1 < 10);havoc main_~i~1#1;assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem1#1, max_#t~ite3#1, max_#t~mem2#1, max_#t~post4#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0;" "assume !(max_~i~0#1 < 10);max_#res#1 := (if max_~ret~0#1 % 4294967296 <= 2147483647 then max_~ret~0#1 % 4294967296 else max_~ret~0#1 % 4294967296 - 4294967296);main_#t~ret7#1 := max_#res#1;havoc max_#t~mem1#1, max_#t~ite3#1, max_#t~mem2#1, max_#t~post4#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;havoc max_#in~x#1.base, max_#in~x#1.offset;assume { :end_inline_max } true;main_~ret~1#1 := main_#t~ret7#1;havoc main_#t~ret7#1;call main_#t~mem8#1 := read~int#1(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem8#1;havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int#1(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int#1(main_#t~mem9#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem9#1;call write~int#1(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem1#1, max_#t~ite3#1, max_#t~mem2#1, max_#t~post4#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0;" [2025-02-08 14:29:14,032 INFO L754 eck$LassoCheckResult]: Loop: "assume max_~i~0#1 < 10;call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);" "assume max_~ret~0#1 < max_#t~mem1#1;call max_#t~mem2#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite3#1 := max_#t~mem2#1;" "max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1;" [2025-02-08 14:29:14,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:29:14,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1683461162, now seen corresponding path program 1 times [2025-02-08 14:29:14,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:29:14,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636334300] [2025-02-08 14:29:14,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:29:14,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:29:14,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 14:29:14,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 14:29:14,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:29:14,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:29:14,113 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-02-08 14:29:14,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:29:14,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636334300] [2025-02-08 14:29:14,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636334300] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:29:14,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:29:14,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:29:14,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907948474] [2025-02-08 14:29:14,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:29:14,114 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-08 14:29:14,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:29:14,114 INFO L85 PathProgramCache]: Analyzing trace with hash 49586, now seen corresponding path program 1 times [2025-02-08 14:29:14,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:29:14,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754639138] [2025-02-08 14:29:14,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:29:14,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:29:14,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:29:14,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:29:14,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:29:14,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:29:14,119 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:29:14,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:29:14,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:29:14,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:29:14,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:29:14,122 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:29:14,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:29:14,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:29:14,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 14:29:14,174 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. cyclomatic complexity: 13 Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 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-08 14:29:14,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:29:14,203 INFO L93 Difference]: Finished difference Result 31 states and 41 transitions. [2025-02-08 14:29:14,203 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 41 transitions. [2025-02-08 14:29:14,204 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2025-02-08 14:29:14,204 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 41 transitions. [2025-02-08 14:29:14,204 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2025-02-08 14:29:14,204 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2025-02-08 14:29:14,204 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 41 transitions. [2025-02-08 14:29:14,204 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:29:14,205 INFO L218 hiAutomatonCegarLoop]: Abstraction has 31 states and 41 transitions. [2025-02-08 14:29:14,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 41 transitions. [2025-02-08 14:29:14,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 24. [2025-02-08 14:29:14,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 23 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-08 14:29:14,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2025-02-08 14:29:14,207 INFO L240 hiAutomatonCegarLoop]: Abstraction has 24 states and 31 transitions. [2025-02-08 14:29:14,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:29:14,209 INFO L432 stractBuchiCegarLoop]: Abstraction has 24 states and 31 transitions. [2025-02-08 14:29:14,209 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-02-08 14:29:14,209 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 31 transitions. [2025-02-08 14:29:14,210 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2025-02-08 14:29:14,210 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:29:14,210 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:29:14,210 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:29:14,210 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-08 14:29:14,210 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post6#1, main_~i~1#1, main_#t~ret7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~ret10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_~i~2#1, main_#t~ret14#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0;" "assume main_~i~1#1 < 10;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume main_~i~1#1 < 10;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume main_~i~1#1 < 10;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume main_~i~1#1 < 10;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume main_~i~1#1 < 10;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume main_~i~1#1 < 10;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume main_~i~1#1 < 10;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume main_~i~1#1 < 10;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume main_~i~1#1 < 10;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume main_~i~1#1 < 10;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume !(main_~i~1#1 < 10);havoc main_~i~1#1;assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem1#1, max_#t~ite3#1, max_#t~mem2#1, max_#t~post4#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0;" "assume max_~i~0#1 < 10;call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);" "assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1;" "max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1;" "assume !(max_~i~0#1 < 10);max_#res#1 := (if max_~ret~0#1 % 4294967296 <= 2147483647 then max_~ret~0#1 % 4294967296 else max_~ret~0#1 % 4294967296 - 4294967296);main_#t~ret7#1 := max_#res#1;havoc max_#t~mem1#1, max_#t~ite3#1, max_#t~mem2#1, max_#t~post4#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;havoc max_#in~x#1.base, max_#in~x#1.offset;assume { :end_inline_max } true;main_~ret~1#1 := main_#t~ret7#1;havoc main_#t~ret7#1;call main_#t~mem8#1 := read~int#1(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem8#1;havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int#1(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int#1(main_#t~mem9#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem9#1;call write~int#1(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem1#1, max_#t~ite3#1, max_#t~mem2#1, max_#t~post4#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0;" "assume max_~i~0#1 < 10;call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);" [2025-02-08 14:29:14,210 INFO L754 eck$LassoCheckResult]: Loop: "assume max_~ret~0#1 < max_#t~mem1#1;call max_#t~mem2#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite3#1 := max_#t~mem2#1;" "max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1;" "assume max_~i~0#1 < 10;call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);" [2025-02-08 14:29:14,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:29:14,210 INFO L85 PathProgramCache]: Analyzing trace with hash 2005282039, now seen corresponding path program 1 times [2025-02-08 14:29:14,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:29:14,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672749785] [2025-02-08 14:29:14,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:29:14,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:29:14,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-08 14:29:14,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 14:29:14,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:29:14,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:29:14,294 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-02-08 14:29:14,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:29:14,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672749785] [2025-02-08 14:29:14,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672749785] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:29:14,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1404569079] [2025-02-08 14:29:14,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:29:14,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:29:14,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:29:14,298 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 14:29:14,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2025-02-08 14:29:14,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-08 14:29:14,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 14:29:14,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:29:14,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:29:14,372 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 14:29:14,373 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:29:14,383 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-02-08 14:29:14,384 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:29:14,401 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-02-08 14:29:14,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1404569079] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:29:14,401 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:29:14,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-08 14:29:14,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472235011] [2025-02-08 14:29:14,401 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:29:14,401 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-08 14:29:14,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:29:14,401 INFO L85 PathProgramCache]: Analyzing trace with hash 47636, now seen corresponding path program 2 times [2025-02-08 14:29:14,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:29:14,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385028522] [2025-02-08 14:29:14,402 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:29:14,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:29:14,404 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:29:14,406 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:29:14,406 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 14:29:14,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:29:14,406 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:29:14,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:29:14,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:29:14,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:29:14,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:29:14,410 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:29:14,493 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2025-02-08 14:29:14,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:29:14,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 14:29:14,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 14:29:14,498 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. cyclomatic complexity: 12 Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 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-08 14:29:14,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:29:14,560 INFO L93 Difference]: Finished difference Result 52 states and 68 transitions. [2025-02-08 14:29:14,560 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 52 states and 68 transitions. [2025-02-08 14:29:14,561 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2025-02-08 14:29:14,561 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 52 states to 52 states and 68 transitions. [2025-02-08 14:29:14,561 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2025-02-08 14:29:14,561 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2025-02-08 14:29:14,561 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 68 transitions. [2025-02-08 14:29:14,561 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:29:14,563 INFO L218 hiAutomatonCegarLoop]: Abstraction has 52 states and 68 transitions. [2025-02-08 14:29:14,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 68 transitions. [2025-02-08 14:29:14,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 42. [2025-02-08 14:29:14,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 41 states have internal predecessors, (55), 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-08 14:29:14,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 55 transitions. [2025-02-08 14:29:14,565 INFO L240 hiAutomatonCegarLoop]: Abstraction has 42 states and 55 transitions. [2025-02-08 14:29:14,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 14:29:14,566 INFO L432 stractBuchiCegarLoop]: Abstraction has 42 states and 55 transitions. [2025-02-08 14:29:14,566 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-02-08 14:29:14,566 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 55 transitions. [2025-02-08 14:29:14,566 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2025-02-08 14:29:14,567 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:29:14,567 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:29:14,568 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 4, 4, 4, 4, 3, 3, 1, 1, 1] [2025-02-08 14:29:14,568 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-08 14:29:14,569 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post6#1, main_~i~1#1, main_#t~ret7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~ret10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_~i~2#1, main_#t~ret14#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0;" "assume main_~i~1#1 < 10;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume main_~i~1#1 < 10;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume main_~i~1#1 < 10;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume main_~i~1#1 < 10;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume main_~i~1#1 < 10;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume main_~i~1#1 < 10;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume main_~i~1#1 < 10;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume main_~i~1#1 < 10;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume main_~i~1#1 < 10;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume main_~i~1#1 < 10;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume !(main_~i~1#1 < 10);havoc main_~i~1#1;assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem1#1, max_#t~ite3#1, max_#t~mem2#1, max_#t~post4#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0;" "assume max_~i~0#1 < 10;call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);" "assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1;" "max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1;" "assume max_~i~0#1 < 10;call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);" "assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1;" "max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1;" "assume max_~i~0#1 < 10;call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);" "assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1;" "max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1;" "assume max_~i~0#1 < 10;call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);" "assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1;" "max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1;" "assume !(max_~i~0#1 < 10);max_#res#1 := (if max_~ret~0#1 % 4294967296 <= 2147483647 then max_~ret~0#1 % 4294967296 else max_~ret~0#1 % 4294967296 - 4294967296);main_#t~ret7#1 := max_#res#1;havoc max_#t~mem1#1, max_#t~ite3#1, max_#t~mem2#1, max_#t~post4#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;havoc max_#in~x#1.base, max_#in~x#1.offset;assume { :end_inline_max } true;main_~ret~1#1 := main_#t~ret7#1;havoc main_#t~ret7#1;call main_#t~mem8#1 := read~int#1(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem8#1;havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int#1(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int#1(main_#t~mem9#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem9#1;call write~int#1(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem1#1, max_#t~ite3#1, max_#t~mem2#1, max_#t~post4#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0;" "assume max_~i~0#1 < 10;call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);" "assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1;" "max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1;" "assume max_~i~0#1 < 10;call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);" "assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1;" "max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1;" "assume max_~i~0#1 < 10;call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);" "assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1;" "max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1;" "assume max_~i~0#1 < 10;call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);" [2025-02-08 14:29:14,569 INFO L754 eck$LassoCheckResult]: Loop: "assume max_~ret~0#1 < max_#t~mem1#1;call max_#t~mem2#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite3#1 := max_#t~mem2#1;" "max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1;" "assume max_~i~0#1 < 10;call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);" [2025-02-08 14:29:14,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:29:14,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1641068232, now seen corresponding path program 1 times [2025-02-08 14:29:14,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:29:14,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622314798] [2025-02-08 14:29:14,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:29:14,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:29:14,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-08 14:29:14,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-08 14:29:14,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:29:14,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:29:14,699 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2025-02-08 14:29:14,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:29:14,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622314798] [2025-02-08 14:29:14,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622314798] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:29:14,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1505604141] [2025-02-08 14:29:14,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:29:14,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:29:14,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:29:14,701 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 14:29:14,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2025-02-08 14:29:14,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-08 14:29:14,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-08 14:29:14,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:29:14,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:29:14,785 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 14:29:14,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:29:14,810 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2025-02-08 14:29:14,810 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:29:14,866 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2025-02-08 14:29:14,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1505604141] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:29:14,866 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:29:14,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-02-08 14:29:14,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585243123] [2025-02-08 14:29:14,867 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:29:14,867 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-08 14:29:14,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:29:14,867 INFO L85 PathProgramCache]: Analyzing trace with hash 47636, now seen corresponding path program 3 times [2025-02-08 14:29:14,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:29:14,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235915449] [2025-02-08 14:29:14,867 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 14:29:14,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:29:14,870 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:29:14,872 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:29:14,872 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-08 14:29:14,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:29:14,872 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:29:14,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:29:14,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:29:14,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:29:14,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:29:14,876 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:29:14,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:29:14,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-08 14:29:14,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-02-08 14:29:14,940 INFO L87 Difference]: Start difference. First operand 42 states and 55 transitions. cyclomatic complexity: 18 Second operand has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 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-08 14:29:15,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:29:15,083 INFO L93 Difference]: Finished difference Result 106 states and 140 transitions. [2025-02-08 14:29:15,083 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 106 states and 140 transitions. [2025-02-08 14:29:15,084 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2025-02-08 14:29:15,085 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 106 states to 106 states and 140 transitions. [2025-02-08 14:29:15,085 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 66 [2025-02-08 14:29:15,085 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 66 [2025-02-08 14:29:15,085 INFO L73 IsDeterministic]: Start isDeterministic. Operand 106 states and 140 transitions. [2025-02-08 14:29:15,090 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:29:15,090 INFO L218 hiAutomatonCegarLoop]: Abstraction has 106 states and 140 transitions. [2025-02-08 14:29:15,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states and 140 transitions. [2025-02-08 14:29:15,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 78. [2025-02-08 14:29:15,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 78 states have (on average 1.3205128205128205) internal successors, (103), 77 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-08 14:29:15,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 103 transitions. [2025-02-08 14:29:15,093 INFO L240 hiAutomatonCegarLoop]: Abstraction has 78 states and 103 transitions. [2025-02-08 14:29:15,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 14:29:15,095 INFO L432 stractBuchiCegarLoop]: Abstraction has 78 states and 103 transitions. [2025-02-08 14:29:15,095 INFO L338 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-02-08 14:29:15,095 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 78 states and 103 transitions. [2025-02-08 14:29:15,096 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2025-02-08 14:29:15,096 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:29:15,096 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:29:15,097 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 10, 10, 10, 9, 9, 1, 1, 1] [2025-02-08 14:29:15,097 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-08 14:29:15,097 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post6#1, main_~i~1#1, main_#t~ret7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~ret10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_~i~2#1, main_#t~ret14#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0;" "assume main_~i~1#1 < 10;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume main_~i~1#1 < 10;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume main_~i~1#1 < 10;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume main_~i~1#1 < 10;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume main_~i~1#1 < 10;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume main_~i~1#1 < 10;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume main_~i~1#1 < 10;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume main_~i~1#1 < 10;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume main_~i~1#1 < 10;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume main_~i~1#1 < 10;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume !(main_~i~1#1 < 10);havoc main_~i~1#1;assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem1#1, max_#t~ite3#1, max_#t~mem2#1, max_#t~post4#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0;" "assume max_~i~0#1 < 10;call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);" "assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1;" "max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1;" "assume max_~i~0#1 < 10;call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);" "assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1;" "max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1;" "assume max_~i~0#1 < 10;call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);" "assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1;" "max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1;" "assume max_~i~0#1 < 10;call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);" "assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1;" "max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1;" "assume max_~i~0#1 < 10;call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);" "assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1;" "max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1;" "assume max_~i~0#1 < 10;call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);" "assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1;" "max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1;" "assume max_~i~0#1 < 10;call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);" "assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1;" "max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1;" "assume max_~i~0#1 < 10;call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);" "assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1;" "max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1;" "assume max_~i~0#1 < 10;call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);" "assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1;" "max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1;" "assume max_~i~0#1 < 10;call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);" "assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1;" "max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1;" "assume !(max_~i~0#1 < 10);max_#res#1 := (if max_~ret~0#1 % 4294967296 <= 2147483647 then max_~ret~0#1 % 4294967296 else max_~ret~0#1 % 4294967296 - 4294967296);main_#t~ret7#1 := max_#res#1;havoc max_#t~mem1#1, max_#t~ite3#1, max_#t~mem2#1, max_#t~post4#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;havoc max_#in~x#1.base, max_#in~x#1.offset;assume { :end_inline_max } true;main_~ret~1#1 := main_#t~ret7#1;havoc main_#t~ret7#1;call main_#t~mem8#1 := read~int#1(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem8#1;havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int#1(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int#1(main_#t~mem9#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem9#1;call write~int#1(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem1#1, max_#t~ite3#1, max_#t~mem2#1, max_#t~post4#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0;" "assume max_~i~0#1 < 10;call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);" "assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1;" "max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1;" "assume max_~i~0#1 < 10;call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);" "assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1;" "max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1;" "assume max_~i~0#1 < 10;call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);" "assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1;" "max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1;" "assume max_~i~0#1 < 10;call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);" "assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1;" "max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1;" "assume max_~i~0#1 < 10;call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);" "assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1;" "max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1;" "assume max_~i~0#1 < 10;call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);" "assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1;" "max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1;" "assume max_~i~0#1 < 10;call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);" "assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1;" "max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1;" "assume max_~i~0#1 < 10;call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);" "assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1;" "max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1;" "assume max_~i~0#1 < 10;call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);" "assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1;" "max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1;" "assume max_~i~0#1 < 10;call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);" [2025-02-08 14:29:15,099 INFO L754 eck$LassoCheckResult]: Loop: "assume max_~ret~0#1 < max_#t~mem1#1;call max_#t~mem2#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite3#1 := max_#t~mem2#1;" "max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1;" "assume max_~i~0#1 < 10;call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);" [2025-02-08 14:29:15,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:29:15,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1187702744, now seen corresponding path program 2 times [2025-02-08 14:29:15,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:29:15,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173338150] [2025-02-08 14:29:15,100 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:29:15,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:29:15,131 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 71 statements into 2 equivalence classes. [2025-02-08 14:29:15,221 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 71 of 71 statements. [2025-02-08 14:29:15,221 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 14:29:15,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:29:15,221 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:29:15,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-08 14:29:15,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-08 14:29:15,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:29:15,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:29:15,284 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:29:15,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:29:15,286 INFO L85 PathProgramCache]: Analyzing trace with hash 47636, now seen corresponding path program 4 times [2025-02-08 14:29:15,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:29:15,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395140764] [2025-02-08 14:29:15,287 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 14:29:15,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:29:15,289 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 3 statements into 2 equivalence classes. [2025-02-08 14:29:15,291 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:29:15,291 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 14:29:15,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:29:15,291 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:29:15,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:29:15,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:29:15,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:29:15,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:29:15,295 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:29:15,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:29:15,295 INFO L85 PathProgramCache]: Analyzing trace with hash 911879901, now seen corresponding path program 1 times [2025-02-08 14:29:15,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:29:15,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741774975] [2025-02-08 14:29:15,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:29:15,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:29:15,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-08 14:29:15,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-08 14:29:15,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:29:15,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:29:15,636 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 117 proven. 28 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-02-08 14:29:15,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:29:15,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741774975] [2025-02-08 14:29:15,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741774975] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:29:15,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [490739497] [2025-02-08 14:29:15,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:29:15,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:29:15,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:29:15,639 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 14:29:15,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2025-02-08 14:29:15,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-08 14:29:15,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-08 14:29:15,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:29:15,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:29:15,757 INFO L256 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-08 14:29:15,759 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:29:15,814 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-02-08 14:29:15,814 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 14:29:15,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [490739497] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:29:15,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 14:29:15,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [12] total 13 [2025-02-08 14:29:15,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660405714] [2025-02-08 14:29:15,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:29:15,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:29:15,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-08 14:29:15,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2025-02-08 14:29:15,878 INFO L87 Difference]: Start difference. First operand 78 states and 103 transitions. cyclomatic complexity: 30 Second operand has 13 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 13 states have internal predecessors, (38), 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-08 14:29:16,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:29:16,112 INFO L93 Difference]: Finished difference Result 106 states and 137 transitions. [2025-02-08 14:29:16,112 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 106 states and 137 transitions. [2025-02-08 14:29:16,113 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2025-02-08 14:29:16,114 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 106 states to 75 states and 96 transitions. [2025-02-08 14:29:16,114 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2025-02-08 14:29:16,114 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 65 [2025-02-08 14:29:16,114 INFO L73 IsDeterministic]: Start isDeterministic. Operand 75 states and 96 transitions. [2025-02-08 14:29:16,114 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:29:16,117 INFO L218 hiAutomatonCegarLoop]: Abstraction has 75 states and 96 transitions. [2025-02-08 14:29:16,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states and 96 transitions. [2025-02-08 14:29:16,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2025-02-08 14:29:16,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 75 states have (on average 1.28) internal successors, (96), 74 states have internal predecessors, (96), 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-08 14:29:16,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 96 transitions. [2025-02-08 14:29:16,120 INFO L240 hiAutomatonCegarLoop]: Abstraction has 75 states and 96 transitions. [2025-02-08 14:29:16,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-08 14:29:16,121 INFO L432 stractBuchiCegarLoop]: Abstraction has 75 states and 96 transitions. [2025-02-08 14:29:16,121 INFO L338 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-02-08 14:29:16,122 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states and 96 transitions. [2025-02-08 14:29:16,122 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2025-02-08 14:29:16,122 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:29:16,122 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:29:16,124 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1] [2025-02-08 14:29:16,124 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-02-08 14:29:16,124 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post6#1, main_~i~1#1, main_#t~ret7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~ret10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_~i~2#1, main_#t~ret14#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0;" "assume main_~i~1#1 < 10;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume main_~i~1#1 < 10;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume main_~i~1#1 < 10;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume main_~i~1#1 < 10;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume main_~i~1#1 < 10;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume main_~i~1#1 < 10;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume main_~i~1#1 < 10;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume main_~i~1#1 < 10;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume main_~i~1#1 < 10;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume main_~i~1#1 < 10;havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" "assume !(main_~i~1#1 < 10);havoc main_~i~1#1;assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem1#1, max_#t~ite3#1, max_#t~mem2#1, max_#t~post4#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0;" "assume max_~i~0#1 < 10;call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);" "assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1;" "max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1;" "assume max_~i~0#1 < 10;call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);" "assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1;" "max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1;" "assume max_~i~0#1 < 10;call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);" "assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1;" "max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1;" "assume max_~i~0#1 < 10;call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);" "assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1;" "max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1;" "assume max_~i~0#1 < 10;call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);" "assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1;" "max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1;" "assume max_~i~0#1 < 10;call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);" "assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1;" "max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1;" "assume max_~i~0#1 < 10;call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);" "assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1;" "max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1;" "assume max_~i~0#1 < 10;call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);" "assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1;" "max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1;" "assume max_~i~0#1 < 10;call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);" "assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1;" "max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1;" "assume max_~i~0#1 < 10;call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);" "assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1;" "max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1;" "assume !(max_~i~0#1 < 10);max_#res#1 := (if max_~ret~0#1 % 4294967296 <= 2147483647 then max_~ret~0#1 % 4294967296 else max_~ret~0#1 % 4294967296 - 4294967296);main_#t~ret7#1 := max_#res#1;havoc max_#t~mem1#1, max_#t~ite3#1, max_#t~mem2#1, max_#t~post4#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;havoc max_#in~x#1.base, max_#in~x#1.offset;assume { :end_inline_max } true;main_~ret~1#1 := main_#t~ret7#1;havoc main_#t~ret7#1;call main_#t~mem8#1 := read~int#1(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem8#1;havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int#1(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int#1(main_#t~mem9#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem9#1;call write~int#1(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem1#1, max_#t~ite3#1, max_#t~mem2#1, max_#t~post4#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0;" "assume max_~i~0#1 < 10;call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);" "assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1;" "max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1;" "assume max_~i~0#1 < 10;call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);" "assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1;" "max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1;" "assume max_~i~0#1 < 10;call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);" "assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1;" "max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1;" "assume max_~i~0#1 < 10;call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);" "assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1;" "max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1;" "assume max_~i~0#1 < 10;call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);" "assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1;" "max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1;" "assume max_~i~0#1 < 10;call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);" "assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1;" "max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1;" "assume max_~i~0#1 < 10;call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);" "assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1;" "max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1;" "assume max_~i~0#1 < 10;call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);" "assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1;" "max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1;" "assume max_~i~0#1 < 10;call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);" "assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1;" "max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1;" "assume max_~i~0#1 < 10;call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);" "assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1;" "max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1;" "assume !(max_~i~0#1 < 10);max_#res#1 := (if max_~ret~0#1 % 4294967296 <= 2147483647 then max_~ret~0#1 % 4294967296 else max_~ret~0#1 % 4294967296 - 4294967296);main_#t~ret10#1 := max_#res#1;havoc max_#t~mem1#1, max_#t~ite3#1, max_#t~mem2#1, max_#t~post4#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;havoc max_#in~x#1.base, max_#in~x#1.offset;assume { :end_inline_max } true;main_~ret2~0#1 := main_#t~ret10#1;havoc main_#t~ret10#1;call main_#t~mem11#1 := read~int#1(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem11#1;havoc main_#t~mem11#1;main_~i~2#1 := 0;" [2025-02-08 14:29:16,125 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~2#1 < 9;call main_#t~mem12#1 := read~int#1(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int#1(main_#t~mem12#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem12#1;main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1;" [2025-02-08 14:29:16,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:29:16,125 INFO L85 PathProgramCache]: Analyzing trace with hash 911880858, now seen corresponding path program 1 times [2025-02-08 14:29:16,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:29:16,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140368378] [2025-02-08 14:29:16,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:29:16,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:29:16,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-08 14:29:16,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-08 14:29:16,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:29:16,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:29:16,180 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:29:16,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-08 14:29:16,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-08 14:29:16,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:29:16,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:29:16,253 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:29:16,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:29:16,255 INFO L85 PathProgramCache]: Analyzing trace with hash 46, now seen corresponding path program 1 times [2025-02-08 14:29:16,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:29:16,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960692452] [2025-02-08 14:29:16,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:29:16,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:29:16,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:29:16,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:29:16,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:29:16,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:29:16,259 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:29:16,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:29:16,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:29:16,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:29:16,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:29:16,261 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:29:16,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:29:16,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1796464459, now seen corresponding path program 1 times [2025-02-08 14:29:16,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:29:16,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30327972] [2025-02-08 14:29:16,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:29:16,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:29:16,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-08 14:29:16,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-08 14:29:16,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:29:16,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:29:16,333 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:29:16,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-08 14:29:16,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-08 14:29:16,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:29:16,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:29:16,383 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:29:44,999 WARN L286 SmtUtils]: Spent 28.56s on a formula simplification. DAG size of input: 613 DAG size of output: 471 (called from [L 276] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2025-02-08 14:29:46,327 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:29:46,328 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:29:46,328 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:29:46,328 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:29:46,328 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-08 14:29:46,328 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:29:46,328 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:29:46,328 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:29:46,328 INFO L132 ssoRankerPreferences]: Filename of dumped script: max10-1.i_Iteration10_Lasso [2025-02-08 14:29:46,328 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:29:46,328 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:29:46,330 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:29:46,334 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:29:46,335 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:29:46,336 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:29:46,338 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:29:46,340 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:29:46,341 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:29:46,342 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:29:46,875 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:29:46,885 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:29:46,886 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:29:46,887 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:29:46,888 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:29:46,889 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:29:46,890 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:29:46,891 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:29:46,893 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:29:46,894 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:29:46,895 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:29:46,896 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:29:46,897 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:29:46,900 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:29:46,901 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:29:46,902 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:29:46,904 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:29:46,905 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:29:46,906 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:29:46,907 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:29:47,087 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:29:47,087 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-08 14:29:47,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:29:47,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:29:47,090 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-08 14:29:47,090 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-08 14:29:47,093 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:29:47,103 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:29:47,103 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:29:47,103 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:29:47,103 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:29:47,103 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:29:47,104 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:29:47,104 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:29:47,105 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:29:47,110 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-08 14:29:47,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:29:47,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:29:47,112 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-08 14:29:47,113 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-08 14:29:47,114 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:29:47,123 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:29:47,124 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:29:47,124 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:29:47,124 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:29:47,124 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:29:47,124 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:29:47,124 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:29:47,125 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:29:47,130 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2025-02-08 14:29:47,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:29:47,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:29:47,132 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-08 14:29:47,132 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-08 14:29:47,133 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:29:47,143 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:29:47,143 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:29:47,143 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:29:47,143 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:29:47,143 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:29:47,143 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:29:47,143 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:29:47,144 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:29:47,149 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-08 14:29:47,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:29:47,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:29:47,151 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-08 14:29:47,152 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-08 14:29:47,153 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:29:47,162 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:29:47,162 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:29:47,162 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:29:47,162 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:29:47,162 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:29:47,162 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:29:47,162 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:29:47,163 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:29:47,169 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-08 14:29:47,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:29:47,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:29:47,171 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-08 14:29:47,171 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-08 14:29:47,172 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:29:47,182 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:29:47,183 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:29:47,183 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:29:47,183 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:29:47,184 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:29:47,184 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:29:47,186 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:29:47,192 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-08 14:29:47,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:29:47,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:29:47,194 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-08 14:29:47,196 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-08 14:29:47,196 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:29:47,206 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:29:47,206 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:29:47,206 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:29:47,206 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:29:47,206 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:29:47,206 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:29:47,206 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:29:47,207 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:29:47,214 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-08 14:29:47,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:29:47,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:29:47,216 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-08 14:29:47,230 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-08 14:29:47,230 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:29:47,242 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:29:47,242 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:29:47,242 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:29:47,242 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:29:47,242 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:29:47,242 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:29:47,242 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:29:47,243 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:29:47,249 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-08 14:29:47,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:29:47,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:29:47,251 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-08 14:29:47,254 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-08 14:29:47,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-08 14:29:47,265 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:29:47,265 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:29:47,265 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:29:47,265 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:29:47,266 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:29:47,266 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:29:47,269 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:29:47,275 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2025-02-08 14:29:47,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:29:47,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:29:47,277 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:29:47,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2025-02-08 14:29:47,278 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:29:47,288 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:29:47,288 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:29:47,288 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:29:47,288 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:29:47,290 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:29:47,290 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:29:47,292 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:29:47,297 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2025-02-08 14:29:47,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:29:47,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:29:47,299 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-08 14:29:47,300 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-08 14:29:47,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-08 14:29:47,310 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:29:47,310 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:29:47,310 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:29:47,310 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:29:47,311 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:29:47,311 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:29:47,314 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:29:47,319 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-08 14:29:47,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:29:47,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:29:47,321 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-08 14:29:47,322 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-08 14:29:47,323 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:29:47,333 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:29:47,333 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:29:47,333 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:29:47,333 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:29:47,334 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:29:47,334 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:29:47,337 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:29:47,342 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-08 14:29:47,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:29:47,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:29:47,344 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-08 14:29:47,345 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-08 14:29:47,346 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:29:47,357 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:29:47,357 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:29:47,357 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:29:47,357 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:29:47,358 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:29:47,358 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:29:47,361 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:29:47,366 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-08 14:29:47,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:29:47,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:29:47,368 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-08 14:29:47,369 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-08 14:29:47,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-08 14:29:47,379 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:29:47,379 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:29:47,379 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:29:47,379 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:29:47,380 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:29:47,380 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:29:47,382 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:29:47,387 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2025-02-08 14:29:47,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:29:47,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:29:47,390 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-08 14:29:47,392 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-08 14:29:47,393 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:29:47,403 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:29:47,403 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:29:47,403 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:29:47,403 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:29:47,404 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:29:47,404 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:29:47,406 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:29:47,412 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Forceful destruction successful, exit code 0 [2025-02-08 14:29:47,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:29:47,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:29:47,414 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-08 14:29:47,414 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-08 14:29:47,415 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:29:47,425 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:29:47,425 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:29:47,425 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:29:47,425 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:29:47,427 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:29:47,427 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:29:47,429 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:29:47,435 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Ended with exit code 0 [2025-02-08 14:29:47,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:29:47,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:29:47,437 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-08 14:29:47,437 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-08 14:29:47,438 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:29:47,448 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:29:47,448 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:29:47,448 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:29:47,448 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:29:47,449 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:29:47,449 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:29:47,451 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:29:47,456 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-08 14:29:47,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:29:47,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:29:47,459 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-08 14:29:47,459 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-08 14:29:47,460 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:29:47,470 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:29:47,470 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:29:47,470 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:29:47,470 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:29:47,471 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:29:47,471 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:29:47,472 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:29:47,478 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Ended with exit code 0 [2025-02-08 14:29:47,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:29:47,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:29:47,480 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-08 14:29:47,481 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-08 14:29:47,481 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:29:47,491 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:29:47,491 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:29:47,491 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:29:47,491 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:29:47,492 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:29:47,492 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:29:47,495 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:29:47,500 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Ended with exit code 0 [2025-02-08 14:29:47,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:29:47,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:29:47,502 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-08 14:29:47,503 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-08 14:29:47,505 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:29:47,515 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:29:47,515 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:29:47,515 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:29:47,515 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:29:47,516 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:29:47,516 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:29:47,518 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:29:47,524 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-08 14:29:47,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:29:47,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:29:47,526 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-08 14:29:47,528 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-08 14:29:47,529 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:29:47,538 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:29:47,538 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:29:47,538 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:29:47,538 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:29:47,540 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:29:47,540 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:29:47,543 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:29:47,548 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Forceful destruction successful, exit code 0 [2025-02-08 14:29:47,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:29:47,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:29:47,550 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-08 14:29:47,551 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-08 14:29:47,552 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:29:47,561 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:29:47,561 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:29:47,561 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:29:47,561 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:29:47,562 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:29:47,562 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:29:47,564 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:29:47,570 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Ended with exit code 0 [2025-02-08 14:29:47,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:29:47,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:29:47,572 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-08 14:29:47,573 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-08 14:29:47,573 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:29:47,583 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:29:47,583 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:29:47,583 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:29:47,583 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:29:47,584 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:29:47,584 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:29:47,586 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:29:47,591 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-08 14:29:47,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:29:47,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:29:47,593 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-08 14:29:47,595 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-08 14:29:47,596 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:29:47,605 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:29:47,605 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:29:47,605 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:29:47,605 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:29:47,609 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:29:47,609 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:29:47,614 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-08 14:29:47,623 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2025-02-08 14:29:47,623 INFO L444 ModelExtractionUtils]: 0 out of 13 variables were initially zero. Simplification set additionally 10 variables to zero. [2025-02-08 14:29:47,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:29:47,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:29:47,625 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-08 14:29:47,626 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-08 14:29:47,626 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-08 14:29:47,637 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-02-08 14:29:47,637 INFO L474 LassoAnalysis]: Proved termination. [2025-02-08 14:29:47,637 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~2#1) = -2*ULTIMATE.start_main_~i~2#1 + 17 Supporting invariants [] [2025-02-08 14:29:47,642 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Forceful destruction successful, exit code 0 [2025-02-08 14:29:47,650 INFO L156 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2025-02-08 14:29:47,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:29:47,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-08 14:29:47,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-08 14:29:47,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:29:47,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:29:47,726 INFO L256 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 14:29:47,728 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:29:47,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:29:47,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:29:47,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:29:47,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:29:47,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 14:29:47,806 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:29:47,806 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-08 14:29:47,807 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-08 14:29:47,807 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 75 states and 96 transitions. cyclomatic complexity: 23 Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 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-08 14:29:47,811 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 75 states and 96 transitions. cyclomatic complexity: 23. Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 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 76 states and 97 transitions. Complement of second has 2 states. [2025-02-08 14:29:47,812 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-08 14:29:47,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 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-08 14:29:47,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 14 transitions. [2025-02-08 14:29:47,812 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 14 transitions. Stem has 74 letters. Loop has 1 letters. [2025-02-08 14:29:47,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:29:47,813 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 14 transitions. Stem has 75 letters. Loop has 1 letters. [2025-02-08 14:29:47,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:29:47,813 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 14 transitions. Stem has 74 letters. Loop has 2 letters. [2025-02-08 14:29:47,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:29:47,813 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 76 states and 97 transitions. [2025-02-08 14:29:47,814 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-08 14:29:47,814 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 76 states to 0 states and 0 transitions. [2025-02-08 14:29:47,814 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-02-08 14:29:47,814 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-02-08 14:29:47,814 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-02-08 14:29:47,814 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:29:47,814 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-08 14:29:47,814 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-08 14:29:47,814 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-08 14:29:47,814 INFO L338 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2025-02-08 14:29:47,814 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-02-08 14:29:47,814 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-08 14:29:47,814 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-02-08 14:29:47,819 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 08.02 02:29:47 BoogieIcfgContainer [2025-02-08 14:29:47,819 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-02-08 14:29:47,820 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 14:29:47,820 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 14:29:47,820 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 14:29:47,820 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:29:06" (3/4) ... [2025-02-08 14:29:47,822 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-08 14:29:47,822 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 14:29:47,823 INFO L158 Benchmark]: Toolchain (without parser) took 41465.91ms. Allocated memory was 142.6MB in the beginning and 620.8MB in the end (delta: 478.2MB). Free memory was 105.1MB in the beginning and 487.6MB in the end (delta: -382.5MB). Peak memory consumption was 100.4MB. Max. memory is 16.1GB. [2025-02-08 14:29:47,823 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 126.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 14:29:47,823 INFO L158 Benchmark]: CACSL2BoogieTranslator took 177.56ms. Allocated memory is still 142.6MB. Free memory was 105.1MB in the beginning and 94.0MB in the end (delta: 11.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 14:29:47,823 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.06ms. Allocated memory is still 142.6MB. Free memory was 94.0MB in the beginning and 92.4MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 14:29:47,823 INFO L158 Benchmark]: Boogie Preprocessor took 35.41ms. Allocated memory is still 142.6MB. Free memory was 92.4MB in the beginning and 91.4MB in the end (delta: 966.9kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 14:29:47,823 INFO L158 Benchmark]: IcfgBuilder took 325.27ms. Allocated memory is still 142.6MB. Free memory was 90.5MB in the beginning and 75.6MB in the end (delta: 14.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 14:29:47,823 INFO L158 Benchmark]: BuchiAutomizer took 40890.64ms. Allocated memory was 142.6MB in the beginning and 620.8MB in the end (delta: 478.2MB). Free memory was 75.6MB in the beginning and 487.8MB in the end (delta: -412.1MB). Peak memory consumption was 66.9MB. Max. memory is 16.1GB. [2025-02-08 14:29:47,823 INFO L158 Benchmark]: Witness Printer took 2.34ms. Allocated memory is still 620.8MB. Free memory was 487.8MB in the beginning and 487.6MB in the end (delta: 193.9kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 14:29:47,824 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 126.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 177.56ms. Allocated memory is still 142.6MB. Free memory was 105.1MB in the beginning and 94.0MB in the end (delta: 11.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.06ms. Allocated memory is still 142.6MB. Free memory was 94.0MB in the beginning and 92.4MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.41ms. Allocated memory is still 142.6MB. Free memory was 92.4MB in the beginning and 91.4MB in the end (delta: 966.9kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 325.27ms. Allocated memory is still 142.6MB. Free memory was 90.5MB in the beginning and 75.6MB in the end (delta: 14.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 40890.64ms. Allocated memory was 142.6MB in the beginning and 620.8MB in the end (delta: 478.2MB). Free memory was 75.6MB in the beginning and 487.8MB in the end (delta: -412.1MB). Peak memory consumption was 66.9MB. Max. memory is 16.1GB. * Witness Printer took 2.34ms. Allocated memory is still 620.8MB. Free memory was 487.8MB in the beginning and 487.6MB in the end (delta: 193.9kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 10 terminating modules (7 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function null and consists of 2 locations. One deterministic module has affine ranking function (19 + ((long long) -2 * i)) and consists of 3 locations. One deterministic module has affine ranking function (((long long) -2 * i) + 17) and consists of 2 locations. 7 modules have a trivial ranking function, the largest among these consists of 13 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 40.8s and 11 iterations. TraceHistogramMax:10. Analysis of lassos took 39.8s. Construction of modules took 0.3s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 10. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 47 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 291 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 288 mSDsluCounter, 356 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 219 mSDsCounter, 116 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 497 IncrementalHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 116 mSolverCounterUnsat, 137 mSDtfsCounter, 497 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU6 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital390 mio100 ax100 hnf100 lsp92 ukn46 mio100 lsp36 div100 bol100 ite100 ukn100 eq156 hnf91 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 22ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-02-08 14:29:47,834 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Ended with exit code 0 [2025-02-08 14:29:48,035 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Ended with exit code 0 [2025-02-08 14:29:48,235 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Forceful destruction successful, exit code 0 [2025-02-08 14:29:48,435 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Forceful destruction successful, exit code 0 [2025-02-08 14:29:48,635 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-02-08 14:29:48,835 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-02-08 14:29:49,038 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE