./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-crafted/Arrays01-EquivalentConstantIndices-1.c --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/termination-crafted/Arrays01-EquivalentConstantIndices-1.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-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 64bit --witnessprinter.graph.data.programhash cad2c6f6e8ebe2adcd550e4a56b83be37e52f812ae33bfb645236c6925734dbf --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 06:59:25,979 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 06:59:26,029 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2025-01-10 06:59:26,032 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 06:59:26,032 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 06:59:26,046 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 06:59:26,048 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 06:59:26,048 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 06:59:26,048 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 06:59:26,048 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 06:59:26,049 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 06:59:26,049 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 06:59:26,049 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 06:59:26,050 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-01-10 06:59:26,050 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-01-10 06:59:26,050 INFO L153 SettingsManager]: * Use old map elimination=false [2025-01-10 06:59:26,050 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-01-10 06:59:26,050 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-01-10 06:59:26,050 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-01-10 06:59:26,050 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 06:59:26,051 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-01-10 06:59:26,051 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 06:59:26,051 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 06:59:26,051 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-01-10 06:59:26,051 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-01-10 06:59:26,051 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-01-10 06:59:26,051 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 06:59:26,051 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 06:59:26,051 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-01-10 06:59:26,051 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 06:59:26,051 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 06:59:26,051 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 06:59:26,051 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:59:26,052 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 06:59:26,052 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 06:59:26,052 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-01-10 06:59:26,052 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cad2c6f6e8ebe2adcd550e4a56b83be37e52f812ae33bfb645236c6925734dbf [2025-01-10 06:59:26,374 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 06:59:26,383 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 06:59:26,385 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 06:59:26,386 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 06:59:26,386 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 06:59:26,387 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted/Arrays01-EquivalentConstantIndices-1.c [2025-01-10 06:59:27,582 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bcf385f92/d9de1d757f97430bb690423b841fd72c/FLAG44d3fd93e [2025-01-10 06:59:27,876 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 06:59:27,877 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/termination-crafted/Arrays01-EquivalentConstantIndices-1.c [2025-01-10 06:59:27,887 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bcf385f92/d9de1d757f97430bb690423b841fd72c/FLAG44d3fd93e [2025-01-10 06:59:28,173 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bcf385f92/d9de1d757f97430bb690423b841fd72c [2025-01-10 06:59:28,175 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 06:59:28,176 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 06:59:28,177 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 06:59:28,177 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 06:59:28,180 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 06:59:28,181 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:59:28" (1/1) ... [2025-01-10 06:59:28,181 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b59d556 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:59:28, skipping insertion in model container [2025-01-10 06:59:28,182 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:59:28" (1/1) ... [2025-01-10 06:59:28,190 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 06:59:28,299 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:59:28,302 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 06:59:28,314 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:59:28,325 INFO L204 MainTranslator]: Completed translation [2025-01-10 06:59:28,327 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:59:28 WrapperNode [2025-01-10 06:59:28,327 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 06:59:28,328 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 06:59:28,328 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 06:59:28,328 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 06:59:28,332 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:59:28" (1/1) ... [2025-01-10 06:59:28,336 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:59:28" (1/1) ... [2025-01-10 06:59:28,347 INFO L138 Inliner]: procedures = 8, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 29 [2025-01-10 06:59:28,347 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 06:59:28,348 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 06:59:28,348 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 06:59:28,348 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 06:59:28,353 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:59:28" (1/1) ... [2025-01-10 06:59:28,354 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:59:28" (1/1) ... [2025-01-10 06:59:28,359 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:59:28" (1/1) ... [2025-01-10 06:59:28,367 INFO L175 MemorySlicer]: Split 4 memory accesses to 1 slices as follows [4]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 2 writes are split as follows [2]. [2025-01-10 06:59:28,367 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:59:28" (1/1) ... [2025-01-10 06:59:28,367 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:59:28" (1/1) ... [2025-01-10 06:59:28,370 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:59:28" (1/1) ... [2025-01-10 06:59:28,372 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:59:28" (1/1) ... [2025-01-10 06:59:28,373 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:59:28" (1/1) ... [2025-01-10 06:59:28,376 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:59:28" (1/1) ... [2025-01-10 06:59:28,376 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:59:28" (1/1) ... [2025-01-10 06:59:28,377 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 06:59:28,378 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 06:59:28,378 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 06:59:28,378 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 06:59:28,379 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:59:28" (1/1) ... [2025-01-10 06:59:28,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:28,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:28,414 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 06:59:28,428 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 06:59:28,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 06:59:28,448 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 06:59:28,448 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 06:59:28,448 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 06:59:28,448 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-10 06:59:28,448 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 06:59:28,495 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 06:59:28,496 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 06:59:28,577 INFO L? ?]: Removed 2 outVars from TransFormulas that were not future-live. [2025-01-10 06:59:28,577 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 06:59:28,585 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 06:59:28,585 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-10 06:59:28,585 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:59:28 BoogieIcfgContainer [2025-01-10 06:59:28,585 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 06:59:28,586 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-01-10 06:59:28,586 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-01-10 06:59:28,590 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-01-10 06:59:28,591 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 06:59:28,591 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.01 06:59:28" (1/3) ... [2025-01-10 06:59:28,593 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@78d4bbd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.01 06:59:28, skipping insertion in model container [2025-01-10 06:59:28,593 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 06:59:28,593 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:59:28" (2/3) ... [2025-01-10 06:59:28,593 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@78d4bbd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.01 06:59:28, skipping insertion in model container [2025-01-10 06:59:28,594 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 06:59:28,594 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:59:28" (3/3) ... [2025-01-10 06:59:28,595 INFO L363 chiAutomizerObserver]: Analyzing ICFG Arrays01-EquivalentConstantIndices-1.c [2025-01-10 06:59:28,634 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-01-10 06:59:28,634 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-01-10 06:59:28,634 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-01-10 06:59:28,634 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-01-10 06:59:28,634 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-01-10 06:59:28,634 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-01-10 06:59:28,635 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-01-10 06:59:28,635 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-01-10 06:59:28,638 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:59:28,650 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2025-01-10 06:59:28,651 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 06:59:28,651 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 06:59:28,654 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-01-10 06:59:28,654 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-01-10 06:59:28,654 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-01-10 06:59:28,654 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:59:28,655 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2025-01-10 06:59:28,655 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 06:59:28,655 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 06:59:28,655 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-01-10 06:59:28,655 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-01-10 06:59:28,660 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~post1#1, main_~i~0#1, main_#t~mem2#1, main_#t~mem3#1, main_~#a~0#1.base, main_~#a~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4192);main_~i~0#1 := 0;" [2025-01-10 06:59:28,660 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" [2025-01-10 06:59:28,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:28,664 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2025-01-10 06:59:28,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:59:28,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815591526] [2025-01-10 06:59:28,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:59:28,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:59:28,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 06:59:28,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 06:59:28,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:28,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:28,734 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:59:28,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 06:59:28,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 06:59:28,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:28,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:28,754 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:59:28,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:28,757 INFO L85 PathProgramCache]: Analyzing trace with hash 37, now seen corresponding path program 1 times [2025-01-10 06:59:28,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:59:28,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582476876] [2025-01-10 06:59:28,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:59:28,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:59:28,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-01-10 06:59:28,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-01-10 06:59:28,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:28,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:28,772 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:59:28,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-01-10 06:59:28,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-01-10 06:59:28,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:28,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:28,782 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:59:28,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:28,784 INFO L85 PathProgramCache]: Analyzing trace with hash 29859, now seen corresponding path program 1 times [2025-01-10 06:59:28,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:59:28,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22935446] [2025-01-10 06:59:28,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:59:28,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:59:28,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 06:59:28,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 06:59:28,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:28,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:28,808 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:59:28,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 06:59:28,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 06:59:28,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:28,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:28,823 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:59:29,070 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 06:59:29,074 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 06:59:29,074 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 06:59:29,074 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 06:59:29,074 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-01-10 06:59:29,074 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:29,074 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 06:59:29,075 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 06:59:29,075 INFO L132 ssoRankerPreferences]: Filename of dumped script: Arrays01-EquivalentConstantIndices-1.c_Iteration1_Lasso [2025-01-10 06:59:29,075 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 06:59:29,075 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 06:59:29,097 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:29,210 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:29,214 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:29,217 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:29,222 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:29,224 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 06:59:29,338 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 06:59:29,342 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-01-10 06:59:29,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:29,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:29,351 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 06:59:29,363 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 06:59:29,364 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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 06:59:29,376 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 06:59:29,377 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 06:59:29,377 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 06:59:29,377 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 06:59:29,383 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 06:59:29,384 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 06:59:29,393 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 06:59:29,400 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2025-01-10 06:59:29,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:29,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:29,407 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 06:59:29,414 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 06:59:29,414 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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 06:59:29,425 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 06:59:29,425 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 06:59:29,425 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 06:59:29,426 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 06:59:29,429 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 06:59:29,430 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 06:59:29,437 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 06:59:29,446 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 06:59:29,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:29,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:29,451 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 06:59:29,456 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 06:59:29,457 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-01-10 06:59:29,467 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 06:59:29,468 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 06:59:29,468 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 06:59:29,468 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 06:59:29,470 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 06:59:29,471 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 06:59:29,475 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 06:59:29,484 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 06:59:29,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:29,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:29,489 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 06:59:29,494 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 06:59:29,495 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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 06:59:29,505 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 06:59:29,505 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 06:59:29,506 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 06:59:29,506 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 06:59:29,506 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 06:59:29,506 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 06:59:29,506 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 06:59:29,508 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 06:59:29,515 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-01-10 06:59:29,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:29,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:29,518 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 06:59:29,519 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 06:59:29,520 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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 06:59:29,532 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 06:59:29,532 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 06:59:29,532 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 06:59:29,532 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 06:59:29,544 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 06:59:29,544 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 06:59:29,558 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-01-10 06:59:29,582 INFO L443 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2025-01-10 06:59:29,584 INFO L444 ModelExtractionUtils]: 0 out of 13 variables were initially zero. Simplification set additionally 10 variables to zero. [2025-01-10 06:59:29,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 06:59:29,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:29,594 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 06:59:29,595 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 06:59:29,595 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-01-10 06:59:29,608 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-01-10 06:59:29,608 INFO L474 LassoAnalysis]: Proved termination. [2025-01-10 06:59:29,608 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#a~0#1.base)_1, ULTIMATE.start_main_~i~0#1) = 2095*v_rep(select #length ULTIMATE.start_main_~#a~0#1.base)_1 - 8*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2025-01-10 06:59:29,615 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 06:59:29,621 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2025-01-10 06:59:29,628 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-01-10 06:59:29,629 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-01-10 06:59:29,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:29,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 06:59:29,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 06:59:29,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:29,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:59:29,663 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 06:59:29,663 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:59:29,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-01-10 06:59:29,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-01-10 06:59:29,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:29,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:59:29,677 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 06:59:29,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:59:29,681 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 06:59:29,705 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 06:59:29,707 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) 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 06:59:29,731 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). 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 12 states and 16 transitions. Complement of second has 3 states. [2025-01-10 06:59:29,733 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 06:59:29,737 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 06:59:29,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 3 transitions. [2025-01-10 06:59:29,743 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 3 transitions. Stem has 2 letters. Loop has 1 letters. [2025-01-10 06:59:29,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 06:59:29,744 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 3 transitions. Stem has 3 letters. Loop has 1 letters. [2025-01-10 06:59:29,745 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 06:59:29,745 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 3 transitions. Stem has 2 letters. Loop has 2 letters. [2025-01-10 06:59:29,745 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 06:59:29,745 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 16 transitions. [2025-01-10 06:59:29,746 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-01-10 06:59:29,748 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 8 states and 10 transitions. [2025-01-10 06:59:29,749 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2025-01-10 06:59:29,750 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2025-01-10 06:59:29,750 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 10 transitions. [2025-01-10 06:59:29,750 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 06:59:29,750 INFO L218 hiAutomatonCegarLoop]: Abstraction has 8 states and 10 transitions. [2025-01-10 06:59:29,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 10 transitions. [2025-01-10 06:59:29,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 7. [2025-01-10 06:59:29,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 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 06:59:29,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2025-01-10 06:59:29,767 INFO L240 hiAutomatonCegarLoop]: Abstraction has 7 states and 9 transitions. [2025-01-10 06:59:29,767 INFO L432 stractBuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2025-01-10 06:59:29,767 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-01-10 06:59:29,767 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 9 transitions. [2025-01-10 06:59:29,767 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-01-10 06:59:29,767 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 06:59:29,767 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 06:59:29,768 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-01-10 06:59:29,768 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-01-10 06:59:29,768 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~post1#1, main_~i~0#1, main_#t~mem2#1, main_#t~mem3#1, main_~#a~0#1.base, main_~#a~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4192);main_~i~0#1 := 0;" "assume !(main_~i~0#1 < 1048);havoc main_~i~0#1;" [2025-01-10 06:59:29,768 INFO L754 eck$LassoCheckResult]: Loop: "call main_#t~mem2#1 := read~int#0(main_~#a~0#1.base, 12 + main_~#a~0#1.offset, 4);" "assume main_#t~mem2#1 >= 0;havoc main_#t~mem2#1;" "call main_#t~mem3#1 := read~int#0(main_~#a~0#1.base, 12 + main_~#a~0#1.offset, 4);call write~int#0(main_#t~mem3#1 - 1, main_~#a~0#1.base, 12 + main_~#a~0#1.offset, 4);havoc main_#t~mem3#1;" [2025-01-10 06:59:29,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:29,768 INFO L85 PathProgramCache]: Analyzing trace with hash 29861, now seen corresponding path program 1 times [2025-01-10 06:59:29,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:59:29,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034541152] [2025-01-10 06:59:29,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:59:29,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:59:29,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 06:59:29,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 06:59:29,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:29,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:59:29,805 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 06:59:29,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:59:29,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034541152] [2025-01-10 06:59:29,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034541152] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:59:29,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:59:29,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:59:29,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106310787] [2025-01-10 06:59:29,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:59:29,807 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 06:59:29,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:29,808 INFO L85 PathProgramCache]: Analyzing trace with hash 41807, now seen corresponding path program 1 times [2025-01-10 06:59:29,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:59:29,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348079280] [2025-01-10 06:59:29,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:59:29,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:59:29,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 06:59:29,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 06:59:29,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:29,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:29,814 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:59:29,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 06:59:29,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 06:59:29,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:29,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:29,818 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:59:29,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:59:29,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:59:29,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:59:29,852 INFO L87 Difference]: Start difference. First operand 7 states and 9 transitions. cyclomatic complexity: 4 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 06:59:29,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:59:29,858 INFO L93 Difference]: Finished difference Result 7 states and 8 transitions. [2025-01-10 06:59:29,858 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7 states and 8 transitions. [2025-01-10 06:59:29,858 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-01-10 06:59:29,858 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7 states to 7 states and 8 transitions. [2025-01-10 06:59:29,858 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2025-01-10 06:59:29,858 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2025-01-10 06:59:29,859 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 8 transitions. [2025-01-10 06:59:29,859 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 06:59:29,859 INFO L218 hiAutomatonCegarLoop]: Abstraction has 7 states and 8 transitions. [2025-01-10 06:59:29,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 8 transitions. [2025-01-10 06:59:29,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2025-01-10 06:59:29,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:59:29,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2025-01-10 06:59:29,860 INFO L240 hiAutomatonCegarLoop]: Abstraction has 7 states and 8 transitions. [2025-01-10 06:59:29,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:59:29,860 INFO L432 stractBuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2025-01-10 06:59:29,861 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-01-10 06:59:29,861 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 8 transitions. [2025-01-10 06:59:29,861 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-01-10 06:59:29,861 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 06:59:29,861 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 06:59:29,861 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-01-10 06:59:29,861 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-01-10 06:59:29,862 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~post1#1, main_~i~0#1, main_#t~mem2#1, main_#t~mem3#1, main_~#a~0#1.base, main_~#a~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4192);main_~i~0#1 := 0;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume !(main_~i~0#1 < 1048);havoc main_~i~0#1;" [2025-01-10 06:59:29,862 INFO L754 eck$LassoCheckResult]: Loop: "call main_#t~mem2#1 := read~int#0(main_~#a~0#1.base, 12 + main_~#a~0#1.offset, 4);" "assume main_#t~mem2#1 >= 0;havoc main_#t~mem2#1;" "call main_#t~mem3#1 := read~int#0(main_~#a~0#1.base, 12 + main_~#a~0#1.offset, 4);call write~int#0(main_#t~mem3#1 - 1, main_~#a~0#1.base, 12 + main_~#a~0#1.offset, 4);havoc main_#t~mem3#1;" [2025-01-10 06:59:29,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:29,862 INFO L85 PathProgramCache]: Analyzing trace with hash 925637, now seen corresponding path program 1 times [2025-01-10 06:59:29,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:59:29,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653274472] [2025-01-10 06:59:29,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:59:29,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:59:29,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 06:59:29,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 06:59:29,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:29,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:59:29,898 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 06:59:29,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:59:29,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653274472] [2025-01-10 06:59:29,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653274472] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:59:29,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1568634995] [2025-01-10 06:59:29,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:59:29,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:59:29,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:29,903 INFO L229 MonitoredProcess]: Starting monitored process 8 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 06:59:29,919 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-10 06:59:29,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 06:59:29,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 06:59:29,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:29,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:59:29,942 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 06:59:29,942 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:59:29,954 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 06:59:29,954 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:59:29,968 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 06:59:29,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1568634995] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:59:29,968 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:59:29,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-01-10 06:59:29,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715146193] [2025-01-10 06:59:29,969 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:59:29,969 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 06:59:29,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:29,969 INFO L85 PathProgramCache]: Analyzing trace with hash 41807, now seen corresponding path program 2 times [2025-01-10 06:59:29,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:59:29,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529985333] [2025-01-10 06:59:29,969 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:59:29,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:59:29,973 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-01-10 06:59:29,975 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 06:59:29,975 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:59:29,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:29,975 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:59:29,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 06:59:29,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 06:59:29,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:29,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:29,979 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:59:30,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:59:30,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 06:59:30,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-10 06:59:30,009 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. cyclomatic complexity: 3 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 06:59:30,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:59:30,018 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2025-01-10 06:59:30,019 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 11 transitions. [2025-01-10 06:59:30,019 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-01-10 06:59:30,019 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 10 states and 11 transitions. [2025-01-10 06:59:30,019 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2025-01-10 06:59:30,019 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2025-01-10 06:59:30,019 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 11 transitions. [2025-01-10 06:59:30,020 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 06:59:30,020 INFO L218 hiAutomatonCegarLoop]: Abstraction has 10 states and 11 transitions. [2025-01-10 06:59:30,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 11 transitions. [2025-01-10 06:59:30,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2025-01-10 06:59:30,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.1) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:59:30,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2025-01-10 06:59:30,021 INFO L240 hiAutomatonCegarLoop]: Abstraction has 10 states and 11 transitions. [2025-01-10 06:59:30,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:59:30,022 INFO L432 stractBuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2025-01-10 06:59:30,022 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-01-10 06:59:30,022 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 11 transitions. [2025-01-10 06:59:30,022 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-01-10 06:59:30,022 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 06:59:30,022 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 06:59:30,022 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 1, 1, 1] [2025-01-10 06:59:30,022 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-01-10 06:59:30,023 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~post1#1, main_~i~0#1, main_#t~mem2#1, main_#t~mem3#1, main_~#a~0#1.base, main_~#a~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4192);main_~i~0#1 := 0;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume !(main_~i~0#1 < 1048);havoc main_~i~0#1;" [2025-01-10 06:59:30,023 INFO L754 eck$LassoCheckResult]: Loop: "call main_#t~mem2#1 := read~int#0(main_~#a~0#1.base, 12 + main_~#a~0#1.offset, 4);" "assume main_#t~mem2#1 >= 0;havoc main_#t~mem2#1;" "call main_#t~mem3#1 := read~int#0(main_~#a~0#1.base, 12 + main_~#a~0#1.offset, 4);call write~int#0(main_#t~mem3#1 - 1, main_~#a~0#1.base, 12 + main_~#a~0#1.offset, 4);havoc main_#t~mem3#1;" [2025-01-10 06:59:30,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:30,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1805794469, now seen corresponding path program 2 times [2025-01-10 06:59:30,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:59:30,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262477496] [2025-01-10 06:59:30,023 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:59:30,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:59:30,028 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 7 statements into 2 equivalence classes. [2025-01-10 06:59:30,035 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 06:59:30,035 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 06:59:30,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:59:30,098 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-01-10 06:59:30,140 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 06:59:30,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:59:30,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262477496] [2025-01-10 06:59:30,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262477496] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:59:30,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1868430202] [2025-01-10 06:59:30,140 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:59:30,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:59:30,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:30,144 INFO L229 MonitoredProcess]: Starting monitored process 9 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 06:59:30,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-10 06:59:30,173 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 7 statements into 2 equivalence classes. [2025-01-10 06:59:30,181 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 06:59:30,181 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 06:59:30,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:59:30,182 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 06:59:30,182 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:59:30,195 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 06:59:30,195 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:59:30,240 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 06:59:30,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1868430202] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:59:30,241 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:59:30,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-01-10 06:59:30,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569730251] [2025-01-10 06:59:30,241 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:59:30,241 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 06:59:30,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:30,242 INFO L85 PathProgramCache]: Analyzing trace with hash 41807, now seen corresponding path program 3 times [2025-01-10 06:59:30,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:59:30,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270671726] [2025-01-10 06:59:30,242 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 06:59:30,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:59:30,245 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 3 statements into 1 equivalence classes. [2025-01-10 06:59:30,247 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 06:59:30,247 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 06:59:30,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:30,247 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:59:30,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 06:59:30,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 06:59:30,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:30,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:30,250 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:59:30,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:59:30,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 06:59:30,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-01-10 06:59:30,281 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. cyclomatic complexity: 3 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 06:59:30,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:59:30,298 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2025-01-10 06:59:30,298 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 17 transitions. [2025-01-10 06:59:30,299 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-01-10 06:59:30,299 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 17 transitions. [2025-01-10 06:59:30,299 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2025-01-10 06:59:30,299 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2025-01-10 06:59:30,299 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 17 transitions. [2025-01-10 06:59:30,300 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 06:59:30,300 INFO L218 hiAutomatonCegarLoop]: Abstraction has 16 states and 17 transitions. [2025-01-10 06:59:30,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 17 transitions. [2025-01-10 06:59:30,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2025-01-10 06:59:30,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.0625) internal successors, (17), 15 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:59:30,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2025-01-10 06:59:30,303 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16 states and 17 transitions. [2025-01-10 06:59:30,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 06:59:30,304 INFO L432 stractBuchiCegarLoop]: Abstraction has 16 states and 17 transitions. [2025-01-10 06:59:30,304 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-01-10 06:59:30,304 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 17 transitions. [2025-01-10 06:59:30,305 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-01-10 06:59:30,305 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 06:59:30,305 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 06:59:30,305 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 1, 1, 1] [2025-01-10 06:59:30,305 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-01-10 06:59:30,305 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~post1#1, main_~i~0#1, main_#t~mem2#1, main_#t~mem3#1, main_~#a~0#1.base, main_~#a~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4192);main_~i~0#1 := 0;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume !(main_~i~0#1 < 1048);havoc main_~i~0#1;" [2025-01-10 06:59:30,305 INFO L754 eck$LassoCheckResult]: Loop: "call main_#t~mem2#1 := read~int#0(main_~#a~0#1.base, 12 + main_~#a~0#1.offset, 4);" "assume main_#t~mem2#1 >= 0;havoc main_#t~mem2#1;" "call main_#t~mem3#1 := read~int#0(main_~#a~0#1.base, 12 + main_~#a~0#1.offset, 4);call write~int#0(main_#t~mem3#1 - 1, main_~#a~0#1.base, 12 + main_~#a~0#1.offset, 4);havoc main_#t~mem3#1;" [2025-01-10 06:59:30,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:30,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1496410277, now seen corresponding path program 3 times [2025-01-10 06:59:30,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:59:30,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934673311] [2025-01-10 06:59:30,305 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 06:59:30,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:59:30,315 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 13 statements into 6 equivalence classes. [2025-01-10 06:59:30,328 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 06:59:30,328 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-01-10 06:59:30,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:59:30,519 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 06:59:30,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:59:30,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934673311] [2025-01-10 06:59:30,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934673311] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:59:30,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [698906012] [2025-01-10 06:59:30,520 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 06:59:30,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:59:30,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:30,522 INFO L229 MonitoredProcess]: Starting monitored process 10 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 06:59:30,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-10 06:59:30,556 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 13 statements into 6 equivalence classes. [2025-01-10 06:59:30,604 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 06:59:30,604 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-01-10 06:59:30,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:59:30,605 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-10 06:59:30,606 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:59:30,626 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 06:59:30,627 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:59:30,802 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 06:59:30,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [698906012] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:59:30,802 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:59:30,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 24 [2025-01-10 06:59:30,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112178857] [2025-01-10 06:59:30,803 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:59:30,803 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 06:59:30,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:30,803 INFO L85 PathProgramCache]: Analyzing trace with hash 41807, now seen corresponding path program 4 times [2025-01-10 06:59:30,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:59:30,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824597877] [2025-01-10 06:59:30,803 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 06:59:30,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:59:30,807 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 3 statements into 2 equivalence classes. [2025-01-10 06:59:30,808 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 06:59:30,809 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 06:59:30,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:30,809 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:59:30,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 06:59:30,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 06:59:30,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:30,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:30,812 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:59:30,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:59:30,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-01-10 06:59:30,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2025-01-10 06:59:30,848 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. cyclomatic complexity: 3 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 06:59:30,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:59:30,891 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2025-01-10 06:59:30,891 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 29 transitions. [2025-01-10 06:59:30,892 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-01-10 06:59:30,892 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 28 states and 29 transitions. [2025-01-10 06:59:30,894 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2025-01-10 06:59:30,894 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2025-01-10 06:59:30,894 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 29 transitions. [2025-01-10 06:59:30,894 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 06:59:30,894 INFO L218 hiAutomatonCegarLoop]: Abstraction has 28 states and 29 transitions. [2025-01-10 06:59:30,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 29 transitions. [2025-01-10 06:59:30,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-01-10 06:59:30,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 27 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:59:30,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2025-01-10 06:59:30,895 INFO L240 hiAutomatonCegarLoop]: Abstraction has 28 states and 29 transitions. [2025-01-10 06:59:30,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-01-10 06:59:30,897 INFO L432 stractBuchiCegarLoop]: Abstraction has 28 states and 29 transitions. [2025-01-10 06:59:30,897 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-01-10 06:59:30,897 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 29 transitions. [2025-01-10 06:59:30,897 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-01-10 06:59:30,898 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 06:59:30,898 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 06:59:30,898 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [22, 1, 1, 1] [2025-01-10 06:59:30,898 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-01-10 06:59:30,898 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~post1#1, main_~i~0#1, main_#t~mem2#1, main_#t~mem3#1, main_~#a~0#1.base, main_~#a~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4192);main_~i~0#1 := 0;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume !(main_~i~0#1 < 1048);havoc main_~i~0#1;" [2025-01-10 06:59:30,898 INFO L754 eck$LassoCheckResult]: Loop: "call main_#t~mem2#1 := read~int#0(main_~#a~0#1.base, 12 + main_~#a~0#1.offset, 4);" "assume main_#t~mem2#1 >= 0;havoc main_#t~mem2#1;" "call main_#t~mem3#1 := read~int#0(main_~#a~0#1.base, 12 + main_~#a~0#1.offset, 4);call write~int#0(main_#t~mem3#1 - 1, main_~#a~0#1.base, 12 + main_~#a~0#1.offset, 4);havoc main_#t~mem3#1;" [2025-01-10 06:59:30,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:30,900 INFO L85 PathProgramCache]: Analyzing trace with hash -975388507, now seen corresponding path program 4 times [2025-01-10 06:59:30,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:59:30,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675916799] [2025-01-10 06:59:30,901 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 06:59:30,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:59:30,919 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-01-10 06:59:30,947 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 06:59:30,947 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 06:59:30,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:59:31,462 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 06:59:31,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:59:31,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675916799] [2025-01-10 06:59:31,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675916799] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:59:31,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1506350831] [2025-01-10 06:59:31,463 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 06:59:31,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:59:31,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:31,470 INFO L229 MonitoredProcess]: Starting monitored process 11 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 06:59:31,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-01-10 06:59:31,553 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-01-10 06:59:31,610 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 06:59:31,610 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 06:59:31,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:59:31,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-01-10 06:59:31,623 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:59:31,727 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 06:59:31,727 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:59:32,538 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 06:59:32,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1506350831] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:59:32,538 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:59:32,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 48 [2025-01-10 06:59:32,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834301346] [2025-01-10 06:59:32,539 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:59:32,539 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 06:59:32,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:32,539 INFO L85 PathProgramCache]: Analyzing trace with hash 41807, now seen corresponding path program 5 times [2025-01-10 06:59:32,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:59:32,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477564353] [2025-01-10 06:59:32,540 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 06:59:32,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:59:32,543 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-01-10 06:59:32,545 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 06:59:32,546 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:59:32,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:32,546 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:59:32,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 06:59:32,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 06:59:32,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:59:32,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:59:32,549 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:59:32,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:59:32,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2025-01-10 06:59:32,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2025-01-10 06:59:32,582 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. cyclomatic complexity: 3 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 06:59:32,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:59:32,637 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2025-01-10 06:59:32,637 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 52 states and 53 transitions. [2025-01-10 06:59:32,638 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-01-10 06:59:32,638 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 52 states to 52 states and 53 transitions. [2025-01-10 06:59:32,638 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2025-01-10 06:59:32,638 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2025-01-10 06:59:32,638 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 53 transitions. [2025-01-10 06:59:32,639 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 06:59:32,639 INFO L218 hiAutomatonCegarLoop]: Abstraction has 52 states and 53 transitions. [2025-01-10 06:59:32,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 53 transitions. [2025-01-10 06:59:32,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2025-01-10 06:59:32,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 52 states have (on average 1.0192307692307692) internal successors, (53), 51 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:59:32,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2025-01-10 06:59:32,641 INFO L240 hiAutomatonCegarLoop]: Abstraction has 52 states and 53 transitions. [2025-01-10 06:59:32,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-01-10 06:59:32,641 INFO L432 stractBuchiCegarLoop]: Abstraction has 52 states and 53 transitions. [2025-01-10 06:59:32,642 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-01-10 06:59:32,642 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 53 transitions. [2025-01-10 06:59:32,642 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-01-10 06:59:32,642 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 06:59:32,642 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 06:59:32,643 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [46, 1, 1, 1] [2025-01-10 06:59:32,643 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-01-10 06:59:32,643 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~post1#1, main_~i~0#1, main_#t~mem2#1, main_#t~mem3#1, main_~#a~0#1.base, main_~#a~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4192);main_~i~0#1 := 0;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume !(main_~i~0#1 < 1048);havoc main_~i~0#1;" [2025-01-10 06:59:32,643 INFO L754 eck$LassoCheckResult]: Loop: "call main_#t~mem2#1 := read~int#0(main_~#a~0#1.base, 12 + main_~#a~0#1.offset, 4);" "assume main_#t~mem2#1 >= 0;havoc main_#t~mem2#1;" "call main_#t~mem3#1 := read~int#0(main_~#a~0#1.base, 12 + main_~#a~0#1.offset, 4);call write~int#0(main_#t~mem3#1 - 1, main_~#a~0#1.base, 12 + main_~#a~0#1.offset, 4);havoc main_#t~mem3#1;" [2025-01-10 06:59:32,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:59:32,644 INFO L85 PathProgramCache]: Analyzing trace with hash 174551205, now seen corresponding path program 5 times [2025-01-10 06:59:32,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:59:32,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207199807] [2025-01-10 06:59:32,644 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 06:59:32,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:59:32,664 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 49 statements into 24 equivalence classes. [2025-01-10 06:59:32,740 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) and asserted 49 of 49 statements. [2025-01-10 06:59:32,747 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2025-01-10 06:59:32,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:59:34,657 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 06:59:34,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:59:34,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207199807] [2025-01-10 06:59:34,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207199807] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:59:34,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1497133708] [2025-01-10 06:59:34,662 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 06:59:34,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:59:34,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:59:34,664 INFO L229 MonitoredProcess]: Starting monitored process 12 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 06:59:34,666 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-01-10 06:59:34,744 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 49 statements into 24 equivalence classes. [2025-01-10 07:00:03,520 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) and asserted 49 of 49 statements. [2025-01-10 07:00:03,521 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2025-01-10 07:00:03,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:00:03,541 INFO L256 TraceCheckSpWp]: Trace formula consists of 526 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-01-10 07:00:03,546 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:00:03,628 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:00:03,628 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 07:00:06,026 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:00:06,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1497133708] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 07:00:06,026 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 07:00:06,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2025-01-10 07:00:06,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800023765] [2025-01-10 07:00:06,026 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 07:00:06,027 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 07:00:06,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:00:06,027 INFO L85 PathProgramCache]: Analyzing trace with hash 41807, now seen corresponding path program 6 times [2025-01-10 07:00:06,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:00:06,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364756770] [2025-01-10 07:00:06,027 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 07:00:06,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:00:06,032 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:00:06,033 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:00:06,033 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-01-10 07:00:06,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:00:06,033 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:00:06,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:00:06,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:00:06,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:00:06,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:00:06,037 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:00:06,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:00:06,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2025-01-10 07:00:06,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2025-01-10 07:00:06,070 INFO L87 Difference]: Start difference. First operand 52 states and 53 transitions. cyclomatic complexity: 3 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:00:06,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:00:06,188 INFO L93 Difference]: Finished difference Result 100 states and 101 transitions. [2025-01-10 07:00:06,188 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 100 states and 101 transitions. [2025-01-10 07:00:06,189 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-01-10 07:00:06,194 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 100 states to 100 states and 101 transitions. [2025-01-10 07:00:06,194 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2025-01-10 07:00:06,194 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2025-01-10 07:00:06,194 INFO L73 IsDeterministic]: Start isDeterministic. Operand 100 states and 101 transitions. [2025-01-10 07:00:06,194 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:00:06,194 INFO L218 hiAutomatonCegarLoop]: Abstraction has 100 states and 101 transitions. [2025-01-10 07:00:06,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states and 101 transitions. [2025-01-10 07:00:06,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2025-01-10 07:00:06,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 100 states have (on average 1.01) internal successors, (101), 99 states have internal predecessors, (101), 0 states have call successors, (0), 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:00:06,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 101 transitions. [2025-01-10 07:00:06,197 INFO L240 hiAutomatonCegarLoop]: Abstraction has 100 states and 101 transitions. [2025-01-10 07:00:06,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2025-01-10 07:00:06,200 INFO L432 stractBuchiCegarLoop]: Abstraction has 100 states and 101 transitions. [2025-01-10 07:00:06,200 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-01-10 07:00:06,200 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 100 states and 101 transitions. [2025-01-10 07:00:06,201 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-01-10 07:00:06,204 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:00:06,204 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:00:06,206 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [94, 1, 1, 1] [2025-01-10 07:00:06,207 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-01-10 07:00:06,207 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~post1#1, main_~i~0#1, main_#t~mem2#1, main_#t~mem3#1, main_~#a~0#1.base, main_~#a~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4192);main_~i~0#1 := 0;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume main_~i~0#1 < 1048;havoc main_#t~nondet0#1;call write~int#0(main_#t~nondet0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet0#1;main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" "assume !(main_~i~0#1 < 1048);havoc main_~i~0#1;" [2025-01-10 07:00:06,207 INFO L754 eck$LassoCheckResult]: Loop: "call main_#t~mem2#1 := read~int#0(main_~#a~0#1.base, 12 + main_~#a~0#1.offset, 4);" "assume main_#t~mem2#1 >= 0;havoc main_#t~mem2#1;" "call main_#t~mem3#1 := read~int#0(main_~#a~0#1.base, 12 + main_~#a~0#1.offset, 4);call write~int#0(main_#t~mem3#1 - 1, main_~#a~0#1.base, 12 + main_~#a~0#1.offset, 4);havoc main_#t~mem3#1;" [2025-01-10 07:00:06,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:00:06,208 INFO L85 PathProgramCache]: Analyzing trace with hash -397619035, now seen corresponding path program 6 times [2025-01-10 07:00:06,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:00:06,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639454588] [2025-01-10 07:00:06,208 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 07:00:06,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:00:06,263 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 97 statements into 48 equivalence classes. [2025-01-10 07:00:06,422 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 48 check-sat command(s) and asserted 97 of 97 statements. [2025-01-10 07:00:06,422 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 48 check-sat command(s) [2025-01-10 07:00:06,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:00:11,142 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:00:11,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:00:11,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639454588] [2025-01-10 07:00:11,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639454588] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 07:00:11,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [660643922] [2025-01-10 07:00:11,143 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 07:00:11,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 07:00:11,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:00:11,145 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:00:11,146 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:00:11,291 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 97 statements into 48 equivalence classes.