./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/memory-model/2SB.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability 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/AutomizerReach.xml -i ../sv-benchmarks/c/memory-model/2SB.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cec14f16ae81e958645b6575cf97932d8a09e14a8eafa007b1475b8cf31c9f62 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 17:29:33,267 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 17:29:33,304 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-07 17:29:33,310 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 17:29:33,310 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 17:29:33,328 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 17:29:33,330 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 17:29:33,331 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 17:29:33,331 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 17:29:33,331 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 17:29:33,331 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 17:29:33,331 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 17:29:33,331 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 17:29:33,332 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 17:29:33,332 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 17:29:33,333 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 17:29:33,333 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 17:29:33,333 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-07 17:29:33,333 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 17:29:33,333 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-07 17:29:33,333 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 17:29:33,333 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 17:29:33,333 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 17:29:33,333 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 17:29:33,333 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-07 17:29:33,333 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 17:29:33,333 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 17:29:33,334 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 17:29:33,334 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 17:29:33,334 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 17:29:33,334 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 17:29:33,334 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 17:29:33,334 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 17:29:33,334 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 17:29:33,335 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 17:29:33,335 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 17:29:33,335 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 17:29:33,335 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 17:29:33,335 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 17:29:33,335 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 17:29:33,335 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 17:29:33,335 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 17:29:33,335 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 17:29:33,335 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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(G ! call(reach_error())) ) 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 -> cec14f16ae81e958645b6575cf97932d8a09e14a8eafa007b1475b8cf31c9f62 [2025-02-07 17:29:33,548 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 17:29:33,558 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 17:29:33,561 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 17:29:33,562 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 17:29:33,562 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 17:29:33,564 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memory-model/2SB.i [2025-02-07 17:29:34,703 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5801dda7a/ee1b1f88a03a4e6c9b120a8b2081c2fe/FLAG15c0d01c1 [2025-02-07 17:29:35,017 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 17:29:35,019 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/memory-model/2SB.i [2025-02-07 17:29:35,029 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5801dda7a/ee1b1f88a03a4e6c9b120a8b2081c2fe/FLAG15c0d01c1 [2025-02-07 17:29:35,043 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5801dda7a/ee1b1f88a03a4e6c9b120a8b2081c2fe [2025-02-07 17:29:35,045 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 17:29:35,046 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 17:29:35,046 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 17:29:35,047 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 17:29:35,051 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 17:29:35,052 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 05:29:35" (1/1) ... [2025-02-07 17:29:35,053 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f809624 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:29:35, skipping insertion in model container [2025-02-07 17:29:35,053 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 05:29:35" (1/1) ... [2025-02-07 17:29:35,070 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 17:29:35,251 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/memory-model/2SB.i[13547,13560] [2025-02-07 17:29:35,254 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 17:29:35,260 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 17:29:35,329 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/memory-model/2SB.i[13547,13560] [2025-02-07 17:29:35,330 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 17:29:35,346 INFO L204 MainTranslator]: Completed translation [2025-02-07 17:29:35,347 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:29:35 WrapperNode [2025-02-07 17:29:35,348 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 17:29:35,349 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 17:29:35,349 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 17:29:35,349 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 17:29:35,355 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:29:35" (1/1) ... [2025-02-07 17:29:35,369 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:29:35" (1/1) ... [2025-02-07 17:29:35,402 INFO L138 Inliner]: procedures = 27, calls = 414, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 913 [2025-02-07 17:29:35,403 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 17:29:35,403 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 17:29:35,403 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 17:29:35,403 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 17:29:35,409 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:29:35" (1/1) ... [2025-02-07 17:29:35,410 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:29:35" (1/1) ... [2025-02-07 17:29:35,415 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:29:35" (1/1) ... [2025-02-07 17:29:35,448 INFO L175 MemorySlicer]: Split 310 memory accesses to 14 slices as follows [12, 12, 11, 10, 76, 10, 13, 13, 15, 37, 48, 40, 3, 10]. 25 percent of accesses are in the largest equivalence class. The 26 initializations are split as follows [10, 5, 0, 1, 0, 0, 5, 5, 0, 0, 0, 0, 0, 0]. The 117 writes are split as follows [1, 2, 5, 3, 40, 5, 2, 2, 5, 15, 10, 20, 2, 5]. [2025-02-07 17:29:35,452 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:29:35" (1/1) ... [2025-02-07 17:29:35,452 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:29:35" (1/1) ... [2025-02-07 17:29:35,473 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:29:35" (1/1) ... [2025-02-07 17:29:35,475 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:29:35" (1/1) ... [2025-02-07 17:29:35,477 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:29:35" (1/1) ... [2025-02-07 17:29:35,479 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:29:35" (1/1) ... [2025-02-07 17:29:35,483 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 17:29:35,484 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 17:29:35,484 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 17:29:35,484 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 17:29:35,484 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:29:35" (1/1) ... [2025-02-07 17:29:35,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 17:29:35,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:29:35,506 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-07 17:29:35,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-07 17:29:35,530 INFO L130 BoogieDeclarations]: Found specification of procedure tso_core_write [2025-02-07 17:29:35,530 INFO L138 BoogieDeclarations]: Found implementation of procedure tso_core_write [2025-02-07 17:29:35,530 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_headerT [2025-02-07 17:29:35,530 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_nondet_headerT [2025-02-07 17:29:35,530 INFO L130 BoogieDeclarations]: Found specification of procedure stepWriteBuffer [2025-02-07 17:29:35,531 INFO L138 BoogieDeclarations]: Found implementation of procedure stepWriteBuffer [2025-02-07 17:29:35,531 INFO L130 BoogieDeclarations]: Found specification of procedure tso_core_read [2025-02-07 17:29:35,531 INFO L138 BoogieDeclarations]: Found implementation of procedure tso_core_read [2025-02-07 17:29:35,531 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-07 17:29:35,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-07 17:29:35,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-07 17:29:35,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-07 17:29:35,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-07 17:29:35,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-07 17:29:35,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-07 17:29:35,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-02-07 17:29:35,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-02-07 17:29:35,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-02-07 17:29:35,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-02-07 17:29:35,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-02-07 17:29:35,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-02-07 17:29:35,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-02-07 17:29:35,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-02-07 17:29:35,531 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-07 17:29:35,531 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-07 17:29:35,531 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-07 17:29:35,531 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-07 17:29:35,531 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-07 17:29:35,531 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-07 17:29:35,531 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-02-07 17:29:35,531 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-02-07 17:29:35,532 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-02-07 17:29:35,532 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-02-07 17:29:35,532 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-02-07 17:29:35,532 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-02-07 17:29:35,532 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-02-07 17:29:35,532 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-02-07 17:29:35,532 INFO L130 BoogieDeclarations]: Found specification of procedure store_buffering_2_conditions [2025-02-07 17:29:35,532 INFO L138 BoogieDeclarations]: Found implementation of procedure store_buffering_2_conditions [2025-02-07 17:29:35,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 17:29:35,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-07 17:29:35,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-07 17:29:35,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-07 17:29:35,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-07 17:29:35,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-07 17:29:35,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-02-07 17:29:35,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-02-07 17:29:35,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-02-07 17:29:35,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-02-07 17:29:35,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-02-07 17:29:35,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-02-07 17:29:35,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-02-07 17:29:35,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-02-07 17:29:35,532 INFO L130 BoogieDeclarations]: Found specification of procedure initWriteBuffer [2025-02-07 17:29:35,532 INFO L138 BoogieDeclarations]: Found implementation of procedure initWriteBuffer [2025-02-07 17:29:35,532 INFO L130 BoogieDeclarations]: Found specification of procedure tso_core_fence [2025-02-07 17:29:35,534 INFO L138 BoogieDeclarations]: Found implementation of procedure tso_core_fence [2025-02-07 17:29:35,534 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 17:29:35,534 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 17:29:35,534 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-07 17:29:35,708 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 17:29:35,709 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 17:29:36,071 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L59: havoc #t~mem7#1;havoc #t~mem8#1;havoc #t~mem9#1;havoc #t~mem10#1;havoc #t~mem11#1;call ULTIMATE.dealloc(~#result~0#1.base, ~#result~0#1.offset);havoc ~#result~0#1.base, ~#result~0#1.offset; [2025-02-07 17:29:36,072 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L50: havoc __VERIFIER_nondet_operations_#t~nondet1#1; [2025-02-07 17:29:36,384 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L101-4: assume !(main_~cpu0Writes_issued~0#1 < main_#t~mem34#1);havoc main_#t~mem34#1;assume false; [2025-02-07 17:29:36,384 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L101-4: assume !!(main_~cpu0Writes_issued~0#1 < main_#t~mem34#1);havoc main_#t~mem34#1; [2025-02-07 17:29:36,384 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L101-5: assume !(main_~cpu0Reads_issued~0#1 < main_#t~mem45#1);havoc main_#t~mem45#1;assume false; [2025-02-07 17:29:36,384 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L101-5: assume !!(main_~cpu0Reads_issued~0#1 < main_#t~mem45#1);havoc main_#t~mem45#1; [2025-02-07 17:29:36,384 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L101-6: assume true;assume false; [2025-02-07 17:29:36,384 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L101-6: assume !true; [2025-02-07 17:29:36,384 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L159-1: assume !((if main_#t~mem94#1 % 256 % 4294967296 <= 2147483647 then main_#t~mem94#1 % 256 % 4294967296 else main_#t~mem94#1 % 256 % 4294967296 - 4294967296) > 0);havoc main_#t~mem94#1;assume false; [2025-02-07 17:29:36,384 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L159-1: assume !!((if main_#t~mem94#1 % 256 % 4294967296 <= 2147483647 then main_#t~mem94#1 % 256 % 4294967296 else main_#t~mem94#1 % 256 % 4294967296 - 4294967296) > 0);havoc main_#t~mem94#1; [2025-02-07 17:29:36,384 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L101-7: assume 3 == main_#t~mem44#1;havoc main_#t~mem44#1;call main_#t~mem45#1 := read~int#4(main_~#litmus_input~0#1.base, 80 + main_~#litmus_input~0#1.offset, 4); [2025-02-07 17:29:36,384 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L101-7: assume !(3 == main_#t~mem44#1);havoc main_#t~mem44#1; [2025-02-07 17:29:36,385 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L159-2: assume main_#t~switch14#1;call main_#t~mem94#1 := read~int#9(main_~#wrBuffer1~0#1.base, 16 + main_~#wrBuffer1~0#1.offset, 1); [2025-02-07 17:29:36,385 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L159-2: assume !main_#t~switch14#1;main_#t~switch14#1 := true; [2025-02-07 17:29:36,385 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L101-8: assume 2 == main_#t~mem33#1;havoc main_#t~mem33#1;call main_#t~mem34#1 := read~int#4(main_~#litmus_input~0#1.base, 76 + main_~#litmus_input~0#1.offset, 4); [2025-02-07 17:29:36,385 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L101-8: assume !(2 == main_#t~mem33#1);havoc main_#t~mem33#1;call main_#t~mem44#1 := read~int#10(main_~#input_action~0#1.base, main_~#input_action~0#1.offset, 4); [2025-02-07 17:29:36,385 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L101-9: assume 1 == main_#t~mem22#1;havoc main_#t~mem22#1;call main_#t~mem23#1 := read~int#4(main_~#litmus_input~0#1.base, 76 + main_~#litmus_input~0#1.offset, 4); [2025-02-07 17:29:36,385 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L101-9: assume !(1 == main_#t~mem22#1);havoc main_#t~mem22#1;call main_#t~mem33#1 := read~int#10(main_~#input_action~0#1.base, main_~#input_action~0#1.offset, 4); [2025-02-07 17:29:36,385 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L101-10: assume true;assume false; [2025-02-07 17:29:36,385 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L101-10: assume !true; [2025-02-07 17:29:36,385 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L101-11: assume 0 == (if main_#t~mem21#1 % 256 % 4294967296 <= 2147483647 then main_#t~mem21#1 % 256 % 4294967296 else main_#t~mem21#1 % 256 % 4294967296 - 4294967296);havoc main_#t~mem21#1;call main_#t~mem22#1 := read~int#10(main_~#input_action~0#1.base, main_~#input_action~0#1.offset, 4); [2025-02-07 17:29:36,385 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L101-11: assume !(0 == (if main_#t~mem21#1 % 256 % 4294967296 <= 2147483647 then main_#t~mem21#1 % 256 % 4294967296 else main_#t~mem21#1 % 256 % 4294967296 - 4294967296));havoc main_#t~mem21#1; [2025-02-07 17:29:36,385 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L101-12: assume main_#t~switch14#1;call main_#t~mem15#1 := read~int#4(main_~#litmus_input~0#1.base, 72 + main_~#litmus_input~0#1.offset, 4);call main_#t~mem16#1 := read~int#4(main_~#litmus_input~0#1.base, main_~#litmus_input~0#1.offset + 8 * main_#t~mem15#1, 4);call main_#t~mem17#1 := read~int#4(main_~#litmus_input~0#1.base, 4 + (main_~#litmus_input~0#1.offset + 8 * main_#t~mem15#1), 1);call main_#t~mem18#1 := read~int#4(main_~#litmus_input~0#1.base, 5 + (main_~#litmus_input~0#1.offset + 8 * main_#t~mem15#1), 1);call main_#t~mem19#1 := read~int#4(main_~#litmus_input~0#1.base, 6 + (main_~#litmus_input~0#1.offset + 8 * main_#t~mem15#1), 1);call main_#t~mem20#1 := read~int#4(main_~#litmus_input~0#1.base, 7 + (main_~#litmus_input~0#1.offset + 8 * main_#t~mem15#1), 1);call write~int#10(main_#t~mem16#1, main_~#input_action~0#1.base, main_~#input_action~0#1.offset, 4);call write~int#10(main_#t~mem17#1, main_~#input_action~0#1.base, 4 + main_~#input_action~0#1.offset, 1);call write~int#10(main_#t~mem18#1, main_~#input_action~0#1.base, 5 + main_~#input_action~0#1.offset, 1);call write~int#10(main_#t~mem19#1, main_~#input_action~0#1.base, 6 + main_~#input_action~0#1.offset, 1);call write~int#10(main_#t~mem20#1, main_~#input_action~0#1.base, 7 + main_~#input_action~0#1.offset, 1);call main_#t~mem21#1 := read~int#10(main_~#input_action~0#1.base, 4 + main_~#input_action~0#1.offset, 1); [2025-02-07 17:29:36,385 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L101-12: assume !main_#t~switch14#1;main_#t~switch14#1 := main_#t~switch14#1 || 2 == main_#t~ret13#1; [2025-02-07 17:29:36,385 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L118: havoc main_#t~mem46#1;havoc main_#t~mem47#1;havoc main_#t~mem48#1;havoc main_#t~mem49#1;havoc main_#t~mem50#1;call main_#t~mem51#1 := read~int#4(main_~#litmus_input~0#1.base, 72 + main_~#litmus_input~0#1.offset, 4);main_#t~post52#1 := main_#t~mem51#1;call write~int#4(1 + main_#t~post52#1, main_~#litmus_input~0#1.base, 72 + main_~#litmus_input~0#1.offset, 4);havoc main_#t~mem51#1;havoc main_#t~post52#1;main_#t~post53#1 := main_~cpu0Reads_issued~0#1;main_~cpu0Reads_issued~0#1 := 1 + main_#t~post53#1;havoc main_#t~post53#1; [2025-02-07 17:29:36,386 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L118-1: SUMMARY for call tso_core_read(main_#t~mem46#1, main_#t~mem47#1, main_#t~mem48#1, main_#t~mem49#1, main_#t~mem50#1, main_~#g_history~0#1.base, main_~#g_history~0#1.offset, main_~#global_time~0#1.base, main_~#global_time~0#1.offset, main_~#wrBuffer0~0#1.base, main_~#wrBuffer0~0#1.offset, main_~#sharedMemory~0#1.base, main_~#sharedMemory~0#1.offset); srcloc: null [2025-02-07 17:29:36,386 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L118-2: call main_#t~mem46#1 := read~int#10(main_~#input_action~0#1.base, main_~#input_action~0#1.offset, 4);call main_#t~mem47#1 := read~int#10(main_~#input_action~0#1.base, 4 + main_~#input_action~0#1.offset, 1);call main_#t~mem48#1 := read~int#10(main_~#input_action~0#1.base, 5 + main_~#input_action~0#1.offset, 1);call main_#t~mem49#1 := read~int#10(main_~#input_action~0#1.base, 6 + main_~#input_action~0#1.offset, 1);call main_#t~mem50#1 := read~int#10(main_~#input_action~0#1.base, 7 + main_~#input_action~0#1.offset, 1); [2025-02-07 17:29:36,386 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L143: call main_#t~mem75#1 := read~int#9(main_~#wrBuffer1~0#1.base, 16 + main_~#wrBuffer1~0#1.offset, 1); [2025-02-07 17:29:36,386 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L144: havoc main_#t~mem76#1;havoc main_#t~mem77#1;havoc main_#t~mem78#1;havoc main_#t~mem79#1;havoc main_#t~mem80#1;call main_#t~mem81#1 := read~int#4(main_~#litmus_input~0#1.base, 156 + main_~#litmus_input~0#1.offset, 4);main_#t~post82#1 := main_#t~mem81#1;call write~int#4(1 + main_#t~post82#1, main_~#litmus_input~0#1.base, 156 + main_~#litmus_input~0#1.offset, 4);havoc main_#t~mem81#1;havoc main_#t~post82#1;main_#t~post83#1 := main_~cpu1Writes_issued~0#1;main_~cpu1Writes_issued~0#1 := 1 + main_#t~post83#1;havoc main_#t~post83#1; [2025-02-07 17:29:36,386 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L144-1: SUMMARY for call tso_core_fence(main_#t~mem76#1, main_#t~mem77#1, main_#t~mem78#1, main_#t~mem79#1, main_#t~mem80#1, main_~#g_history~0#1.base, main_~#g_history~0#1.offset, main_~#global_time~0#1.base, main_~#global_time~0#1.offset); srcloc: null [2025-02-07 17:29:36,386 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L144-2: call main_#t~mem76#1 := read~int#10(main_~#input_action~0#1.base, main_~#input_action~0#1.offset, 4);call main_#t~mem77#1 := read~int#10(main_~#input_action~0#1.base, 4 + main_~#input_action~0#1.offset, 1);call main_#t~mem78#1 := read~int#10(main_~#input_action~0#1.base, 5 + main_~#input_action~0#1.offset, 1);call main_#t~mem79#1 := read~int#10(main_~#input_action~0#1.base, 6 + main_~#input_action~0#1.offset, 1);call main_#t~mem80#1 := read~int#10(main_~#input_action~0#1.base, 7 + main_~#input_action~0#1.offset, 1); [2025-02-07 17:29:36,387 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L161: SUMMARY for call stepWriteBuffer(main_~#wrBuffer1~0#1.base, main_~#wrBuffer1~0#1.offset, main_~#sharedMemory~0#1.base, main_~#sharedMemory~0#1.offset); srcloc: null [2025-02-07 17:29:36,387 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L128-1: assume !((if main_#t~mem54#1 % 256 % 4294967296 <= 2147483647 then main_#t~mem54#1 % 256 % 4294967296 else main_#t~mem54#1 % 256 % 4294967296 - 4294967296) > 0);havoc main_#t~mem54#1;assume false; [2025-02-07 17:29:36,387 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L128-1: assume !!((if main_#t~mem54#1 % 256 % 4294967296 <= 2147483647 then main_#t~mem54#1 % 256 % 4294967296 else main_#t~mem54#1 % 256 % 4294967296 - 4294967296) > 0);havoc main_#t~mem54#1; [2025-02-07 17:29:36,387 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L128-2: assume main_#t~switch14#1;call main_#t~mem54#1 := read~int#9(main_~#wrBuffer0~0#1.base, 16 + main_~#wrBuffer0~0#1.offset, 1); [2025-02-07 17:29:36,387 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L128-2: assume !main_#t~switch14#1;main_#t~switch14#1 := main_#t~switch14#1 || 1 == main_#t~ret13#1; [2025-02-07 17:29:36,387 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L112: call main_#t~mem35#1 := read~int#9(main_~#wrBuffer0~0#1.base, 16 + main_~#wrBuffer0~0#1.offset, 1); [2025-02-07 17:29:36,387 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L137: call main_#t~mem64#1 := read~int#9(main_~#wrBuffer1~0#1.base, 16 + main_~#wrBuffer1~0#1.offset, 1); [2025-02-07 17:29:36,387 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L113: havoc main_#t~mem36#1;havoc main_#t~mem37#1;havoc main_#t~mem38#1;havoc main_#t~mem39#1;havoc main_#t~mem40#1;call main_#t~mem41#1 := read~int#4(main_~#litmus_input~0#1.base, 72 + main_~#litmus_input~0#1.offset, 4);main_#t~post42#1 := main_#t~mem41#1;call write~int#4(1 + main_#t~post42#1, main_~#litmus_input~0#1.base, 72 + main_~#litmus_input~0#1.offset, 4);havoc main_#t~mem41#1;havoc main_#t~post42#1;main_#t~post43#1 := main_~cpu0Writes_issued~0#1;main_~cpu0Writes_issued~0#1 := 1 + main_#t~post43#1;havoc main_#t~post43#1; [2025-02-07 17:29:36,387 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L113-1: SUMMARY for call tso_core_fence(main_#t~mem36#1, main_#t~mem37#1, main_#t~mem38#1, main_#t~mem39#1, main_#t~mem40#1, main_~#g_history~0#1.base, main_~#g_history~0#1.offset, main_~#global_time~0#1.base, main_~#global_time~0#1.offset); srcloc: null [2025-02-07 17:29:36,387 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L113-2: call main_#t~mem36#1 := read~int#10(main_~#input_action~0#1.base, main_~#input_action~0#1.offset, 4);call main_#t~mem37#1 := read~int#10(main_~#input_action~0#1.base, 4 + main_~#input_action~0#1.offset, 1);call main_#t~mem38#1 := read~int#10(main_~#input_action~0#1.base, 5 + main_~#input_action~0#1.offset, 1);call main_#t~mem39#1 := read~int#10(main_~#input_action~0#1.base, 6 + main_~#input_action~0#1.offset, 1);call main_#t~mem40#1 := read~int#10(main_~#input_action~0#1.base, 7 + main_~#input_action~0#1.offset, 1); [2025-02-07 17:29:36,387 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L47: havoc __VERIFIER_nondet_step_#t~nondet0#1;main_#t~ret13#1 := __VERIFIER_nondet_step_#res#1;havoc __VERIFIER_nondet_step_#t~nondet0#1;assume { :end_inline___VERIFIER_nondet_step } true;assume -2147483648 <= main_#t~ret13#1 && main_#t~ret13#1 <= 2147483647;main_#t~switch14#1 := 0 == main_#t~ret13#1; [2025-02-07 17:29:36,388 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L138: havoc main_#t~mem65#1;havoc main_#t~mem66#1;havoc main_#t~mem67#1;havoc main_#t~mem68#1;havoc main_#t~mem69#1;call main_#t~mem70#1 := read~int#4(main_~#litmus_input~0#1.base, 156 + main_~#litmus_input~0#1.offset, 4);main_#t~post71#1 := main_#t~mem70#1;call write~int#4(1 + main_#t~post71#1, main_~#litmus_input~0#1.base, 156 + main_~#litmus_input~0#1.offset, 4);havoc main_#t~mem70#1;havoc main_#t~post71#1;main_#t~post72#1 := main_~cpu1Writes_issued~0#1;main_~cpu1Writes_issued~0#1 := 1 + main_#t~post72#1;havoc main_#t~post72#1; [2025-02-07 17:29:36,388 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L138-1: SUMMARY for call tso_core_write(main_#t~mem65#1, main_#t~mem66#1, main_#t~mem67#1, main_#t~mem68#1, main_#t~mem69#1, main_~#g_history~0#1.base, main_~#g_history~0#1.offset, main_~#global_time~0#1.base, main_~#global_time~0#1.offset, main_~#wrBuffer1~0#1.base, main_~#wrBuffer1~0#1.offset); srcloc: null [2025-02-07 17:29:36,388 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L138-2: call main_#t~mem65#1 := read~int#10(main_~#input_action~0#1.base, main_~#input_action~0#1.offset, 4);call main_#t~mem66#1 := read~int#10(main_~#input_action~0#1.base, 4 + main_~#input_action~0#1.offset, 1);call main_#t~mem67#1 := read~int#10(main_~#input_action~0#1.base, 5 + main_~#input_action~0#1.offset, 1);call main_#t~mem68#1 := read~int#10(main_~#input_action~0#1.base, 6 + main_~#input_action~0#1.offset, 1);call main_#t~mem69#1 := read~int#10(main_~#input_action~0#1.base, 7 + main_~#input_action~0#1.offset, 1); [2025-02-07 17:29:36,388 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L163-1: assume true;assume false; [2025-02-07 17:29:36,388 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L163-1: assume !true; [2025-02-07 17:29:36,388 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L130: SUMMARY for call stepWriteBuffer(main_~#wrBuffer0~0#1.base, main_~#wrBuffer0~0#1.offset, main_~#sharedMemory~0#1.base, main_~#sharedMemory~0#1.offset); srcloc: null [2025-02-07 17:29:36,388 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L163-2: assume main_#t~switch14#1; [2025-02-07 17:29:36,388 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L163-2: assume !main_#t~switch14#1;havoc main_#t~ret13#1;havoc main_#t~switch14#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;havoc main_#t~mem17#1;havoc main_#t~mem18#1;havoc main_#t~mem19#1;havoc main_#t~mem20#1;havoc main_#t~mem55#1;havoc main_#t~mem56#1;havoc main_#t~mem57#1;havoc main_#t~mem58#1;havoc main_#t~mem59#1;havoc main_#t~mem60#1;havoc main_#t~ret13#1;havoc main_#t~switch14#1;havoc main_#t~mem15#1;havoc main_#t~mem16#1;havoc main_#t~mem17#1;havoc main_#t~mem18#1;havoc main_#t~mem19#1;havoc main_#t~mem20#1;havoc main_#t~mem55#1;havoc main_#t~mem56#1;havoc main_#t~mem57#1;havoc main_#t~mem58#1;havoc main_#t~mem59#1;havoc main_#t~mem60#1; [2025-02-07 17:29:36,388 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L106: call main_#t~mem24#1 := read~int#9(main_~#wrBuffer0~0#1.base, 16 + main_~#wrBuffer0~0#1.offset, 1); [2025-02-07 17:29:36,388 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L107: havoc main_#t~mem25#1;havoc main_#t~mem26#1;havoc main_#t~mem27#1;havoc main_#t~mem28#1;havoc main_#t~mem29#1;call main_#t~mem30#1 := read~int#4(main_~#litmus_input~0#1.base, 72 + main_~#litmus_input~0#1.offset, 4);main_#t~post31#1 := main_#t~mem30#1;call write~int#4(1 + main_#t~post31#1, main_~#litmus_input~0#1.base, 72 + main_~#litmus_input~0#1.offset, 4);havoc main_#t~mem30#1;havoc main_#t~post31#1;main_#t~post32#1 := main_~cpu0Writes_issued~0#1;main_~cpu0Writes_issued~0#1 := 1 + main_#t~post32#1;havoc main_#t~post32#1; [2025-02-07 17:29:36,388 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L107-1: SUMMARY for call tso_core_write(main_#t~mem25#1, main_#t~mem26#1, main_#t~mem27#1, main_#t~mem28#1, main_#t~mem29#1, main_~#g_history~0#1.base, main_~#g_history~0#1.offset, main_~#global_time~0#1.base, main_~#global_time~0#1.offset, main_~#wrBuffer0~0#1.base, main_~#wrBuffer0~0#1.offset); srcloc: null [2025-02-07 17:29:36,389 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L107-2: call main_#t~mem25#1 := read~int#10(main_~#input_action~0#1.base, main_~#input_action~0#1.offset, 4);call main_#t~mem26#1 := read~int#10(main_~#input_action~0#1.base, 4 + main_~#input_action~0#1.offset, 1);call main_#t~mem27#1 := read~int#10(main_~#input_action~0#1.base, 5 + main_~#input_action~0#1.offset, 1);call main_#t~mem28#1 := read~int#10(main_~#input_action~0#1.base, 6 + main_~#input_action~0#1.offset, 1);call main_#t~mem29#1 := read~int#10(main_~#input_action~0#1.base, 7 + main_~#input_action~0#1.offset, 1); [2025-02-07 17:29:36,389 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L132-1: assume !((if main_#t~mem64#1 % 256 % 4294967296 <= 2147483647 then main_#t~mem64#1 % 256 % 4294967296 else main_#t~mem64#1 % 256 % 4294967296 - 4294967296) < 2);havoc main_#t~mem64#1;assume false; [2025-02-07 17:29:36,389 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L132-1: assume !!((if main_#t~mem64#1 % 256 % 4294967296 <= 2147483647 then main_#t~mem64#1 % 256 % 4294967296 else main_#t~mem64#1 % 256 % 4294967296 - 4294967296) < 2);havoc main_#t~mem64#1; [2025-02-07 17:29:36,389 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L132-2: assume !(main_~cpu1Writes_issued~0#1 < main_#t~mem63#1);havoc main_#t~mem63#1;assume false; [2025-02-07 17:29:36,389 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L132-2: assume !!(main_~cpu1Writes_issued~0#1 < main_#t~mem63#1);havoc main_#t~mem63#1; [2025-02-07 17:29:36,389 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L132-3: assume !(0 == (if main_#t~mem75#1 % 256 % 4294967296 <= 2147483647 then main_#t~mem75#1 % 256 % 4294967296 else main_#t~mem75#1 % 256 % 4294967296 - 4294967296));havoc main_#t~mem75#1;assume false; [2025-02-07 17:29:36,389 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L132-3: assume !!(0 == (if main_#t~mem75#1 % 256 % 4294967296 <= 2147483647 then main_#t~mem75#1 % 256 % 4294967296 else main_#t~mem75#1 % 256 % 4294967296 - 4294967296));havoc main_#t~mem75#1; [2025-02-07 17:29:36,389 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L132-4: assume !(main_~cpu1Writes_issued~0#1 < main_#t~mem74#1);havoc main_#t~mem74#1;assume false; [2025-02-07 17:29:36,389 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L132-4: assume !!(main_~cpu1Writes_issued~0#1 < main_#t~mem74#1);havoc main_#t~mem74#1; [2025-02-07 17:29:36,389 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L132-5: assume !(main_~cpu1Reads_issued~0#1 < main_#t~mem85#1);havoc main_#t~mem85#1;assume false; [2025-02-07 17:29:36,389 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L132-5: assume !!(main_~cpu1Reads_issued~0#1 < main_#t~mem85#1);havoc main_#t~mem85#1; [2025-02-07 17:29:36,389 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L132-6: assume true;assume false; [2025-02-07 17:29:36,390 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L132-6: assume !true; [2025-02-07 17:29:36,390 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L132-7: assume 3 == main_#t~mem84#1;havoc main_#t~mem84#1;call main_#t~mem85#1 := read~int#4(main_~#litmus_input~0#1.base, 164 + main_~#litmus_input~0#1.offset, 4); [2025-02-07 17:29:36,390 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L132-7: assume !(3 == main_#t~mem84#1);havoc main_#t~mem84#1; [2025-02-07 17:29:36,390 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L132-8: assume 2 == main_#t~mem73#1;havoc main_#t~mem73#1;call main_#t~mem74#1 := read~int#4(main_~#litmus_input~0#1.base, 160 + main_~#litmus_input~0#1.offset, 4); [2025-02-07 17:29:36,390 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L132-8: assume !(2 == main_#t~mem73#1);havoc main_#t~mem73#1;call main_#t~mem84#1 := read~int#10(main_~#input_action~0#1.base, main_~#input_action~0#1.offset, 4); [2025-02-07 17:29:36,390 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L132-9: assume 1 == main_#t~mem62#1;havoc main_#t~mem62#1;call main_#t~mem63#1 := read~int#4(main_~#litmus_input~0#1.base, 160 + main_~#litmus_input~0#1.offset, 4); [2025-02-07 17:29:36,390 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L132-9: assume !(1 == main_#t~mem62#1);havoc main_#t~mem62#1;call main_#t~mem73#1 := read~int#10(main_~#input_action~0#1.base, main_~#input_action~0#1.offset, 4); [2025-02-07 17:29:36,390 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L132-10: assume true;assume false; [2025-02-07 17:29:36,390 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L132-10: assume !true; [2025-02-07 17:29:36,390 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L132-11: assume 1 == (if main_#t~mem61#1 % 256 % 4294967296 <= 2147483647 then main_#t~mem61#1 % 256 % 4294967296 else main_#t~mem61#1 % 256 % 4294967296 - 4294967296);havoc main_#t~mem61#1;call main_#t~mem62#1 := read~int#10(main_~#input_action~0#1.base, main_~#input_action~0#1.offset, 4); [2025-02-07 17:29:36,390 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L132-11: assume !(1 == (if main_#t~mem61#1 % 256 % 4294967296 <= 2147483647 then main_#t~mem61#1 % 256 % 4294967296 else main_#t~mem61#1 % 256 % 4294967296 - 4294967296));havoc main_#t~mem61#1; [2025-02-07 17:29:36,390 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L132-12: assume main_#t~switch14#1;call main_#t~mem55#1 := read~int#4(main_~#litmus_input~0#1.base, 156 + main_~#litmus_input~0#1.offset, 4);call main_#t~mem56#1 := read~int#4(main_~#litmus_input~0#1.base, 84 + main_~#litmus_input~0#1.offset + 8 * main_#t~mem55#1, 4);call main_#t~mem57#1 := read~int#4(main_~#litmus_input~0#1.base, 4 + (84 + main_~#litmus_input~0#1.offset + 8 * main_#t~mem55#1), 1);call main_#t~mem58#1 := read~int#4(main_~#litmus_input~0#1.base, 5 + (84 + main_~#litmus_input~0#1.offset + 8 * main_#t~mem55#1), 1);call main_#t~mem59#1 := read~int#4(main_~#litmus_input~0#1.base, 6 + (84 + main_~#litmus_input~0#1.offset + 8 * main_#t~mem55#1), 1);call main_#t~mem60#1 := read~int#4(main_~#litmus_input~0#1.base, 7 + (84 + main_~#litmus_input~0#1.offset + 8 * main_#t~mem55#1), 1);call write~int#10(main_#t~mem56#1, main_~#input_action~0#1.base, main_~#input_action~0#1.offset, 4);call write~int#10(main_#t~mem57#1, main_~#input_action~0#1.base, 4 + main_~#input_action~0#1.offset, 1);call write~int#10(main_#t~mem58#1, main_~#input_action~0#1.base, 5 + main_~#input_action~0#1.offset, 1);call write~int#10(main_#t~mem59#1, main_~#input_action~0#1.base, 6 + main_~#input_action~0#1.offset, 1);call write~int#10(main_#t~mem60#1, main_~#input_action~0#1.base, 7 + main_~#input_action~0#1.offset, 1);call main_#t~mem61#1 := read~int#10(main_~#input_action~0#1.base, 4 + main_~#input_action~0#1.offset, 1); [2025-02-07 17:29:36,390 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L132-12: assume !main_#t~switch14#1;main_#t~switch14#1 := main_#t~switch14#1 || 3 == main_#t~ret13#1; [2025-02-07 17:29:36,390 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L149: havoc main_#t~mem86#1;havoc main_#t~mem87#1;havoc main_#t~mem88#1;havoc main_#t~mem89#1;havoc main_#t~mem90#1;call main_#t~mem91#1 := read~int#4(main_~#litmus_input~0#1.base, 156 + main_~#litmus_input~0#1.offset, 4);main_#t~post92#1 := main_#t~mem91#1;call write~int#4(1 + main_#t~post92#1, main_~#litmus_input~0#1.base, 156 + main_~#litmus_input~0#1.offset, 4);havoc main_#t~mem91#1;havoc main_#t~post92#1;main_#t~post93#1 := main_~cpu1Reads_issued~0#1;main_~cpu1Reads_issued~0#1 := 1 + main_#t~post93#1;havoc main_#t~post93#1; [2025-02-07 17:29:36,390 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L149-1: SUMMARY for call tso_core_read(main_#t~mem86#1, main_#t~mem87#1, main_#t~mem88#1, main_#t~mem89#1, main_#t~mem90#1, main_~#g_history~0#1.base, main_~#g_history~0#1.offset, main_~#global_time~0#1.base, main_~#global_time~0#1.offset, main_~#wrBuffer1~0#1.base, main_~#wrBuffer1~0#1.offset, main_~#sharedMemory~0#1.base, main_~#sharedMemory~0#1.offset); srcloc: null [2025-02-07 17:29:36,391 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L83: call ULTIMATE.dealloc(main_~#sharedMemory~0#1.base, main_~#sharedMemory~0#1.offset);havoc main_~#sharedMemory~0#1.base, main_~#sharedMemory~0#1.offset;call ULTIMATE.dealloc(main_~#wrBuffer0~0#1.base, main_~#wrBuffer0~0#1.offset);havoc main_~#wrBuffer0~0#1.base, main_~#wrBuffer0~0#1.offset;call ULTIMATE.dealloc(main_~#wrBuffer1~0#1.base, main_~#wrBuffer1~0#1.offset);havoc main_~#wrBuffer1~0#1.base, main_~#wrBuffer1~0#1.offset;call ULTIMATE.dealloc(main_~#g_history~0#1.base, main_~#g_history~0#1.offset);havoc main_~#g_history~0#1.base, main_~#g_history~0#1.offset;call ULTIMATE.dealloc(main_~#global_time~0#1.base, main_~#global_time~0#1.offset);havoc main_~#global_time~0#1.base, main_~#global_time~0#1.offset;call ULTIMATE.dealloc(main_~#litmus_input~0#1.base, main_~#litmus_input~0#1.offset);havoc main_~#litmus_input~0#1.base, main_~#litmus_input~0#1.offset;call ULTIMATE.dealloc(main_~#input_action~0#1.base, main_~#input_action~0#1.offset);havoc main_~#input_action~0#1.base, main_~#input_action~0#1.offset; [2025-02-07 17:29:36,391 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L149-2: call main_#t~mem86#1 := read~int#10(main_~#input_action~0#1.base, main_~#input_action~0#1.offset, 4);call main_#t~mem87#1 := read~int#10(main_~#input_action~0#1.base, 4 + main_~#input_action~0#1.offset, 1);call main_#t~mem88#1 := read~int#10(main_~#input_action~0#1.base, 5 + main_~#input_action~0#1.offset, 1);call main_#t~mem89#1 := read~int#10(main_~#input_action~0#1.base, 6 + main_~#input_action~0#1.offset, 1);call main_#t~mem90#1 := read~int#10(main_~#input_action~0#1.base, 7 + main_~#input_action~0#1.offset, 1); [2025-02-07 17:29:36,391 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L101-1: assume !((if main_#t~mem24#1 % 256 % 4294967296 <= 2147483647 then main_#t~mem24#1 % 256 % 4294967296 else main_#t~mem24#1 % 256 % 4294967296 - 4294967296) < 2);havoc main_#t~mem24#1;assume false; [2025-02-07 17:29:36,391 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L101-1: assume !!((if main_#t~mem24#1 % 256 % 4294967296 <= 2147483647 then main_#t~mem24#1 % 256 % 4294967296 else main_#t~mem24#1 % 256 % 4294967296 - 4294967296) < 2);havoc main_#t~mem24#1; [2025-02-07 17:29:36,391 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L101-2: assume !(main_~cpu0Writes_issued~0#1 < main_#t~mem23#1);havoc main_#t~mem23#1;assume false; [2025-02-07 17:29:36,391 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L101-2: assume !!(main_~cpu0Writes_issued~0#1 < main_#t~mem23#1);havoc main_#t~mem23#1; [2025-02-07 17:29:36,391 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L101-3: assume !(0 == (if main_#t~mem35#1 % 256 % 4294967296 <= 2147483647 then main_#t~mem35#1 % 256 % 4294967296 else main_#t~mem35#1 % 256 % 4294967296 - 4294967296));havoc main_#t~mem35#1;assume false; [2025-02-07 17:29:36,391 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L101-3: assume !!(0 == (if main_#t~mem35#1 % 256 % 4294967296 <= 2147483647 then main_#t~mem35#1 % 256 % 4294967296 else main_#t~mem35#1 % 256 % 4294967296 - 4294967296));havoc main_#t~mem35#1; [2025-02-07 17:29:36,423 INFO L? ?]: Removed 134 outVars from TransFormulas that were not future-live. [2025-02-07 17:29:36,424 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 17:29:36,435 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 17:29:36,436 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 17:29:36,436 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 05:29:36 BoogieIcfgContainer [2025-02-07 17:29:36,437 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 17:29:36,439 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 17:29:36,439 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 17:29:36,442 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 17:29:36,442 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 05:29:35" (1/3) ... [2025-02-07 17:29:36,442 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22a739d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 05:29:36, skipping insertion in model container [2025-02-07 17:29:36,443 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:29:35" (2/3) ... [2025-02-07 17:29:36,443 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22a739d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 05:29:36, skipping insertion in model container [2025-02-07 17:29:36,443 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 05:29:36" (3/3) ... [2025-02-07 17:29:36,444 INFO L128 eAbstractionObserver]: Analyzing ICFG 2SB.i [2025-02-07 17:29:36,461 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 17:29:36,462 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 2SB.i that has 8 procedures, 105 locations, 1 initial locations, 7 loop locations, and 1 error locations. [2025-02-07 17:29:36,491 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 17:29:36,498 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7b7eee3b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 17:29:36,498 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 17:29:36,501 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 70 states have (on average 1.5571428571428572) internal successors, (109), 73 states have internal predecessors, (109), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-07 17:29:36,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-02-07 17:29:36,505 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:29:36,505 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:29:36,506 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:29:36,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:29:36,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1087592608, now seen corresponding path program 1 times [2025-02-07 17:29:36,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:29:36,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397373145] [2025-02-07 17:29:36,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:29:36,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:29:36,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-07 17:29:36,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-07 17:29:36,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:29:36,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:29:36,878 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-07 17:29:36,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:29:36,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397373145] [2025-02-07 17:29:36,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397373145] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 17:29:36,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 17:29:36,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 17:29:36,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779610727] [2025-02-07 17:29:36,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 17:29:36,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 17:29:36,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:29:36,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 17:29:36,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 17:29:36,900 INFO L87 Difference]: Start difference. First operand has 83 states, 70 states have (on average 1.5571428571428572) internal successors, (109), 73 states have internal predecessors, (109), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-07 17:29:36,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:29:36,928 INFO L93 Difference]: Finished difference Result 165 states and 241 transitions. [2025-02-07 17:29:36,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 17:29:36,930 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 38 [2025-02-07 17:29:36,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:29:36,937 INFO L225 Difference]: With dead ends: 165 [2025-02-07 17:29:36,937 INFO L226 Difference]: Without dead ends: 78 [2025-02-07 17:29:36,939 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 17:29:36,943 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 0 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 17:29:36,943 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 230 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 17:29:36,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-02-07 17:29:36,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2025-02-07 17:29:36,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 68 states have (on average 1.3235294117647058) internal successors, (90), 68 states have internal predecessors, (90), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-07 17:29:36,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 102 transitions. [2025-02-07 17:29:36,972 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 102 transitions. Word has length 38 [2025-02-07 17:29:36,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:29:36,972 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 102 transitions. [2025-02-07 17:29:36,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-07 17:29:36,973 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 102 transitions. [2025-02-07 17:29:36,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-02-07 17:29:36,974 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:29:36,974 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:29:36,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-07 17:29:36,974 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:29:36,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:29:36,975 INFO L85 PathProgramCache]: Analyzing trace with hash -148067867, now seen corresponding path program 1 times [2025-02-07 17:29:36,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:29:36,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454684872] [2025-02-07 17:29:36,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:29:36,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:29:37,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-07 17:29:37,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-07 17:29:37,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:29:37,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:29:37,157 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-07 17:29:37,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:29:37,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454684872] [2025-02-07 17:29:37,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454684872] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 17:29:37,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1699925741] [2025-02-07 17:29:37,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:29:37,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:29:37,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:29:37,161 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 17:29:37,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-07 17:29:37,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-07 17:29:37,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-07 17:29:37,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:29:37,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:29:37,368 INFO L256 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-07 17:29:37,373 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:29:37,397 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-07 17:29:37,397 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 17:29:37,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1699925741] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 17:29:37,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-07 17:29:37,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-02-07 17:29:37,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164039450] [2025-02-07 17:29:37,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 17:29:37,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 17:29:37,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:29:37,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 17:29:37,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 17:29:37,399 INFO L87 Difference]: Start difference. First operand 78 states and 102 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-07 17:29:37,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:29:37,416 INFO L93 Difference]: Finished difference Result 153 states and 202 transitions. [2025-02-07 17:29:37,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 17:29:37,417 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 40 [2025-02-07 17:29:37,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:29:37,418 INFO L225 Difference]: With dead ends: 153 [2025-02-07 17:29:37,418 INFO L226 Difference]: Without dead ends: 79 [2025-02-07 17:29:37,418 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 17:29:37,419 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 0 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 17:29:37,419 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 198 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 17:29:37,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-02-07 17:29:37,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2025-02-07 17:29:37,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 69 states have (on average 1.318840579710145) internal successors, (91), 69 states have internal predecessors, (91), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-07 17:29:37,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 103 transitions. [2025-02-07 17:29:37,424 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 103 transitions. Word has length 40 [2025-02-07 17:29:37,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:29:37,425 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 103 transitions. [2025-02-07 17:29:37,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-07 17:29:37,425 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 103 transitions. [2025-02-07 17:29:37,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-02-07 17:29:37,425 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:29:37,426 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:29:37,437 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-07 17:29:37,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:29:37,626 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:29:37,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:29:37,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1911391491, now seen corresponding path program 1 times [2025-02-07 17:29:37,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:29:37,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614710190] [2025-02-07 17:29:37,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:29:37,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:29:37,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-07 17:29:37,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-07 17:29:37,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:29:37,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:29:37,785 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 17:29:37,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:29:37,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614710190] [2025-02-07 17:29:37,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614710190] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 17:29:37,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2045725787] [2025-02-07 17:29:37,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:29:37,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:29:37,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:29:37,788 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 17:29:37,788 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-07 17:29:37,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-07 17:29:37,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-07 17:29:37,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:29:37,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:29:37,990 INFO L256 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-07 17:29:37,992 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:29:38,008 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-07 17:29:38,009 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 17:29:38,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2045725787] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 17:29:38,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-07 17:29:38,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-02-07 17:29:38,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954574072] [2025-02-07 17:29:38,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 17:29:38,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 17:29:38,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:29:38,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 17:29:38,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 17:29:38,010 INFO L87 Difference]: Start difference. First operand 79 states and 103 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-07 17:29:38,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:29:38,032 INFO L93 Difference]: Finished difference Result 145 states and 189 transitions. [2025-02-07 17:29:38,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 17:29:38,033 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 42 [2025-02-07 17:29:38,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:29:38,034 INFO L225 Difference]: With dead ends: 145 [2025-02-07 17:29:38,034 INFO L226 Difference]: Without dead ends: 86 [2025-02-07 17:29:38,034 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 17:29:38,034 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 6 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 17:29:38,035 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 189 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 17:29:38,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-02-07 17:29:38,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 80. [2025-02-07 17:29:38,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 70 states have (on average 1.3142857142857143) internal successors, (92), 70 states have internal predecessors, (92), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-07 17:29:38,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 104 transitions. [2025-02-07 17:29:38,043 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 104 transitions. Word has length 42 [2025-02-07 17:29:38,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:29:38,044 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 104 transitions. [2025-02-07 17:29:38,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-07 17:29:38,044 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 104 transitions. [2025-02-07 17:29:38,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-02-07 17:29:38,045 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:29:38,045 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:29:38,055 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-07 17:29:38,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:29:38,250 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:29:38,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:29:38,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1063934498, now seen corresponding path program 1 times [2025-02-07 17:29:38,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:29:38,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18604880] [2025-02-07 17:29:38,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:29:38,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:29:38,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-07 17:29:38,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-07 17:29:38,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:29:38,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:29:38,362 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-02-07 17:29:38,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:29:38,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18604880] [2025-02-07 17:29:38,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18604880] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 17:29:38,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1053811541] [2025-02-07 17:29:38,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:29:38,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:29:38,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:29:38,364 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 17:29:38,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-07 17:29:38,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-07 17:29:38,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-07 17:29:38,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:29:38,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:29:38,562 INFO L256 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-07 17:29:38,564 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:29:38,572 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-07 17:29:38,572 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 17:29:38,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1053811541] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 17:29:38,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-07 17:29:38,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-02-07 17:29:38,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213505618] [2025-02-07 17:29:38,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 17:29:38,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 17:29:38,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:29:38,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 17:29:38,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 17:29:38,573 INFO L87 Difference]: Start difference. First operand 80 states and 104 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-07 17:29:38,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:29:38,604 INFO L93 Difference]: Finished difference Result 135 states and 177 transitions. [2025-02-07 17:29:38,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 17:29:38,604 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 45 [2025-02-07 17:29:38,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:29:38,605 INFO L225 Difference]: With dead ends: 135 [2025-02-07 17:29:38,605 INFO L226 Difference]: Without dead ends: 87 [2025-02-07 17:29:38,606 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 17:29:38,606 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 6 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 17:29:38,606 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 193 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 17:29:38,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-02-07 17:29:38,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 81. [2025-02-07 17:29:38,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 71 states have (on average 1.3098591549295775) internal successors, (93), 71 states have internal predecessors, (93), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-07 17:29:38,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 105 transitions. [2025-02-07 17:29:38,611 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 105 transitions. Word has length 45 [2025-02-07 17:29:38,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:29:38,611 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 105 transitions. [2025-02-07 17:29:38,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-07 17:29:38,612 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 105 transitions. [2025-02-07 17:29:38,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-07 17:29:38,612 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:29:38,613 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:29:38,620 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-07 17:29:38,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:29:38,814 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:29:38,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:29:38,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1558259555, now seen corresponding path program 1 times [2025-02-07 17:29:38,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:29:38,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130110453] [2025-02-07 17:29:38,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:29:38,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:29:38,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-07 17:29:38,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-07 17:29:38,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:29:38,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:29:38,931 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-02-07 17:29:38,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:29:38,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130110453] [2025-02-07 17:29:38,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130110453] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 17:29:38,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1747918727] [2025-02-07 17:29:38,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:29:38,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:29:38,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:29:38,934 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 17:29:38,950 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-07 17:29:39,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-07 17:29:39,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-07 17:29:39,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:29:39,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:29:39,148 INFO L256 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-07 17:29:39,152 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:29:39,159 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-07 17:29:39,159 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 17:29:39,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1747918727] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 17:29:39,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-07 17:29:39,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-02-07 17:29:39,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298476179] [2025-02-07 17:29:39,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 17:29:39,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 17:29:39,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:29:39,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 17:29:39,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 17:29:39,161 INFO L87 Difference]: Start difference. First operand 81 states and 105 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-07 17:29:39,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:29:39,202 INFO L93 Difference]: Finished difference Result 115 states and 154 transitions. [2025-02-07 17:29:39,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 17:29:39,202 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 48 [2025-02-07 17:29:39,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:29:39,203 INFO L225 Difference]: With dead ends: 115 [2025-02-07 17:29:39,203 INFO L226 Difference]: Without dead ends: 110 [2025-02-07 17:29:39,203 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 17:29:39,204 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 42 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 17:29:39,204 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 162 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 17:29:39,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-02-07 17:29:39,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 82. [2025-02-07 17:29:39,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 72 states have (on average 1.3055555555555556) internal successors, (94), 72 states have internal predecessors, (94), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-07 17:29:39,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 106 transitions. [2025-02-07 17:29:39,216 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 106 transitions. Word has length 48 [2025-02-07 17:29:39,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:29:39,217 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 106 transitions. [2025-02-07 17:29:39,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-07 17:29:39,217 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 106 transitions. [2025-02-07 17:29:39,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-02-07 17:29:39,221 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:29:39,221 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:29:39,236 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-07 17:29:39,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:29:39,422 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:29:39,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:29:39,423 INFO L85 PathProgramCache]: Analyzing trace with hash 939739621, now seen corresponding path program 1 times [2025-02-07 17:29:39,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:29:39,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153340129] [2025-02-07 17:29:39,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:29:39,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:29:39,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-07 17:29:39,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-07 17:29:39,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:29:39,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:29:39,544 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-07 17:29:39,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:29:39,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153340129] [2025-02-07 17:29:39,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153340129] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 17:29:39,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [642811582] [2025-02-07 17:29:39,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:29:39,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:29:39,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:29:39,549 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 17:29:39,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-07 17:29:39,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-07 17:29:39,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-07 17:29:39,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:29:39,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:29:39,756 INFO L256 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-07 17:29:39,759 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:29:39,798 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-07 17:29:39,798 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 17:29:39,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [642811582] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 17:29:39,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-07 17:29:39,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-02-07 17:29:39,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399241116] [2025-02-07 17:29:39,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 17:29:39,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 17:29:39,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:29:39,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 17:29:39,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 17:29:39,799 INFO L87 Difference]: Start difference. First operand 82 states and 106 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-07 17:29:39,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:29:39,803 INFO L93 Difference]: Finished difference Result 82 states and 106 transitions. [2025-02-07 17:29:39,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 17:29:39,803 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 77 [2025-02-07 17:29:39,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:29:39,804 INFO L225 Difference]: With dead ends: 82 [2025-02-07 17:29:39,804 INFO L226 Difference]: Without dead ends: 0 [2025-02-07 17:29:39,804 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 17:29:39,805 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 14 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 17:29:39,805 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 146 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 17:29:39,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-07 17:29:39,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-07 17:29:39,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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-07 17:29:39,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-07 17:29:39,806 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 77 [2025-02-07 17:29:39,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:29:39,806 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-07 17:29:39,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-07 17:29:39,806 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-07 17:29:39,806 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-07 17:29:39,808 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-07 17:29:39,815 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-07 17:29:40,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:29:40,012 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-02-07 17:29:40,014 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-07 17:29:40,033 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-07 17:29:40,042 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.02 05:29:40 BoogieIcfgContainer [2025-02-07 17:29:40,042 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-07 17:29:40,042 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-07 17:29:40,042 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-07 17:29:40,042 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-07 17:29:40,043 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 05:29:36" (3/4) ... [2025-02-07 17:29:40,044 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-07 17:29:40,050 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure tso_core_write [2025-02-07 17:29:40,050 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_nondet_headerT [2025-02-07 17:29:40,050 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure stepWriteBuffer [2025-02-07 17:29:40,050 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure tso_core_read [2025-02-07 17:29:40,050 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure tso_core_fence [2025-02-07 17:29:40,050 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure store_buffering_2_conditions [2025-02-07 17:29:40,050 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure initWriteBuffer [2025-02-07 17:29:40,056 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 58 nodes and edges [2025-02-07 17:29:40,057 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-02-07 17:29:40,057 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-02-07 17:29:40,058 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-07 17:29:40,129 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-07 17:29:40,129 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-07 17:29:40,130 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-07 17:29:40,130 INFO L158 Benchmark]: Toolchain (without parser) took 5084.44ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 109.0MB in the beginning and 116.2MB in the end (delta: -7.2MB). Peak memory consumption was 151.3MB. Max. memory is 16.1GB. [2025-02-07 17:29:40,130 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 126.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 17:29:40,131 INFO L158 Benchmark]: CACSL2BoogieTranslator took 302.07ms. Allocated memory is still 142.6MB. Free memory was 109.0MB in the beginning and 87.9MB in the end (delta: 21.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-07 17:29:40,131 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.75ms. Allocated memory is still 142.6MB. Free memory was 87.9MB in the beginning and 81.7MB in the end (delta: 6.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 17:29:40,131 INFO L158 Benchmark]: Boogie Preprocessor took 79.79ms. Allocated memory is still 142.6MB. Free memory was 81.7MB in the beginning and 73.4MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 17:29:40,131 INFO L158 Benchmark]: IcfgBuilder took 953.01ms. Allocated memory is still 142.6MB. Free memory was 73.4MB in the beginning and 78.9MB in the end (delta: -5.6MB). Peak memory consumption was 51.2MB. Max. memory is 16.1GB. [2025-02-07 17:29:40,131 INFO L158 Benchmark]: TraceAbstraction took 3603.20ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 78.3MB in the beginning and 127.1MB in the end (delta: -48.8MB). Peak memory consumption was 108.5MB. Max. memory is 16.1GB. [2025-02-07 17:29:40,132 INFO L158 Benchmark]: Witness Printer took 87.36ms. Allocated memory is still 302.0MB. Free memory was 127.1MB in the beginning and 116.2MB in the end (delta: 10.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 17:29:40,133 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 126.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 302.07ms. Allocated memory is still 142.6MB. Free memory was 109.0MB in the beginning and 87.9MB in the end (delta: 21.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.75ms. Allocated memory is still 142.6MB. Free memory was 87.9MB in the beginning and 81.7MB in the end (delta: 6.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 79.79ms. Allocated memory is still 142.6MB. Free memory was 81.7MB in the beginning and 73.4MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 953.01ms. Allocated memory is still 142.6MB. Free memory was 73.4MB in the beginning and 78.9MB in the end (delta: -5.6MB). Peak memory consumption was 51.2MB. Max. memory is 16.1GB. * TraceAbstraction took 3603.20ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 78.3MB in the beginning and 127.1MB in the end (delta: -48.8MB). Peak memory consumption was 108.5MB. Max. memory is 16.1GB. * Witness Printer took 87.36ms. Allocated memory is still 302.0MB. Free memory was 127.1MB in the beginning and 116.2MB in the end (delta: 10.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 374]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 105 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.5s, OverallIterations: 6, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 70 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 68 mSDsluCounter, 1118 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 529 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 70 IncrementalHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 589 mSDtfsCounter, 70 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 270 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=83occurred in iteration=0, InterpolantAutomatonStates: 18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 40 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 542 NumberOfCodeBlocks, 542 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 531 ConstructedInterpolants, 0 QuantifiedInterpolants, 685 SizeOfPredicates, 0 NumberOfNonLiveVariables, 2330 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 11 InterpolantComputations, 6 PerfectInterpolantSequences, 134/139 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 326]: Location Invariant Derived location invariant: (((long long) event_i1 + 1) == 0) RESULT: Ultimate proved your program to be correct! [2025-02-07 17:29:40,156 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE