./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-examples/standard_vararg_ground.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-examples/standard_vararg_ground.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 28ac72543f751666908cbd68a77fa11ffe4dd886016c3996df45b97bb42d5078 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 07:10:29,923 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 07:10:29,992 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:30,001 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 07:10:30,002 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 07:10:30,031 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 07:10:30,031 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 07:10:30,031 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 07:10:30,032 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 07:10:30,032 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 07:10:30,032 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 07:10:30,032 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 07:10:30,032 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 07:10:30,032 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-01-10 07:10:30,033 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-01-10 07:10:30,033 INFO L153 SettingsManager]: * Use old map elimination=false [2025-01-10 07:10:30,033 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-01-10 07:10:30,033 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-01-10 07:10:30,034 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-01-10 07:10:30,034 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 07:10:30,035 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-01-10 07:10:30,035 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 07:10:30,035 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 07:10:30,035 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 07:10:30,035 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 07:10:30,035 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-01-10 07:10:30,035 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-01-10 07:10:30,036 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-01-10 07:10:30,036 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 07:10:30,036 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 07:10:30,036 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 07:10:30,036 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-01-10 07:10:30,036 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 07:10:30,036 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 07:10:30,037 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 07:10:30,037 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 07:10:30,037 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 07:10:30,037 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 07:10:30,037 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-01-10 07:10:30,037 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 -> 28ac72543f751666908cbd68a77fa11ffe4dd886016c3996df45b97bb42d5078 [2025-01-10 07:10:30,327 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 07:10:30,336 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 07:10:30,340 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 07:10:30,342 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 07:10:30,342 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 07:10:30,344 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-examples/standard_vararg_ground.i [2025-01-10 07:10:31,711 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0c86e105c/440fbb8e439a4d858d7d875a5f9fd107/FLAG8e111e995 [2025-01-10 07:10:31,997 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 07:10:31,999 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-examples/standard_vararg_ground.i [2025-01-10 07:10:32,007 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0c86e105c/440fbb8e439a4d858d7d875a5f9fd107/FLAG8e111e995 [2025-01-10 07:10:32,028 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0c86e105c/440fbb8e439a4d858d7d875a5f9fd107 [2025-01-10 07:10:32,030 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 07:10:32,033 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 07:10:32,035 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 07:10:32,035 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 07:10:32,040 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 07:10:32,040 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 07:10:32" (1/1) ... [2025-01-10 07:10:32,041 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@84a568b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:10:32, skipping insertion in model container [2025-01-10 07:10:32,041 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 07:10:32" (1/1) ... [2025-01-10 07:10:32,057 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 07:10:32,199 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 07:10:32,211 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 07:10:32,228 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 07:10:32,243 INFO L204 MainTranslator]: Completed translation [2025-01-10 07:10:32,244 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:10:32 WrapperNode [2025-01-10 07:10:32,244 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 07:10:32,245 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 07:10:32,246 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 07:10:32,246 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 07:10:32,251 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:32" (1/1) ... [2025-01-10 07:10:32,259 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:32" (1/1) ... [2025-01-10 07:10:32,276 INFO L138 Inliner]: procedures = 16, calls = 14, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 50 [2025-01-10 07:10:32,277 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 07:10:32,278 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 07:10:32,278 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 07:10:32,279 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 07:10:32,285 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:32" (1/1) ... [2025-01-10 07:10:32,286 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:32" (1/1) ... [2025-01-10 07:10:32,287 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:32" (1/1) ... [2025-01-10 07:10:32,302 INFO L175 MemorySlicer]: Split 5 memory accesses to 2 slices as follows [2, 3]. 60 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-01-10 07:10:32,303 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:32" (1/1) ... [2025-01-10 07:10:32,303 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:32" (1/1) ... [2025-01-10 07:10:32,309 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:32" (1/1) ... [2025-01-10 07:10:32,311 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:32" (1/1) ... [2025-01-10 07:10:32,315 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:32" (1/1) ... [2025-01-10 07:10:32,316 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:32" (1/1) ... [2025-01-10 07:10:32,321 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:32" (1/1) ... [2025-01-10 07:10:32,322 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 07:10:32,323 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 07:10:32,323 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 07:10:32,323 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 07:10:32,324 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:10:32" (1/1) ... [2025-01-10 07:10:32,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:32,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:32,360 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:32,365 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:32,388 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 07:10:32,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 07:10:32,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 07:10:32,389 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-10 07:10:32,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 07:10:32,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 07:10:32,389 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 07:10:32,389 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 07:10:32,389 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 07:10:32,389 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 07:10:32,389 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 07:10:32,441 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 07:10:32,443 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 07:10:32,558 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-01-10 07:10:32,558 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 07:10:32,567 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 07:10:32,567 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-10 07:10:32,568 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 07:10:32 BoogieIcfgContainer [2025-01-10 07:10:32,569 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 07:10:32,569 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-01-10 07:10:32,570 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-01-10 07:10:32,575 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-01-10 07:10:32,575 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 07:10:32,575 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.01 07:10:32" (1/3) ... [2025-01-10 07:10:32,576 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@69b2b943 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.01 07:10:32, skipping insertion in model container [2025-01-10 07:10:32,576 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 07:10:32,576 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:10:32" (2/3) ... [2025-01-10 07:10:32,577 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@69b2b943 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.01 07:10:32, skipping insertion in model container [2025-01-10 07:10:32,577 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 07:10:32,577 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 07:10:32" (3/3) ... [2025-01-10 07:10:32,578 INFO L363 chiAutomizerObserver]: Analyzing ICFG standard_vararg_ground.i [2025-01-10 07:10:32,617 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-01-10 07:10:32,618 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-01-10 07:10:32,618 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-01-10 07:10:32,618 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-01-10 07:10:32,618 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-01-10 07:10:32,618 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-01-10 07:10:32,618 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-01-10 07:10:32,618 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-01-10 07:10:32,622 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:32,635 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2025-01-10 07:10:32,635 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:10:32,635 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:10:32,638 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-01-10 07:10:32,638 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-01-10 07:10:32,638 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-01-10 07:10:32,638 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:32,639 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2025-01-10 07:10:32,639 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:10:32,639 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:10:32,640 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-01-10 07:10:32,640 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-01-10 07:10:32,644 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(25, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_~i~0#1, main_#t~mem3#1, main_#t~post4#1, main_#t~mem5#1, main_#t~post6#1, main_~#aa~0#1.base, main_~#aa~0#1.offset, main_~a~0#1, main_~x~0#1;call main_~#aa~0#1.base, main_~#aa~0#1.offset := #Ultimate.allocOnStack(400000);main_~a~0#1 := 0;main_~i~0#1 := 0;" [2025-01-10 07:10:32,644 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_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" [2025-01-10 07:10:32,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:10:32,649 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2025-01-10 07:10:32,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:10:32,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335982174] [2025-01-10 07:10:32,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:10:32,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:10:32,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:10:32,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:10:32,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:10:32,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:10:32,740 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:10:32,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:10:32,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:10:32,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:10:32,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:10:32,770 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:10:32,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:10:32,773 INFO L85 PathProgramCache]: Analyzing trace with hash 37, now seen corresponding path program 1 times [2025-01-10 07:10:32,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:10:32,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254047544] [2025-01-10 07:10:32,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:10:32,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:10:32,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-01-10 07:10:32,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-01-10 07:10:32,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:10:32,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:10:32,792 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:10:32,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-01-10 07:10:32,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-01-10 07:10:32,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:10:32,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:10:32,799 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:10:32,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:10:32,800 INFO L85 PathProgramCache]: Analyzing trace with hash 29859, now seen corresponding path program 1 times [2025-01-10 07:10:32,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:10:32,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912721825] [2025-01-10 07:10:32,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:10:32,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:10:32,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:10:32,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:32,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:10:32,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:10:32,827 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:10:32,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:10:32,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:10:32,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:10:32,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:10:32,854 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:10:33,217 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:10:33,218 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:10:33,218 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:10:33,218 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:10:33,218 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-01-10 07:10:33,223 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:33,223 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:10:33,223 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:10:33,223 INFO L132 ssoRankerPreferences]: Filename of dumped script: standard_vararg_ground.i_Iteration1_Lasso [2025-01-10 07:10:33,223 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:10:33,224 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:10:33,240 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:33,262 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:33,265 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:33,269 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:33,272 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:33,277 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:33,282 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:33,503 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:33,508 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:33,512 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:33,514 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:10:33,750 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:10:33,754 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-01-10 07:10:33,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:33,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:33,759 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:33,760 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:33,761 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:33,775 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:10:33,775 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:10:33,775 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:10:33,775 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:10:33,784 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:10:33,784 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:10:33,794 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:10:33,803 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:33,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:33,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:33,808 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:33,812 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:33,814 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:10:33,827 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:10:33,827 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:10:33,827 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:10:33,827 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:10:33,829 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:10:33,830 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:10:33,850 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:10:33,858 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-01-10 07:10:33,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:33,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:33,863 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:33,864 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:33,866 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:33,879 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:10:33,879 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:10:33,879 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:10:33,879 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:10:33,880 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:10:33,880 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:10:33,880 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:10:33,881 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:10:33,889 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:33,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:33,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:33,891 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:33,894 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:33,895 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:33,908 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:10:33,908 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:10:33,908 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:10:33,908 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:10:33,908 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:10:33,909 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:10:33,909 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:10:33,910 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:10:33,918 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:33,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:33,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:33,921 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:33,924 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:33,928 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:33,937 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:10:33,937 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:10:33,937 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:10:33,937 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:10:33,937 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:10:33,938 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:10:33,938 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:10:33,941 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:10:33,948 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:33,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:33,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:33,951 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:33,954 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:33,954 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:33,967 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:10:33,967 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:10:33,967 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:10:33,967 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:10:33,967 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:10:33,968 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:10:33,968 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:10:33,971 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:10:33,978 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:33,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:33,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:33,981 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:33,983 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:33,984 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:33,993 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:10:33,993 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:10:33,993 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:10:33,993 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:10:33,994 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:10:33,995 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:10:33,995 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:10:33,997 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:10:34,003 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-01-10 07:10:34,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:34,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:34,005 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:34,006 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:34,007 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:34,017 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:10:34,017 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:10:34,017 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:10:34,017 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:10:34,019 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:10:34,019 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:10:34,024 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:10:34,031 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:34,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:34,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:34,034 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:34,035 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:34,037 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 07:10:34,050 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:10:34,050 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:10:34,051 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:10:34,051 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:10:34,051 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:10:34,052 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:10:34,052 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:10:34,055 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:10:34,062 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-01-10 07:10:34,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:34,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:34,065 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:34,068 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:34,069 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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:34,079 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:10:34,079 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:10:34,079 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:10:34,080 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:10:34,084 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:10:34,084 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:10:34,093 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-01-10 07:10:34,133 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2025-01-10 07:10:34,135 INFO L444 ModelExtractionUtils]: 1 out of 13 variables were initially zero. Simplification set additionally 9 variables to zero. [2025-01-10 07:10:34,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:10:34,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:34,140 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:34,141 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:34,142 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-01-10 07:10:34,156 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-01-10 07:10:34,156 INFO L474 LassoAnalysis]: Proved termination. [2025-01-10 07:10:34,157 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1, v_rep(select #length ULTIMATE.start_main_~#aa~0#1.base)_1) = -8*ULTIMATE.start_main_~i~0#1 + 199999*v_rep(select #length ULTIMATE.start_main_~#aa~0#1.base)_1 Supporting invariants [] [2025-01-10 07:10:34,165 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:34,185 INFO L156 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2025-01-10 07:10:34,195 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-01-10 07:10:34,196 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-01-10 07:10:34,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:10:34,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:10:34,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:10:34,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:10:34,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:10:34,240 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 07:10:34,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:10:34,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-01-10 07:10:34,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-01-10 07:10:34,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:10:34,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:10:34,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 07:10:34,259 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:10:34,263 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:34,292 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-01-10 07:10:34,294 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 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:10:34,320 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 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 18 states and 25 transitions. Complement of second has 3 states. [2025-01-10 07:10:34,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2025-01-10 07:10:34,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:10:34,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 3 transitions. [2025-01-10 07:10:34,333 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 3 transitions. Stem has 2 letters. Loop has 1 letters. [2025-01-10 07:10:34,334 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:10:34,334 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 3 transitions. Stem has 3 letters. Loop has 1 letters. [2025-01-10 07:10:34,334 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:10:34,334 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 3 transitions. Stem has 2 letters. Loop has 2 letters. [2025-01-10 07:10:34,334 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:10:34,335 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 25 transitions. [2025-01-10 07:10:34,335 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2025-01-10 07:10:34,340 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 15 states and 22 transitions. [2025-01-10 07:10:34,341 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2025-01-10 07:10:34,341 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2025-01-10 07:10:34,342 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 22 transitions. [2025-01-10 07:10:34,342 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:10:34,342 INFO L218 hiAutomatonCegarLoop]: Abstraction has 15 states and 22 transitions. [2025-01-10 07:10:34,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 22 transitions. [2025-01-10 07:10:34,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2025-01-10 07:10:34,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:10:34,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 20 transitions. [2025-01-10 07:10:34,362 INFO L240 hiAutomatonCegarLoop]: Abstraction has 14 states and 20 transitions. [2025-01-10 07:10:34,362 INFO L432 stractBuchiCegarLoop]: Abstraction has 14 states and 20 transitions. [2025-01-10 07:10:34,362 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-01-10 07:10:34,362 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 20 transitions. [2025-01-10 07:10:34,364 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2025-01-10 07:10:34,364 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:10:34,364 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:10:34,364 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-01-10 07:10:34,365 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-01-10 07:10:34,365 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(25, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_~i~0#1, main_#t~mem3#1, main_#t~post4#1, main_#t~mem5#1, main_#t~post6#1, main_~#aa~0#1.base, main_~#aa~0#1.offset, main_~a~0#1, main_~x~0#1;call main_~#aa~0#1.base, main_~#aa~0#1.offset := #Ultimate.allocOnStack(400000);main_~a~0#1 := 0;main_~i~0#1 := 0;" "assume !(main_~i~0#1 < 100000);havoc main_~i~0#1;" [2025-01-10 07:10:34,365 INFO L754 eck$LassoCheckResult]: Loop: "call main_#t~mem3#1 := read~int#1(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);" "assume main_#t~mem3#1 >= 0;havoc main_#t~mem3#1;" "main_#t~post4#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" [2025-01-10 07:10:34,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:10:34,368 INFO L85 PathProgramCache]: Analyzing trace with hash 29861, now seen corresponding path program 1 times [2025-01-10 07:10:34,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:10:34,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482915171] [2025-01-10 07:10:34,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:10:34,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:10:34,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:10:34,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:10:34,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:10:34,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:10:34,443 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:34,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:10:34,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482915171] [2025-01-10 07:10:34,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482915171] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:10:34,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 07:10:34,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 07:10:34,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78991669] [2025-01-10 07:10:34,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:10:34,450 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 07:10:34,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:10:34,451 INFO L85 PathProgramCache]: Analyzing trace with hash 41807, now seen corresponding path program 1 times [2025-01-10 07:10:34,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:10:34,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701474960] [2025-01-10 07:10:34,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:10:34,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:10:34,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:10:34,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:10:34,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:10:34,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:10:34,464 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:10:34,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:10:34,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:10:34,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:10:34,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:10:34,471 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:10:34,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:10:34,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 07:10:34,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 07:10:34,515 INFO L87 Difference]: Start difference. First operand 14 states and 20 transitions. cyclomatic complexity: 9 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:34,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:10:34,522 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2025-01-10 07:10:34,522 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 15 transitions. [2025-01-10 07:10:34,523 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2025-01-10 07:10:34,525 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 11 states and 13 transitions. [2025-01-10 07:10:34,525 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2025-01-10 07:10:34,525 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2025-01-10 07:10:34,525 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 13 transitions. [2025-01-10 07:10:34,525 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:10:34,525 INFO L218 hiAutomatonCegarLoop]: Abstraction has 11 states and 13 transitions. [2025-01-10 07:10:34,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 13 transitions. [2025-01-10 07:10:34,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2025-01-10 07:10:34,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 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:34,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2025-01-10 07:10:34,526 INFO L240 hiAutomatonCegarLoop]: Abstraction has 11 states and 13 transitions. [2025-01-10 07:10:34,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 07:10:34,529 INFO L432 stractBuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2025-01-10 07:10:34,529 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-01-10 07:10:34,529 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 13 transitions. [2025-01-10 07:10:34,530 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2025-01-10 07:10:34,530 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:10:34,530 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:10:34,531 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-01-10 07:10:34,531 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-01-10 07:10:34,531 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(25, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_~i~0#1, main_#t~mem3#1, main_#t~post4#1, main_#t~mem5#1, main_#t~post6#1, main_~#aa~0#1.base, main_~#aa~0#1.offset, main_~a~0#1, main_~x~0#1;call main_~#aa~0#1.base, main_~#aa~0#1.offset := #Ultimate.allocOnStack(400000);main_~a~0#1 := 0;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_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !(main_~i~0#1 < 100000);havoc main_~i~0#1;" [2025-01-10 07:10:34,531 INFO L754 eck$LassoCheckResult]: Loop: "call main_#t~mem3#1 := read~int#1(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);" "assume main_#t~mem3#1 >= 0;havoc main_#t~mem3#1;" "main_#t~post4#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" [2025-01-10 07:10:34,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:10:34,531 INFO L85 PathProgramCache]: Analyzing trace with hash 925637, now seen corresponding path program 1 times [2025-01-10 07:10:34,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:10:34,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598003276] [2025-01-10 07:10:34,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:10:34,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:10:34,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:10:34,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:10:34,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:10:34,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:10:34,605 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:34,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:10:34,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598003276] [2025-01-10 07:10:34,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598003276] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 07:10:34,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1778020852] [2025-01-10 07:10:34,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:10:34,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 07:10:34,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:34,608 INFO L229 MonitoredProcess]: Starting monitored process 13 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:34,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-01-10 07:10:34,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:10:34,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:10:34,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:10:34,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:10:34,656 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 07:10:34,657 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:10:34,671 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:34,672 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 07:10:34,689 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:34,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1778020852] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 07:10:34,689 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 07:10:34,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-01-10 07:10:34,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365359354] [2025-01-10 07:10:34,690 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 07:10:34,690 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 07:10:34,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:10:34,690 INFO L85 PathProgramCache]: Analyzing trace with hash 41807, now seen corresponding path program 2 times [2025-01-10 07:10:34,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:10:34,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145259747] [2025-01-10 07:10:34,690 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:10:34,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:10:34,694 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:10:34,695 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:34,695 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 07:10:34,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:10:34,696 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:10:34,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:10:34,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:10:34,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:10:34,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:10:34,700 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:10:34,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:10:34,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 07:10:34,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-10 07:10:34,745 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. cyclomatic complexity: 5 Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:10:34,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:10:34,761 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2025-01-10 07:10:34,761 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 16 transitions. [2025-01-10 07:10:34,762 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2025-01-10 07:10:34,762 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 16 transitions. [2025-01-10 07:10:34,762 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2025-01-10 07:10:34,762 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2025-01-10 07:10:34,762 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 16 transitions. [2025-01-10 07:10:34,762 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:10:34,762 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14 states and 16 transitions. [2025-01-10 07:10:34,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 16 transitions. [2025-01-10 07:10:34,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2025-01-10 07:10:34,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 13 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:10:34,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2025-01-10 07:10:34,764 INFO L240 hiAutomatonCegarLoop]: Abstraction has 14 states and 16 transitions. [2025-01-10 07:10:34,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 07:10:34,764 INFO L432 stractBuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2025-01-10 07:10:34,765 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-01-10 07:10:34,765 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 16 transitions. [2025-01-10 07:10:34,765 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2025-01-10 07:10:34,765 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:10:34,765 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:10:34,765 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 1, 1, 1] [2025-01-10 07:10:34,765 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-01-10 07:10:34,766 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(25, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_~i~0#1, main_#t~mem3#1, main_#t~post4#1, main_#t~mem5#1, main_#t~post6#1, main_~#aa~0#1.base, main_~#aa~0#1.offset, main_~a~0#1, main_~x~0#1;call main_~#aa~0#1.base, main_~#aa~0#1.offset := #Ultimate.allocOnStack(400000);main_~a~0#1 := 0;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_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !(main_~i~0#1 < 100000);havoc main_~i~0#1;" [2025-01-10 07:10:34,766 INFO L754 eck$LassoCheckResult]: Loop: "call main_#t~mem3#1 := read~int#1(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);" "assume main_#t~mem3#1 >= 0;havoc main_#t~mem3#1;" "main_#t~post4#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" [2025-01-10 07:10:34,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:10:34,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1805794469, now seen corresponding path program 2 times [2025-01-10 07:10:34,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:10:34,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922702924] [2025-01-10 07:10:34,766 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:10:34,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:10:34,775 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 7 statements into 2 equivalence classes. [2025-01-10 07:10:34,787 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 07:10:34,787 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 07:10:34,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:10:34,921 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:10:34,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:10:34,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922702924] [2025-01-10 07:10:34,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922702924] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 07:10:34,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [946978566] [2025-01-10 07:10:34,921 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:10:34,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 07:10:34,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:34,925 INFO L229 MonitoredProcess]: Starting monitored process 14 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:34,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-01-10 07:10:34,977 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 7 statements into 2 equivalence classes. [2025-01-10 07:10:34,993 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 07:10:34,993 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 07:10:34,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:10:34,994 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 07:10:34,994 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:10:35,017 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:10:35,017 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 07:10:35,087 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:10:35,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [946978566] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 07:10:35,088 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 07:10:35,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-01-10 07:10:35,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101545569] [2025-01-10 07:10:35,088 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 07:10:35,088 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 07:10:35,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:10:35,088 INFO L85 PathProgramCache]: Analyzing trace with hash 41807, now seen corresponding path program 3 times [2025-01-10 07:10:35,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:10:35,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216283456] [2025-01-10 07:10:35,088 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 07:10:35,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:10:35,091 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:10:35,095 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:35,095 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 07:10:35,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:10:35,095 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:10:35,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:10:35,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:10:35,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:10:35,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:10:35,098 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:10:35,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:10:35,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 07:10:35,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-01-10 07:10:35,146 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. cyclomatic complexity: 5 Second operand has 13 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:10:35,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:10:35,174 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2025-01-10 07:10:35,174 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 22 transitions. [2025-01-10 07:10:35,175 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2025-01-10 07:10:35,175 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 22 transitions. [2025-01-10 07:10:35,175 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2025-01-10 07:10:35,175 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2025-01-10 07:10:35,175 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 22 transitions. [2025-01-10 07:10:35,175 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:10:35,175 INFO L218 hiAutomatonCegarLoop]: Abstraction has 20 states and 22 transitions. [2025-01-10 07:10:35,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 22 transitions. [2025-01-10 07:10:35,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2025-01-10 07:10:35,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.1) internal successors, (22), 19 states have internal predecessors, (22), 0 states have call successors, (0), 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:35,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2025-01-10 07:10:35,177 INFO L240 hiAutomatonCegarLoop]: Abstraction has 20 states and 22 transitions. [2025-01-10 07:10:35,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 07:10:35,178 INFO L432 stractBuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2025-01-10 07:10:35,178 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-01-10 07:10:35,178 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 22 transitions. [2025-01-10 07:10:35,178 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2025-01-10 07:10:35,178 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:10:35,178 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:10:35,179 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 1, 1, 1] [2025-01-10 07:10:35,179 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-01-10 07:10:35,179 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(25, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_~i~0#1, main_#t~mem3#1, main_#t~post4#1, main_#t~mem5#1, main_#t~post6#1, main_~#aa~0#1.base, main_~#aa~0#1.offset, main_~a~0#1, main_~x~0#1;call main_~#aa~0#1.base, main_~#aa~0#1.offset := #Ultimate.allocOnStack(400000);main_~a~0#1 := 0;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_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !(main_~i~0#1 < 100000);havoc main_~i~0#1;" [2025-01-10 07:10:35,179 INFO L754 eck$LassoCheckResult]: Loop: "call main_#t~mem3#1 := read~int#1(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);" "assume main_#t~mem3#1 >= 0;havoc main_#t~mem3#1;" "main_#t~post4#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" [2025-01-10 07:10:35,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:10:35,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1496410277, now seen corresponding path program 3 times [2025-01-10 07:10:35,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:10:35,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253346455] [2025-01-10 07:10:35,180 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 07:10:35,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:10:35,192 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 13 statements into 6 equivalence classes. [2025-01-10 07:10:35,211 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 07:10:35,211 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-01-10 07:10:35,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:10:35,283 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:35,514 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:10:35,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:10:35,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253346455] [2025-01-10 07:10:35,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253346455] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 07:10:35,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [14387534] [2025-01-10 07:10:35,515 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 07:10:35,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 07:10:35,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:35,517 INFO L229 MonitoredProcess]: Starting monitored process 15 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:35,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-01-10 07:10:35,569 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 13 statements into 6 equivalence classes. [2025-01-10 07:10:35,606 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 07:10:35,606 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-01-10 07:10:35,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:10:35,607 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-10 07:10:35,608 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:10:35,654 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:10:35,654 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 07:10:35,870 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:10:35,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [14387534] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 07:10:35,870 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 07:10:35,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 24 [2025-01-10 07:10:35,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226669371] [2025-01-10 07:10:35,871 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 07:10:35,871 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 07:10:35,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:10:35,871 INFO L85 PathProgramCache]: Analyzing trace with hash 41807, now seen corresponding path program 4 times [2025-01-10 07:10:35,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:10:35,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943276822] [2025-01-10 07:10:35,871 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 07:10:35,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:10:35,874 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 3 statements into 2 equivalence classes. [2025-01-10 07:10:35,876 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:35,876 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 07:10:35,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:10:35,876 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:10:35,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:10:35,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:10:35,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:10:35,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:10:35,879 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:10:35,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:10:35,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-01-10 07:10:35,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2025-01-10 07:10:35,915 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. cyclomatic complexity: 5 Second operand has 25 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:10:35,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:10:35,956 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2025-01-10 07:10:35,956 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 34 transitions. [2025-01-10 07:10:35,958 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2025-01-10 07:10:35,960 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 32 states and 34 transitions. [2025-01-10 07:10:35,960 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2025-01-10 07:10:35,960 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2025-01-10 07:10:35,960 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 34 transitions. [2025-01-10 07:10:35,960 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:10:35,961 INFO L218 hiAutomatonCegarLoop]: Abstraction has 32 states and 34 transitions. [2025-01-10 07:10:35,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 34 transitions. [2025-01-10 07:10:35,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2025-01-10 07:10:35,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.0625) internal successors, (34), 31 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:10:35,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2025-01-10 07:10:35,965 INFO L240 hiAutomatonCegarLoop]: Abstraction has 32 states and 34 transitions. [2025-01-10 07:10:35,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-01-10 07:10:35,965 INFO L432 stractBuchiCegarLoop]: Abstraction has 32 states and 34 transitions. [2025-01-10 07:10:35,965 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-01-10 07:10:35,966 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 34 transitions. [2025-01-10 07:10:35,966 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2025-01-10 07:10:35,966 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:10:35,966 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:10:35,967 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [22, 1, 1, 1] [2025-01-10 07:10:35,967 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-01-10 07:10:35,967 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(25, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_~i~0#1, main_#t~mem3#1, main_#t~post4#1, main_#t~mem5#1, main_#t~post6#1, main_~#aa~0#1.base, main_~#aa~0#1.offset, main_~a~0#1, main_~x~0#1;call main_~#aa~0#1.base, main_~#aa~0#1.offset := #Ultimate.allocOnStack(400000);main_~a~0#1 := 0;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_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !(main_~i~0#1 < 100000);havoc main_~i~0#1;" [2025-01-10 07:10:35,967 INFO L754 eck$LassoCheckResult]: Loop: "call main_#t~mem3#1 := read~int#1(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);" "assume main_#t~mem3#1 >= 0;havoc main_#t~mem3#1;" "main_#t~post4#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" [2025-01-10 07:10:35,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:10:35,970 INFO L85 PathProgramCache]: Analyzing trace with hash -975388507, now seen corresponding path program 4 times [2025-01-10 07:10:35,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:10:35,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188813956] [2025-01-10 07:10:35,970 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 07:10:35,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:10:35,988 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-01-10 07:10:36,013 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 07:10:36,014 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 07:10:36,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:10:36,646 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:10:36,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:10:36,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188813956] [2025-01-10 07:10:36,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188813956] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 07:10:36,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [356672035] [2025-01-10 07:10:36,648 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 07:10:36,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 07:10:36,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:36,651 INFO L229 MonitoredProcess]: Starting monitored process 16 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:36,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-01-10 07:10:36,707 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-01-10 07:10:36,739 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 07:10:36,739 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 07:10:36,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:10:36,741 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-01-10 07:10:36,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:10:36,793 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:10:36,793 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 07:10:37,540 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:10:37,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [356672035] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 07:10:37,541 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 07:10:37,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 48 [2025-01-10 07:10:37,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369333919] [2025-01-10 07:10:37,541 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 07:10:37,541 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 07:10:37,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:10:37,542 INFO L85 PathProgramCache]: Analyzing trace with hash 41807, now seen corresponding path program 5 times [2025-01-10 07:10:37,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:10:37,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472938997] [2025-01-10 07:10:37,542 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 07:10:37,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:10:37,545 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:10:37,546 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:37,547 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 07:10:37,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:10:37,547 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:10:37,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:10:37,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:10:37,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:10:37,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:10:37,550 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:10:37,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:10:37,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2025-01-10 07:10:37,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2025-01-10 07:10:37,585 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. cyclomatic complexity: 5 Second operand has 49 states, 48 states have (on average 1.0625) internal successors, (51), 49 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:37,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:10:37,647 INFO L93 Difference]: Finished difference Result 56 states and 58 transitions. [2025-01-10 07:10:37,647 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 58 transitions. [2025-01-10 07:10:37,649 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2025-01-10 07:10:37,649 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 56 states and 58 transitions. [2025-01-10 07:10:37,650 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2025-01-10 07:10:37,650 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2025-01-10 07:10:37,650 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 58 transitions. [2025-01-10 07:10:37,650 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:10:37,650 INFO L218 hiAutomatonCegarLoop]: Abstraction has 56 states and 58 transitions. [2025-01-10 07:10:37,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 58 transitions. [2025-01-10 07:10:37,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-01-10 07:10:37,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 56 states have (on average 1.0357142857142858) internal successors, (58), 55 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:10:37,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2025-01-10 07:10:37,654 INFO L240 hiAutomatonCegarLoop]: Abstraction has 56 states and 58 transitions. [2025-01-10 07:10:37,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-01-10 07:10:37,656 INFO L432 stractBuchiCegarLoop]: Abstraction has 56 states and 58 transitions. [2025-01-10 07:10:37,656 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-01-10 07:10:37,656 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 58 transitions. [2025-01-10 07:10:37,657 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2025-01-10 07:10:37,657 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:10:37,657 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:10:37,658 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [46, 1, 1, 1] [2025-01-10 07:10:37,658 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-01-10 07:10:37,658 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(25, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_~i~0#1, main_#t~mem3#1, main_#t~post4#1, main_#t~mem5#1, main_#t~post6#1, main_~#aa~0#1.base, main_~#aa~0#1.offset, main_~a~0#1, main_~x~0#1;call main_~#aa~0#1.base, main_~#aa~0#1.offset := #Ultimate.allocOnStack(400000);main_~a~0#1 := 0;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_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !(main_~i~0#1 < 100000);havoc main_~i~0#1;" [2025-01-10 07:10:37,658 INFO L754 eck$LassoCheckResult]: Loop: "call main_#t~mem3#1 := read~int#1(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);" "assume main_#t~mem3#1 >= 0;havoc main_#t~mem3#1;" "main_#t~post4#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" [2025-01-10 07:10:37,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:10:37,659 INFO L85 PathProgramCache]: Analyzing trace with hash 174551205, now seen corresponding path program 5 times [2025-01-10 07:10:37,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:10:37,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794317043] [2025-01-10 07:10:37,659 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 07:10:37,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:10:37,693 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 49 statements into 24 equivalence classes. [2025-01-10 07:10:37,802 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) and asserted 49 of 49 statements. [2025-01-10 07:10:37,802 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2025-01-10 07:10:37,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:10:39,690 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:10:39,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:10:39,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794317043] [2025-01-10 07:10:39,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794317043] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 07:10:39,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1671316731] [2025-01-10 07:10:39,690 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 07:10:39,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 07:10:39,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:10:39,694 INFO L229 MonitoredProcess]: Starting monitored process 17 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,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-01-10 07:10:39,776 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 49 statements into 24 equivalence classes. [2025-01-10 07:11:10,485 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) and asserted 49 of 49 statements. [2025-01-10 07:11:10,486 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2025-01-10 07:11:10,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:11:10,504 INFO L256 TraceCheckSpWp]: Trace formula consists of 540 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-01-10 07:11:10,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:11:10,587 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:11:10,587 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 07:11:13,093 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:11:13,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1671316731] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 07:11:13,093 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 07:11:13,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2025-01-10 07:11:13,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977818941] [2025-01-10 07:11:13,093 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 07:11:13,094 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 07:11:13,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:11:13,094 INFO L85 PathProgramCache]: Analyzing trace with hash 41807, now seen corresponding path program 6 times [2025-01-10 07:11:13,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:11:13,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691038950] [2025-01-10 07:11:13,094 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 07:11:13,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:11:13,097 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:11:13,099 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:11:13,099 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-01-10 07:11:13,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:11:13,099 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:11:13,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:11:13,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:11:13,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:11:13,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:11:13,102 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:11:13,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:11:13,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2025-01-10 07:11:13,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2025-01-10 07:11:13,139 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. cyclomatic complexity: 5 Second operand has 96 states, 95 states have (on average 1.0210526315789474) internal successors, (97), 96 states have internal predecessors, (97), 0 states have call successors, (0), 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:11:13,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:11:13,284 INFO L93 Difference]: Finished difference Result 104 states and 106 transitions. [2025-01-10 07:11:13,284 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 104 states and 106 transitions. [2025-01-10 07:11:13,286 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2025-01-10 07:11:13,286 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 104 states to 104 states and 106 transitions. [2025-01-10 07:11:13,286 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2025-01-10 07:11:13,286 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2025-01-10 07:11:13,286 INFO L73 IsDeterministic]: Start isDeterministic. Operand 104 states and 106 transitions. [2025-01-10 07:11:13,287 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:11:13,287 INFO L218 hiAutomatonCegarLoop]: Abstraction has 104 states and 106 transitions. [2025-01-10 07:11:13,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states and 106 transitions. [2025-01-10 07:11:13,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2025-01-10 07:11:13,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 104 states have (on average 1.0192307692307692) internal successors, (106), 103 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:11:13,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 106 transitions. [2025-01-10 07:11:13,296 INFO L240 hiAutomatonCegarLoop]: Abstraction has 104 states and 106 transitions. [2025-01-10 07:11:13,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2025-01-10 07:11:13,297 INFO L432 stractBuchiCegarLoop]: Abstraction has 104 states and 106 transitions. [2025-01-10 07:11:13,298 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-01-10 07:11:13,298 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 104 states and 106 transitions. [2025-01-10 07:11:13,299 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2025-01-10 07:11:13,302 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:11:13,302 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:11:13,304 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [94, 1, 1, 1] [2025-01-10 07:11:13,304 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-01-10 07:11:13,304 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(25, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_~i~0#1, main_#t~mem3#1, main_#t~post4#1, main_#t~mem5#1, main_#t~post6#1, main_~#aa~0#1.base, main_~#aa~0#1.offset, main_~a~0#1, main_~x~0#1;call main_~#aa~0#1.base, main_~#aa~0#1.offset := #Ultimate.allocOnStack(400000);main_~a~0#1 := 0;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_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !(main_~i~0#1 < 100000);havoc main_~i~0#1;" [2025-01-10 07:11:13,307 INFO L754 eck$LassoCheckResult]: Loop: "call main_#t~mem3#1 := read~int#1(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4);" "assume main_#t~mem3#1 >= 0;havoc main_#t~mem3#1;" "main_#t~post4#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" [2025-01-10 07:11:13,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:11:13,307 INFO L85 PathProgramCache]: Analyzing trace with hash -397619035, now seen corresponding path program 6 times [2025-01-10 07:11:13,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:11:13,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941085293] [2025-01-10 07:11:13,308 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 07:11:13,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:11:13,367 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 97 statements into 48 equivalence classes. [2025-01-10 07:11:13,577 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 48 check-sat command(s) and asserted 97 of 97 statements. [2025-01-10 07:11:13,578 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 48 check-sat command(s) [2025-01-10 07:11:13,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:11:19,113 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:11:19,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:11:19,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941085293] [2025-01-10 07:11:19,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941085293] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 07:11:19,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [60372753] [2025-01-10 07:11:19,113 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 07:11:19,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 07:11:19,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:11:19,115 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 07:11:19,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-01-10 07:11:19,255 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 97 statements into 48 equivalence classes.