./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-industry-pattern/array_monotonic.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/array-industry-pattern/array_monotonic.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 5e947ce3cb6be538c3110154d89a790a98803ec545aa8464d99fb543118ea442 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 07:10:33,382 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 07:10:33,449 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2025-01-10 07:10:33,456 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 07:10:33,456 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 07:10:33,469 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 07:10:33,469 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 07:10:33,469 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 07:10:33,470 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 07:10:33,470 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 07:10:33,470 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 07:10:33,470 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 07:10:33,470 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 07:10:33,470 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-01-10 07:10:33,470 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-01-10 07:10:33,470 INFO L153 SettingsManager]: * Use old map elimination=false [2025-01-10 07:10:33,471 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-01-10 07:10:33,471 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-01-10 07:10:33,471 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-01-10 07:10:33,471 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 07:10:33,471 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-01-10 07:10:33,471 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 07:10:33,471 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 07:10:33,471 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 07:10:33,471 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 07:10:33,471 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-01-10 07:10:33,471 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-01-10 07:10:33,472 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-01-10 07:10:33,472 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 07:10:33,472 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 07:10:33,472 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 07:10:33,472 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-01-10 07:10:33,472 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 07:10:33,472 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 07:10:33,472 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 07:10:33,472 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 07:10:33,472 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 07:10:33,473 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 07:10:33,473 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-01-10 07:10:33,473 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 -> 5e947ce3cb6be538c3110154d89a790a98803ec545aa8464d99fb543118ea442 [2025-01-10 07:10:33,718 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 07:10:33,725 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 07:10:33,727 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 07:10:33,728 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 07:10:33,728 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 07:10:33,729 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-industry-pattern/array_monotonic.i [2025-01-10 07:10:35,299 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e3c88fc14/cc9cebee6ee8453e8f49cb37f14f8131/FLAG19dd50057 [2025-01-10 07:10:35,610 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 07:10:35,611 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-industry-pattern/array_monotonic.i [2025-01-10 07:10:35,618 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e3c88fc14/cc9cebee6ee8453e8f49cb37f14f8131/FLAG19dd50057 [2025-01-10 07:10:35,885 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e3c88fc14/cc9cebee6ee8453e8f49cb37f14f8131 [2025-01-10 07:10:35,887 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 07:10:35,888 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 07:10:35,893 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 07:10:35,893 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 07:10:35,897 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 07:10:35,898 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 07:10:35" (1/1) ... [2025-01-10 07:10:35,899 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fc654a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:10:35, skipping insertion in model container [2025-01-10 07:10:35,899 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 07:10:35" (1/1) ... [2025-01-10 07:10:35,911 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 07:10:36,002 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 07:10:36,009 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 07:10:36,021 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 07:10:36,032 INFO L204 MainTranslator]: Completed translation [2025-01-10 07:10:36,034 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:10:36 WrapperNode [2025-01-10 07:10:36,034 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 07:10:36,035 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 07:10:36,035 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 07:10:36,035 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 07:10:36,039 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:10:36" (1/1) ... [2025-01-10 07:10:36,044 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:10:36" (1/1) ... [2025-01-10 07:10:36,054 INFO L138 Inliner]: procedures = 16, calls = 17, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 42 [2025-01-10 07:10:36,055 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 07:10:36,056 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 07:10:36,056 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 07:10:36,056 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 07:10:36,061 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:10:36" (1/1) ... [2025-01-10 07:10:36,062 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:10:36" (1/1) ... [2025-01-10 07:10:36,063 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:10:36" (1/1) ... [2025-01-10 07:10:36,078 INFO L175 MemorySlicer]: Split 7 memory accesses to 3 slices as follows [2, 3, 2]. 43 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2025-01-10 07:10:36,078 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:10:36" (1/1) ... [2025-01-10 07:10:36,078 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:10:36" (1/1) ... [2025-01-10 07:10:36,082 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:10:36" (1/1) ... [2025-01-10 07:10:36,085 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:10:36" (1/1) ... [2025-01-10 07:10:36,088 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:10:36" (1/1) ... [2025-01-10 07:10:36,092 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:10:36" (1/1) ... [2025-01-10 07:10:36,093 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:10:36" (1/1) ... [2025-01-10 07:10:36,094 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 07:10:36,094 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 07:10:36,094 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 07:10:36,094 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 07:10:36,095 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:10:36" (1/1) ... [2025-01-10 07:10:36,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:36,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:36,126 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:10:36,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-01-10 07:10:36,145 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 07:10:36,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 07:10:36,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 07:10:36,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-10 07:10:36,146 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-10 07:10:36,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 07:10:36,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 07:10:36,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-10 07:10:36,146 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 07:10:36,146 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 07:10:36,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 07:10:36,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 07:10:36,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-10 07:10:36,146 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 07:10:36,190 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 07:10:36,191 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 07:10:36,270 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2025-01-10 07:10:36,271 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 07:10:36,280 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 07:10:36,281 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 07:10:36,281 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 07:10:36 BoogieIcfgContainer [2025-01-10 07:10:36,281 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 07:10:36,282 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-01-10 07:10:36,282 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-01-10 07:10:36,286 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-01-10 07:10:36,286 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 07:10:36,287 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.01 07:10:35" (1/3) ... [2025-01-10 07:10:36,287 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1ecf297f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.01 07:10:36, skipping insertion in model container [2025-01-10 07:10:36,287 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 07:10:36,287 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:10:36" (2/3) ... [2025-01-10 07:10:36,288 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1ecf297f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.01 07:10:36, skipping insertion in model container [2025-01-10 07:10:36,288 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 07:10:36,288 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 07:10:36" (3/3) ... [2025-01-10 07:10:36,289 INFO L363 chiAutomizerObserver]: Analyzing ICFG array_monotonic.i [2025-01-10 07:10:36,321 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-01-10 07:10:36,322 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-01-10 07:10:36,322 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-01-10 07:10:36,322 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-01-10 07:10:36,322 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-01-10 07:10:36,322 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-01-10 07:10:36,322 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-01-10 07:10:36,322 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-01-10 07:10:36,326 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:10:36,339 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2025-01-10 07:10:36,340 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:10:36,340 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:10:36,343 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-01-10 07:10:36,343 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-01-10 07:10:36,343 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-01-10 07:10:36,343 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:10:36,344 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2025-01-10 07:10:36,344 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:10:36,344 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:10:36,344 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-01-10 07:10:36,344 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-01-10 07:10:36,353 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(18, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0;" [2025-01-10 07:10:36,354 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int#2(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);" "main_~i~0#1 := 2 + main_~i~0#1;" [2025-01-10 07:10:36,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:10:36,357 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2025-01-10 07:10:36,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:10:36,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615202998] [2025-01-10 07:10:36,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:10:36,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:10:36,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:10:36,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:10:36,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:10:36,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:10:36,419 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:10:36,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:10:36,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:10:36,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:10:36,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:10:36,437 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:10:36,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:10:36,439 INFO L85 PathProgramCache]: Analyzing trace with hash 35849, now seen corresponding path program 1 times [2025-01-10 07:10:36,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:10:36,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261167169] [2025-01-10 07:10:36,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:10:36,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:10:36,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:10:36,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:10:36,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:10:36,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:10:36,449 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:10:36,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:10:36,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:10:36,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:10:36,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:10:36,456 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:10:36,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:10:36,457 INFO L85 PathProgramCache]: Analyzing trace with hash 28694791, now seen corresponding path program 1 times [2025-01-10 07:10:36,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:10:36,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107045988] [2025-01-10 07:10:36,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:10:36,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:10:36,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 07:10:36,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 07:10:36,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:10:36,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:10:36,495 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:10:36,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 07:10:36,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 07:10:36,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:10:36,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:10:36,513 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:10:36,914 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:10:36,915 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:10:36,915 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:10:36,915 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:10:36,916 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-01-10 07:10:36,916 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:36,916 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:10:36,916 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:10:36,916 INFO L132 ssoRankerPreferences]: Filename of dumped script: array_monotonic.i_Iteration1_Lasso [2025-01-10 07:10:36,916 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:10:36,916 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:10:36,930 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:36,946 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:36,950 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:36,953 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:36,956 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:36,958 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:37,126 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:37,351 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:10:37,357 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-01-10 07:10:37,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:37,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:37,365 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:10:37,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-01-10 07:10:37,368 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:10:37,381 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:10:37,381 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:10:37,381 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:10:37,381 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:10:37,389 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:10:37,389 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:10:37,394 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:10:37,402 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-01-10 07:10:37,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:37,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:37,407 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:10:37,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-01-10 07:10:37,409 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:10:37,420 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:10:37,420 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:10:37,420 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:10:37,420 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:10:37,429 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:10:37,429 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:10:37,434 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:10:37,443 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-01-10 07:10:37,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:37,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:37,448 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:10:37,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-01-10 07:10:37,452 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:10:37,462 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:10:37,463 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:10:37,464 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:10:37,464 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:10:37,464 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:10:37,467 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:10:37,467 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:10:37,470 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:10:37,476 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-01-10 07:10:37,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:37,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:37,479 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:10:37,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-01-10 07:10:37,482 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:10:37,494 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:10:37,494 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:10:37,494 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:10:37,494 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:10:37,495 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:10:37,495 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:10:37,495 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:10:37,500 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:10:37,513 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-01-10 07:10:37,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:37,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:37,517 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:10:37,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-01-10 07:10:37,519 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:10:37,529 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:10:37,529 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:10:37,529 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:10:37,529 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:10:37,529 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:10:37,530 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:10:37,530 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:10:37,534 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:10:37,544 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-01-10 07:10:37,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:37,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:37,546 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:10:37,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-01-10 07:10:37,549 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:10:37,558 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:10:37,559 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:10:37,559 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:10:37,559 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:10:37,559 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:10:37,561 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:10:37,561 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:10:37,563 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:10:37,569 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-01-10 07:10:37,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:37,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:37,573 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:10:37,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-01-10 07:10:37,575 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:10:37,585 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:10:37,585 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:10:37,585 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:10:37,585 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:10:37,589 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:10:37,589 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:10:37,593 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:10:37,601 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-01-10 07:10:37,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:37,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:37,604 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:10:37,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-01-10 07:10:37,609 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:10:37,622 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:10:37,622 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:10:37,622 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:10:37,622 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:10:37,622 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:10:37,623 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:10:37,623 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:10:37,626 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:10:37,634 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-01-10 07:10:37,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:37,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:37,637 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:10:37,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-01-10 07:10:37,640 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:10:37,653 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:10:37,653 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:10:37,653 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:10:37,653 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:10:37,656 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:10:37,656 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:10:37,659 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:10:37,667 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-01-10 07:10:37,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:37,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:37,670 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:10:37,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-01-10 07:10:37,673 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:10:37,685 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:10:37,685 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:10:37,685 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:10:37,685 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:10:37,688 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:10:37,688 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:10:37,691 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:10:37,698 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-01-10 07:10:37,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:37,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:37,701 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-01-10 07:10:37,705 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-01-10 07:10:37,706 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:10:37,718 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:10:37,718 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:10:37,718 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:10:37,718 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:10:37,721 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:10:37,721 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:10:37,726 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:10:37,735 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-01-10 07:10:37,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:37,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:37,739 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:10:37,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-01-10 07:10:37,740 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:10:37,753 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:10:37,753 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:10:37,753 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:10:37,753 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:10:37,756 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:10:37,756 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:10:37,760 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:10:37,767 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-01-10 07:10:37,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:37,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:37,770 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:10:37,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-01-10 07:10:37,773 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:10:37,785 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:10:37,786 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:10:37,786 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:10:37,786 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:10:37,788 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:10:37,788 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:10:37,792 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:10:37,801 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-01-10 07:10:37,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:37,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:37,803 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:10:37,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-01-10 07:10:37,806 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:10:37,818 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:10:37,819 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:10:37,819 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:10:37,819 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:10:37,821 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:10:37,821 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:10:37,824 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:10:37,831 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-01-10 07:10:37,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:37,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:37,834 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:10:37,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-01-10 07:10:37,840 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:10:37,852 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:10:37,852 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:10:37,852 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:10:37,852 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:10:37,865 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:10:37,865 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:10:37,874 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-01-10 07:10:37,908 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2025-01-10 07:10:37,910 INFO L444 ModelExtractionUtils]: 0 out of 19 variables were initially zero. Simplification set additionally 16 variables to zero. [2025-01-10 07:10:37,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:37,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:37,915 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:10:37,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-01-10 07:10:37,919 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-01-10 07:10:37,931 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-01-10 07:10:37,931 INFO L474 LassoAnalysis]: Proved termination. [2025-01-10 07:10:37,932 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1, v_rep(select #length ULTIMATE.start_main_~#b~0#1.base)_1) = -1*ULTIMATE.start_main_~i~0#1 + 25000*v_rep(select #length ULTIMATE.start_main_~#b~0#1.base)_1 Supporting invariants [] [2025-01-10 07:10:37,940 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-01-10 07:10:37,962 INFO L156 tatePredicateManager]: 8 out of 8 supporting invariants were superfluous and have been removed [2025-01-10 07:10:37,970 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-01-10 07:10:37,971 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-01-10 07:10:37,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:10:38,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:10:38,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:10:38,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:10:38,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:10:38,008 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 07:10:38,009 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:10:38,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:10:38,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:10:38,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:10:38,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:10:38,065 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 07:10:38,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:10:38,074 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-01-10 07:10:38,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:10:38,190 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-01-10 07:10:38,194 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 16 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:10:38,292 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 16 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 25 states and 36 transitions. Complement of second has 9 states. [2025-01-10 07:10:38,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2025-01-10 07:10:38,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:10:38,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 8 transitions. [2025-01-10 07:10:38,317 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 8 transitions. Stem has 2 letters. Loop has 3 letters. [2025-01-10 07:10:38,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:10:38,317 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 8 transitions. Stem has 5 letters. Loop has 3 letters. [2025-01-10 07:10:38,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:10:38,317 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 8 transitions. Stem has 2 letters. Loop has 6 letters. [2025-01-10 07:10:38,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:10:38,320 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 36 transitions. [2025-01-10 07:10:38,321 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2025-01-10 07:10:38,323 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 21 states and 30 transitions. [2025-01-10 07:10:38,329 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2025-01-10 07:10:38,332 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2025-01-10 07:10:38,333 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 30 transitions. [2025-01-10 07:10:38,333 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:10:38,333 INFO L218 hiAutomatonCegarLoop]: Abstraction has 21 states and 30 transitions. [2025-01-10 07:10:38,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 30 transitions. [2025-01-10 07:10:38,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2025-01-10 07:10:38,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 18 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:10:38,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 28 transitions. [2025-01-10 07:10:38,369 INFO L240 hiAutomatonCegarLoop]: Abstraction has 19 states and 28 transitions. [2025-01-10 07:10:38,369 INFO L432 stractBuchiCegarLoop]: Abstraction has 19 states and 28 transitions. [2025-01-10 07:10:38,369 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-01-10 07:10:38,369 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 28 transitions. [2025-01-10 07:10:38,369 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2025-01-10 07:10:38,369 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:10:38,369 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:10:38,369 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-01-10 07:10:38,369 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-01-10 07:10:38,370 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(18, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" [2025-01-10 07:10:38,370 INFO L754 eck$LassoCheckResult]: Loop: "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" [2025-01-10 07:10:38,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:10:38,370 INFO L85 PathProgramCache]: Analyzing trace with hash 29859, now seen corresponding path program 1 times [2025-01-10 07:10:38,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:10:38,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072519813] [2025-01-10 07:10:38,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:10:38,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:10:38,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:10:38,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:10:38,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:10:38,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:10:38,381 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:10:38,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:10:38,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:10:38,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:10:38,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:10:38,389 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:10:38,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:10:38,389 INFO L85 PathProgramCache]: Analyzing trace with hash 40771, now seen corresponding path program 1 times [2025-01-10 07:10:38,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:10:38,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564659695] [2025-01-10 07:10:38,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:10:38,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:10:38,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:10:38,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:10:38,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:10:38,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:10:38,397 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:10:38,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:10:38,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:10:38,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:10:38,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:10:38,401 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:10:38,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:10:38,402 INFO L85 PathProgramCache]: Analyzing trace with hash 889540449, now seen corresponding path program 1 times [2025-01-10 07:10:38,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:10:38,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406433002] [2025-01-10 07:10:38,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:10:38,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:10:38,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 07:10:38,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 07:10:38,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:10:38,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:10:38,417 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:10:38,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 07:10:38,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 07:10:38,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:10:38,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:10:38,426 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:10:38,924 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:10:38,924 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:10:38,924 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:10:38,924 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:10:38,924 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-01-10 07:10:38,924 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:38,924 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:10:38,924 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:10:38,924 INFO L132 ssoRankerPreferences]: Filename of dumped script: array_monotonic.i_Iteration2_Lasso [2025-01-10 07:10:38,924 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:10:38,924 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:10:38,926 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:38,929 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:38,930 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:38,937 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:39,099 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:39,101 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:39,103 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:39,266 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:10:39,266 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-01-10 07:10:39,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:39,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:39,270 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:10:39,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-01-10 07:10:39,273 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:10:39,283 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:10:39,283 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:10:39,283 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:10:39,283 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:10:39,283 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:10:39,284 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:10:39,284 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:10:39,285 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:10:39,291 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-01-10 07:10:39,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:39,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:39,297 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:10:39,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-01-10 07:10:39,300 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:10:39,309 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:10:39,310 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:10:39,310 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:10:39,310 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:10:39,310 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:10:39,311 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:10:39,311 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:10:39,312 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:10:39,321 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-01-10 07:10:39,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:39,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:39,323 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:10:39,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-01-10 07:10:39,326 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:10:39,336 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:10:39,336 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:10:39,336 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:10:39,336 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:10:39,339 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:10:39,339 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:10:39,341 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:10:39,346 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-01-10 07:10:39,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:39,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:39,348 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:10:39,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-01-10 07:10:39,351 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:10:39,361 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:10:39,362 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:10:39,362 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:10:39,362 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:10:39,364 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:10:39,364 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:10:39,367 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:10:39,372 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2025-01-10 07:10:39,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:39,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:39,375 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:10:39,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-01-10 07:10:39,378 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:10:39,388 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:10:39,388 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:10:39,388 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:10:39,388 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:10:39,389 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:10:39,389 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:10:39,392 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:10:39,398 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2025-01-10 07:10:39,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:39,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:39,401 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-01-10 07:10:39,402 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-01-10 07:10:39,403 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:10:39,413 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:10:39,413 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:10:39,413 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:10:39,413 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:10:39,415 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:10:39,415 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:10:39,420 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:10:39,426 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2025-01-10 07:10:39,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:39,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:39,432 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:10:39,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-01-10 07:10:39,436 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:10:39,445 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:10:39,446 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:10:39,446 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-01-10 07:10:39,446 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:10:39,466 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2025-01-10 07:10:39,466 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-01-10 07:10:39,475 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:10:39,481 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2025-01-10 07:10:39,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:39,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:39,485 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:10:39,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-01-10 07:10:39,487 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:10:39,497 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:10:39,497 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:10:39,497 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:10:39,497 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:10:39,500 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:10:39,500 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:10:39,503 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:10:39,508 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2025-01-10 07:10:39,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:39,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:39,511 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:10:39,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-01-10 07:10:39,514 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:10:39,524 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:10:39,524 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:10:39,524 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:10:39,524 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:10:39,525 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:10:39,525 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:10:39,529 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:10:39,536 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2025-01-10 07:10:39,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:39,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:39,539 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:10:39,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-01-10 07:10:39,541 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:10:39,552 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:10:39,552 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:10:39,552 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:10:39,552 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:10:39,553 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:10:39,553 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:10:39,556 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:10:39,562 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2025-01-10 07:10:39,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:39,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:39,564 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:10:39,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2025-01-10 07:10:39,567 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:10:39,576 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:10:39,576 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:10:39,577 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:10:39,577 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:10:39,578 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:10:39,578 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:10:39,580 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:10:39,586 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-01-10 07:10:39,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:39,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:39,591 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:10:39,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2025-01-10 07:10:39,593 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:10:39,603 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:10:39,603 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:10:39,603 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:10:39,603 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:10:39,606 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:10:39,606 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:10:39,609 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:10:39,615 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2025-01-10 07:10:39,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:39,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:39,619 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:10:39,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2025-01-10 07:10:39,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-01-10 07:10:39,635 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:10:39,636 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:10:39,636 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:10:39,636 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:10:39,638 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:10:39,638 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:10:39,640 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:10:39,646 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2025-01-10 07:10:39,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:39,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:39,648 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:10:39,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2025-01-10 07:10:39,652 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:10:39,663 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:10:39,663 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:10:39,663 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:10:39,663 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:10:39,667 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:10:39,667 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:10:39,672 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-01-10 07:10:39,685 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2025-01-10 07:10:39,685 INFO L444 ModelExtractionUtils]: 0 out of 13 variables were initially zero. Simplification set additionally 10 variables to zero. [2025-01-10 07:10:39,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:39,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:39,688 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:10:39,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2025-01-10 07:10:39,694 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-01-10 07:10:39,704 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-01-10 07:10:39,705 INFO L474 LassoAnalysis]: Proved termination. [2025-01-10 07:10:39,705 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -1*ULTIMATE.start_main_~i~0#1 + 99998 Supporting invariants [] [2025-01-10 07:10:39,711 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2025-01-10 07:10:39,726 INFO L156 tatePredicateManager]: 8 out of 8 supporting invariants were superfluous and have been removed [2025-01-10 07:10:39,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:10:39,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:10:39,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:10:39,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:10:39,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:10:39,763 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 07:10:39,763 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:10:39,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:10:39,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:10:39,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:10:39,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:10:39,774 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 07:10:39,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:10:39,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:10:39,784 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-01-10 07:10:39,785 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 28 transitions. cyclomatic complexity: 12 Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 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-01-10 07:10:39,804 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 28 transitions. cyclomatic complexity: 12. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 42 states and 58 transitions. Complement of second has 8 states. [2025-01-10 07:10:39,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-01-10 07:10:39,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 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-01-10 07:10:39,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 29 transitions. [2025-01-10 07:10:39,806 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 29 transitions. Stem has 3 letters. Loop has 3 letters. [2025-01-10 07:10:39,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:10:39,806 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 29 transitions. Stem has 6 letters. Loop has 3 letters. [2025-01-10 07:10:39,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:10:39,806 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 29 transitions. Stem has 3 letters. Loop has 6 letters. [2025-01-10 07:10:39,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:10:39,806 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 58 transitions. [2025-01-10 07:10:39,807 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2025-01-10 07:10:39,808 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 29 states and 40 transitions. [2025-01-10 07:10:39,808 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2025-01-10 07:10:39,808 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2025-01-10 07:10:39,808 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 40 transitions. [2025-01-10 07:10:39,808 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:10:39,808 INFO L218 hiAutomatonCegarLoop]: Abstraction has 29 states and 40 transitions. [2025-01-10 07:10:39,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 40 transitions. [2025-01-10 07:10:39,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2025-01-10 07:10:39,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 26 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:10:39,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 38 transitions. [2025-01-10 07:10:39,812 INFO L240 hiAutomatonCegarLoop]: Abstraction has 27 states and 38 transitions. [2025-01-10 07:10:39,812 INFO L432 stractBuchiCegarLoop]: Abstraction has 27 states and 38 transitions. [2025-01-10 07:10:39,813 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-01-10 07:10:39,813 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 38 transitions. [2025-01-10 07:10:39,813 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2025-01-10 07:10:39,815 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:10:39,815 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:10:39,815 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-01-10 07:10:39,815 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-01-10 07:10:39,815 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(18, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0;" "assume !(main_~i~0#1 < 100000);main_~i~0#1 := 0;" [2025-01-10 07:10:39,815 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < 100000;call main_#t~mem3#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem3#1);havoc main_#t~mem3#1;" "main_~i~0#1 := 2 + main_~i~0#1;" [2025-01-10 07:10:39,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:10:39,816 INFO L85 PathProgramCache]: Analyzing trace with hash 29868, now seen corresponding path program 1 times [2025-01-10 07:10:39,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:10:39,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274419495] [2025-01-10 07:10:39,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:10:39,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:10:39,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:10:39,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:10:39,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:10:39,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:10:39,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:10:39,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:10:39,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274419495] [2025-01-10 07:10:39,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274419495] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:10:39,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 07:10:39,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 07:10:39,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598521245] [2025-01-10 07:10:39,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:10:39,881 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 07:10:39,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:10:39,881 INFO L85 PathProgramCache]: Analyzing trace with hash 49332, now seen corresponding path program 1 times [2025-01-10 07:10:39,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:10:39,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869572215] [2025-01-10 07:10:39,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:10:39,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:10:39,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:10:39,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:10:39,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:10:39,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:10:39,885 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:10:39,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:10:39,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:10:39,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:10:39,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:10:39,887 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:10:39,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:10:39,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 07:10:39,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 07:10:39,926 INFO L87 Difference]: Start difference. First operand 27 states and 38 transitions. cyclomatic complexity: 15 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-01-10 07:10:39,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:10:39,943 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2025-01-10 07:10:39,943 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 45 transitions. [2025-01-10 07:10:39,944 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-01-10 07:10:39,946 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 30 states and 41 transitions. [2025-01-10 07:10:39,946 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2025-01-10 07:10:39,946 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2025-01-10 07:10:39,946 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 41 transitions. [2025-01-10 07:10:39,946 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:10:39,946 INFO L218 hiAutomatonCegarLoop]: Abstraction has 30 states and 41 transitions. [2025-01-10 07:10:39,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 41 transitions. [2025-01-10 07:10:39,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 19. [2025-01-10 07:10:39,947 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-01-10 07:10:39,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 26 transitions. [2025-01-10 07:10:39,947 INFO L240 hiAutomatonCegarLoop]: Abstraction has 19 states and 26 transitions. [2025-01-10 07:10:39,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 07:10:39,950 INFO L432 stractBuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2025-01-10 07:10:39,950 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-01-10 07:10:39,950 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 26 transitions. [2025-01-10 07:10:39,950 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-01-10 07:10:39,951 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:10:39,951 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:10:39,951 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-01-10 07:10:39,951 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-01-10 07:10:39,951 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(18, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume !(main_~i~0#1 < 100000);main_~i~0#1 := 0;" [2025-01-10 07:10:39,951 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < 100000;call main_#t~mem3#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem3#1);havoc main_#t~mem3#1;" "main_~i~0#1 := 2 + main_~i~0#1;" [2025-01-10 07:10:39,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:10:39,952 INFO L85 PathProgramCache]: Analyzing trace with hash 889540458, now seen corresponding path program 1 times [2025-01-10 07:10:39,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:10:39,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133707514] [2025-01-10 07:10:39,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:10:39,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:10:39,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 07:10:39,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 07:10:39,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:10:39,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:10:39,987 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:10:39,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:10:39,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133707514] [2025-01-10 07:10:39,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133707514] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 07:10:39,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [130621] [2025-01-10 07:10:39,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:10:39,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 07:10:39,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:39,989 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 07:10:39,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2025-01-10 07:10:40,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 07:10:40,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 07:10:40,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:10:40,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:10:40,030 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 07:10:40,030 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:10:40,040 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:10:40,040 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 07:10:40,055 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:10:40,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [130621] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 07:10:40,055 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 07:10:40,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-01-10 07:10:40,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650941810] [2025-01-10 07:10:40,056 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 07:10:40,056 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 07:10:40,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:10:40,056 INFO L85 PathProgramCache]: Analyzing trace with hash 49332, now seen corresponding path program 2 times [2025-01-10 07:10:40,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:10:40,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61951749] [2025-01-10 07:10:40,056 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:10:40,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:10:40,059 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:10:40,062 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:10:40,062 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 07:10:40,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:10:40,062 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:10:40,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:10:40,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:10:40,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:10:40,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:10:40,068 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:10:40,110 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-01-10 07:10:40,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:10:40,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 07:10:40,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-10 07:10:40,118 INFO L87 Difference]: Start difference. First operand 19 states and 26 transitions. cyclomatic complexity: 10 Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:10:40,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:10:40,158 INFO L93 Difference]: Finished difference Result 67 states and 88 transitions. [2025-01-10 07:10:40,158 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 88 transitions. [2025-01-10 07:10:40,159 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-01-10 07:10:40,161 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 61 states and 77 transitions. [2025-01-10 07:10:40,161 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2025-01-10 07:10:40,161 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2025-01-10 07:10:40,161 INFO L73 IsDeterministic]: Start isDeterministic. Operand 61 states and 77 transitions. [2025-01-10 07:10:40,161 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:10:40,161 INFO L218 hiAutomatonCegarLoop]: Abstraction has 61 states and 77 transitions. [2025-01-10 07:10:40,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states and 77 transitions. [2025-01-10 07:10:40,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 39. [2025-01-10 07:10:40,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 38 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:10:40,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 51 transitions. [2025-01-10 07:10:40,163 INFO L240 hiAutomatonCegarLoop]: Abstraction has 39 states and 51 transitions. [2025-01-10 07:10:40,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 07:10:40,164 INFO L432 stractBuchiCegarLoop]: Abstraction has 39 states and 51 transitions. [2025-01-10 07:10:40,164 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-01-10 07:10:40,164 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 51 transitions. [2025-01-10 07:10:40,165 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-01-10 07:10:40,165 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:10:40,165 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:10:40,165 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 4, 1, 1, 1] [2025-01-10 07:10:40,165 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-01-10 07:10:40,165 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(18, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume !(main_~i~0#1 < 100000);main_~i~0#1 := 0;" [2025-01-10 07:10:40,166 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < 100000;call main_#t~mem3#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem3#1);havoc main_#t~mem3#1;" "main_~i~0#1 := 2 + main_~i~0#1;" [2025-01-10 07:10:40,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:10:40,166 INFO L85 PathProgramCache]: Analyzing trace with hash -795065556, now seen corresponding path program 2 times [2025-01-10 07:10:40,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:10:40,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793646219] [2025-01-10 07:10:40,166 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:10:40,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:10:40,171 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-01-10 07:10:40,177 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 07:10:40,177 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 07:10:40,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:10:40,270 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:10:40,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:10:40,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793646219] [2025-01-10 07:10:40,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793646219] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 07:10:40,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1380216896] [2025-01-10 07:10:40,271 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:10:40,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 07:10:40,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:40,273 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 07:10:40,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2025-01-10 07:10:40,299 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-01-10 07:10:40,309 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 07:10:40,309 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 07:10:40,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:10:40,310 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 07:10:40,310 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:10:40,327 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:10:40,327 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 07:10:40,372 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:10:40,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1380216896] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 07:10:40,373 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 07:10:40,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-01-10 07:10:40,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74223275] [2025-01-10 07:10:40,373 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 07:10:40,373 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 07:10:40,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:10:40,374 INFO L85 PathProgramCache]: Analyzing trace with hash 49332, now seen corresponding path program 3 times [2025-01-10 07:10:40,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:10:40,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068833806] [2025-01-10 07:10:40,374 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 07:10:40,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:10:40,376 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:10:40,378 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:10:40,378 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 07:10:40,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:10:40,378 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:10:40,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:10:40,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:10:40,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:10:40,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:10:40,380 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:10:40,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:10:40,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 07:10:40,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-01-10 07:10:40,410 INFO L87 Difference]: Start difference. First operand 39 states and 51 transitions. cyclomatic complexity: 15 Second operand has 13 states, 12 states have (on average 2.75) internal successors, (33), 13 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:10:40,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:10:40,504 INFO L93 Difference]: Finished difference Result 157 states and 203 transitions. [2025-01-10 07:10:40,504 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 157 states and 203 transitions. [2025-01-10 07:10:40,506 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-01-10 07:10:40,506 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 157 states to 145 states and 179 transitions. [2025-01-10 07:10:40,506 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 66 [2025-01-10 07:10:40,507 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 66 [2025-01-10 07:10:40,507 INFO L73 IsDeterministic]: Start isDeterministic. Operand 145 states and 179 transitions. [2025-01-10 07:10:40,507 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:10:40,507 INFO L218 hiAutomatonCegarLoop]: Abstraction has 145 states and 179 transitions. [2025-01-10 07:10:40,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states and 179 transitions. [2025-01-10 07:10:40,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 93. [2025-01-10 07:10:40,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 93 states have (on average 1.2580645161290323) internal successors, (117), 92 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:10:40,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 117 transitions. [2025-01-10 07:10:40,517 INFO L240 hiAutomatonCegarLoop]: Abstraction has 93 states and 117 transitions. [2025-01-10 07:10:40,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 07:10:40,517 INFO L432 stractBuchiCegarLoop]: Abstraction has 93 states and 117 transitions. [2025-01-10 07:10:40,517 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-01-10 07:10:40,517 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 93 states and 117 transitions. [2025-01-10 07:10:40,518 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-01-10 07:10:40,521 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:10:40,521 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:10:40,521 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 10, 1, 1, 1] [2025-01-10 07:10:40,521 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-01-10 07:10:40,522 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(18, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume !(main_~i~0#1 < 100000);main_~i~0#1 := 0;" [2025-01-10 07:10:40,522 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < 100000;call main_#t~mem3#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem3#1);havoc main_#t~mem3#1;" "main_~i~0#1 := 2 + main_~i~0#1;" [2025-01-10 07:10:40,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:10:40,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1808576748, now seen corresponding path program 3 times [2025-01-10 07:10:40,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:10:40,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844682623] [2025-01-10 07:10:40,522 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 07:10:40,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:10:40,532 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 11 equivalence classes. [2025-01-10 07:10:40,561 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 33 of 33 statements. [2025-01-10 07:10:40,562 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-01-10 07:10:40,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:10:40,767 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:10:40,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:10:40,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844682623] [2025-01-10 07:10:40,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844682623] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 07:10:40,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1728994998] [2025-01-10 07:10:40,767 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 07:10:40,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 07:10:40,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:40,770 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 07:10:40,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2025-01-10 07:10:40,806 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 11 equivalence classes. [2025-01-10 07:10:40,865 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 33 of 33 statements. [2025-01-10 07:10:40,865 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-01-10 07:10:40,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:10:40,868 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-10 07:10:40,870 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:10:40,981 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:10:40,981 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 07:10:41,202 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:10:41,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1728994998] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 07:10:41,202 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 07:10:41,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 24 [2025-01-10 07:10:41,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483218784] [2025-01-10 07:10:41,203 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 07:10:41,203 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 07:10:41,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:10:41,203 INFO L85 PathProgramCache]: Analyzing trace with hash 49332, now seen corresponding path program 4 times [2025-01-10 07:10:41,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:10:41,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924450854] [2025-01-10 07:10:41,204 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 07:10:41,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:10:41,206 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 3 statements into 2 equivalence classes. [2025-01-10 07:10:41,207 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:10:41,207 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 07:10:41,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:10:41,208 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:10:41,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:10:41,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:10:41,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:10:41,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:10:41,210 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:10:41,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:10:41,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-01-10 07:10:41,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2025-01-10 07:10:41,245 INFO L87 Difference]: Start difference. First operand 93 states and 117 transitions. cyclomatic complexity: 27 Second operand has 25 states, 24 states have (on average 2.875) internal successors, (69), 25 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:10:41,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:10:41,470 INFO L93 Difference]: Finished difference Result 337 states and 431 transitions. [2025-01-10 07:10:41,470 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 337 states and 431 transitions. [2025-01-10 07:10:41,473 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-01-10 07:10:41,475 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 337 states to 313 states and 383 transitions. [2025-01-10 07:10:41,476 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 138 [2025-01-10 07:10:41,476 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 138 [2025-01-10 07:10:41,476 INFO L73 IsDeterministic]: Start isDeterministic. Operand 313 states and 383 transitions. [2025-01-10 07:10:41,476 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:10:41,476 INFO L218 hiAutomatonCegarLoop]: Abstraction has 313 states and 383 transitions. [2025-01-10 07:10:41,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states and 383 transitions. [2025-01-10 07:10:41,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 201. [2025-01-10 07:10:41,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 201 states have (on average 1.2388059701492538) internal successors, (249), 200 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:10:41,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 249 transitions. [2025-01-10 07:10:41,484 INFO L240 hiAutomatonCegarLoop]: Abstraction has 201 states and 249 transitions. [2025-01-10 07:10:41,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-01-10 07:10:41,485 INFO L432 stractBuchiCegarLoop]: Abstraction has 201 states and 249 transitions. [2025-01-10 07:10:41,485 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-01-10 07:10:41,486 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 201 states and 249 transitions. [2025-01-10 07:10:41,487 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-01-10 07:10:41,487 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:10:41,487 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:10:41,488 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [22, 22, 21, 1, 1, 1, 1] [2025-01-10 07:10:41,488 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-01-10 07:10:41,489 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(18, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int#2(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume !(main_~i~0#1 < 100000);main_~i~0#1 := 0;" [2025-01-10 07:10:41,492 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < 100000;call main_#t~mem3#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem3#1);havoc main_#t~mem3#1;" "main_~i~0#1 := 2 + main_~i~0#1;" [2025-01-10 07:10:41,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:10:41,492 INFO L85 PathProgramCache]: Analyzing trace with hash -2010993618, now seen corresponding path program 1 times [2025-01-10 07:10:41,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:10:41,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893068041] [2025-01-10 07:10:41,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:10:41,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:10:41,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-10 07:10:41,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-10 07:10:41,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:10:41,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:10:42,130 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:10:42,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:10:42,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893068041] [2025-01-10 07:10:42,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893068041] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 07:10:42,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1617916857] [2025-01-10 07:10:42,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:10:42,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 07:10:42,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:42,141 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 07:10:42,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2025-01-10 07:10:42,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-10 07:10:42,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-10 07:10:42,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:10:42,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:10:42,263 INFO L256 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-01-10 07:10:42,266 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:10:42,362 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:10:42,362 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 07:10:43,162 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:10:43,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1617916857] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 07:10:43,163 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 07:10:43,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 48 [2025-01-10 07:10:43,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889921514] [2025-01-10 07:10:43,163 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 07:10:43,164 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 07:10:43,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:10:43,164 INFO L85 PathProgramCache]: Analyzing trace with hash 49332, now seen corresponding path program 5 times [2025-01-10 07:10:43,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:10:43,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808580348] [2025-01-10 07:10:43,164 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 07:10:43,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:10:43,167 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:10:43,168 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:10:43,168 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 07:10:43,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:10:43,168 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:10:43,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:10:43,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:10:43,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:10:43,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:10:43,171 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:10:43,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:10:43,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2025-01-10 07:10:43,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2025-01-10 07:10:43,208 INFO L87 Difference]: Start difference. First operand 201 states and 249 transitions. cyclomatic complexity: 51 Second operand has 49 states, 48 states have (on average 2.9375) internal successors, (141), 49 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:10:43,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:10:43,796 INFO L93 Difference]: Finished difference Result 697 states and 887 transitions. [2025-01-10 07:10:43,796 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 697 states and 887 transitions. [2025-01-10 07:10:43,799 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-01-10 07:10:43,802 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 697 states to 649 states and 791 transitions. [2025-01-10 07:10:43,802 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 282 [2025-01-10 07:10:43,802 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 282 [2025-01-10 07:10:43,802 INFO L73 IsDeterministic]: Start isDeterministic. Operand 649 states and 791 transitions. [2025-01-10 07:10:43,802 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:10:43,802 INFO L218 hiAutomatonCegarLoop]: Abstraction has 649 states and 791 transitions. [2025-01-10 07:10:43,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states and 791 transitions. [2025-01-10 07:10:43,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 417. [2025-01-10 07:10:43,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 417 states have (on average 1.2302158273381294) internal successors, (513), 416 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:10:43,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 513 transitions. [2025-01-10 07:10:43,827 INFO L240 hiAutomatonCegarLoop]: Abstraction has 417 states and 513 transitions. [2025-01-10 07:10:43,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-01-10 07:10:43,828 INFO L432 stractBuchiCegarLoop]: Abstraction has 417 states and 513 transitions. [2025-01-10 07:10:43,828 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-01-10 07:10:43,828 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 417 states and 513 transitions. [2025-01-10 07:10:43,829 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-01-10 07:10:43,829 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:10:43,829 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:10:43,836 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [46, 46, 46, 1, 1, 1] [2025-01-10 07:10:43,836 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-01-10 07:10:43,836 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(18, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume !(main_~i~0#1 < 100000);main_~i~0#1 := 0;" [2025-01-10 07:10:43,836 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < 100000;call main_#t~mem3#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem3#1);havoc main_#t~mem3#1;" "main_~i~0#1 := 2 + main_~i~0#1;" [2025-01-10 07:10:43,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:10:43,837 INFO L85 PathProgramCache]: Analyzing trace with hash 759993196, now seen corresponding path program 4 times [2025-01-10 07:10:43,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:10:43,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900599541] [2025-01-10 07:10:43,837 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 07:10:43,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:10:43,863 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 141 statements into 2 equivalence classes. [2025-01-10 07:10:43,899 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 141 of 141 statements. [2025-01-10 07:10:43,899 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 07:10:43,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:10:45,617 INFO L134 CoverageAnalysis]: Checked inductivity of 3151 backedges. 0 proven. 3151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:10:45,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:10:45,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900599541] [2025-01-10 07:10:45,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900599541] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 07:10:45,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [977517777] [2025-01-10 07:10:45,617 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 07:10:45,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 07:10:45,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:45,624 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 07:10:45,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2025-01-10 07:10:45,711 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 141 statements into 2 equivalence classes. [2025-01-10 07:10:45,787 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 141 of 141 statements. [2025-01-10 07:10:45,788 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 07:10:45,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:10:45,796 INFO L256 TraceCheckSpWp]: Trace formula consists of 688 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-01-10 07:10:45,800 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:10:46,005 INFO L134 CoverageAnalysis]: Checked inductivity of 3151 backedges. 0 proven. 3151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:10:46,005 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 07:10:48,445 INFO L134 CoverageAnalysis]: Checked inductivity of 3151 backedges. 0 proven. 3151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:10:48,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [977517777] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 07:10:48,445 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 07:10:48,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2025-01-10 07:10:48,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360499166] [2025-01-10 07:10:48,446 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 07:10:48,446 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 07:10:48,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:10:48,446 INFO L85 PathProgramCache]: Analyzing trace with hash 49332, now seen corresponding path program 6 times [2025-01-10 07:10:48,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:10:48,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989483033] [2025-01-10 07:10:48,446 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 07:10:48,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:10:48,449 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:10:48,450 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:10:48,450 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-01-10 07:10:48,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:10:48,451 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:10:48,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:10:48,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:10:48,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:10:48,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:10:48,453 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:10:48,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:10:48,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2025-01-10 07:10:48,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2025-01-10 07:10:48,492 INFO L87 Difference]: Start difference. First operand 417 states and 513 transitions. cyclomatic complexity: 99 Second operand has 96 states, 95 states have (on average 2.957894736842105) internal successors, (281), 96 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:10:51,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:10:51,024 INFO L93 Difference]: Finished difference Result 1417 states and 1799 transitions. [2025-01-10 07:10:51,024 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1417 states and 1799 transitions. [2025-01-10 07:10:51,032 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-01-10 07:10:51,037 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1417 states to 1321 states and 1607 transitions. [2025-01-10 07:10:51,037 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 570 [2025-01-10 07:10:51,037 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 570 [2025-01-10 07:10:51,038 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1321 states and 1607 transitions. [2025-01-10 07:10:51,038 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:10:51,038 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1321 states and 1607 transitions. [2025-01-10 07:10:51,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1321 states and 1607 transitions. [2025-01-10 07:10:51,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1321 to 849. [2025-01-10 07:10:51,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 849 states, 849 states have (on average 1.226148409893993) internal successors, (1041), 848 states have internal predecessors, (1041), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:10:51,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 1041 transitions. [2025-01-10 07:10:51,049 INFO L240 hiAutomatonCegarLoop]: Abstraction has 849 states and 1041 transitions. [2025-01-10 07:10:51,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2025-01-10 07:10:51,054 INFO L432 stractBuchiCegarLoop]: Abstraction has 849 states and 1041 transitions. [2025-01-10 07:10:51,054 INFO L338 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-01-10 07:10:51,054 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 849 states and 1041 transitions. [2025-01-10 07:10:51,058 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-01-10 07:10:51,058 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:10:51,058 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:10:51,061 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [94, 94, 94, 1, 1, 1] [2025-01-10 07:10:51,061 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-01-10 07:10:51,061 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(18, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume !(main_~i~0#1 < 100000);main_~i~0#1 := 0;" [2025-01-10 07:10:51,061 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < 100000;call main_#t~mem3#1 := read~int#1(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem3#1);havoc main_#t~mem3#1;" "main_~i~0#1 := 2 + main_~i~0#1;" [2025-01-10 07:10:51,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:10:51,062 INFO L85 PathProgramCache]: Analyzing trace with hash -2065350292, now seen corresponding path program 5 times [2025-01-10 07:10:51,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:10:51,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579255191] [2025-01-10 07:10:51,062 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 07:10:51,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:10:51,106 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 285 statements into 95 equivalence classes. [2025-01-10 07:10:51,448 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 95 check-sat command(s) and asserted 285 of 285 statements. [2025-01-10 07:10:51,448 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 95 check-sat command(s) [2025-01-10 07:10:51,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:10:56,976 INFO L134 CoverageAnalysis]: Checked inductivity of 13207 backedges. 0 proven. 13207 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:10:56,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:10:56,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579255191] [2025-01-10 07:10:56,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579255191] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 07:10:56,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [943444143] [2025-01-10 07:10:56,977 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 07:10:56,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 07:10:56,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:56,979 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 07:10:56,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2025-01-10 07:10:57,206 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 285 statements into 95 equivalence classes.