./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-industry-pattern/array_monotonic.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/array-industry-pattern/array_monotonic.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5e947ce3cb6be538c3110154d89a790a98803ec545aa8464d99fb543118ea442 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 14:28:16,084 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 14:28:16,132 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2025-02-08 14:28:16,135 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 14:28:16,136 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 14:28:16,136 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-02-08 14:28:16,154 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 14:28:16,156 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 14:28:16,156 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 14:28:16,157 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 14:28:16,157 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 14:28:16,157 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 14:28:16,158 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 14:28:16,158 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 14:28:16,158 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-02-08 14:28:16,158 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-02-08 14:28:16,158 INFO L153 SettingsManager]: * Use old map elimination=false [2025-02-08 14:28:16,158 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-02-08 14:28:16,158 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-02-08 14:28:16,158 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-02-08 14:28:16,158 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 14:28:16,158 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-02-08 14:28:16,159 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 14:28:16,159 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 14:28:16,159 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 14:28:16,159 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 14:28:16,159 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-02-08 14:28:16,159 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-02-08 14:28:16,159 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-02-08 14:28:16,159 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 14:28:16,159 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 14:28:16,159 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 14:28:16,160 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-02-08 14:28:16,160 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 14:28:16,160 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 14:28:16,160 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 14:28:16,160 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 14:28:16,160 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 14:28:16,160 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 14:28:16,161 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-02-08 14:28:16,161 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5e947ce3cb6be538c3110154d89a790a98803ec545aa8464d99fb543118ea442 [2025-02-08 14:28:16,423 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 14:28:16,427 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 14:28:16,429 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 14:28:16,429 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 14:28:16,430 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 14:28:16,430 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-industry-pattern/array_monotonic.i [2025-02-08 14:28:17,507 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9cace032d/9dcd6166fa104745b9be30cc1f424745/FLAG89f64f418 [2025-02-08 14:28:17,714 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 14:28:17,715 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-industry-pattern/array_monotonic.i [2025-02-08 14:28:17,720 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9cace032d/9dcd6166fa104745b9be30cc1f424745/FLAG89f64f418 [2025-02-08 14:28:18,075 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9cace032d/9dcd6166fa104745b9be30cc1f424745 [2025-02-08 14:28:18,077 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 14:28:18,078 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 14:28:18,080 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 14:28:18,081 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 14:28:18,083 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 14:28:18,084 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:28:18" (1/1) ... [2025-02-08 14:28:18,085 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76360ec0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:28:18, skipping insertion in model container [2025-02-08 14:28:18,085 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:28:18" (1/1) ... [2025-02-08 14:28:18,097 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 14:28:18,216 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 14:28:18,225 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 14:28:18,260 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 14:28:18,293 INFO L204 MainTranslator]: Completed translation [2025-02-08 14:28:18,293 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:28:18 WrapperNode [2025-02-08 14:28:18,294 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 14:28:18,294 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 14:28:18,294 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 14:28:18,294 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 14:28:18,298 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:28:18" (1/1) ... [2025-02-08 14:28:18,319 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:28:18" (1/1) ... [2025-02-08 14:28:18,333 INFO L138 Inliner]: procedures = 16, calls = 17, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 42 [2025-02-08 14:28:18,338 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 14:28:18,338 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 14:28:18,338 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 14:28:18,338 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 14:28:18,353 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:28:18" (1/1) ... [2025-02-08 14:28:18,353 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:28:18" (1/1) ... [2025-02-08 14:28:18,358 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:28:18" (1/1) ... [2025-02-08 14:28:18,390 INFO L175 MemorySlicer]: Split 7 memory accesses to 3 slices as follows [2, 2, 3]. 43 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2025-02-08 14:28:18,390 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:28:18" (1/1) ... [2025-02-08 14:28:18,390 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:28:18" (1/1) ... [2025-02-08 14:28:18,393 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:28:18" (1/1) ... [2025-02-08 14:28:18,393 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:28:18" (1/1) ... [2025-02-08 14:28:18,394 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:28:18" (1/1) ... [2025-02-08 14:28:18,394 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:28:18" (1/1) ... [2025-02-08 14:28:18,397 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 14:28:18,398 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 14:28:18,398 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 14:28:18,398 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 14:28:18,399 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:28:18" (1/1) ... [2025-02-08 14:28:18,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:28:18,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:28:18,428 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:28:18,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-02-08 14:28:18,450 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 14:28:18,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 14:28:18,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 14:28:18,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 14:28:18,450 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 14:28:18,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 14:28:18,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 14:28:18,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 14:28:18,451 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 14:28:18,451 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 14:28:18,451 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 14:28:18,451 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 14:28:18,451 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 14:28:18,451 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 14:28:18,497 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 14:28:18,499 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 14:28:18,604 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2025-02-08 14:28:18,604 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 14:28:18,610 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 14:28:18,610 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 14:28:18,610 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:28:18 BoogieIcfgContainer [2025-02-08 14:28:18,610 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 14:28:18,611 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-02-08 14:28:18,611 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-02-08 14:28:18,615 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-02-08 14:28:18,615 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-08 14:28:18,615 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 08.02 02:28:18" (1/3) ... [2025-02-08 14:28:18,616 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5a9dc448 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.02 02:28:18, skipping insertion in model container [2025-02-08 14:28:18,616 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-08 14:28:18,616 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:28:18" (2/3) ... [2025-02-08 14:28:18,616 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5a9dc448 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.02 02:28:18, skipping insertion in model container [2025-02-08 14:28:18,616 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-08 14:28:18,616 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:28:18" (3/3) ... [2025-02-08 14:28:18,617 INFO L363 chiAutomizerObserver]: Analyzing ICFG array_monotonic.i [2025-02-08 14:28:18,647 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-02-08 14:28:18,647 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-02-08 14:28:18,647 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-02-08 14:28:18,647 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-02-08 14:28:18,647 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-02-08 14:28:18,648 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-02-08 14:28:18,648 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-02-08 14:28:18,648 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-02-08 14:28:18,651 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:28:18,660 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2025-02-08 14:28:18,661 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:28:18,661 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:28:18,663 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-02-08 14:28:18,663 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-08 14:28:18,663 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-02-08 14:28:18,663 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:28:18,664 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2025-02-08 14:28:18,664 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:28:18,664 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:28:18,664 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-02-08 14:28:18,664 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-08 14:28:18,668 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0;" [2025-02-08 14:28:18,668 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int#1(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);" "main_~i~0#1 := 2 + main_~i~0#1;" [2025-02-08 14:28:18,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:28:18,671 INFO L85 PathProgramCache]: Analyzing trace with hash 47, now seen corresponding path program 1 times [2025-02-08 14:28:18,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:28:18,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266902849] [2025-02-08 14:28:18,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:28:18,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:28:18,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:28:18,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:28:18,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:28:18,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:28:18,770 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:28:18,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:28:18,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:28:18,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:28:18,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:28:18,820 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:28:18,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:28:18,826 INFO L85 PathProgramCache]: Analyzing trace with hash 44621, now seen corresponding path program 1 times [2025-02-08 14:28:18,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:28:18,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117245332] [2025-02-08 14:28:18,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:28:18,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:28:18,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:28:18,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:28:18,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:28:18,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:28:18,852 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:28:18,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:28:18,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:28:18,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:28:18,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:28:18,865 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:28:18,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:28:18,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1415007, now seen corresponding path program 1 times [2025-02-08 14:28:18,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:28:18,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698708858] [2025-02-08 14:28:18,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:28:18,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:28:18,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:28:18,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:28:18,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:28:18,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:28:18,907 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:28:18,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:28:18,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:28:18,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:28:18,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:28:18,926 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:28:19,346 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:28:19,346 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:28:19,346 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:28:19,347 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:28:19,347 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-08 14:28:19,347 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:28:19,347 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:28:19,347 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:28:19,347 INFO L132 ssoRankerPreferences]: Filename of dumped script: array_monotonic.i_Iteration1_Lasso [2025-02-08 14:28:19,347 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:28:19,347 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:28:19,399 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:19,429 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:19,432 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:19,635 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:19,637 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:19,640 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:19,642 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:19,829 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:28:19,831 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-08 14:28:19,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:28:19,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:28:19,835 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:28:19,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-02-08 14:28:19,838 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:28:19,849 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:28:19,849 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:28:19,849 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:28:19,850 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:28:19,858 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:28:19,858 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:28:19,865 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:28:19,879 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2025-02-08 14:28:19,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:28:19,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:28:19,881 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:28:19,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-02-08 14:28:19,884 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:28:19,894 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:28:19,894 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:28:19,894 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:28:19,894 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:28:19,896 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:28:19,896 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:28:19,900 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:28:19,905 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-02-08 14:28:19,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:28:19,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:28:19,909 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:28:19,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-02-08 14:28:19,913 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:28:19,922 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:28:19,923 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:28:19,923 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:28:19,923 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:28:19,923 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:28:19,924 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:28:19,924 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:28:19,926 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:28:19,931 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-02-08 14:28:19,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:28:19,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:28:19,934 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:28:19,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-02-08 14:28:19,938 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:28:19,947 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:28:19,948 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:28:19,948 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:28:19,948 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:28:19,952 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:28:19,952 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:28:19,956 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:28:19,961 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-02-08 14:28:19,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:28:19,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:28:19,963 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:28:19,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-02-08 14:28:19,967 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:28:19,976 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:28:19,977 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:28:19,977 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:28:19,977 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:28:19,979 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:28:19,979 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:28:19,983 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:28:19,988 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-02-08 14:28:19,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:28:19,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:28:19,991 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:28:19,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-02-08 14:28:19,994 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:28:20,003 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:28:20,004 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:28:20,004 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:28:20,004 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:28:20,010 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:28:20,011 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:28:20,016 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:28:20,026 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-02-08 14:28:20,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:28:20,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:28:20,029 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:28:20,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-02-08 14:28:20,031 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:28:20,041 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:28:20,041 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:28:20,041 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:28:20,041 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:28:20,043 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:28:20,043 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:28:20,046 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:28:20,052 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-02-08 14:28:20,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:28:20,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:28:20,054 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:28:20,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-02-08 14:28:20,057 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:28:20,067 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:28:20,067 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:28:20,067 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:28:20,067 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:28:20,069 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:28:20,069 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:28:20,073 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:28:20,079 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-02-08 14:28:20,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:28:20,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:28:20,081 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:28:20,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-02-08 14:28:20,084 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:28:20,093 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:28:20,094 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:28:20,094 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:28:20,094 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:28:20,094 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:28:20,094 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:28:20,094 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:28:20,095 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:28:20,101 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-02-08 14:28:20,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:28:20,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:28:20,103 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:28:20,105 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-02-08 14:28:20,105 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:28:20,115 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:28:20,115 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:28:20,115 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:28:20,115 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:28:20,117 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:28:20,117 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:28:20,120 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:28:20,126 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-02-08 14:28:20,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:28:20,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:28:20,129 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:28:20,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-02-08 14:28:20,131 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:28:20,141 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:28:20,141 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:28:20,141 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:28:20,141 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:28:20,144 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:28:20,144 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:28:20,149 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:28:20,154 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-02-08 14:28:20,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:28:20,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:28:20,156 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:28:20,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-02-08 14:28:20,158 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:28:20,167 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:28:20,167 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:28:20,167 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:28:20,167 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:28:20,171 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:28:20,172 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:28:20,179 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-08 14:28:20,213 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2025-02-08 14:28:20,214 INFO L444 ModelExtractionUtils]: 1 out of 19 variables were initially zero. Simplification set additionally 15 variables to zero. [2025-02-08 14:28:20,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:28:20,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:28:20,218 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:28:20,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-02-08 14:28:20,230 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-08 14:28:20,243 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-02-08 14:28:20,244 INFO L474 LassoAnalysis]: Proved termination. [2025-02-08 14:28:20,244 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1, v_rep(select #length ULTIMATE.start_main_~#b~0#1.base)_1) = -1*ULTIMATE.start_main_~i~0#1 + 25000*v_rep(select #length ULTIMATE.start_main_~#b~0#1.base)_1 Supporting invariants [] [2025-02-08 14:28:20,250 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-02-08 14:28:20,416 INFO L156 tatePredicateManager]: 8 out of 8 supporting invariants were superfluous and have been removed [2025-02-08 14:28:20,433 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-02-08 14:28:20,436 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-02-08 14:28:20,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:28:20,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:28:20,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:28:20,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:28:20,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:28:20,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 14:28:20,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:28:20,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:28:20,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:28:20,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:28:20,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:28:20,587 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 14:28:20,587 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:28:20,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:28:20,806 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-02-08 14:28:20,807 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:28:20,852 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2025-02-08 14:28:20,892 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 22 states and 33 transitions. Complement of second has 9 states. [2025-02-08 14:28:20,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2025-02-08 14:28:20,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:28:20,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 7 transitions. [2025-02-08 14:28:20,907 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 7 transitions. Stem has 1 letters. Loop has 3 letters. [2025-02-08 14:28:20,907 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:28:20,907 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 7 transitions. Stem has 4 letters. Loop has 3 letters. [2025-02-08 14:28:20,907 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:28:20,907 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 7 transitions. Stem has 1 letters. Loop has 6 letters. [2025-02-08 14:28:20,908 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:28:20,908 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 33 transitions. [2025-02-08 14:28:20,913 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2025-02-08 14:28:20,916 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 19 states and 28 transitions. [2025-02-08 14:28:20,916 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2025-02-08 14:28:20,916 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2025-02-08 14:28:20,917 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 28 transitions. [2025-02-08 14:28:20,918 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:28:20,918 INFO L218 hiAutomatonCegarLoop]: Abstraction has 19 states and 28 transitions. [2025-02-08 14:28:20,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 28 transitions. [2025-02-08 14:28:20,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2025-02-08 14:28:20,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 16 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:28:20,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 26 transitions. [2025-02-08 14:28:20,938 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17 states and 26 transitions. [2025-02-08 14:28:20,938 INFO L432 stractBuchiCegarLoop]: Abstraction has 17 states and 26 transitions. [2025-02-08 14:28:20,938 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-02-08 14:28:20,938 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 26 transitions. [2025-02-08 14:28:20,939 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2025-02-08 14:28:20,939 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:28:20,940 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:28:20,940 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-02-08 14:28:20,940 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-08 14:28:20,941 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0;" "assume !(main_~i~0#1 < 100000);main_~i~0#1 := 0;" [2025-02-08 14:28:20,941 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < 100000;call main_#t~mem3#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem3#1);havoc main_#t~mem3#1;" "main_~i~0#1 := 2 + main_~i~0#1;" [2025-02-08 14:28:20,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:28:20,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1468, now seen corresponding path program 1 times [2025-02-08 14:28:20,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:28:20,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138227532] [2025-02-08 14:28:20,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:28:20,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:28:20,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:28:20,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:28:20,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:28:20,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:28:20,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:28:20,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:28:20,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138227532] [2025-02-08 14:28:20,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138227532] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:28:20,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:28:20,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 14:28:20,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114768297] [2025-02-08 14:28:20,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:28:20,998 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-08 14:28:20,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:28:20,999 INFO L85 PathProgramCache]: Analyzing trace with hash 39681, now seen corresponding path program 1 times [2025-02-08 14:28:20,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:28:20,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188384858] [2025-02-08 14:28:20,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:28:20,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:28:21,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:28:21,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:28:21,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:28:21,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:28:21,010 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:28:21,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:28:21,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:28:21,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:28:21,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:28:21,018 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:28:21,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:28:21,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:28:21,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 14:28:21,070 INFO L87 Difference]: Start difference. First operand 17 states and 26 transitions. cyclomatic complexity: 12 Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:28:21,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:28:21,091 INFO L93 Difference]: Finished difference Result 27 states and 35 transitions. [2025-02-08 14:28:21,091 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 35 transitions. [2025-02-08 14:28:21,091 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2025-02-08 14:28:21,092 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 25 states and 33 transitions. [2025-02-08 14:28:21,092 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2025-02-08 14:28:21,092 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2025-02-08 14:28:21,092 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 33 transitions. [2025-02-08 14:28:21,092 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:28:21,092 INFO L218 hiAutomatonCegarLoop]: Abstraction has 25 states and 33 transitions. [2025-02-08 14:28:21,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 33 transitions. [2025-02-08 14:28:21,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 15. [2025-02-08 14:28:21,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:28:21,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 21 transitions. [2025-02-08 14:28:21,093 INFO L240 hiAutomatonCegarLoop]: Abstraction has 15 states and 21 transitions. [2025-02-08 14:28:21,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:28:21,096 INFO L432 stractBuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2025-02-08 14:28:21,096 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-02-08 14:28:21,096 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 21 transitions. [2025-02-08 14:28:21,097 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2025-02-08 14:28:21,097 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:28:21,097 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:28:21,097 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-02-08 14:28:21,097 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-08 14:28:21,097 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" [2025-02-08 14:28:21,097 INFO L754 eck$LassoCheckResult]: Loop: "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" [2025-02-08 14:28:21,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:28:21,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1472, now seen corresponding path program 1 times [2025-02-08 14:28:21,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:28:21,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270189138] [2025-02-08 14:28:21,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:28:21,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:28:21,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:28:21,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:28:21,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:28:21,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:28:21,116 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:28:21,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:28:21,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:28:21,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:28:21,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:28:21,123 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:28:21,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:28:21,124 INFO L85 PathProgramCache]: Analyzing trace with hash 43632, now seen corresponding path program 1 times [2025-02-08 14:28:21,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:28:21,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841454680] [2025-02-08 14:28:21,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:28:21,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:28:21,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:28:21,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:28:21,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:28:21,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:28:21,128 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:28:21,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:28:21,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:28:21,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:28:21,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:28:21,132 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:28:21,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:28:21,132 INFO L85 PathProgramCache]: Analyzing trace with hash 43866193, now seen corresponding path program 1 times [2025-02-08 14:28:21,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:28:21,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887225214] [2025-02-08 14:28:21,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:28:21,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:28:21,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 14:28:21,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 14:28:21,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:28:21,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:28:21,155 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:28:21,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 14:28:21,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 14:28:21,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:28:21,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:28:21,171 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:28:21,445 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:28:21,445 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:28:21,446 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:28:21,446 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:28:21,446 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-08 14:28:21,446 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:28:21,446 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:28:21,446 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:28:21,446 INFO L132 ssoRankerPreferences]: Filename of dumped script: array_monotonic.i_Iteration3_Lasso [2025-02-08 14:28:21,446 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:28:21,446 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:28:21,447 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:21,451 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:21,453 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:21,454 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:21,463 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:21,465 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:21,628 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:21,791 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:28:21,791 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-08 14:28:21,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:28:21,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:28:21,793 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:28:21,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-02-08 14:28:21,796 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:28:21,806 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:28:21,807 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:28:21,807 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:28:21,807 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:28:21,807 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:28:21,807 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:28:21,808 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:28:21,810 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:28:21,816 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-02-08 14:28:21,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:28:21,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:28:21,818 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:28:21,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-02-08 14:28:21,821 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:28:21,832 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:28:21,832 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:28:21,832 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:28:21,832 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:28:21,832 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:28:21,833 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:28:21,833 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:28:21,834 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:28:21,840 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2025-02-08 14:28:21,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:28:21,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:28:21,842 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:28:21,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-02-08 14:28:21,845 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:28:21,854 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:28:21,855 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:28:21,855 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:28:21,855 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:28:21,855 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:28:21,856 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:28:21,856 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:28:21,857 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:28:21,862 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-02-08 14:28:21,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:28:21,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:28:21,865 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:28:21,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-02-08 14:28:21,870 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:28:21,880 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:28:21,880 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:28:21,880 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:28:21,880 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:28:21,881 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:28:21,882 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:28:21,884 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:28:21,890 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2025-02-08 14:28:21,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:28:21,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:28:21,892 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:28:21,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-02-08 14:28:21,895 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:28:21,906 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:28:21,906 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:28:21,906 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:28:21,906 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:28:21,907 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:28:21,907 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:28:21,909 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:28:21,915 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2025-02-08 14:28:21,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:28:21,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:28:21,917 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:28:21,919 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-02-08 14:28:21,920 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:28:21,930 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:28:21,930 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:28:21,930 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:28:21,930 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:28:21,931 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:28:21,931 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:28:21,933 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:28:21,939 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2025-02-08 14:28:21,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:28:21,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:28:21,941 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:28:21,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-02-08 14:28:21,944 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:28:21,954 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:28:21,954 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:28:21,954 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:28:21,954 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:28:21,956 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:28:21,956 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:28:21,959 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:28:21,964 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-02-08 14:28:21,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:28:21,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:28:21,967 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:28:21,968 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-02-08 14:28:21,969 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:28:21,979 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:28:21,979 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:28:21,979 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:28:21,979 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:28:21,981 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:28:21,981 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:28:21,986 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:28:21,992 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2025-02-08 14:28:21,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:28:21,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:28:21,994 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:28:21,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-02-08 14:28:21,995 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:28:22,005 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:28:22,005 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:28:22,005 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-02-08 14:28:22,005 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:28:22,009 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2025-02-08 14:28:22,009 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-02-08 14:28:22,018 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:28:22,024 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2025-02-08 14:28:22,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:28:22,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:28:22,026 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:28:22,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-02-08 14:28:22,028 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:28:22,037 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:28:22,037 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:28:22,037 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:28:22,037 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:28:22,038 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:28:22,038 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:28:22,041 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:28:22,047 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2025-02-08 14:28:22,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:28:22,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:28:22,049 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:28:22,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-02-08 14:28:22,051 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:28:22,061 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:28:22,061 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:28:22,061 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:28:22,061 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:28:22,062 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:28:22,062 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:28:22,065 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:28:22,071 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2025-02-08 14:28:22,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:28:22,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:28:22,074 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:28:22,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-02-08 14:28:22,076 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:28:22,086 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:28:22,086 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:28:22,086 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:28:22,086 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:28:22,088 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:28:22,088 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:28:22,094 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:28:22,100 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2025-02-08 14:28:22,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:28:22,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:28:22,103 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:28:22,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-02-08 14:28:22,105 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:28:22,115 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:28:22,115 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:28:22,115 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:28:22,115 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:28:22,118 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:28:22,118 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:28:22,123 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-08 14:28:22,133 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-02-08 14:28:22,133 INFO L444 ModelExtractionUtils]: 3 out of 13 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-02-08 14:28:22,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:28:22,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:28:22,135 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:28:22,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2025-02-08 14:28:22,138 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-08 14:28:22,148 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-02-08 14:28:22,149 INFO L474 LassoAnalysis]: Proved termination. [2025-02-08 14:28:22,149 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#a~0#1.base)_2, ULTIMATE.start_main_~i~0#1) = 49999*v_rep(select #length ULTIMATE.start_main_~#a~0#1.base)_2 - 2*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2025-02-08 14:28:22,156 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2025-02-08 14:28:22,172 INFO L156 tatePredicateManager]: 8 out of 8 supporting invariants were superfluous and have been removed [2025-02-08 14:28:22,173 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-02-08 14:28:22,173 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-02-08 14:28:22,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:28:22,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:28:22,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:28:22,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:28:22,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:28:22,198 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 14:28:22,198 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:28:22,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:28:22,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:28:22,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:28:22,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:28:22,207 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 14:28:22,207 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:28:22,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:28:22,220 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-02-08 14:28:22,220 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 21 transitions. cyclomatic complexity: 9 Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:28:22,240 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 21 transitions. cyclomatic complexity: 9. Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 22 states and 29 transitions. Complement of second has 7 states. [2025-02-08 14:28:22,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-02-08 14:28:22,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:28:22,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 6 transitions. [2025-02-08 14:28:22,242 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 6 transitions. Stem has 2 letters. Loop has 3 letters. [2025-02-08 14:28:22,242 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:28:22,242 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 6 transitions. Stem has 5 letters. Loop has 3 letters. [2025-02-08 14:28:22,242 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:28:22,242 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 6 transitions. Stem has 2 letters. Loop has 6 letters. [2025-02-08 14:28:22,243 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:28:22,243 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 29 transitions. [2025-02-08 14:28:22,245 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-02-08 14:28:22,246 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 20 states and 27 transitions. [2025-02-08 14:28:22,246 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-02-08 14:28:22,246 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2025-02-08 14:28:22,247 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 27 transitions. [2025-02-08 14:28:22,247 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:28:22,247 INFO L218 hiAutomatonCegarLoop]: Abstraction has 20 states and 27 transitions. [2025-02-08 14:28:22,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 27 transitions. [2025-02-08 14:28:22,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2025-02-08 14:28:22,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:28:22,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2025-02-08 14:28:22,249 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18 states and 25 transitions. [2025-02-08 14:28:22,249 INFO L432 stractBuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2025-02-08 14:28:22,249 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-02-08 14:28:22,250 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. [2025-02-08 14:28:22,250 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-02-08 14:28:22,250 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:28:22,250 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:28:22,251 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-02-08 14:28:22,251 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-08 14:28:22,251 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume !(main_~i~0#1 < 100000);main_~i~0#1 := 0;" [2025-02-08 14:28:22,251 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < 100000;call main_#t~mem3#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem3#1);havoc main_#t~mem3#1;" "main_~i~0#1 := 2 + main_~i~0#1;" [2025-02-08 14:28:22,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:28:22,252 INFO L85 PathProgramCache]: Analyzing trace with hash 43866189, now seen corresponding path program 1 times [2025-02-08 14:28:22,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:28:22,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960149295] [2025-02-08 14:28:22,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:28:22,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:28:22,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 14:28:22,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 14:28:22,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:28:22,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:28:22,335 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:28:22,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:28:22,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960149295] [2025-02-08 14:28:22,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960149295] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:28:22,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [780950579] [2025-02-08 14:28:22,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:28:22,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:28:22,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:28:22,337 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 14:28:22,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2025-02-08 14:28:22,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 14:28:22,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 14:28:22,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:28:22,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:28:22,368 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 14:28:22,369 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:28:22,385 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:28:22,385 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:28:22,398 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:28:22,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [780950579] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:28:22,398 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:28:22,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 5 [2025-02-08 14:28:22,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782546429] [2025-02-08 14:28:22,399 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:28:22,399 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-08 14:28:22,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:28:22,399 INFO L85 PathProgramCache]: Analyzing trace with hash 39681, now seen corresponding path program 2 times [2025-02-08 14:28:22,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:28:22,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143174518] [2025-02-08 14:28:22,399 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:28:22,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:28:22,402 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:28:22,406 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:28:22,407 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 14:28:22,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:28:22,407 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:28:22,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:28:22,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:28:22,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:28:22,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:28:22,410 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:28:22,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:28:22,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 14:28:22,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 14:28:22,437 INFO L87 Difference]: Start difference. First operand 18 states and 25 transitions. cyclomatic complexity: 10 Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:28:22,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:28:22,481 INFO L93 Difference]: Finished difference Result 66 states and 87 transitions. [2025-02-08 14:28:22,481 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 87 transitions. [2025-02-08 14:28:22,483 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-02-08 14:28:22,483 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 60 states and 76 transitions. [2025-02-08 14:28:22,483 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2025-02-08 14:28:22,483 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2025-02-08 14:28:22,483 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 76 transitions. [2025-02-08 14:28:22,484 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:28:22,484 INFO L218 hiAutomatonCegarLoop]: Abstraction has 60 states and 76 transitions. [2025-02-08 14:28:22,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 76 transitions. [2025-02-08 14:28:22,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 38. [2025-02-08 14:28:22,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 37 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:28:22,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 50 transitions. [2025-02-08 14:28:22,486 INFO L240 hiAutomatonCegarLoop]: Abstraction has 38 states and 50 transitions. [2025-02-08 14:28:22,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 14:28:22,487 INFO L432 stractBuchiCegarLoop]: Abstraction has 38 states and 50 transitions. [2025-02-08 14:28:22,487 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-02-08 14:28:22,487 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 50 transitions. [2025-02-08 14:28:22,488 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-02-08 14:28:22,488 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:28:22,488 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:28:22,488 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 4, 1, 1] [2025-02-08 14:28:22,488 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-08 14:28:22,488 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume !(main_~i~0#1 < 100000);main_~i~0#1 := 0;" [2025-02-08 14:28:22,488 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < 100000;call main_#t~mem3#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem3#1);havoc main_#t~mem3#1;" "main_~i~0#1 := 2 + main_~i~0#1;" [2025-02-08 14:28:22,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:28:22,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1417679484, now seen corresponding path program 2 times [2025-02-08 14:28:22,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:28:22,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484037675] [2025-02-08 14:28:22,489 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:28:22,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:28:22,494 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-02-08 14:28:22,500 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 14:28:22,500 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 14:28:22,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:28:22,554 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:28:22,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:28:22,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484037675] [2025-02-08 14:28:22,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484037675] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:28:22,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [954167331] [2025-02-08 14:28:22,554 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:28:22,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:28:22,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:28:22,556 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 14:28:22,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2025-02-08 14:28:22,597 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2025-02-08 14:28:22,602 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-02-08 14:28:22,612 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 14:28:22,612 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 14:28:22,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:28:22,613 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 14:28:22,613 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:28:22,634 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:28:22,634 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:28:22,687 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:28:22,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [954167331] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:28:22,687 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:28:22,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-02-08 14:28:22,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73001942] [2025-02-08 14:28:22,688 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:28:22,688 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-08 14:28:22,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:28:22,688 INFO L85 PathProgramCache]: Analyzing trace with hash 39681, now seen corresponding path program 3 times [2025-02-08 14:28:22,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:28:22,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204079894] [2025-02-08 14:28:22,688 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 14:28:22,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:28:22,691 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:28:22,692 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:28:22,692 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-08 14:28:22,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:28:22,692 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:28:22,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:28:22,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:28:22,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:28:22,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:28:22,694 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:28:22,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:28:22,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-08 14:28:22,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2025-02-08 14:28:22,722 INFO L87 Difference]: Start difference. First operand 38 states and 50 transitions. cyclomatic complexity: 15 Second operand has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:28:22,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:28:22,807 INFO L93 Difference]: Finished difference Result 156 states and 202 transitions. [2025-02-08 14:28:22,807 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 156 states and 202 transitions. [2025-02-08 14:28:22,809 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-02-08 14:28:22,810 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 156 states to 144 states and 178 transitions. [2025-02-08 14:28:22,810 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 65 [2025-02-08 14:28:22,810 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 65 [2025-02-08 14:28:22,811 INFO L73 IsDeterministic]: Start isDeterministic. Operand 144 states and 178 transitions. [2025-02-08 14:28:22,811 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:28:22,811 INFO L218 hiAutomatonCegarLoop]: Abstraction has 144 states and 178 transitions. [2025-02-08 14:28:22,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states and 178 transitions. [2025-02-08 14:28:22,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 92. [2025-02-08 14:28:22,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 92 states have (on average 1.2608695652173914) internal successors, (116), 91 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:28:22,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 116 transitions. [2025-02-08 14:28:22,814 INFO L240 hiAutomatonCegarLoop]: Abstraction has 92 states and 116 transitions. [2025-02-08 14:28:22,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 14:28:22,815 INFO L432 stractBuchiCegarLoop]: Abstraction has 92 states and 116 transitions. [2025-02-08 14:28:22,815 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-02-08 14:28:22,815 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 92 states and 116 transitions. [2025-02-08 14:28:22,816 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-02-08 14:28:22,816 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:28:22,816 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:28:22,816 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 10, 1, 1] [2025-02-08 14:28:22,816 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-08 14:28:22,816 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume !(main_~i~0#1 < 100000);main_~i~0#1 := 0;" [2025-02-08 14:28:22,816 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < 100000;call main_#t~mem3#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem3#1);havoc main_#t~mem3#1;" "main_~i~0#1 := 2 + main_~i~0#1;" [2025-02-08 14:28:22,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:28:22,820 INFO L85 PathProgramCache]: Analyzing trace with hash 557484444, now seen corresponding path program 3 times [2025-02-08 14:28:22,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:28:22,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860007314] [2025-02-08 14:28:22,820 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 14:28:22,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:28:22,829 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 32 statements into 11 equivalence classes. [2025-02-08 14:28:22,852 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 32 of 32 statements. [2025-02-08 14:28:22,852 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-02-08 14:28:22,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:28:23,043 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:28:23,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:28:23,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860007314] [2025-02-08 14:28:23,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860007314] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:28:23,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [234579016] [2025-02-08 14:28:23,044 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 14:28:23,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:28:23,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:28:23,046 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 14:28:23,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2025-02-08 14:28:23,094 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 32 statements into 11 equivalence classes. [2025-02-08 14:28:23,177 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 32 of 32 statements. [2025-02-08 14:28:23,177 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-02-08 14:28:23,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:28:23,178 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-08 14:28:23,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:28:23,255 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:28:23,255 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:28:23,426 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:28:23,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [234579016] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:28:23,426 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:28:23,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 23 [2025-02-08 14:28:23,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245110665] [2025-02-08 14:28:23,426 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:28:23,426 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-08 14:28:23,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:28:23,427 INFO L85 PathProgramCache]: Analyzing trace with hash 39681, now seen corresponding path program 4 times [2025-02-08 14:28:23,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:28:23,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716468769] [2025-02-08 14:28:23,427 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 14:28:23,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:28:23,429 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 3 statements into 2 equivalence classes. [2025-02-08 14:28:23,431 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:28:23,431 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 14:28:23,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:28:23,431 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:28:23,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:28:23,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:28:23,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:28:23,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:28:23,433 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:28:23,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:28:23,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-02-08 14:28:23,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2025-02-08 14:28:23,460 INFO L87 Difference]: Start difference. First operand 92 states and 116 transitions. cyclomatic complexity: 27 Second operand has 25 states, 24 states have (on average 2.8333333333333335) internal successors, (68), 24 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:28:23,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:28:23,651 INFO L93 Difference]: Finished difference Result 336 states and 430 transitions. [2025-02-08 14:28:23,651 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 336 states and 430 transitions. [2025-02-08 14:28:23,657 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-02-08 14:28:23,659 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 336 states to 312 states and 382 transitions. [2025-02-08 14:28:23,662 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 137 [2025-02-08 14:28:23,662 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 137 [2025-02-08 14:28:23,662 INFO L73 IsDeterministic]: Start isDeterministic. Operand 312 states and 382 transitions. [2025-02-08 14:28:23,663 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:28:23,663 INFO L218 hiAutomatonCegarLoop]: Abstraction has 312 states and 382 transitions. [2025-02-08 14:28:23,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states and 382 transitions. [2025-02-08 14:28:23,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 200. [2025-02-08 14:28:23,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 200 states have (on average 1.24) internal successors, (248), 199 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:28:23,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 248 transitions. [2025-02-08 14:28:23,676 INFO L240 hiAutomatonCegarLoop]: Abstraction has 200 states and 248 transitions. [2025-02-08 14:28:23,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-02-08 14:28:23,679 INFO L432 stractBuchiCegarLoop]: Abstraction has 200 states and 248 transitions. [2025-02-08 14:28:23,680 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-02-08 14:28:23,680 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 200 states and 248 transitions. [2025-02-08 14:28:23,681 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-02-08 14:28:23,681 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:28:23,681 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:28:23,682 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [22, 22, 22, 1, 1] [2025-02-08 14:28:23,682 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-08 14:28:23,682 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume !(main_~i~0#1 < 100000);main_~i~0#1 := 0;" [2025-02-08 14:28:23,683 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < 100000;call main_#t~mem3#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem3#1);havoc main_#t~mem3#1;" "main_~i~0#1 := 2 + main_~i~0#1;" [2025-02-08 14:28:23,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:28:23,683 INFO L85 PathProgramCache]: Analyzing trace with hash -868818980, now seen corresponding path program 4 times [2025-02-08 14:28:23,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:28:23,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023215242] [2025-02-08 14:28:23,683 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 14:28:23,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:28:23,698 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 68 statements into 2 equivalence classes. [2025-02-08 14:28:23,717 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 68 of 68 statements. [2025-02-08 14:28:23,717 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 14:28:23,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:28:24,232 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:28:24,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:28:24,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023215242] [2025-02-08 14:28:24,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023215242] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:28:24,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1871768184] [2025-02-08 14:28:24,232 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 14:28:24,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:28:24,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:28:24,235 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 14:28:24,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2025-02-08 14:28:24,289 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 68 statements into 2 equivalence classes. [2025-02-08 14:28:24,321 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 68 of 68 statements. [2025-02-08 14:28:24,321 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 14:28:24,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:28:24,322 INFO L256 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-02-08 14:28:24,325 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:28:24,427 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:28:24,428 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:28:25,028 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:28:25,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1871768184] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:28:25,029 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:28:25,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 46 [2025-02-08 14:28:25,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065219261] [2025-02-08 14:28:25,029 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:28:25,029 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-08 14:28:25,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:28:25,030 INFO L85 PathProgramCache]: Analyzing trace with hash 39681, now seen corresponding path program 5 times [2025-02-08 14:28:25,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:28:25,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322132108] [2025-02-08 14:28:25,030 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 14:28:25,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:28:25,032 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:28:25,033 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:28:25,033 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 14:28:25,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:28:25,033 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:28:25,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:28:25,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:28:25,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:28:25,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:28:25,035 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:28:25,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:28:25,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-02-08 14:28:25,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2025-02-08 14:28:25,076 INFO L87 Difference]: Start difference. First operand 200 states and 248 transitions. cyclomatic complexity: 51 Second operand has 48 states, 47 states have (on average 2.893617021276596) internal successors, (136), 47 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:28:25,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:28:25,510 INFO L93 Difference]: Finished difference Result 696 states and 886 transitions. [2025-02-08 14:28:25,510 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 696 states and 886 transitions. [2025-02-08 14:28:25,514 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-02-08 14:28:25,516 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 696 states to 648 states and 790 transitions. [2025-02-08 14:28:25,516 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 281 [2025-02-08 14:28:25,517 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 281 [2025-02-08 14:28:25,517 INFO L73 IsDeterministic]: Start isDeterministic. Operand 648 states and 790 transitions. [2025-02-08 14:28:25,517 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:28:25,517 INFO L218 hiAutomatonCegarLoop]: Abstraction has 648 states and 790 transitions. [2025-02-08 14:28:25,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states and 790 transitions. [2025-02-08 14:28:25,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 416. [2025-02-08 14:28:25,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 416 states have (on average 1.2307692307692308) internal successors, (512), 415 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:28:25,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 512 transitions. [2025-02-08 14:28:25,535 INFO L240 hiAutomatonCegarLoop]: Abstraction has 416 states and 512 transitions. [2025-02-08 14:28:25,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-02-08 14:28:25,536 INFO L432 stractBuchiCegarLoop]: Abstraction has 416 states and 512 transitions. [2025-02-08 14:28:25,536 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-02-08 14:28:25,536 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 416 states and 512 transitions. [2025-02-08 14:28:25,537 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-02-08 14:28:25,537 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:28:25,537 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:28:25,540 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [46, 46, 46, 1, 1] [2025-02-08 14:28:25,540 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-08 14:28:25,540 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume !(main_~i~0#1 < 100000);main_~i~0#1 := 0;" [2025-02-08 14:28:25,540 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < 100000;call main_#t~mem3#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem3#1);havoc main_#t~mem3#1;" "main_~i~0#1 := 2 + main_~i~0#1;" [2025-02-08 14:28:25,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:28:25,541 INFO L85 PathProgramCache]: Analyzing trace with hash -976933796, now seen corresponding path program 5 times [2025-02-08 14:28:25,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:28:25,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561191246] [2025-02-08 14:28:25,541 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 14:28:25,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:28:25,563 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 140 statements into 47 equivalence classes. [2025-02-08 14:28:25,650 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) and asserted 140 of 140 statements. [2025-02-08 14:28:25,651 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2025-02-08 14:28:25,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:28:27,148 INFO L134 CoverageAnalysis]: Checked inductivity of 3151 backedges. 0 proven. 3151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:28:27,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:28:27,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561191246] [2025-02-08 14:28:27,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561191246] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:28:27,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [44841939] [2025-02-08 14:28:27,149 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 14:28:27,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:28:27,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:28:27,151 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 14:28:27,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2025-02-08 14:28:27,219 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 140 statements into 47 equivalence classes. [2025-02-08 14:28:59,744 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) and asserted 140 of 140 statements. [2025-02-08 14:28:59,745 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2025-02-08 14:28:59,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:28:59,766 INFO L256 TraceCheckSpWp]: Trace formula consists of 688 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-02-08 14:28:59,769 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:28:59,949 INFO L134 CoverageAnalysis]: Checked inductivity of 3151 backedges. 0 proven. 3151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:28:59,949 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:29:02,296 INFO L134 CoverageAnalysis]: Checked inductivity of 3151 backedges. 0 proven. 3151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:29:02,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [44841939] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:29:02,296 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:29:02,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 94 [2025-02-08 14:29:02,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417090730] [2025-02-08 14:29:02,296 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:29:02,297 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-08 14:29:02,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:29:02,297 INFO L85 PathProgramCache]: Analyzing trace with hash 39681, now seen corresponding path program 6 times [2025-02-08 14:29:02,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:29:02,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929488212] [2025-02-08 14:29:02,297 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-08 14:29:02,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:29:02,300 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:29:02,302 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:29:02,302 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-02-08 14:29:02,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:29:02,302 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:29:02,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:29:02,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:29:02,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:29:02,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:29:02,305 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:29:02,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:29:02,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2025-02-08 14:29:02,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2025-02-08 14:29:02,354 INFO L87 Difference]: Start difference. First operand 416 states and 512 transitions. cyclomatic complexity: 99 Second operand has 96 states, 95 states have (on average 2.9473684210526314) internal successors, (280), 95 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:29:04,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:29:04,794 INFO L93 Difference]: Finished difference Result 1416 states and 1798 transitions. [2025-02-08 14:29:04,794 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1416 states and 1798 transitions. [2025-02-08 14:29:04,811 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-02-08 14:29:04,832 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1416 states to 1320 states and 1606 transitions. [2025-02-08 14:29:04,836 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 569 [2025-02-08 14:29:04,837 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 569 [2025-02-08 14:29:04,838 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1320 states and 1606 transitions. [2025-02-08 14:29:04,838 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:29:04,838 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1320 states and 1606 transitions. [2025-02-08 14:29:04,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1320 states and 1606 transitions. [2025-02-08 14:29:04,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1320 to 848. [2025-02-08 14:29:04,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 848 states, 848 states have (on average 1.2264150943396226) internal successors, (1040), 847 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:29:04,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848 states to 848 states and 1040 transitions. [2025-02-08 14:29:04,907 INFO L240 hiAutomatonCegarLoop]: Abstraction has 848 states and 1040 transitions. [2025-02-08 14:29:04,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2025-02-08 14:29:04,910 INFO L432 stractBuchiCegarLoop]: Abstraction has 848 states and 1040 transitions. [2025-02-08 14:29:04,910 INFO L338 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-02-08 14:29:04,910 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 848 states and 1040 transitions. [2025-02-08 14:29:04,913 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-02-08 14:29:04,913 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:29:04,913 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:29:04,918 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [94, 94, 94, 1, 1] [2025-02-08 14:29:04,928 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-08 14:29:04,929 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume main_~i~0#1 < 100000;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1;" "main_~i~0#1 := 2 + main_~i~0#1;" "assume !(main_~i~0#1 < 100000);main_~i~0#1 := 0;" [2025-02-08 14:29:04,933 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < 100000;call main_#t~mem3#1 := read~int#2(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(10 == main_#t~mem3#1);havoc main_#t~mem3#1;" "main_~i~0#1 := 2 + main_~i~0#1;" [2025-02-08 14:29:04,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:29:04,933 INFO L85 PathProgramCache]: Analyzing trace with hash 251151708, now seen corresponding path program 6 times [2025-02-08 14:29:04,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:29:04,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615863472] [2025-02-08 14:29:04,934 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-08 14:29:04,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:29:05,011 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 284 statements into 95 equivalence classes. [2025-02-08 14:29:05,203 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) and asserted 284 of 284 statements. [2025-02-08 14:29:05,203 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) [2025-02-08 14:29:05,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:29:09,896 INFO L134 CoverageAnalysis]: Checked inductivity of 13207 backedges. 0 proven. 13207 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:29:09,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:29:09,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615863472] [2025-02-08 14:29:09,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615863472] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:29:09,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [768054304] [2025-02-08 14:29:09,897 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-08 14:29:09,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:29:09,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:29:09,899 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 14:29:09,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2025-02-08 14:29:10,024 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 284 statements into 95 equivalence classes.