./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 c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/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-?-c00e63d-m [2025-02-06 19:09:25,981 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 19:09:26,038 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2025-02-06 19:09:26,041 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 19:09:26,041 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 19:09:26,041 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-02-06 19:09:26,054 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 19:09:26,054 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 19:09:26,054 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 19:09:26,055 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 19:09:26,055 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 19:09:26,055 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 19:09:26,055 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 19:09:26,055 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 19:09:26,055 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-02-06 19:09:26,055 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-02-06 19:09:26,055 INFO L153 SettingsManager]: * Use old map elimination=false [2025-02-06 19:09:26,056 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-02-06 19:09:26,056 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-02-06 19:09:26,056 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-02-06 19:09:26,056 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 19:09:26,056 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-02-06 19:09:26,056 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 19:09:26,056 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 19:09:26,056 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 19:09:26,056 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 19:09:26,056 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-02-06 19:09:26,056 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-02-06 19:09:26,056 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-02-06 19:09:26,056 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 19:09:26,057 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 19:09:26,057 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 19:09:26,057 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-02-06 19:09:26,057 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 19:09:26,057 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 19:09:26,057 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 19:09:26,057 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 19:09:26,057 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 19:09:26,057 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 19:09:26,057 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-02-06 19:09:26,057 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-06 19:09:26,234 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 19:09:26,238 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 19:09:26,240 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 19:09:26,240 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 19:09:26,241 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 19:09:26,241 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-06 19:09:27,313 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/104ec2691/1685f9f63762493893bdfaa84da5acea/FLAGad102bfb5 [2025-02-06 19:09:27,530 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 19:09:27,531 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/reducercommutativity/max10-1.i [2025-02-06 19:09:27,539 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/104ec2691/1685f9f63762493893bdfaa84da5acea/FLAGad102bfb5 [2025-02-06 19:09:27,891 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/104ec2691/1685f9f63762493893bdfaa84da5acea [2025-02-06 19:09:27,893 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 19:09:27,894 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 19:09:27,895 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 19:09:27,897 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 19:09:27,900 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 19:09:27,902 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 07:09:27" (1/1) ... [2025-02-06 19:09:27,902 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18e0bfa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:09:27, skipping insertion in model container [2025-02-06 19:09:27,903 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 07:09:27" (1/1) ... [2025-02-06 19:09:27,915 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 19:09:28,039 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 19:09:28,047 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 19:09:28,063 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 19:09:28,077 INFO L204 MainTranslator]: Completed translation [2025-02-06 19:09:28,078 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:09:28 WrapperNode [2025-02-06 19:09:28,078 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 19:09:28,079 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 19:09:28,079 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 19:09:28,079 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 19:09:28,083 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:09:28" (1/1) ... [2025-02-06 19:09:28,088 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:09:28" (1/1) ... [2025-02-06 19:09:28,103 INFO L138 Inliner]: procedures = 16, calls = 24, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 121 [2025-02-06 19:09:28,103 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 19:09:28,103 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 19:09:28,103 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 19:09:28,104 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 19:09:28,110 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:09:28" (1/1) ... [2025-02-06 19:09:28,111 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:09:28" (1/1) ... [2025-02-06 19:09:28,112 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:09:28" (1/1) ... [2025-02-06 19:09:28,124 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-06 19:09:28,126 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:09:28" (1/1) ... [2025-02-06 19:09:28,126 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:09:28" (1/1) ... [2025-02-06 19:09:28,131 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:09:28" (1/1) ... [2025-02-06 19:09:28,131 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:09:28" (1/1) ... [2025-02-06 19:09:28,132 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:09:28" (1/1) ... [2025-02-06 19:09:28,133 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:09:28" (1/1) ... [2025-02-06 19:09:28,134 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 19:09:28,135 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 19:09:28,135 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 19:09:28,135 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 19:09:28,135 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:09:28" (1/1) ... [2025-02-06 19:09:28,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:09:28,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:09:28,172 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:09:28,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-02-06 19:09:28,198 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 19:09:28,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 19:09:28,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 19:09:28,198 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 19:09:28,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 19:09:28,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 19:09:28,199 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 19:09:28,199 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 19:09:28,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 19:09:28,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 19:09:28,199 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 19:09:28,259 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 19:09:28,260 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 19:09:28,457 INFO L1309 $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-06 19:09:28,474 INFO L? ?]: Removed 40 outVars from TransFormulas that were not future-live. [2025-02-06 19:09:28,474 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 19:09:28,484 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 19:09:28,485 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 19:09:28,485 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 07:09:28 BoogieIcfgContainer [2025-02-06 19:09:28,485 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 19:09:28,486 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-02-06 19:09:28,486 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-02-06 19:09:28,490 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-02-06 19:09:28,491 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-06 19:09:28,491 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 06.02 07:09:27" (1/3) ... [2025-02-06 19:09:28,492 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@192bc79f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.02 07:09:28, skipping insertion in model container [2025-02-06 19:09:28,492 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-06 19:09:28,492 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:09:28" (2/3) ... [2025-02-06 19:09:28,493 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@192bc79f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.02 07:09:28, skipping insertion in model container [2025-02-06 19:09:28,493 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-06 19:09:28,494 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 07:09:28" (3/3) ... [2025-02-06 19:09:28,494 INFO L363 chiAutomizerObserver]: Analyzing ICFG max10-1.i [2025-02-06 19:09:28,543 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-02-06 19:09:28,544 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-02-06 19:09:28,544 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-02-06 19:09:28,544 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-02-06 19:09:28,544 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-02-06 19:09:28,544 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-02-06 19:09:28,544 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-02-06 19:09:28,544 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-02-06 19:09:28,549 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 23 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 22 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:09:28,559 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 11 [2025-02-06 19:09:28,560 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:09:28,560 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:09:28,564 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-02-06 19:09:28,564 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-02-06 19:09:28,564 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-02-06 19:09:28,565 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 23 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 22 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:09:28,566 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 11 [2025-02-06 19:09:28,566 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:09:28,566 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:09:28,567 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-02-06 19:09:28,567 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-02-06 19:09:28,570 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-06 19:09:28,571 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-06 19:09:28,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:09:28,575 INFO L85 PathProgramCache]: Analyzing trace with hash 2080, now seen corresponding path program 1 times [2025-02-06 19:09:28,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:09:28,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542124225] [2025-02-06 19:09:28,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:09:28,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:09:28,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:09:28,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:09:28,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:09:28,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:09:28,646 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:09:28,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:09:28,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:09:28,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:09:28,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:09:28,668 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:09:28,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:09:28,671 INFO L85 PathProgramCache]: Analyzing trace with hash 64, now seen corresponding path program 1 times [2025-02-06 19:09:28,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:09:28,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617910624] [2025-02-06 19:09:28,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:09:28,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:09:28,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-06 19:09:28,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-06 19:09:28,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:09:28,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:09:28,685 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:09:28,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-06 19:09:28,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-06 19:09:28,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:09:28,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:09:28,694 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:09:28,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:09:28,695 INFO L85 PathProgramCache]: Analyzing trace with hash 64513, now seen corresponding path program 1 times [2025-02-06 19:09:28,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:09:28,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711245036] [2025-02-06 19:09:28,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:09:28,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:09:28,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 19:09:28,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:09:28,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:09:28,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:09:28,718 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:09:28,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 19:09:28,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:09:28,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:09:28,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:09:28,735 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:09:29,014 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:09:29,016 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:09:29,016 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:09:29,018 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:09:29,018 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-06 19:09:29,018 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:09:29,018 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:09:29,018 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:09:29,018 INFO L132 ssoRankerPreferences]: Filename of dumped script: max10-1.i_Iteration1_Lasso [2025-02-06 19:09:29,018 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:09:29,018 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:09:29,032 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:29,037 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:29,052 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:29,055 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:29,058 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:29,061 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:29,063 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:29,070 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:29,072 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:29,074 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:29,078 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:29,080 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:29,083 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:29,084 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:29,235 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:29,237 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:29,239 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:29,240 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:29,501 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:09:29,503 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-06 19:09:29,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:09:29,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:09:29,507 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:09:29,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-02-06 19:09:29,511 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:09:29,522 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:09:29,522 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:09:29,523 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:09:29,523 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:09:29,523 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:09:29,530 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:09:29,530 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:09:29,536 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:09:29,542 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-02-06 19:09:29,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:09:29,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:09:29,546 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:09:29,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-02-06 19:09:29,550 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:09:29,561 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:09:29,561 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:09:29,561 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:09:29,561 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:09:29,563 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:09:29,563 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:09:29,566 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:09:29,573 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-02-06 19:09:29,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:09:29,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:09:29,576 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:09:29,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-02-06 19:09:29,578 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:09:29,589 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:09:29,589 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:09:29,589 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:09:29,589 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:09:29,591 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:09:29,591 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:09:29,594 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:09:29,601 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-02-06 19:09:29,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:09:29,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:09:29,606 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:09:29,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-02-06 19:09:29,608 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:09:29,619 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:09:29,619 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:09:29,619 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:09:29,619 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:09:29,619 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:09:29,619 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:09:29,619 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:09:29,621 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:09:29,626 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-02-06 19:09:29,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:09:29,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:09:29,629 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:09:29,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-02-06 19:09:29,632 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:09:29,642 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:09:29,642 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:09:29,642 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:09:29,642 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:09:29,642 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:09:29,642 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:09:29,642 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:09:29,644 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:09:29,649 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-02-06 19:09:29,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:09:29,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:09:29,652 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:09:29,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-02-06 19:09:29,654 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:09:29,664 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:09:29,664 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:09:29,664 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:09:29,664 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:09:29,664 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:09:29,664 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:09:29,665 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:09:29,666 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:09:29,671 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-06 19:09:29,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:09:29,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:09:29,677 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:09:29,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-02-06 19:09:29,680 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:09:29,691 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:09:29,691 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:09:29,691 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:09:29,691 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:09:29,691 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:09:29,693 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:09:29,693 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:09:29,698 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:09:29,710 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-02-06 19:09:29,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:09:29,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:09:29,713 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:09:29,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-02-06 19:09:29,719 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:09:29,737 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:09:29,737 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:09:29,737 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:09:29,737 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:09:29,737 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:09:29,738 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:09:29,738 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:09:29,743 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:09:29,752 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-02-06 19:09:29,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:09:29,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:09:29,754 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:09:29,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-02-06 19:09:29,758 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:09:29,768 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:09:29,769 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:09:29,769 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:09:29,769 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:09:29,769 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:09:29,769 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:09:29,769 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:09:29,770 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:09:29,776 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-02-06 19:09:29,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:09:29,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:09:29,778 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:09:29,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-02-06 19:09:29,781 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:09:29,791 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:09:29,791 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:09:29,791 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:09:29,791 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:09:29,791 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:09:29,791 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:09:29,791 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:09:29,793 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:09:29,798 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-02-06 19:09:29,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:09:29,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:09:29,800 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:09:29,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-02-06 19:09:29,803 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:09:29,812 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:09:29,813 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:09:29,813 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:09:29,813 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:09:29,813 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:09:29,813 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:09:29,813 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:09:29,814 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:09:29,820 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-02-06 19:09:29,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:09:29,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:09:29,822 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:09:29,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-02-06 19:09:29,826 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:09:29,836 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:09:29,836 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:09:29,837 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:09:29,837 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:09:29,837 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:09:29,837 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:09:29,837 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:09:29,840 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:09:29,846 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-02-06 19:09:29,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:09:29,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:09:29,849 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:09:29,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-02-06 19:09:29,851 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:09:29,860 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:09:29,861 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:09:29,861 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:09:29,861 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:09:29,861 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:09:29,863 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:09:29,863 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:09:29,865 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:09:29,871 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-06 19:09:29,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:09:29,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:09:29,875 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:09:29,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-02-06 19:09:29,882 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:09:29,893 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:09:29,893 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:09:29,893 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:09:29,893 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:09:29,893 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:09:29,893 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:09:29,893 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:09:29,894 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:09:29,900 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-02-06 19:09:29,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:09:29,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:09:29,902 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:09:29,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-02-06 19:09:29,905 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:09:29,918 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:09:29,919 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:09:29,919 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:09:29,919 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:09:29,924 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:09:29,924 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:09:29,928 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:09:29,937 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-02-06 19:09:29,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:09:29,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:09:29,943 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:09:29,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-02-06 19:09:29,947 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:09:29,957 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:09:29,957 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:09:29,957 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:09:29,957 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:09:29,963 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:09:29,964 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:09:29,969 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:09:29,976 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-02-06 19:09:29,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:09:29,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:09:29,978 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:09:29,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-02-06 19:09:29,980 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:09:29,990 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:09:29,990 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:09:29,990 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:09:29,990 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:09:29,995 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:09:29,995 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:09:30,000 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:09:30,006 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2025-02-06 19:09:30,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:09:30,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:09:30,012 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:09:30,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-02-06 19:09:30,015 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:09:30,025 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:09:30,026 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:09:30,026 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:09:30,026 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:09:30,029 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:09:30,029 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:09:30,036 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-06 19:09:30,072 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2025-02-06 19:09:30,074 INFO L444 ModelExtractionUtils]: 1 out of 13 variables were initially zero. Simplification set additionally 9 variables to zero. [2025-02-06 19:09:30,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:09:30,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:09:30,078 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:09:30,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-02-06 19:09:30,080 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-06 19:09:30,092 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-02-06 19:09:30,093 INFO L474 LassoAnalysis]: Proved termination. [2025-02-06 19:09:30,093 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-06 19:09:30,103 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-02-06 19:09:30,112 INFO L156 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2025-02-06 19:09:30,119 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-02-06 19:09:30,119 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-02-06 19:09:30,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:09:30,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:09:30,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:09:30,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:09:30,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:09:30,143 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 19:09:30,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:09:30,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-06 19:09:30,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-06 19:09:30,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:09:30,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:09:30,154 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 19:09:30,154 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:09:30,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:09:30,177 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-02-06 19:09:30,179 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 23 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 22 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:09:30,202 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 23 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 22 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 25 states and 36 transitions. Complement of second has 3 states. [2025-02-06 19:09:30,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2025-02-06 19:09:30,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:09:30,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 3 transitions. [2025-02-06 19:09:30,217 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 3 transitions. Stem has 2 letters. Loop has 1 letters. [2025-02-06 19:09:30,218 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:09:30,218 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 3 transitions. Stem has 3 letters. Loop has 1 letters. [2025-02-06 19:09:30,218 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:09:30,218 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 3 transitions. Stem has 2 letters. Loop has 2 letters. [2025-02-06 19:09:30,218 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:09:30,219 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 36 transitions. [2025-02-06 19:09:30,220 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 10 [2025-02-06 19:09:30,223 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 17 states and 26 transitions. [2025-02-06 19:09:30,224 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2025-02-06 19:09:30,224 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2025-02-06 19:09:30,224 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 26 transitions. [2025-02-06 19:09:30,225 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 19:09:30,225 INFO L218 hiAutomatonCegarLoop]: Abstraction has 17 states and 26 transitions. [2025-02-06 19:09:30,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 26 transitions. [2025-02-06 19:09:30,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2025-02-06 19:09:30,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:09:30,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 24 transitions. [2025-02-06 19:09:30,243 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16 states and 24 transitions. [2025-02-06 19:09:30,243 INFO L432 stractBuchiCegarLoop]: Abstraction has 16 states and 24 transitions. [2025-02-06 19:09:30,243 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-02-06 19:09:30,243 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 24 transitions. [2025-02-06 19:09:30,244 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 10 [2025-02-06 19:09:30,244 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:09:30,244 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:09:30,245 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-02-06 19:09:30,245 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-06 19:09:30,245 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-06 19:09:30,245 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-06 19:09:30,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:09:30,246 INFO L85 PathProgramCache]: Analyzing trace with hash 64512, now seen corresponding path program 1 times [2025-02-06 19:09:30,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:09:30,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628358953] [2025-02-06 19:09:30,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:09:30,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:09:30,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 19:09:30,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:09:30,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:09:30,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:09:30,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:09:30,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:09:30,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628358953] [2025-02-06 19:09:30,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628358953] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 19:09:30,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 19:09:30,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 19:09:30,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398162432] [2025-02-06 19:09:30,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 19:09:30,294 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-06 19:09:30,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:09:30,294 INFO L85 PathProgramCache]: Analyzing trace with hash 60509, now seen corresponding path program 1 times [2025-02-06 19:09:30,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:09:30,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585142738] [2025-02-06 19:09:30,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:09:30,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:09:30,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 19:09:30,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:09:30,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:09:30,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:09:30,308 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:09:30,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 19:09:30,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:09:30,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:09:30,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:09:30,316 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:09:30,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:09:30,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 19:09:30,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 19:09:30,372 INFO L87 Difference]: Start difference. First operand 16 states and 24 transitions. cyclomatic complexity: 13 Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:09:30,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:09:30,378 INFO L93 Difference]: Finished difference Result 16 states and 23 transitions. [2025-02-06 19:09:30,378 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 23 transitions. [2025-02-06 19:09:30,379 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 10 [2025-02-06 19:09:30,379 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 23 transitions. [2025-02-06 19:09:30,379 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2025-02-06 19:09:30,379 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2025-02-06 19:09:30,379 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 23 transitions. [2025-02-06 19:09:30,379 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 19:09:30,379 INFO L218 hiAutomatonCegarLoop]: Abstraction has 16 states and 23 transitions. [2025-02-06 19:09:30,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 23 transitions. [2025-02-06 19:09:30,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2025-02-06 19:09:30,380 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-06 19:09:30,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 23 transitions. [2025-02-06 19:09:30,380 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16 states and 23 transitions. [2025-02-06 19:09:30,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 19:09:30,381 INFO L432 stractBuchiCegarLoop]: Abstraction has 16 states and 23 transitions. [2025-02-06 19:09:30,381 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-02-06 19:09:30,381 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 23 transitions. [2025-02-06 19:09:30,382 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 10 [2025-02-06 19:09:30,382 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:09:30,382 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:09:30,382 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-02-06 19:09:30,382 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-06 19:09:30,382 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-06 19:09:30,382 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-06 19:09:30,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:09:30,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1999935, now seen corresponding path program 1 times [2025-02-06 19:09:30,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:09:30,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138571791] [2025-02-06 19:09:30,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:09:30,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:09:30,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 19:09:30,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 19:09:30,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:09:30,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:09:30,428 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2025-02-06 19:09:30,442 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-06 19:09:30,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:09:30,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138571791] [2025-02-06 19:09:30,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138571791] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:09:30,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [997208038] [2025-02-06 19:09:30,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:09:30,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:09:30,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:09:30,446 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 19:09:30,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-02-06 19:09:30,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 19:09:30,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 19:09:30,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:09:30,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:09:30,485 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 19:09:30,485 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:09:30,495 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-06 19:09:30,496 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:09:30,512 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-06 19:09:30,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [997208038] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:09:30,514 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:09:30,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-02-06 19:09:30,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612078508] [2025-02-06 19:09:30,515 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:09:30,515 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-06 19:09:30,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:09:30,515 INFO L85 PathProgramCache]: Analyzing trace with hash 60509, now seen corresponding path program 2 times [2025-02-06 19:09:30,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:09:30,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451412754] [2025-02-06 19:09:30,515 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:09:30,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:09:30,518 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-02-06 19:09:30,524 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:09:30,524 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 19:09:30,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:09:30,525 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:09:30,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 19:09:30,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:09:30,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:09:30,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:09:30,532 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:09:30,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:09:30,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 19:09:30,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-06 19:09:30,578 INFO L87 Difference]: Start difference. First operand 16 states and 23 transitions. cyclomatic complexity: 12 Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:09:30,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:09:30,591 INFO L93 Difference]: Finished difference Result 19 states and 26 transitions. [2025-02-06 19:09:30,591 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 26 transitions. [2025-02-06 19:09:30,592 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 10 [2025-02-06 19:09:30,593 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 19 states and 26 transitions. [2025-02-06 19:09:30,594 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2025-02-06 19:09:30,594 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2025-02-06 19:09:30,594 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 26 transitions. [2025-02-06 19:09:30,594 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 19:09:30,594 INFO L218 hiAutomatonCegarLoop]: Abstraction has 19 states and 26 transitions. [2025-02-06 19:09:30,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 26 transitions. [2025-02-06 19:09:30,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2025-02-06 19:09:30,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:09:30,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 26 transitions. [2025-02-06 19:09:30,598 INFO L240 hiAutomatonCegarLoop]: Abstraction has 19 states and 26 transitions. [2025-02-06 19:09:30,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 19:09:30,599 INFO L432 stractBuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2025-02-06 19:09:30,599 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-02-06 19:09:30,599 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 26 transitions. [2025-02-06 19:09:30,599 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 10 [2025-02-06 19:09:30,599 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:09:30,599 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:09:30,599 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 1, 1, 1] [2025-02-06 19:09:30,599 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-06 19:09:30,599 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-06 19:09:30,599 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-06 19:09:30,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:09:30,600 INFO L85 PathProgramCache]: Analyzing trace with hash -549416000, now seen corresponding path program 2 times [2025-02-06 19:09:30,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:09:30,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127836626] [2025-02-06 19:09:30,600 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:09:30,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:09:30,608 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 7 statements into 2 equivalence classes. [2025-02-06 19:09:30,619 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 19:09:30,620 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 19:09:30,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:09:30,715 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-06 19:09:30,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:09:30,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127836626] [2025-02-06 19:09:30,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127836626] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:09:30,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [400366866] [2025-02-06 19:09:30,715 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:09:30,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:09:30,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:09:30,722 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 19:09:30,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-02-06 19:09:30,757 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 7 statements into 2 equivalence classes. [2025-02-06 19:09:30,770 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 19:09:30,770 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 19:09:30,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:09:30,771 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 19:09:30,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:09:30,785 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-06 19:09:30,786 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:09:30,829 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-06 19:09:30,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [400366866] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:09:30,829 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:09:30,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-02-06 19:09:30,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562070337] [2025-02-06 19:09:30,830 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:09:30,830 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-06 19:09:30,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:09:30,831 INFO L85 PathProgramCache]: Analyzing trace with hash 60509, now seen corresponding path program 3 times [2025-02-06 19:09:30,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:09:30,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904095315] [2025-02-06 19:09:30,831 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 19:09:30,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:09:30,834 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 3 statements into 1 equivalence classes. [2025-02-06 19:09:30,835 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:09:30,835 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-06 19:09:30,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:09:30,835 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:09:30,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 19:09:30,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:09:30,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:09:30,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:09:30,838 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:09:30,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:09:30,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 19:09:30,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-02-06 19:09:30,878 INFO L87 Difference]: Start difference. First operand 19 states and 26 transitions. cyclomatic complexity: 12 Second operand has 13 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:09:30,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:09:30,893 INFO L93 Difference]: Finished difference Result 25 states and 32 transitions. [2025-02-06 19:09:30,894 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 32 transitions. [2025-02-06 19:09:30,894 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 10 [2025-02-06 19:09:30,894 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 32 transitions. [2025-02-06 19:09:30,895 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2025-02-06 19:09:30,895 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2025-02-06 19:09:30,895 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 32 transitions. [2025-02-06 19:09:30,895 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 19:09:30,895 INFO L218 hiAutomatonCegarLoop]: Abstraction has 25 states and 32 transitions. [2025-02-06 19:09:30,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 32 transitions. [2025-02-06 19:09:30,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2025-02-06 19:09:30,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.28) internal successors, (32), 24 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:09:30,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2025-02-06 19:09:30,896 INFO L240 hiAutomatonCegarLoop]: Abstraction has 25 states and 32 transitions. [2025-02-06 19:09:30,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 19:09:30,897 INFO L432 stractBuchiCegarLoop]: Abstraction has 25 states and 32 transitions. [2025-02-06 19:09:30,897 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-02-06 19:09:30,897 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 32 transitions. [2025-02-06 19:09:30,897 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 10 [2025-02-06 19:09:30,897 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:09:30,898 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:09:30,898 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 1, 1, 1] [2025-02-06 19:09:30,898 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-06 19:09:30,898 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-06 19:09:30,898 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-06 19:09:30,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:09:30,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1089899680, now seen corresponding path program 3 times [2025-02-06 19:09:30,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:09:30,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464826046] [2025-02-06 19:09:30,898 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 19:09:30,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:09:30,905 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 13 statements into 6 equivalence classes. [2025-02-06 19:09:30,929 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 19:09:30,929 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-02-06 19:09:30,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:09:30,929 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:09:30,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 19:09:30,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 19:09:30,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:09:30,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:09:30,954 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:09:30,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:09:30,958 INFO L85 PathProgramCache]: Analyzing trace with hash 60509, now seen corresponding path program 4 times [2025-02-06 19:09:30,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:09:30,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045236740] [2025-02-06 19:09:30,961 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 19:09:30,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:09:30,964 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 3 statements into 2 equivalence classes. [2025-02-06 19:09:30,966 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:09:30,966 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 19:09:30,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:09:30,966 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:09:30,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 19:09:30,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:09:30,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:09:30,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:09:30,969 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:09:30,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:09:30,969 INFO L85 PathProgramCache]: Analyzing trace with hash 751421598, now seen corresponding path program 1 times [2025-02-06 19:09:30,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:09:30,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388420839] [2025-02-06 19:09:30,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:09:30,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:09:30,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 19:09:30,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 19:09:30,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:09:30,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:09:30,995 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:09:30,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 19:09:31,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 19:09:31,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:09:31,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:09:31,028 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:09:33,869 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:09:33,870 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:09:33,870 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:09:33,870 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:09:33,870 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-06 19:09:33,870 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:09:33,870 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:09:33,870 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:09:33,870 INFO L132 ssoRankerPreferences]: Filename of dumped script: max10-1.i_Iteration5_Lasso [2025-02-06 19:09:33,870 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:09:33,870 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:09:33,872 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:33,875 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:33,877 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:33,878 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:33,898 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:33,901 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:33,902 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:33,904 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:33,906 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:33,908 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:33,917 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:33,921 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:34,210 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:34,212 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:34,214 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:34,215 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:34,217 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:34,218 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:34,220 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:34,221 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:34,223 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:34,226 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:34,227 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:34,228 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:34,230 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:34,429 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:09:34,429 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-06 19:09:34,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:09:34,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:09:34,433 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:09:34,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-02-06 19:09:34,434 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:09:34,444 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:09:34,444 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:09:34,444 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:09:34,444 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:09:34,444 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:09:34,445 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:09:34,445 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:09:34,446 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:09:34,452 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2025-02-06 19:09:34,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:09:34,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:09:34,454 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:09:34,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-02-06 19:09:34,456 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:09:34,465 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:09:34,465 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:09:34,466 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:09:34,466 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:09:34,466 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:09:34,466 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:09:34,466 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:09:34,467 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:09:34,472 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2025-02-06 19:09:34,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:09:34,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:09:34,474 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:09:34,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-02-06 19:09:34,476 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:09:34,485 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:09:34,486 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:09:34,486 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:09:34,486 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:09:34,486 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:09:34,486 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:09:34,486 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:09:34,487 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:09:34,492 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2025-02-06 19:09:34,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:09:34,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:09:34,494 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:09:34,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-02-06 19:09:34,496 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:09:34,506 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:09:34,506 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:09:34,506 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:09:34,506 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:09:34,506 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:09:34,507 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:09:34,507 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:09:34,508 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:09:34,513 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2025-02-06 19:09:34,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:09:34,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:09:34,516 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:09:34,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-02-06 19:09:34,517 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:09:34,527 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:09:34,527 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:09:34,527 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:09:34,527 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:09:34,527 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:09:34,527 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:09:34,527 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:09:34,528 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:09:34,533 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2025-02-06 19:09:34,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:09:34,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:09:34,536 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:09:34,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2025-02-06 19:09:34,537 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:09:34,546 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:09:34,547 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:09:34,547 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:09:34,547 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:09:34,547 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:09:34,547 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:09:34,547 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:09:34,548 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:09:34,553 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2025-02-06 19:09:34,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:09:34,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:09:34,556 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:09:34,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2025-02-06 19:09:34,557 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:09:34,567 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:09:34,567 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:09:34,567 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:09:34,567 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:09:34,567 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:09:34,567 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:09:34,567 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:09:34,568 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:09:34,573 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-06 19:09:34,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:09:34,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:09:34,575 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:09:34,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2025-02-06 19:09:34,578 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:09:34,587 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:09:34,587 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:09:34,587 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:09:34,587 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:09:34,592 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:09:34,592 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:09:34,595 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:09:34,603 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2025-02-06 19:09:34,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:09:34,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:09:34,605 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:09:34,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2025-02-06 19:09:34,625 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:09:34,635 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:09:34,635 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:09:34,635 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:09:34,635 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:09:34,635 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:09:34,635 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:09:34,635 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:09:34,636 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:09:34,642 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2025-02-06 19:09:34,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:09:34,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:09:34,644 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:09:34,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2025-02-06 19:09:34,647 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:09:34,659 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:09:34,659 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:09:34,659 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:09:34,659 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:09:34,660 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:09:34,660 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:09:34,662 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:09:34,668 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2025-02-06 19:09:34,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:09:34,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:09:34,670 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:09:34,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2025-02-06 19:09:34,672 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:09:34,681 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:09:34,681 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:09:34,681 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:09:34,681 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:09:34,683 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:09:34,683 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:09:34,686 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:09:34,691 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-06 19:09:34,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:09:34,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:09:34,692 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:09:34,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2025-02-06 19:09:34,695 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:09:34,704 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:09:34,704 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:09:34,704 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:09:34,704 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:09:34,704 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:09:34,705 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:09:34,705 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:09:34,706 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:09:34,712 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2025-02-06 19:09:34,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:09:34,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:09:34,714 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:09:34,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2025-02-06 19:09:34,719 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:09:34,729 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:09:34,729 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:09:34,729 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:09:34,729 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:09:34,730 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:09:34,731 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:09:34,733 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:09:34,738 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2025-02-06 19:09:34,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:09:34,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:09:34,742 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:09:34,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2025-02-06 19:09:34,744 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:09:34,753 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:09:34,753 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:09:34,753 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:09:34,753 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:09:34,755 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:09:34,755 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:09:34,757 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:09:34,762 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2025-02-06 19:09:34,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:09:34,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:09:34,769 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:09:34,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2025-02-06 19:09:34,770 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:09:34,780 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:09:34,780 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:09:34,780 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:09:34,780 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:09:34,785 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:09:34,785 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:09:34,791 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-06 19:09:34,810 INFO L443 ModelExtractionUtils]: Simplification made 18 calls to the SMT solver. [2025-02-06 19:09:34,810 INFO L444 ModelExtractionUtils]: 0 out of 16 variables were initially zero. Simplification set additionally 13 variables to zero. [2025-02-06 19:09:34,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:09:34,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:09:34,814 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:09:34,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2025-02-06 19:09:34,816 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-06 19:09:34,827 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-02-06 19:09:34,827 INFO L474 LassoAnalysis]: Proved termination. [2025-02-06 19:09:34,827 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#x~0#1.base)_2, ULTIMATE.start_max_~i~0#1) = 19*v_rep(select #length ULTIMATE.start_main_~#x~0#1.base)_2 - 8*ULTIMATE.start_max_~i~0#1 Supporting invariants [] [2025-02-06 19:09:34,833 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2025-02-06 19:09:34,853 INFO L156 tatePredicateManager]: 7 out of 8 supporting invariants were superfluous and have been removed [2025-02-06 19:09:34,854 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-02-06 19:09:34,854 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-02-06 19:09:34,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:09:34,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 19:09:34,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 19:09:34,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:09:34,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:09:34,896 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 19:09:34,896 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:09:34,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 19:09:34,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:09:34,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:09:34,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:09:34,919 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 19:09:34,919 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:09:34,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:09:34,946 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-02-06 19:09:34,946 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 32 transitions. cyclomatic complexity: 12 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:09:34,979 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 32 transitions. cyclomatic complexity: 12. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 28 states and 38 transitions. Complement of second has 5 states. [2025-02-06 19:09:34,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-02-06 19:09:34,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:09:34,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2025-02-06 19:09:34,980 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 13 letters. Loop has 3 letters. [2025-02-06 19:09:34,981 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:09:34,981 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 16 letters. Loop has 3 letters. [2025-02-06 19:09:34,981 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:09:34,981 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 13 letters. Loop has 6 letters. [2025-02-06 19:09:34,981 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:09:34,981 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 38 transitions. [2025-02-06 19:09:34,981 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2025-02-06 19:09:34,982 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 26 states and 34 transitions. [2025-02-06 19:09:34,982 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2025-02-06 19:09:34,982 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2025-02-06 19:09:34,982 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 34 transitions. [2025-02-06 19:09:34,982 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 19:09:34,982 INFO L218 hiAutomatonCegarLoop]: Abstraction has 26 states and 34 transitions. [2025-02-06 19:09:34,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 34 transitions. [2025-02-06 19:09:34,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2025-02-06 19:09:34,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 25 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:09:34,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2025-02-06 19:09:34,983 INFO L240 hiAutomatonCegarLoop]: Abstraction has 26 states and 34 transitions. [2025-02-06 19:09:34,983 INFO L432 stractBuchiCegarLoop]: Abstraction has 26 states and 34 transitions. [2025-02-06 19:09:34,983 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-02-06 19:09:34,983 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 34 transitions. [2025-02-06 19:09:34,983 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2025-02-06 19:09:34,983 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:09:34,983 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:09:34,984 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 1, 1, 1, 1, 1] [2025-02-06 19:09:34,984 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-06 19:09:34,984 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-06 19:09:34,984 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-06 19:09:34,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:09:34,985 INFO L85 PathProgramCache]: Analyzing trace with hash 578428606, now seen corresponding path program 1 times [2025-02-06 19:09:34,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:09:34,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430595797] [2025-02-06 19:09:34,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:09:34,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:09:34,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 19:09:35,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 19:09:35,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:09:35,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:09:35,040 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-06 19:09:35,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:09:35,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430595797] [2025-02-06 19:09:35,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430595797] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 19:09:35,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 19:09:35,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 19:09:35,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593988532] [2025-02-06 19:09:35,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 19:09:35,041 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-06 19:09:35,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:09:35,041 INFO L85 PathProgramCache]: Analyzing trace with hash 53558, now seen corresponding path program 1 times [2025-02-06 19:09:35,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:09:35,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530145249] [2025-02-06 19:09:35,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:09:35,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:09:35,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 19:09:35,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:09:35,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:09:35,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:09:35,045 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:09:35,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 19:09:35,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:09:35,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:09:35,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:09:35,047 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:09:35,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:09:35,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 19:09:35,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 19:09:35,083 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. cyclomatic complexity: 13 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-06 19:09:35,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:09:35,105 INFO L93 Difference]: Finished difference Result 34 states and 44 transitions. [2025-02-06 19:09:35,105 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 44 transitions. [2025-02-06 19:09:35,106 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2025-02-06 19:09:35,106 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 34 states and 44 transitions. [2025-02-06 19:09:35,106 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2025-02-06 19:09:35,106 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2025-02-06 19:09:35,106 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 44 transitions. [2025-02-06 19:09:35,106 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 19:09:35,106 INFO L218 hiAutomatonCegarLoop]: Abstraction has 34 states and 44 transitions. [2025-02-06 19:09:35,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 44 transitions. [2025-02-06 19:09:35,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 27. [2025-02-06 19:09:35,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 26 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:09:35,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2025-02-06 19:09:35,108 INFO L240 hiAutomatonCegarLoop]: Abstraction has 27 states and 34 transitions. [2025-02-06 19:09:35,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 19:09:35,108 INFO L432 stractBuchiCegarLoop]: Abstraction has 27 states and 34 transitions. [2025-02-06 19:09:35,108 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-02-06 19:09:35,108 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 34 transitions. [2025-02-06 19:09:35,109 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2025-02-06 19:09:35,109 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:09:35,109 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:09:35,109 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:09:35,109 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-06 19:09:35,109 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-06 19:09:35,109 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-06 19:09:35,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:09:35,110 INFO L85 PathProgramCache]: Analyzing trace with hash 232229533, now seen corresponding path program 1 times [2025-02-06 19:09:35,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:09:35,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775956467] [2025-02-06 19:09:35,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:09:35,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:09:35,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-06 19:09:35,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 19:09:35,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:09:35,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:09:35,170 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-06 19:09:35,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:09:35,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775956467] [2025-02-06 19:09:35,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775956467] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:09:35,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2132118562] [2025-02-06 19:09:35,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:09:35,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:09:35,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:09:35,173 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 19:09:35,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2025-02-06 19:09:35,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-06 19:09:35,245 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2025-02-06 19:09:35,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 19:09:35,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:09:35,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:09:35,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 19:09:35,259 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:09:35,268 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-06 19:09:35,268 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:09:35,280 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-06 19:09:35,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2132118562] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:09:35,280 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:09:35,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-06 19:09:35,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022442310] [2025-02-06 19:09:35,280 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:09:35,280 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-06 19:09:35,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:09:35,281 INFO L85 PathProgramCache]: Analyzing trace with hash 51608, now seen corresponding path program 2 times [2025-02-06 19:09:35,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:09:35,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407654500] [2025-02-06 19:09:35,281 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:09:35,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:09:35,283 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-02-06 19:09:35,284 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:09:35,284 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 19:09:35,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:09:35,284 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:09:35,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 19:09:35,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:09:35,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:09:35,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:09:35,287 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:09:35,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:09:35,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 19:09:35,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-06 19:09:35,340 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. cyclomatic complexity: 12 Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:09:35,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:09:35,435 INFO L93 Difference]: Finished difference Result 55 states and 71 transitions. [2025-02-06 19:09:35,435 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 71 transitions. [2025-02-06 19:09:35,436 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2025-02-06 19:09:35,439 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 55 states and 71 transitions. [2025-02-06 19:09:35,439 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2025-02-06 19:09:35,439 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2025-02-06 19:09:35,439 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 71 transitions. [2025-02-06 19:09:35,439 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 19:09:35,439 INFO L218 hiAutomatonCegarLoop]: Abstraction has 55 states and 71 transitions. [2025-02-06 19:09:35,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 71 transitions. [2025-02-06 19:09:35,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 45. [2025-02-06 19:09:35,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 45 states have (on average 1.288888888888889) internal successors, (58), 44 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:09:35,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 58 transitions. [2025-02-06 19:09:35,444 INFO L240 hiAutomatonCegarLoop]: Abstraction has 45 states and 58 transitions. [2025-02-06 19:09:35,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 19:09:35,451 INFO L432 stractBuchiCegarLoop]: Abstraction has 45 states and 58 transitions. [2025-02-06 19:09:35,451 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-02-06 19:09:35,451 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 58 transitions. [2025-02-06 19:09:35,452 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2025-02-06 19:09:35,452 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:09:35,452 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:09:35,452 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1] [2025-02-06 19:09:35,452 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-06 19:09:35,453 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-06 19:09:35,455 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-06 19:09:35,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:09:35,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1669580064, now seen corresponding path program 1 times [2025-02-06 19:09:35,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:09:35,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276228882] [2025-02-06 19:09:35,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:09:35,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:09:35,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-06 19:09:35,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-06 19:09:35,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:09:35,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:09:35,597 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-06 19:09:35,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:09:35,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276228882] [2025-02-06 19:09:35,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276228882] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:09:35,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1682477883] [2025-02-06 19:09:35,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:09:35,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:09:35,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:09:35,601 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 19:09:35,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2025-02-06 19:09:35,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-06 19:09:35,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-06 19:09:35,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:09:35,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:09:35,683 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 19:09:35,685 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:09:35,713 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-06 19:09:35,713 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:09:35,772 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-06 19:09:35,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1682477883] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:09:35,773 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:09:35,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-02-06 19:09:35,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697537869] [2025-02-06 19:09:35,773 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:09:35,773 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-06 19:09:35,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:09:35,774 INFO L85 PathProgramCache]: Analyzing trace with hash 51608, now seen corresponding path program 3 times [2025-02-06 19:09:35,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:09:35,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352338820] [2025-02-06 19:09:35,774 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 19:09:35,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:09:35,776 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 3 statements into 1 equivalence classes. [2025-02-06 19:09:35,778 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:09:35,778 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-06 19:09:35,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:09:35,778 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:09:35,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 19:09:35,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:09:35,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:09:35,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:09:35,781 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:09:35,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:09:35,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 19:09:35,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-02-06 19:09:35,841 INFO L87 Difference]: Start difference. First operand 45 states and 58 transitions. cyclomatic complexity: 18 Second operand has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:09:35,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:09:35,978 INFO L93 Difference]: Finished difference Result 109 states and 143 transitions. [2025-02-06 19:09:35,978 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 109 states and 143 transitions. [2025-02-06 19:09:35,979 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2025-02-06 19:09:35,980 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 109 states to 109 states and 143 transitions. [2025-02-06 19:09:35,980 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 69 [2025-02-06 19:09:35,980 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 69 [2025-02-06 19:09:35,980 INFO L73 IsDeterministic]: Start isDeterministic. Operand 109 states and 143 transitions. [2025-02-06 19:09:35,980 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 19:09:35,981 INFO L218 hiAutomatonCegarLoop]: Abstraction has 109 states and 143 transitions. [2025-02-06 19:09:35,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states and 143 transitions. [2025-02-06 19:09:35,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 81. [2025-02-06 19:09:35,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 81 states have (on average 1.308641975308642) internal successors, (106), 80 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:09:35,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 106 transitions. [2025-02-06 19:09:35,984 INFO L240 hiAutomatonCegarLoop]: Abstraction has 81 states and 106 transitions. [2025-02-06 19:09:35,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 19:09:35,984 INFO L432 stractBuchiCegarLoop]: Abstraction has 81 states and 106 transitions. [2025-02-06 19:09:35,984 INFO L338 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-02-06 19:09:35,985 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 81 states and 106 transitions. [2025-02-06 19:09:35,985 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2025-02-06 19:09:35,985 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:09:35,985 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:09:35,986 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 10, 10, 10, 9, 9, 1, 1, 1, 1, 1] [2025-02-06 19:09:35,986 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-06 19:09:35,987 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-06 19:09:35,987 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-06 19:09:35,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:09:35,987 INFO L85 PathProgramCache]: Analyzing trace with hash 910390016, now seen corresponding path program 2 times [2025-02-06 19:09:35,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:09:35,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342820852] [2025-02-06 19:09:35,988 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:09:35,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:09:36,000 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 73 statements into 2 equivalence classes. [2025-02-06 19:09:36,059 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 73 of 73 statements. [2025-02-06 19:09:36,059 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 19:09:36,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:09:36,059 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:09:36,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-02-06 19:09:36,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-02-06 19:09:36,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:09:36,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:09:36,113 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:09:36,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:09:36,114 INFO L85 PathProgramCache]: Analyzing trace with hash 51608, now seen corresponding path program 4 times [2025-02-06 19:09:36,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:09:36,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338135425] [2025-02-06 19:09:36,114 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 19:09:36,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:09:36,117 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 3 statements into 2 equivalence classes. [2025-02-06 19:09:36,118 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:09:36,118 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 19:09:36,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:09:36,118 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:09:36,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 19:09:36,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:09:36,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:09:36,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:09:36,121 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:09:36,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:09:36,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1289485767, now seen corresponding path program 1 times [2025-02-06 19:09:36,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:09:36,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133197711] [2025-02-06 19:09:36,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:09:36,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:09:36,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-06 19:09:36,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-06 19:09:36,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:09:36,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:09:36,395 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-06 19:09:36,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:09:36,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133197711] [2025-02-06 19:09:36,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133197711] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:09:36,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1508287821] [2025-02-06 19:09:36,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:09:36,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:09:36,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:09:36,398 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 19:09:36,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2025-02-06 19:09:36,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-06 19:09:36,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-06 19:09:36,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:09:36,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:09:36,494 INFO L256 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-06 19:09:36,496 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:09:36,540 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-06 19:09:36,541 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 19:09:36,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1508287821] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 19:09:36,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 19:09:36,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [12] total 13 [2025-02-06 19:09:36,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208742620] [2025-02-06 19:09:36,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 19:09:36,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:09:36,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 19:09:36,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2025-02-06 19:09:36,595 INFO L87 Difference]: Start difference. First operand 81 states and 106 transitions. cyclomatic complexity: 30 Second operand has 13 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 13 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:09:36,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:09:36,785 INFO L93 Difference]: Finished difference Result 109 states and 140 transitions. [2025-02-06 19:09:36,785 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 109 states and 140 transitions. [2025-02-06 19:09:36,786 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2025-02-06 19:09:36,786 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 109 states to 78 states and 99 transitions. [2025-02-06 19:09:36,787 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2025-02-06 19:09:36,787 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2025-02-06 19:09:36,787 INFO L73 IsDeterministic]: Start isDeterministic. Operand 78 states and 99 transitions. [2025-02-06 19:09:36,787 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 19:09:36,787 INFO L218 hiAutomatonCegarLoop]: Abstraction has 78 states and 99 transitions. [2025-02-06 19:09:36,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states and 99 transitions. [2025-02-06 19:09:36,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2025-02-06 19:09:36,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 78 states have (on average 1.2692307692307692) internal successors, (99), 77 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:09:36,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 99 transitions. [2025-02-06 19:09:36,790 INFO L240 hiAutomatonCegarLoop]: Abstraction has 78 states and 99 transitions. [2025-02-06 19:09:36,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 19:09:36,790 INFO L432 stractBuchiCegarLoop]: Abstraction has 78 states and 99 transitions. [2025-02-06 19:09:36,790 INFO L338 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-02-06 19:09:36,790 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 78 states and 99 transitions. [2025-02-06 19:09:36,791 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2025-02-06 19:09:36,791 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:09:36,791 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:09:36,792 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:09:36,792 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-02-06 19:09:36,793 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-06 19:09:36,793 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-06 19:09:36,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:09:36,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1319323428, now seen corresponding path program 1 times [2025-02-06 19:09:36,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:09:36,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615250525] [2025-02-06 19:09:36,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:09:36,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:09:36,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-06 19:09:36,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-06 19:09:36,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:09:36,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:09:36,847 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:09:36,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-06 19:09:36,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-06 19:09:36,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:09:36,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:09:36,893 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:09:36,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:09:36,893 INFO L85 PathProgramCache]: Analyzing trace with hash 48, now seen corresponding path program 1 times [2025-02-06 19:09:36,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:09:36,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32768054] [2025-02-06 19:09:36,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:09:36,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:09:36,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-06 19:09:36,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-06 19:09:36,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:09:36,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:09:36,897 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:09:36,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-06 19:09:36,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-06 19:09:36,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:09:36,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:09:36,899 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:09:36,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:09:36,899 INFO L85 PathProgramCache]: Analyzing trace with hash 2050646709, now seen corresponding path program 1 times [2025-02-06 19:09:36,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:09:36,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836901958] [2025-02-06 19:09:36,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:09:36,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:09:36,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-02-06 19:09:36,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-02-06 19:09:36,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:09:36,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:09:36,985 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:09:36,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-02-06 19:09:37,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-02-06 19:09:37,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:09:37,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:09:37,032 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:10:03,408 WARN L286 SmtUtils]: Spent 26.33s on a formula simplification. DAG size of input: 615 DAG size of output: 468 (called from [L 276] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2025-02-06 19:10:05,121 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:10:05,121 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:10:05,121 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:10:05,121 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:10:05,121 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-06 19:10:05,121 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:05,121 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:10:05,121 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:10:05,121 INFO L132 ssoRankerPreferences]: Filename of dumped script: max10-1.i_Iteration10_Lasso [2025-02-06 19:10:05,121 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:10:05,122 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:10:05,123 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:05,126 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:05,625 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:05,627 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:05,629 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:05,631 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:05,632 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:05,634 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:05,636 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:05,637 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:05,639 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:05,641 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:05,642 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:05,645 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:05,647 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:05,648 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:05,650 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:05,651 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:05,653 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:05,663 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:05,665 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:05,666 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:05,668 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:05,669 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:05,671 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:05,673 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:05,675 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:05,676 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:10:05,890 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:10:05,891 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-06 19:10:05,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:05,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:05,897 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:10:05,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2025-02-06 19:10:05,900 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:10:05,909 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:05,909 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:10:05,910 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:05,910 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:05,910 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:05,911 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:10:05,911 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:10:05,913 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:05,919 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2025-02-06 19:10:05,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:05,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:05,921 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:10:05,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2025-02-06 19:10:05,927 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:10:05,943 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:05,943 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:05,943 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:05,943 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:05,944 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:10:05,944 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:10:05,946 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:05,951 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2025-02-06 19:10:05,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:05,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:05,954 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:10:05,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2025-02-06 19:10:05,957 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:10:05,967 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:05,967 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:05,967 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:05,967 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:05,969 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:10:05,969 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:10:05,971 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:05,979 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2025-02-06 19:10:05,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:05,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:05,981 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:10:05,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2025-02-06 19:10:05,983 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:10:05,993 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:05,993 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:05,993 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:05,993 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:05,995 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:10:05,995 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:10:05,997 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:06,004 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2025-02-06 19:10:06,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:06,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:06,009 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:10:06,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2025-02-06 19:10:06,011 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:10:06,021 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:06,021 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:06,021 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:06,021 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:06,022 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:10:06,022 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:10:06,025 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:06,030 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2025-02-06 19:10:06,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:06,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:06,034 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:10:06,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2025-02-06 19:10:06,036 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:10:06,046 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:06,046 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:06,046 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:06,046 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:06,047 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:10:06,047 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:10:06,050 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:10:06,056 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2025-02-06 19:10:06,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:06,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:06,058 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:10:06,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2025-02-06 19:10:06,060 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:10:06,070 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:10:06,070 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:10:06,070 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:10:06,070 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:10:06,072 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:10:06,073 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:10:06,078 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-06 19:10:06,088 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-02-06 19:10:06,089 INFO L444 ModelExtractionUtils]: 1 out of 13 variables were initially zero. Simplification set additionally 9 variables to zero. [2025-02-06 19:10:06,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:10:06,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:10:06,091 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:10:06,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2025-02-06 19:10:06,093 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-06 19:10:06,104 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-02-06 19:10:06,104 INFO L474 LassoAnalysis]: Proved termination. [2025-02-06 19:10:06,104 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-06 19:10:06,110 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2025-02-06 19:10:06,118 INFO L156 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2025-02-06 19:10:06,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:10:06,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-06 19:10:06,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-06 19:10:06,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:06,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:10:06,204 INFO L256 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 19:10:06,206 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:10:06,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-06 19:10:06,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-06 19:10:06,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:10:06,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:10:06,289 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 19:10:06,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:10:06,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:10:06,290 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-02-06 19:10:06,291 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 78 states and 99 transitions. cyclomatic complexity: 23 Second operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:10:06,296 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 78 states and 99 transitions. cyclomatic complexity: 23. Second operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 79 states and 100 transitions. Complement of second has 2 states. [2025-02-06 19:10:06,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2025-02-06 19:10:06,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:10:06,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 17 transitions. [2025-02-06 19:10:06,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 17 transitions. Stem has 77 letters. Loop has 1 letters. [2025-02-06 19:10:06,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:10:06,300 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 17 transitions. Stem has 78 letters. Loop has 1 letters. [2025-02-06 19:10:06,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:10:06,300 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 17 transitions. Stem has 77 letters. Loop has 2 letters. [2025-02-06 19:10:06,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:10:06,300 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 79 states and 100 transitions. [2025-02-06 19:10:06,301 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-06 19:10:06,301 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 79 states to 0 states and 0 transitions. [2025-02-06 19:10:06,301 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-02-06 19:10:06,301 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-02-06 19:10:06,301 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-02-06 19:10:06,301 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 19:10:06,301 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-06 19:10:06,301 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-06 19:10:06,301 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-06 19:10:06,301 INFO L338 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2025-02-06 19:10:06,301 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-02-06 19:10:06,301 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-06 19:10:06,301 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-02-06 19:10:06,309 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 06.02 07:10:06 BoogieIcfgContainer [2025-02-06 19:10:06,311 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-02-06 19:10:06,312 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 19:10:06,312 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 19:10:06,312 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 19:10:06,313 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 07:09:28" (3/4) ... [2025-02-06 19:10:06,314 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 19:10:06,315 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 19:10:06,316 INFO L158 Benchmark]: Toolchain (without parser) took 38421.16ms. Allocated memory was 142.6MB in the beginning and 729.8MB in the end (delta: 587.2MB). Free memory was 107.3MB in the beginning and 589.7MB in the end (delta: -482.3MB). Peak memory consumption was 102.9MB. Max. memory is 16.1GB. [2025-02-06 19:10:06,316 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 126.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 19:10:06,316 INFO L158 Benchmark]: CACSL2BoogieTranslator took 182.89ms. Allocated memory is still 142.6MB. Free memory was 106.3MB in the beginning and 95.6MB in the end (delta: 10.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 19:10:06,316 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.26ms. Allocated memory is still 142.6MB. Free memory was 95.6MB in the beginning and 94.6MB in the end (delta: 988.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 19:10:06,317 INFO L158 Benchmark]: Boogie Preprocessor took 30.67ms. Allocated memory is still 142.6MB. Free memory was 94.6MB in the beginning and 92.3MB in the end (delta: 2.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 19:10:06,317 INFO L158 Benchmark]: IcfgBuilder took 350.89ms. Allocated memory is still 142.6MB. Free memory was 92.3MB in the beginning and 76.7MB in the end (delta: 15.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 19:10:06,317 INFO L158 Benchmark]: BuchiAutomizer took 37825.35ms. Allocated memory was 142.6MB in the beginning and 729.8MB in the end (delta: 587.2MB). Free memory was 76.7MB in the beginning and 589.8MB in the end (delta: -513.1MB). Peak memory consumption was 77.8MB. Max. memory is 16.1GB. [2025-02-06 19:10:06,317 INFO L158 Benchmark]: Witness Printer took 2.96ms. Allocated memory is still 729.8MB. Free memory was 589.8MB in the beginning and 589.7MB in the end (delta: 120.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 19:10:06,318 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.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 182.89ms. Allocated memory is still 142.6MB. Free memory was 106.3MB in the beginning and 95.6MB in the end (delta: 10.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.26ms. Allocated memory is still 142.6MB. Free memory was 95.6MB in the beginning and 94.6MB in the end (delta: 988.6kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 30.67ms. Allocated memory is still 142.6MB. Free memory was 94.6MB in the beginning and 92.3MB in the end (delta: 2.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 350.89ms. Allocated memory is still 142.6MB. Free memory was 92.3MB in the beginning and 76.7MB in the end (delta: 15.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 37825.35ms. Allocated memory was 142.6MB in the beginning and 729.8MB in the end (delta: 587.2MB). Free memory was 76.7MB in the beginning and 589.8MB in the end (delta: -513.1MB). Peak memory consumption was 77.8MB. Max. memory is 16.1GB. * Witness Printer took 2.96ms. Allocated memory is still 729.8MB. Free memory was 589.8MB in the beginning and 589.7MB in the end (delta: 120.0kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #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 null 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 37.7s and 11 iterations. TraceHistogramMax:10. Analysis of lassos took 36.7s. 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, 46 StatesRemovedByMinimization, 4 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, 383 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 381 mSDsluCounter, 377 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 214 mSDsCounter, 143 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 501 IncrementalHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 143 mSolverCounterUnsat, 163 mSDtfsCounter, 501 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU6 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital266 mio100 ax100 hnf100 lsp92 ukn51 mio100 lsp35 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-06 19:10:06,329 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2025-02-06 19:10:06,535 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Forceful destruction successful, exit code 0 [2025-02-06 19:10:06,735 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Ended with exit code 0 [2025-02-06 19:10:06,935 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2025-02-06 19:10:07,139 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2025-02-06 19:10:07,343 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2025-02-06 19:10:07,547 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