./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-atomic/read_write_lock-2.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --validate ./goblint.2024-05-21_14-57-05.files/mutex-meet/read_write_lock-2.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version bcb38a6f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-atomic/read_write_lock-2.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/read_write_lock-2.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-bcb38a6-m [2024-06-04 16:30:05,350 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-04 16:30:05,415 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-04 16:30:05,420 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-04 16:30:05,420 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-04 16:30:05,440 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-04 16:30:05,445 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-04 16:30:05,445 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-04 16:30:05,446 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-04 16:30:05,448 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-04 16:30:05,449 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-04 16:30:05,449 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-04 16:30:05,450 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-04 16:30:05,451 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-04 16:30:05,451 INFO L153 SettingsManager]: * Use SBE=true [2024-06-04 16:30:05,451 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-04 16:30:05,452 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-04 16:30:05,452 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-04 16:30:05,452 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-04 16:30:05,452 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-04 16:30:05,452 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-04 16:30:05,453 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-04 16:30:05,453 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-04 16:30:05,453 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-04 16:30:05,454 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-04 16:30:05,454 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-04 16:30:05,454 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-04 16:30:05,454 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-04 16:30:05,455 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-04 16:30:05,455 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-04 16:30:05,456 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-04 16:30:05,456 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-04 16:30:05,456 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-04 16:30:05,456 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-04 16:30:05,457 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-04 16:30:05,457 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-04 16:30:05,457 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-04 16:30:05,457 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-04 16:30:05,457 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-04 16:30:05,457 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-04 16:30:05,458 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-04 16:30:05,458 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-04 16:30:05,458 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-04 16:30:05,458 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false [2024-06-04 16:30:05,643 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-04 16:30:05,670 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-04 16:30:05,672 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-04 16:30:05,673 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-04 16:30:05,673 INFO L274 PluginConnector]: CDTParser initialized [2024-06-04 16:30:05,674 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-atomic/read_write_lock-2.i [2024-06-04 16:30:06,695 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-04 16:30:06,885 INFO L384 CDTParser]: Found 1 translation units. [2024-06-04 16:30:06,887 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/read_write_lock-2.i [2024-06-04 16:30:06,897 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/589f25c25/cb47236a9aa44e26b9607f255b5d118b/FLAGbbe17f639 [2024-06-04 16:30:06,908 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/589f25c25/cb47236a9aa44e26b9607f255b5d118b [2024-06-04 16:30:06,910 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-04 16:30:06,910 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-04 16:30:06,911 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-05-21_14-57-05.files/mutex-meet/read_write_lock-2.yml/witness.yml [2024-06-04 16:30:07,023 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-04 16:30:07,024 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-04 16:30:07,025 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-04 16:30:07,025 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-04 16:30:07,029 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-04 16:30:07,030 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 04:30:06" (1/2) ... [2024-06-04 16:30:07,031 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d86fc1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 04:30:07, skipping insertion in model container [2024-06-04 16:30:07,031 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 04:30:06" (1/2) ... [2024-06-04 16:30:07,032 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@7acb05ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 04:30:07, skipping insertion in model container [2024-06-04 16:30:07,033 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 04:30:07" (2/2) ... [2024-06-04 16:30:07,033 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d86fc1a and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:30:07, skipping insertion in model container [2024-06-04 16:30:07,033 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 04:30:07" (2/2) ... [2024-06-04 16:30:07,034 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-04 16:30:07,078 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-04 16:30:07,079 INFO L97 edCorrectnessWitness]: Location invariant before [L750-L750] ((((! multithreaded || ((((0 <= x && x <= 3) && x <= 127) && x % 3 == 0) && (x == 0 || x == 3))) && (! multithreaded || ((((((((1LL - (long long )w) + (long long )x >= 0LL && (1LL - (long long )w) + (long long )y >= 0LL) && (3LL - (long long )x) + (long long )y >= 0LL) && (long long )w + (long long )x >= 0LL) && (long long )w + (long long )y >= 0LL) && (long long )x + (long long )y >= 0LL) && (3LL + (long long )w) - (long long )x >= 0LL) && (4LL - (long long )w) - (long long )x >= 0LL))) && (! multithreaded || ((((0 <= y && y <= 3) && y <= 127) && y % 3 == 0) && (y == 0 || y == 3)))) && (! multithreaded || (((((((((((0 <= w && 0 <= x) && 0 <= y) && w <= 1) && x <= 3) && x <= 127) && y <= 127) && x % 3 == 0) && y % 3 == 0) && (w == 0 || w == 1)) && (x == 0 || x == 3)) && (y == 0 || y == 3)))) && (! multithreaded || ((0 <= w && w <= 1) && (w == 0 || w == 1))) [2024-06-04 16:30:07,079 INFO L97 edCorrectnessWitness]: Location invariant before [L753-L753] ((((! multithreaded || ((((0 <= x && x <= 3) && x <= 127) && x % 3 == 0) && (x == 0 || x == 3))) && (! multithreaded || ((((((((1LL - (long long )w) + (long long )x >= 0LL && (1LL - (long long )w) + (long long )y >= 0LL) && (3LL - (long long )x) + (long long )y >= 0LL) && (long long )w + (long long )x >= 0LL) && (long long )w + (long long )y >= 0LL) && (long long )x + (long long )y >= 0LL) && (3LL + (long long )w) - (long long )x >= 0LL) && (4LL - (long long )w) - (long long )x >= 0LL))) && (! multithreaded || ((((0 <= y && y <= 3) && y <= 127) && y % 3 == 0) && (y == 0 || y == 3)))) && (! multithreaded || (((((((((((0 <= w && 0 <= x) && 0 <= y) && w <= 1) && x <= 3) && x <= 127) && y <= 127) && x % 3 == 0) && y % 3 == 0) && (w == 0 || w == 1)) && (x == 0 || x == 3)) && (y == 0 || y == 3)))) && (! multithreaded || ((0 <= w && w <= 1) && (w == 0 || w == 1))) [2024-06-04 16:30:07,080 INFO L97 edCorrectnessWitness]: Location invariant before [L751-L751] ((((! multithreaded || ((((0 <= x && x <= 3) && x <= 127) && x % 3 == 0) && (x == 0 || x == 3))) && (! multithreaded || ((((((((1LL - (long long )w) + (long long )x >= 0LL && (1LL - (long long )w) + (long long )y >= 0LL) && (3LL - (long long )x) + (long long )y >= 0LL) && (long long )w + (long long )x >= 0LL) && (long long )w + (long long )y >= 0LL) && (long long )x + (long long )y >= 0LL) && (3LL + (long long )w) - (long long )x >= 0LL) && (4LL - (long long )w) - (long long )x >= 0LL))) && (! multithreaded || ((((0 <= y && y <= 3) && y <= 127) && y % 3 == 0) && (y == 0 || y == 3)))) && (! multithreaded || (((((((((((0 <= w && 0 <= x) && 0 <= y) && w <= 1) && x <= 3) && x <= 127) && y <= 127) && x % 3 == 0) && y % 3 == 0) && (w == 0 || w == 1)) && (x == 0 || x == 3)) && (y == 0 || y == 3)))) && (! multithreaded || ((0 <= w && w <= 1) && (w == 0 || w == 1))) [2024-06-04 16:30:07,080 INFO L97 edCorrectnessWitness]: Location invariant before [L752-L752] ((((! multithreaded || ((((0 <= x && x <= 3) && x <= 127) && x % 3 == 0) && (x == 0 || x == 3))) && (! multithreaded || ((((((((1LL - (long long )w) + (long long )x >= 0LL && (1LL - (long long )w) + (long long )y >= 0LL) && (3LL - (long long )x) + (long long )y >= 0LL) && (long long )w + (long long )x >= 0LL) && (long long )w + (long long )y >= 0LL) && (long long )x + (long long )y >= 0LL) && (3LL + (long long )w) - (long long )x >= 0LL) && (4LL - (long long )w) - (long long )x >= 0LL))) && (! multithreaded || ((((0 <= y && y <= 3) && y <= 127) && y % 3 == 0) && (y == 0 || y == 3)))) && (! multithreaded || (((((((((((0 <= w && 0 <= x) && 0 <= y) && w <= 1) && x <= 3) && x <= 127) && y <= 127) && x % 3 == 0) && y % 3 == 0) && (w == 0 || w == 1)) && (x == 0 || x == 3)) && (y == 0 || y == 3)))) && (! multithreaded || ((0 <= w && w <= 1) && (w == 0 || w == 1))) [2024-06-04 16:30:07,080 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-04 16:30:07,081 INFO L106 edCorrectnessWitness]: ghost_update [L749-L749] multithreaded = 1; [2024-06-04 16:30:07,110 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-04 16:30:07,346 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-04 16:30:07,357 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-04 16:30:07,458 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-04 16:30:07,497 INFO L206 MainTranslator]: Completed translation [2024-06-04 16:30:07,499 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:30:07 WrapperNode [2024-06-04 16:30:07,499 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-04 16:30:07,500 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-04 16:30:07,500 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-04 16:30:07,500 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-04 16:30:07,505 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:30:07" (1/1) ... [2024-06-04 16:30:07,531 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:30:07" (1/1) ... [2024-06-04 16:30:07,565 INFO L138 Inliner]: procedures = 172, calls = 31, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 103 [2024-06-04 16:30:07,567 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-04 16:30:07,568 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-04 16:30:07,568 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-04 16:30:07,568 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-04 16:30:07,576 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:30:07" (1/1) ... [2024-06-04 16:30:07,577 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:30:07" (1/1) ... [2024-06-04 16:30:07,581 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:30:07" (1/1) ... [2024-06-04 16:30:07,600 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-06-04 16:30:07,600 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:30:07" (1/1) ... [2024-06-04 16:30:07,600 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:30:07" (1/1) ... [2024-06-04 16:30:07,614 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:30:07" (1/1) ... [2024-06-04 16:30:07,616 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:30:07" (1/1) ... [2024-06-04 16:30:07,619 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:30:07" (1/1) ... [2024-06-04 16:30:07,620 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:30:07" (1/1) ... [2024-06-04 16:30:07,623 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-04 16:30:07,626 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-04 16:30:07,627 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-04 16:30:07,627 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-04 16:30:07,628 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:30:07" (1/1) ... [2024-06-04 16:30:07,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-04 16:30:07,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-04 16:30:07,653 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-06-04 16:30:07,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-06-04 16:30:07,688 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-04 16:30:07,688 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-04 16:30:07,688 INFO L130 BoogieDeclarations]: Found specification of procedure reader [2024-06-04 16:30:07,688 INFO L138 BoogieDeclarations]: Found implementation of procedure reader [2024-06-04 16:30:07,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-04 16:30:07,689 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-04 16:30:07,689 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-04 16:30:07,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-04 16:30:07,689 INFO L130 BoogieDeclarations]: Found specification of procedure writer [2024-06-04 16:30:07,689 INFO L138 BoogieDeclarations]: Found implementation of procedure writer [2024-06-04 16:30:07,690 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-04 16:30:07,825 INFO L244 CfgBuilder]: Building ICFG [2024-06-04 16:30:07,827 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-04 16:30:08,075 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-04 16:30:08,076 INFO L293 CfgBuilder]: Performing block encoding [2024-06-04 16:30:08,138 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-04 16:30:08,141 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-04 16:30:08,142 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.06 04:30:08 BoogieIcfgContainer [2024-06-04 16:30:08,142 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-04 16:30:08,144 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-04 16:30:08,144 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-04 16:30:08,146 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-04 16:30:08,147 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.06 04:30:06" (1/4) ... [2024-06-04 16:30:08,148 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@182160f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.06 04:30:08, skipping insertion in model container [2024-06-04 16:30:08,148 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 04:30:07" (2/4) ... [2024-06-04 16:30:08,148 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@182160f8 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 04.06 04:30:08, skipping insertion in model container [2024-06-04 16:30:08,148 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:30:07" (3/4) ... [2024-06-04 16:30:08,149 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@182160f8 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 04.06 04:30:08, skipping insertion in model container [2024-06-04 16:30:08,149 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.06 04:30:08" (4/4) ... [2024-06-04 16:30:08,150 INFO L112 eAbstractionObserver]: Analyzing ICFG read_write_lock-2.i [2024-06-04 16:30:08,163 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-04 16:30:08,163 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-06-04 16:30:08,163 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-04 16:30:08,228 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-06-04 16:30:08,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 58 transitions, 144 flow [2024-06-04 16:30:08,293 INFO L124 PetriNetUnfolderBase]: 0/54 cut-off events. [2024-06-04 16:30:08,294 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-06-04 16:30:08,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71 conditions, 54 events. 0/54 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 97 event pairs, 0 based on Foata normal form. 0/50 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2024-06-04 16:30:08,295 INFO L82 GeneralOperation]: Start removeDead. Operand has 71 places, 58 transitions, 144 flow [2024-06-04 16:30:08,299 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 61 places, 48 transitions, 108 flow [2024-06-04 16:30:08,311 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-04 16:30:08,316 INFO L357 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, mHoare=false, 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;@27c53e11, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-04 16:30:08,316 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-06-04 16:30:08,319 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-04 16:30:08,319 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-04 16:30:08,319 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-04 16:30:08,319 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:30:08,320 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-04 16:30:08,320 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-04 16:30:08,326 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:30:08,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1341263991, now seen corresponding path program 1 times [2024-06-04 16:30:08,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:30:08,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341604898] [2024-06-04 16:30:08,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:30:08,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:30:08,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:30:08,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:30:08,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:30:08,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341604898] [2024-06-04 16:30:08,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341604898] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:30:08,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:30:08,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-04 16:30:08,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122245585] [2024-06-04 16:30:08,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:30:08,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-04 16:30:08,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:30:08,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-04 16:30:08,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-04 16:30:08,853 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 58 [2024-06-04 16:30:08,856 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 48 transitions, 108 flow. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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) [2024-06-04 16:30:08,856 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:30:08,856 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 58 [2024-06-04 16:30:08,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:30:09,823 INFO L124 PetriNetUnfolderBase]: 5905/9727 cut-off events. [2024-06-04 16:30:09,824 INFO L125 PetriNetUnfolderBase]: For 117/117 co-relation queries the response was YES. [2024-06-04 16:30:09,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18099 conditions, 9727 events. 5905/9727 cut-off events. For 117/117 co-relation queries the response was YES. Maximal size of possible extension queue 397. Compared 66733 event pairs, 3124 based on Foata normal form. 9/9480 useless extension candidates. Maximal degree in co-relation 18083. Up to 8047 conditions per place. [2024-06-04 16:30:09,879 INFO L140 encePairwiseOnDemand]: 49/58 looper letters, 47 selfloop transitions, 5 changer transitions 0/66 dead transitions. [2024-06-04 16:30:09,880 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 66 transitions, 257 flow [2024-06-04 16:30:09,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-04 16:30:09,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-04 16:30:09,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2024-06-04 16:30:09,890 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6494252873563219 [2024-06-04 16:30:09,892 INFO L175 Difference]: Start difference. First operand has 61 places, 48 transitions, 108 flow. Second operand 3 states and 113 transitions. [2024-06-04 16:30:09,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 66 transitions, 257 flow [2024-06-04 16:30:09,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 66 transitions, 250 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-06-04 16:30:09,901 INFO L231 Difference]: Finished difference. Result has 60 places, 52 transitions, 143 flow [2024-06-04 16:30:09,902 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=143, PETRI_PLACES=60, PETRI_TRANSITIONS=52} [2024-06-04 16:30:09,905 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, -1 predicate places. [2024-06-04 16:30:09,905 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 52 transitions, 143 flow [2024-06-04 16:30:09,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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) [2024-06-04 16:30:09,906 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:30:09,906 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:30:09,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-04 16:30:09,906 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-04 16:30:09,907 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:30:09,907 INFO L85 PathProgramCache]: Analyzing trace with hash -464438168, now seen corresponding path program 1 times [2024-06-04 16:30:09,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:30:09,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206605574] [2024-06-04 16:30:09,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:30:09,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:30:09,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:30:10,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:30:10,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:30:10,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206605574] [2024-06-04 16:30:10,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206605574] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:30:10,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:30:10,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-04 16:30:10,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761077284] [2024-06-04 16:30:10,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:30:10,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-04 16:30:10,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:30:10,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-04 16:30:10,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-04 16:30:10,179 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 58 [2024-06-04 16:30:10,180 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 52 transitions, 143 flow. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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) [2024-06-04 16:30:10,180 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:30:10,180 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 58 [2024-06-04 16:30:10,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:30:11,217 INFO L124 PetriNetUnfolderBase]: 9222/14466 cut-off events. [2024-06-04 16:30:11,218 INFO L125 PetriNetUnfolderBase]: For 2061/2061 co-relation queries the response was YES. [2024-06-04 16:30:11,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30749 conditions, 14466 events. 9222/14466 cut-off events. For 2061/2061 co-relation queries the response was YES. Maximal size of possible extension queue 569. Compared 97480 event pairs, 4632 based on Foata normal form. 115/14415 useless extension candidates. Maximal degree in co-relation 30734. Up to 12366 conditions per place. [2024-06-04 16:30:11,302 INFO L140 encePairwiseOnDemand]: 45/58 looper letters, 61 selfloop transitions, 9 changer transitions 0/82 dead transitions. [2024-06-04 16:30:11,302 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 82 transitions, 359 flow [2024-06-04 16:30:11,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-04 16:30:11,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-04 16:30:11,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 146 transitions. [2024-06-04 16:30:11,304 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6293103448275862 [2024-06-04 16:30:11,304 INFO L175 Difference]: Start difference. First operand has 60 places, 52 transitions, 143 flow. Second operand 4 states and 146 transitions. [2024-06-04 16:30:11,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 82 transitions, 359 flow [2024-06-04 16:30:11,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 82 transitions, 354 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-04 16:30:11,306 INFO L231 Difference]: Finished difference. Result has 63 places, 56 transitions, 198 flow [2024-06-04 16:30:11,307 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=198, PETRI_PLACES=63, PETRI_TRANSITIONS=56} [2024-06-04 16:30:11,307 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 2 predicate places. [2024-06-04 16:30:11,307 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 56 transitions, 198 flow [2024-06-04 16:30:11,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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) [2024-06-04 16:30:11,308 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:30:11,308 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:30:11,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-04 16:30:11,308 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-04 16:30:11,309 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:30:11,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1512679122, now seen corresponding path program 1 times [2024-06-04 16:30:11,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:30:11,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794868254] [2024-06-04 16:30:11,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:30:11,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:30:11,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:30:11,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:30:11,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:30:11,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794868254] [2024-06-04 16:30:11,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794868254] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:30:11,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:30:11,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-04 16:30:11,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024549332] [2024-06-04 16:30:11,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:30:11,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-04 16:30:11,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:30:11,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-04 16:30:11,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-04 16:30:11,613 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 58 [2024-06-04 16:30:11,613 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 56 transitions, 198 flow. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 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) [2024-06-04 16:30:11,613 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:30:11,613 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 58 [2024-06-04 16:30:11,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:30:12,581 INFO L124 PetriNetUnfolderBase]: 8409/13384 cut-off events. [2024-06-04 16:30:12,581 INFO L125 PetriNetUnfolderBase]: For 5780/5780 co-relation queries the response was YES. [2024-06-04 16:30:12,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33228 conditions, 13384 events. 8409/13384 cut-off events. For 5780/5780 co-relation queries the response was YES. Maximal size of possible extension queue 551. Compared 91055 event pairs, 2749 based on Foata normal form. 339/13440 useless extension candidates. Maximal degree in co-relation 33211. Up to 9313 conditions per place. [2024-06-04 16:30:12,664 INFO L140 encePairwiseOnDemand]: 43/58 looper letters, 81 selfloop transitions, 21 changer transitions 0/114 dead transitions. [2024-06-04 16:30:12,665 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 114 transitions, 594 flow [2024-06-04 16:30:12,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 16:30:12,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 16:30:12,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 189 transitions. [2024-06-04 16:30:12,670 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6517241379310345 [2024-06-04 16:30:12,670 INFO L175 Difference]: Start difference. First operand has 63 places, 56 transitions, 198 flow. Second operand 5 states and 189 transitions. [2024-06-04 16:30:12,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 114 transitions, 594 flow [2024-06-04 16:30:12,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 114 transitions, 578 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-06-04 16:30:12,676 INFO L231 Difference]: Finished difference. Result has 68 places, 68 transitions, 351 flow [2024-06-04 16:30:12,676 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=351, PETRI_PLACES=68, PETRI_TRANSITIONS=68} [2024-06-04 16:30:12,677 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 7 predicate places. [2024-06-04 16:30:12,677 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 68 transitions, 351 flow [2024-06-04 16:30:12,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 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) [2024-06-04 16:30:12,677 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:30:12,677 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:30:12,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-04 16:30:12,678 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-04 16:30:12,678 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:30:12,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1869887243, now seen corresponding path program 1 times [2024-06-04 16:30:12,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:30:12,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599991020] [2024-06-04 16:30:12,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:30:12,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:30:12,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:30:12,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:30:12,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:30:12,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599991020] [2024-06-04 16:30:12,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599991020] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:30:12,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:30:12,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-04 16:30:12,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409429030] [2024-06-04 16:30:12,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:30:12,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-04 16:30:12,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:30:12,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-04 16:30:12,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-04 16:30:12,871 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 58 [2024-06-04 16:30:12,872 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 68 transitions, 351 flow. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 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) [2024-06-04 16:30:12,873 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:30:12,873 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 58 [2024-06-04 16:30:12,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:30:13,944 INFO L124 PetriNetUnfolderBase]: 8195/12989 cut-off events. [2024-06-04 16:30:13,944 INFO L125 PetriNetUnfolderBase]: For 17024/17030 co-relation queries the response was YES. [2024-06-04 16:30:13,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40361 conditions, 12989 events. 8195/12989 cut-off events. For 17024/17030 co-relation queries the response was YES. Maximal size of possible extension queue 544. Compared 88248 event pairs, 2416 based on Foata normal form. 110/12779 useless extension candidates. Maximal degree in co-relation 40341. Up to 9283 conditions per place. [2024-06-04 16:30:14,018 INFO L140 encePairwiseOnDemand]: 45/58 looper letters, 81 selfloop transitions, 17 changer transitions 0/110 dead transitions. [2024-06-04 16:30:14,018 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 110 transitions, 677 flow [2024-06-04 16:30:14,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 16:30:14,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 16:30:14,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 183 transitions. [2024-06-04 16:30:14,019 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6310344827586207 [2024-06-04 16:30:14,019 INFO L175 Difference]: Start difference. First operand has 68 places, 68 transitions, 351 flow. Second operand 5 states and 183 transitions. [2024-06-04 16:30:14,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 110 transitions, 677 flow [2024-06-04 16:30:14,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 110 transitions, 669 flow, removed 4 selfloop flow, removed 0 redundant places. [2024-06-04 16:30:14,025 INFO L231 Difference]: Finished difference. Result has 72 places, 67 transitions, 381 flow [2024-06-04 16:30:14,025 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=335, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=381, PETRI_PLACES=72, PETRI_TRANSITIONS=67} [2024-06-04 16:30:14,026 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 11 predicate places. [2024-06-04 16:30:14,026 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 67 transitions, 381 flow [2024-06-04 16:30:14,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 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) [2024-06-04 16:30:14,026 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:30:14,027 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:30:14,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-04 16:30:14,027 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-04 16:30:14,027 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:30:14,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1742681279, now seen corresponding path program 1 times [2024-06-04 16:30:14,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:30:14,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313487249] [2024-06-04 16:30:14,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:30:14,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:30:14,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:30:14,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:30:14,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:30:14,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313487249] [2024-06-04 16:30:14,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313487249] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:30:14,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:30:14,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-04 16:30:14,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636704380] [2024-06-04 16:30:14,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:30:14,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-04 16:30:14,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:30:14,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-04 16:30:14,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-04 16:30:14,363 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 58 [2024-06-04 16:30:14,364 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 67 transitions, 381 flow. Second operand has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 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) [2024-06-04 16:30:14,364 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:30:14,364 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 58 [2024-06-04 16:30:14,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:30:15,627 INFO L124 PetriNetUnfolderBase]: 10109/16328 cut-off events. [2024-06-04 16:30:15,628 INFO L125 PetriNetUnfolderBase]: For 29596/29610 co-relation queries the response was YES. [2024-06-04 16:30:15,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51915 conditions, 16328 events. 10109/16328 cut-off events. For 29596/29610 co-relation queries the response was YES. Maximal size of possible extension queue 633. Compared 115636 event pairs, 3959 based on Foata normal form. 46/15985 useless extension candidates. Maximal degree in co-relation 51892. Up to 12984 conditions per place. [2024-06-04 16:30:15,739 INFO L140 encePairwiseOnDemand]: 47/58 looper letters, 89 selfloop transitions, 23 changer transitions 0/126 dead transitions. [2024-06-04 16:30:15,739 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 126 transitions, 878 flow [2024-06-04 16:30:15,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 16:30:15,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 16:30:15,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 217 transitions. [2024-06-04 16:30:15,741 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5344827586206896 [2024-06-04 16:30:15,741 INFO L175 Difference]: Start difference. First operand has 72 places, 67 transitions, 381 flow. Second operand 7 states and 217 transitions. [2024-06-04 16:30:15,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 126 transitions, 878 flow [2024-06-04 16:30:15,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 126 transitions, 836 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-06-04 16:30:15,763 INFO L231 Difference]: Finished difference. Result has 78 places, 85 transitions, 575 flow [2024-06-04 16:30:15,763 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=575, PETRI_PLACES=78, PETRI_TRANSITIONS=85} [2024-06-04 16:30:15,763 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 17 predicate places. [2024-06-04 16:30:15,764 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 85 transitions, 575 flow [2024-06-04 16:30:15,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 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) [2024-06-04 16:30:15,764 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:30:15,764 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:30:15,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-04 16:30:15,765 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-04 16:30:15,765 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:30:15,765 INFO L85 PathProgramCache]: Analyzing trace with hash -298585698, now seen corresponding path program 1 times [2024-06-04 16:30:15,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:30:15,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293483785] [2024-06-04 16:30:15,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:30:15,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:30:15,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:30:15,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:30:15,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:30:15,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293483785] [2024-06-04 16:30:15,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293483785] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:30:15,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:30:15,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-04 16:30:15,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483728346] [2024-06-04 16:30:15,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:30:15,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-04 16:30:15,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:30:15,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-04 16:30:15,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-04 16:30:15,813 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 58 [2024-06-04 16:30:15,813 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 85 transitions, 575 flow. Second operand has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 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) [2024-06-04 16:30:15,813 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:30:15,813 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 58 [2024-06-04 16:30:15,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:30:16,748 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([242] L714-->L714-1: Formula: (and (= v_~w~0_72 1) (not (= (ite (and (= v_~w~0_73 0) (= v_~r~0_51 0)) 1 0) 0))) InVars {~w~0=v_~w~0_73, ~r~0=v_~r~0_51} OutVars{~w~0=v_~w~0_72, writerThread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_writerThread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~r~0=v_~r~0_51, writerThread1of1ForFork3_assume_abort_if_not_~cond#1=|v_writerThread1of1ForFork3_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork3_assume_abort_if_not_~cond#1, writerThread1of1ForFork3_assume_abort_if_not_#in~cond#1][94], [Black: 95#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0)), writerThread1of1ForFork3InUse, 114#(= ~r~0 0), writerThread1of1ForFork2InUse, 83#true, 59#L744true, readerThread1of1ForFork0InUse, 16#L720true, readerThread1of1ForFork1InUse, 97#true, Black: 76#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), Black: 106#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= |#ghost~multithreaded| 1) (= ~y~0 0) (= ~w~0 0)), Black: 104#(and (= ~x~0 0) (= |#ghost~multithreaded| 1) (= ~y~0 0) (= ~w~0 0)), Black: 108#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= |#ghost~multithreaded| 1) (= ~w~0 0)), Black: 81#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 12#L714-1true, Black: 85#(= ~y~0 0), 28#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, Black: 86#(and (= ~w~0 1) (= ~y~0 0)), 11#L744true, Black: 87#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0))]) [2024-06-04 16:30:16,748 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-06-04 16:30:16,748 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-06-04 16:30:16,748 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-06-04 16:30:16,748 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-06-04 16:30:16,769 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([247] L714-->L714-1: Formula: (and (= v_~w~0_72 1) (not (= (ite (and (= v_~w~0_73 0) (= v_~r~0_51 0)) 1 0) 0))) InVars {~w~0=v_~w~0_73, ~r~0=v_~r~0_51} OutVars{~w~0=v_~w~0_72, writerThread1of1ForFork2_assume_abort_if_not_~cond#1=|v_writerThread1of1ForFork2_assume_abort_if_not_~cond#1_1|, writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~r~0=v_~r~0_51} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork2_assume_abort_if_not_~cond#1, writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1][98], [Black: 95#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0)), writerThread1of1ForFork3InUse, 114#(= ~r~0 0), writerThread1of1ForFork2InUse, 83#true, 59#L744true, readerThread1of1ForFork0InUse, 29#L714-1true, readerThread1of1ForFork1InUse, 6#L720true, 97#true, Black: 76#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), Black: 106#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= |#ghost~multithreaded| 1) (= ~y~0 0) (= ~w~0 0)), Black: 104#(and (= ~x~0 0) (= |#ghost~multithreaded| 1) (= ~y~0 0) (= ~w~0 0)), Black: 108#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= |#ghost~multithreaded| 1) (= ~w~0 0)), Black: 81#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), Black: 85#(= ~y~0 0), 28#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, Black: 86#(and (= ~w~0 1) (= ~y~0 0)), 11#L744true, Black: 87#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0))]) [2024-06-04 16:30:16,769 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-06-04 16:30:16,769 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-06-04 16:30:16,769 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-06-04 16:30:16,770 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-06-04 16:30:16,779 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([242] L714-->L714-1: Formula: (and (= v_~w~0_72 1) (not (= (ite (and (= v_~w~0_73 0) (= v_~r~0_51 0)) 1 0) 0))) InVars {~w~0=v_~w~0_73, ~r~0=v_~r~0_51} OutVars{~w~0=v_~w~0_72, writerThread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_writerThread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~r~0=v_~r~0_51, writerThread1of1ForFork3_assume_abort_if_not_~cond#1=|v_writerThread1of1ForFork3_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork3_assume_abort_if_not_~cond#1, writerThread1of1ForFork3_assume_abort_if_not_#in~cond#1][94], [Black: 95#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0)), writerThread1of1ForFork3InUse, 114#(= ~r~0 0), writerThread1of1ForFork2InUse, 83#true, 59#L744true, readerThread1of1ForFork0InUse, 16#L720true, readerThread1of1ForFork1InUse, 97#true, Black: 106#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= |#ghost~multithreaded| 1) (= ~y~0 0) (= ~w~0 0)), Black: 76#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), Black: 104#(and (= ~x~0 0) (= |#ghost~multithreaded| 1) (= ~y~0 0) (= ~w~0 0)), Black: 108#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= |#ghost~multithreaded| 1) (= ~w~0 0)), Black: 81#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 28#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 12#L714-1true, Black: 85#(= ~y~0 0), Black: 86#(and (= ~w~0 1) (= ~y~0 0)), 11#L744true, Black: 87#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0))]) [2024-06-04 16:30:16,780 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-06-04 16:30:16,780 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-06-04 16:30:16,780 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-06-04 16:30:16,780 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-06-04 16:30:16,780 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-06-04 16:30:16,784 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([242] L714-->L714-1: Formula: (and (= v_~w~0_72 1) (not (= (ite (and (= v_~w~0_73 0) (= v_~r~0_51 0)) 1 0) 0))) InVars {~w~0=v_~w~0_73, ~r~0=v_~r~0_51} OutVars{~w~0=v_~w~0_72, writerThread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_writerThread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~r~0=v_~r~0_51, writerThread1of1ForFork3_assume_abort_if_not_~cond#1=|v_writerThread1of1ForFork3_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork3_assume_abort_if_not_~cond#1, writerThread1of1ForFork3_assume_abort_if_not_#in~cond#1][94], [Black: 95#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0)), writerThread1of1ForFork3InUse, 114#(= ~r~0 0), writerThread1of1ForFork2InUse, 83#true, readerThread1of1ForFork0InUse, 16#L720true, readerThread1of1ForFork1InUse, 97#true, Black: 76#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), Black: 106#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= |#ghost~multithreaded| 1) (= ~y~0 0) (= ~w~0 0)), Black: 104#(and (= ~x~0 0) (= |#ghost~multithreaded| 1) (= ~y~0 0) (= ~w~0 0)), Black: 108#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= |#ghost~multithreaded| 1) (= ~w~0 0)), Black: 81#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 27#readerEXITtrue, 12#L714-1true, Black: 85#(= ~y~0 0), 28#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, Black: 86#(and (= ~w~0 1) (= ~y~0 0)), Black: 87#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0)), 11#L744true]) [2024-06-04 16:30:16,784 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2024-06-04 16:30:16,784 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-04 16:30:16,784 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-04 16:30:16,784 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-04 16:30:16,785 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([242] L714-->L714-1: Formula: (and (= v_~w~0_72 1) (not (= (ite (and (= v_~w~0_73 0) (= v_~r~0_51 0)) 1 0) 0))) InVars {~w~0=v_~w~0_73, ~r~0=v_~r~0_51} OutVars{~w~0=v_~w~0_72, writerThread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_writerThread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~r~0=v_~r~0_51, writerThread1of1ForFork3_assume_abort_if_not_~cond#1=|v_writerThread1of1ForFork3_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork3_assume_abort_if_not_~cond#1, writerThread1of1ForFork3_assume_abort_if_not_#in~cond#1][94], [Black: 95#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0)), writerThread1of1ForFork3InUse, 114#(= ~r~0 0), writerThread1of1ForFork2InUse, 83#true, 59#L744true, readerThread1of1ForFork0InUse, 16#L720true, readerThread1of1ForFork1InUse, 97#true, Black: 76#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), Black: 106#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= |#ghost~multithreaded| 1) (= ~y~0 0) (= ~w~0 0)), Black: 104#(and (= ~x~0 0) (= |#ghost~multithreaded| 1) (= ~y~0 0) (= ~w~0 0)), Black: 108#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= |#ghost~multithreaded| 1) (= ~w~0 0)), Black: 81#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 12#L714-1true, Black: 85#(= ~y~0 0), 28#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, Black: 86#(and (= ~w~0 1) (= ~y~0 0)), Black: 87#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0)), 45#readerEXITtrue]) [2024-06-04 16:30:16,785 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2024-06-04 16:30:16,785 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-04 16:30:16,785 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-04 16:30:16,785 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-04 16:30:16,789 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([247] L714-->L714-1: Formula: (and (= v_~w~0_72 1) (not (= (ite (and (= v_~w~0_73 0) (= v_~r~0_51 0)) 1 0) 0))) InVars {~w~0=v_~w~0_73, ~r~0=v_~r~0_51} OutVars{~w~0=v_~w~0_72, writerThread1of1ForFork2_assume_abort_if_not_~cond#1=|v_writerThread1of1ForFork2_assume_abort_if_not_~cond#1_1|, writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~r~0=v_~r~0_51} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork2_assume_abort_if_not_~cond#1, writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1][98], [Black: 95#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0)), writerThread1of1ForFork3InUse, 114#(= ~r~0 0), writerThread1of1ForFork2InUse, 83#true, 59#L744true, readerThread1of1ForFork0InUse, 29#L714-1true, readerThread1of1ForFork1InUse, 6#L720true, 97#true, Black: 106#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= |#ghost~multithreaded| 1) (= ~y~0 0) (= ~w~0 0)), Black: 76#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), Black: 104#(and (= ~x~0 0) (= |#ghost~multithreaded| 1) (= ~y~0 0) (= ~w~0 0)), Black: 108#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= |#ghost~multithreaded| 1) (= ~w~0 0)), Black: 81#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 28#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, Black: 85#(= ~y~0 0), Black: 86#(and (= ~w~0 1) (= ~y~0 0)), 11#L744true, Black: 87#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0))]) [2024-06-04 16:30:16,790 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-06-04 16:30:16,790 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-06-04 16:30:16,790 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-06-04 16:30:16,790 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-06-04 16:30:16,790 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-06-04 16:30:16,801 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([247] L714-->L714-1: Formula: (and (= v_~w~0_72 1) (not (= (ite (and (= v_~w~0_73 0) (= v_~r~0_51 0)) 1 0) 0))) InVars {~w~0=v_~w~0_73, ~r~0=v_~r~0_51} OutVars{~w~0=v_~w~0_72, writerThread1of1ForFork2_assume_abort_if_not_~cond#1=|v_writerThread1of1ForFork2_assume_abort_if_not_~cond#1_1|, writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~r~0=v_~r~0_51} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork2_assume_abort_if_not_~cond#1, writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1][98], [Black: 95#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0)), writerThread1of1ForFork3InUse, 114#(= ~r~0 0), writerThread1of1ForFork2InUse, 83#true, readerThread1of1ForFork0InUse, 29#L714-1true, readerThread1of1ForFork1InUse, 6#L720true, 97#true, Black: 76#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), Black: 106#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= |#ghost~multithreaded| 1) (= ~y~0 0) (= ~w~0 0)), Black: 104#(and (= ~x~0 0) (= |#ghost~multithreaded| 1) (= ~y~0 0) (= ~w~0 0)), Black: 108#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= |#ghost~multithreaded| 1) (= ~w~0 0)), 27#readerEXITtrue, Black: 81#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), Black: 85#(= ~y~0 0), 28#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, Black: 86#(and (= ~w~0 1) (= ~y~0 0)), 11#L744true, Black: 87#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0))]) [2024-06-04 16:30:16,801 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2024-06-04 16:30:16,801 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-04 16:30:16,801 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-04 16:30:16,801 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-04 16:30:16,802 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([247] L714-->L714-1: Formula: (and (= v_~w~0_72 1) (not (= (ite (and (= v_~w~0_73 0) (= v_~r~0_51 0)) 1 0) 0))) InVars {~w~0=v_~w~0_73, ~r~0=v_~r~0_51} OutVars{~w~0=v_~w~0_72, writerThread1of1ForFork2_assume_abort_if_not_~cond#1=|v_writerThread1of1ForFork2_assume_abort_if_not_~cond#1_1|, writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~r~0=v_~r~0_51} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork2_assume_abort_if_not_~cond#1, writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1][98], [Black: 95#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0)), writerThread1of1ForFork3InUse, 114#(= ~r~0 0), writerThread1of1ForFork2InUse, 83#true, 59#L744true, readerThread1of1ForFork0InUse, 29#L714-1true, readerThread1of1ForFork1InUse, 6#L720true, 97#true, Black: 76#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), Black: 106#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= |#ghost~multithreaded| 1) (= ~y~0 0) (= ~w~0 0)), Black: 104#(and (= ~x~0 0) (= |#ghost~multithreaded| 1) (= ~y~0 0) (= ~w~0 0)), Black: 108#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= |#ghost~multithreaded| 1) (= ~w~0 0)), Black: 81#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), Black: 85#(= ~y~0 0), 28#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, Black: 86#(and (= ~w~0 1) (= ~y~0 0)), Black: 87#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0)), 45#readerEXITtrue]) [2024-06-04 16:30:16,802 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2024-06-04 16:30:16,802 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-04 16:30:16,802 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-04 16:30:16,802 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-04 16:30:16,811 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([242] L714-->L714-1: Formula: (and (= v_~w~0_72 1) (not (= (ite (and (= v_~w~0_73 0) (= v_~r~0_51 0)) 1 0) 0))) InVars {~w~0=v_~w~0_73, ~r~0=v_~r~0_51} OutVars{~w~0=v_~w~0_72, writerThread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_writerThread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~r~0=v_~r~0_51, writerThread1of1ForFork3_assume_abort_if_not_~cond#1=|v_writerThread1of1ForFork3_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork3_assume_abort_if_not_~cond#1, writerThread1of1ForFork3_assume_abort_if_not_#in~cond#1][94], [Black: 95#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0)), writerThread1of1ForFork3InUse, 114#(= ~r~0 0), writerThread1of1ForFork2InUse, 83#true, readerThread1of1ForFork0InUse, 16#L720true, readerThread1of1ForFork1InUse, 97#true, Black: 106#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= |#ghost~multithreaded| 1) (= ~y~0 0) (= ~w~0 0)), Black: 76#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), Black: 104#(and (= ~x~0 0) (= |#ghost~multithreaded| 1) (= ~y~0 0) (= ~w~0 0)), Black: 108#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= |#ghost~multithreaded| 1) (= ~w~0 0)), Black: 81#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 27#readerEXITtrue, 28#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 12#L714-1true, Black: 85#(= ~y~0 0), Black: 86#(and (= ~w~0 1) (= ~y~0 0)), 11#L744true, Black: 87#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0))]) [2024-06-04 16:30:16,811 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2024-06-04 16:30:16,811 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-04 16:30:16,811 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-04 16:30:16,811 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-04 16:30:16,811 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-04 16:30:16,812 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([242] L714-->L714-1: Formula: (and (= v_~w~0_72 1) (not (= (ite (and (= v_~w~0_73 0) (= v_~r~0_51 0)) 1 0) 0))) InVars {~w~0=v_~w~0_73, ~r~0=v_~r~0_51} OutVars{~w~0=v_~w~0_72, writerThread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_writerThread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~r~0=v_~r~0_51, writerThread1of1ForFork3_assume_abort_if_not_~cond#1=|v_writerThread1of1ForFork3_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork3_assume_abort_if_not_~cond#1, writerThread1of1ForFork3_assume_abort_if_not_#in~cond#1][94], [Black: 95#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0)), writerThread1of1ForFork3InUse, 114#(= ~r~0 0), writerThread1of1ForFork2InUse, 83#true, 59#L744true, readerThread1of1ForFork0InUse, 16#L720true, readerThread1of1ForFork1InUse, 97#true, Black: 106#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= |#ghost~multithreaded| 1) (= ~y~0 0) (= ~w~0 0)), Black: 76#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), Black: 104#(and (= ~x~0 0) (= |#ghost~multithreaded| 1) (= ~y~0 0) (= ~w~0 0)), Black: 108#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= |#ghost~multithreaded| 1) (= ~w~0 0)), Black: 81#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 28#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 12#L714-1true, Black: 85#(= ~y~0 0), Black: 86#(and (= ~w~0 1) (= ~y~0 0)), Black: 87#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0)), 45#readerEXITtrue]) [2024-06-04 16:30:16,813 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2024-06-04 16:30:16,813 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-04 16:30:16,813 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-04 16:30:16,813 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-04 16:30:16,813 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-04 16:30:16,816 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([242] L714-->L714-1: Formula: (and (= v_~w~0_72 1) (not (= (ite (and (= v_~w~0_73 0) (= v_~r~0_51 0)) 1 0) 0))) InVars {~w~0=v_~w~0_73, ~r~0=v_~r~0_51} OutVars{~w~0=v_~w~0_72, writerThread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_writerThread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~r~0=v_~r~0_51, writerThread1of1ForFork3_assume_abort_if_not_~cond#1=|v_writerThread1of1ForFork3_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork3_assume_abort_if_not_~cond#1, writerThread1of1ForFork3_assume_abort_if_not_#in~cond#1][94], [Black: 95#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0)), writerThread1of1ForFork3InUse, 114#(= ~r~0 0), writerThread1of1ForFork2InUse, 83#true, readerThread1of1ForFork0InUse, 16#L720true, readerThread1of1ForFork1InUse, 97#true, Black: 76#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), Black: 106#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= |#ghost~multithreaded| 1) (= ~y~0 0) (= ~w~0 0)), Black: 104#(and (= ~x~0 0) (= |#ghost~multithreaded| 1) (= ~y~0 0) (= ~w~0 0)), Black: 108#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= |#ghost~multithreaded| 1) (= ~w~0 0)), 27#readerEXITtrue, Black: 81#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 12#L714-1true, Black: 85#(= ~y~0 0), 28#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, Black: 86#(and (= ~w~0 1) (= ~y~0 0)), Black: 87#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0)), 45#readerEXITtrue]) [2024-06-04 16:30:16,816 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2024-06-04 16:30:16,816 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-06-04 16:30:16,816 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-06-04 16:30:16,816 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-06-04 16:30:16,819 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([247] L714-->L714-1: Formula: (and (= v_~w~0_72 1) (not (= (ite (and (= v_~w~0_73 0) (= v_~r~0_51 0)) 1 0) 0))) InVars {~w~0=v_~w~0_73, ~r~0=v_~r~0_51} OutVars{~w~0=v_~w~0_72, writerThread1of1ForFork2_assume_abort_if_not_~cond#1=|v_writerThread1of1ForFork2_assume_abort_if_not_~cond#1_1|, writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~r~0=v_~r~0_51} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork2_assume_abort_if_not_~cond#1, writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1][98], [Black: 95#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0)), writerThread1of1ForFork3InUse, 114#(= ~r~0 0), writerThread1of1ForFork2InUse, 83#true, 29#L714-1true, readerThread1of1ForFork0InUse, readerThread1of1ForFork1InUse, 6#L720true, 97#true, Black: 106#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= |#ghost~multithreaded| 1) (= ~y~0 0) (= ~w~0 0)), Black: 76#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), Black: 104#(and (= ~x~0 0) (= |#ghost~multithreaded| 1) (= ~y~0 0) (= ~w~0 0)), Black: 108#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= |#ghost~multithreaded| 1) (= ~w~0 0)), 27#readerEXITtrue, Black: 81#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 28#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, Black: 85#(= ~y~0 0), Black: 86#(and (= ~w~0 1) (= ~y~0 0)), Black: 87#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0)), 11#L744true]) [2024-06-04 16:30:16,819 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2024-06-04 16:30:16,819 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-04 16:30:16,819 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-04 16:30:16,820 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-04 16:30:16,820 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-04 16:30:16,821 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([247] L714-->L714-1: Formula: (and (= v_~w~0_72 1) (not (= (ite (and (= v_~w~0_73 0) (= v_~r~0_51 0)) 1 0) 0))) InVars {~w~0=v_~w~0_73, ~r~0=v_~r~0_51} OutVars{~w~0=v_~w~0_72, writerThread1of1ForFork2_assume_abort_if_not_~cond#1=|v_writerThread1of1ForFork2_assume_abort_if_not_~cond#1_1|, writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~r~0=v_~r~0_51} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork2_assume_abort_if_not_~cond#1, writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1][98], [Black: 95#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0)), writerThread1of1ForFork3InUse, 114#(= ~r~0 0), writerThread1of1ForFork2InUse, 83#true, 59#L744true, readerThread1of1ForFork0InUse, 29#L714-1true, readerThread1of1ForFork1InUse, 6#L720true, 97#true, Black: 106#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= |#ghost~multithreaded| 1) (= ~y~0 0) (= ~w~0 0)), Black: 76#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), Black: 104#(and (= ~x~0 0) (= |#ghost~multithreaded| 1) (= ~y~0 0) (= ~w~0 0)), Black: 108#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= |#ghost~multithreaded| 1) (= ~w~0 0)), Black: 81#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 28#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, Black: 85#(= ~y~0 0), Black: 86#(and (= ~w~0 1) (= ~y~0 0)), Black: 87#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0)), 45#readerEXITtrue]) [2024-06-04 16:30:16,822 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2024-06-04 16:30:16,822 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-04 16:30:16,822 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-04 16:30:16,822 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-04 16:30:16,822 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-04 16:30:16,828 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([247] L714-->L714-1: Formula: (and (= v_~w~0_72 1) (not (= (ite (and (= v_~w~0_73 0) (= v_~r~0_51 0)) 1 0) 0))) InVars {~w~0=v_~w~0_73, ~r~0=v_~r~0_51} OutVars{~w~0=v_~w~0_72, writerThread1of1ForFork2_assume_abort_if_not_~cond#1=|v_writerThread1of1ForFork2_assume_abort_if_not_~cond#1_1|, writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~r~0=v_~r~0_51} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork2_assume_abort_if_not_~cond#1, writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1][98], [Black: 95#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0)), writerThread1of1ForFork3InUse, 114#(= ~r~0 0), writerThread1of1ForFork2InUse, 83#true, readerThread1of1ForFork0InUse, 29#L714-1true, readerThread1of1ForFork1InUse, 6#L720true, 97#true, Black: 76#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), Black: 106#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= |#ghost~multithreaded| 1) (= ~y~0 0) (= ~w~0 0)), Black: 104#(and (= ~x~0 0) (= |#ghost~multithreaded| 1) (= ~y~0 0) (= ~w~0 0)), Black: 108#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= |#ghost~multithreaded| 1) (= ~w~0 0)), 27#readerEXITtrue, Black: 81#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), Black: 85#(= ~y~0 0), 28#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, Black: 86#(and (= ~w~0 1) (= ~y~0 0)), Black: 87#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0)), 45#readerEXITtrue]) [2024-06-04 16:30:16,828 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2024-06-04 16:30:16,828 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-06-04 16:30:16,828 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-06-04 16:30:16,828 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-06-04 16:30:16,837 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([242] L714-->L714-1: Formula: (and (= v_~w~0_72 1) (not (= (ite (and (= v_~w~0_73 0) (= v_~r~0_51 0)) 1 0) 0))) InVars {~w~0=v_~w~0_73, ~r~0=v_~r~0_51} OutVars{~w~0=v_~w~0_72, writerThread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_writerThread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~r~0=v_~r~0_51, writerThread1of1ForFork3_assume_abort_if_not_~cond#1=|v_writerThread1of1ForFork3_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork3_assume_abort_if_not_~cond#1, writerThread1of1ForFork3_assume_abort_if_not_#in~cond#1][94], [Black: 95#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0)), writerThread1of1ForFork3InUse, 114#(= ~r~0 0), writerThread1of1ForFork2InUse, 83#true, readerThread1of1ForFork0InUse, 16#L720true, readerThread1of1ForFork1InUse, 97#true, Black: 106#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= |#ghost~multithreaded| 1) (= ~y~0 0) (= ~w~0 0)), Black: 76#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), Black: 104#(and (= ~x~0 0) (= |#ghost~multithreaded| 1) (= ~y~0 0) (= ~w~0 0)), Black: 108#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= |#ghost~multithreaded| 1) (= ~w~0 0)), Black: 81#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 27#readerEXITtrue, 28#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 12#L714-1true, Black: 85#(= ~y~0 0), Black: 86#(and (= ~w~0 1) (= ~y~0 0)), Black: 87#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0)), 45#readerEXITtrue]) [2024-06-04 16:30:16,837 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2024-06-04 16:30:16,837 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-06-04 16:30:16,837 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-06-04 16:30:16,837 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-06-04 16:30:16,837 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-06-04 16:30:16,843 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([247] L714-->L714-1: Formula: (and (= v_~w~0_72 1) (not (= (ite (and (= v_~w~0_73 0) (= v_~r~0_51 0)) 1 0) 0))) InVars {~w~0=v_~w~0_73, ~r~0=v_~r~0_51} OutVars{~w~0=v_~w~0_72, writerThread1of1ForFork2_assume_abort_if_not_~cond#1=|v_writerThread1of1ForFork2_assume_abort_if_not_~cond#1_1|, writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~r~0=v_~r~0_51} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork2_assume_abort_if_not_~cond#1, writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1][98], [Black: 95#(and (= ~y~0 0) (= 3 ~x~0) (= ~w~0 0)), writerThread1of1ForFork3InUse, 114#(= ~r~0 0), writerThread1of1ForFork2InUse, 83#true, readerThread1of1ForFork0InUse, 29#L714-1true, readerThread1of1ForFork1InUse, 6#L720true, 97#true, Black: 106#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= |#ghost~multithreaded| 1) (= ~y~0 0) (= ~w~0 0)), Black: 76#(and (= ~x~0 0) (= ~y~0 0) (= ~w~0 0)), Black: 104#(and (= ~x~0 0) (= |#ghost~multithreaded| 1) (= ~y~0 0) (= ~w~0 0)), Black: 108#(and (= ~x~0 0) (= |readerThread1of1ForFork0_~l~0#1| 0) (= |#ghost~multithreaded| 1) (= ~w~0 0)), 27#readerEXITtrue, Black: 81#(and (= ~x~0 0) (= ~w~0 1) (= ~y~0 0)), 28#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, Black: 85#(= ~y~0 0), Black: 86#(and (= ~w~0 1) (= ~y~0 0)), Black: 87#(and (= ~w~0 1) (= ~y~0 0) (= 3 ~x~0)), 45#readerEXITtrue]) [2024-06-04 16:30:16,843 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2024-06-04 16:30:16,843 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-06-04 16:30:16,843 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-06-04 16:30:16,843 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-06-04 16:30:16,843 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-06-04 16:30:16,867 INFO L124 PetriNetUnfolderBase]: 7485/13543 cut-off events. [2024-06-04 16:30:16,868 INFO L125 PetriNetUnfolderBase]: For 50391/52520 co-relation queries the response was YES. [2024-06-04 16:30:16,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44370 conditions, 13543 events. 7485/13543 cut-off events. For 50391/52520 co-relation queries the response was YES. Maximal size of possible extension queue 667. Compared 110951 event pairs, 2690 based on Foata normal form. 842/13595 useless extension candidates. Maximal degree in co-relation 44344. Up to 4829 conditions per place. [2024-06-04 16:30:16,959 INFO L140 encePairwiseOnDemand]: 51/58 looper letters, 63 selfloop transitions, 17 changer transitions 0/117 dead transitions. [2024-06-04 16:30:16,960 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 117 transitions, 797 flow [2024-06-04 16:30:16,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-04 16:30:16,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-04 16:30:16,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 170 transitions. [2024-06-04 16:30:16,961 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7327586206896551 [2024-06-04 16:30:16,961 INFO L175 Difference]: Start difference. First operand has 78 places, 85 transitions, 575 flow. Second operand 4 states and 170 transitions. [2024-06-04 16:30:16,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 117 transitions, 797 flow [2024-06-04 16:30:16,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 117 transitions, 779 flow, removed 5 selfloop flow, removed 2 redundant places. [2024-06-04 16:30:16,993 INFO L231 Difference]: Finished difference. Result has 82 places, 85 transitions, 627 flow [2024-06-04 16:30:16,993 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=487, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=627, PETRI_PLACES=82, PETRI_TRANSITIONS=85} [2024-06-04 16:30:16,994 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 21 predicate places. [2024-06-04 16:30:16,994 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 85 transitions, 627 flow [2024-06-04 16:30:16,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 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) [2024-06-04 16:30:16,994 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:30:16,995 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:30:16,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-04 16:30:16,995 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-04 16:30:16,995 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:30:16,995 INFO L85 PathProgramCache]: Analyzing trace with hash -578562307, now seen corresponding path program 1 times [2024-06-04 16:30:16,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:30:16,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760759837] [2024-06-04 16:30:16,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:30:16,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:30:17,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:30:17,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:30:17,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:30:17,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760759837] [2024-06-04 16:30:17,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760759837] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:30:17,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:30:17,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 16:30:17,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193140945] [2024-06-04 16:30:17,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:30:17,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 16:30:17,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:30:17,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 16:30:17,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-06-04 16:30:17,340 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 58 [2024-06-04 16:30:17,342 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 85 transitions, 627 flow. Second operand has 8 states, 8 states have (on average 17.0) internal successors, (136), 8 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:30:17,343 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:30:17,343 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 58 [2024-06-04 16:30:17,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:30:19,631 INFO L124 PetriNetUnfolderBase]: 17556/27532 cut-off events. [2024-06-04 16:30:19,631 INFO L125 PetriNetUnfolderBase]: For 100703/101481 co-relation queries the response was YES. [2024-06-04 16:30:19,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95151 conditions, 27532 events. 17556/27532 cut-off events. For 100703/101481 co-relation queries the response was YES. Maximal size of possible extension queue 1114. Compared 200886 event pairs, 2069 based on Foata normal form. 570/27846 useless extension candidates. Maximal degree in co-relation 95121. Up to 10804 conditions per place. [2024-06-04 16:30:19,831 INFO L140 encePairwiseOnDemand]: 42/58 looper letters, 176 selfloop transitions, 36 changer transitions 0/226 dead transitions. [2024-06-04 16:30:19,831 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 226 transitions, 1931 flow [2024-06-04 16:30:19,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 16:30:19,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 16:30:19,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 292 transitions. [2024-06-04 16:30:19,832 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6293103448275862 [2024-06-04 16:30:19,833 INFO L175 Difference]: Start difference. First operand has 82 places, 85 transitions, 627 flow. Second operand 8 states and 292 transitions. [2024-06-04 16:30:19,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 226 transitions, 1931 flow [2024-06-04 16:30:19,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 226 transitions, 1899 flow, removed 16 selfloop flow, removed 0 redundant places. [2024-06-04 16:30:19,891 INFO L231 Difference]: Finished difference. Result has 95 places, 117 transitions, 1196 flow [2024-06-04 16:30:19,891 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=615, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1196, PETRI_PLACES=95, PETRI_TRANSITIONS=117} [2024-06-04 16:30:19,892 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 34 predicate places. [2024-06-04 16:30:19,892 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 117 transitions, 1196 flow [2024-06-04 16:30:19,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 17.0) internal successors, (136), 8 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:30:19,892 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:30:19,892 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:30:19,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-04 16:30:19,892 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-04 16:30:19,892 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:30:19,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1555890578, now seen corresponding path program 1 times [2024-06-04 16:30:19,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:30:19,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72010626] [2024-06-04 16:30:19,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:30:19,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:30:19,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:30:20,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:30:20,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:30:20,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72010626] [2024-06-04 16:30:20,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72010626] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:30:20,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:30:20,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-04 16:30:20,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551606355] [2024-06-04 16:30:20,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:30:20,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-04 16:30:20,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:30:20,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-04 16:30:20,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-06-04 16:30:20,307 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 58 [2024-06-04 16:30:20,308 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 117 transitions, 1196 flow. Second operand has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 6 states have internal predecessors, (118), 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) [2024-06-04 16:30:20,308 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:30:20,308 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 58 [2024-06-04 16:30:20,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:30:22,624 INFO L124 PetriNetUnfolderBase]: 15036/24882 cut-off events. [2024-06-04 16:30:22,624 INFO L125 PetriNetUnfolderBase]: For 143369/144640 co-relation queries the response was YES. [2024-06-04 16:30:22,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100893 conditions, 24882 events. 15036/24882 cut-off events. For 143369/144640 co-relation queries the response was YES. Maximal size of possible extension queue 1076. Compared 192161 event pairs, 6611 based on Foata normal form. 269/24650 useless extension candidates. Maximal degree in co-relation 100855. Up to 19756 conditions per place. [2024-06-04 16:30:22,787 INFO L140 encePairwiseOnDemand]: 46/58 looper letters, 122 selfloop transitions, 13 changer transitions 0/158 dead transitions. [2024-06-04 16:30:22,788 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 158 transitions, 1658 flow [2024-06-04 16:30:22,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 16:30:22,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 16:30:22,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 190 transitions. [2024-06-04 16:30:22,789 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5459770114942529 [2024-06-04 16:30:22,789 INFO L175 Difference]: Start difference. First operand has 95 places, 117 transitions, 1196 flow. Second operand 6 states and 190 transitions. [2024-06-04 16:30:22,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 158 transitions, 1658 flow [2024-06-04 16:30:22,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 158 transitions, 1587 flow, removed 35 selfloop flow, removed 1 redundant places. [2024-06-04 16:30:22,986 INFO L231 Difference]: Finished difference. Result has 100 places, 119 transitions, 1185 flow [2024-06-04 16:30:22,986 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=1125, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1185, PETRI_PLACES=100, PETRI_TRANSITIONS=119} [2024-06-04 16:30:22,987 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 39 predicate places. [2024-06-04 16:30:22,987 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 119 transitions, 1185 flow [2024-06-04 16:30:22,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 6 states have internal predecessors, (118), 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) [2024-06-04 16:30:22,987 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:30:22,987 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:30:22,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-04 16:30:22,987 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-04 16:30:22,988 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:30:22,988 INFO L85 PathProgramCache]: Analyzing trace with hash -2050380768, now seen corresponding path program 1 times [2024-06-04 16:30:22,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:30:22,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325927687] [2024-06-04 16:30:22,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:30:22,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:30:22,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:30:23,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:30:23,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:30:23,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325927687] [2024-06-04 16:30:23,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325927687] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:30:23,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:30:23,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-04 16:30:23,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644097015] [2024-06-04 16:30:23,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:30:23,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-04 16:30:23,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:30:23,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-04 16:30:23,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-04 16:30:23,302 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 58 [2024-06-04 16:30:23,302 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 119 transitions, 1185 flow. Second operand has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 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) [2024-06-04 16:30:23,302 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:30:23,302 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 58 [2024-06-04 16:30:23,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:30:25,715 INFO L124 PetriNetUnfolderBase]: 14963/24724 cut-off events. [2024-06-04 16:30:25,716 INFO L125 PetriNetUnfolderBase]: For 158495/159295 co-relation queries the response was YES. [2024-06-04 16:30:25,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101808 conditions, 24724 events. 14963/24724 cut-off events. For 158495/159295 co-relation queries the response was YES. Maximal size of possible extension queue 1083. Compared 193123 event pairs, 6765 based on Foata normal form. 311/24444 useless extension candidates. Maximal degree in co-relation 101767. Up to 19848 conditions per place. [2024-06-04 16:30:25,934 INFO L140 encePairwiseOnDemand]: 49/58 looper letters, 115 selfloop transitions, 26 changer transitions 0/170 dead transitions. [2024-06-04 16:30:25,935 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 170 transitions, 1699 flow [2024-06-04 16:30:25,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 16:30:25,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 16:30:25,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 211 transitions. [2024-06-04 16:30:25,936 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5197044334975369 [2024-06-04 16:30:25,936 INFO L175 Difference]: Start difference. First operand has 100 places, 119 transitions, 1185 flow. Second operand 7 states and 211 transitions. [2024-06-04 16:30:25,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 170 transitions, 1699 flow [2024-06-04 16:30:26,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 170 transitions, 1654 flow, removed 14 selfloop flow, removed 3 redundant places. [2024-06-04 16:30:26,121 INFO L231 Difference]: Finished difference. Result has 105 places, 129 transitions, 1303 flow [2024-06-04 16:30:26,121 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=1149, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1303, PETRI_PLACES=105, PETRI_TRANSITIONS=129} [2024-06-04 16:30:26,121 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 44 predicate places. [2024-06-04 16:30:26,122 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 129 transitions, 1303 flow [2024-06-04 16:30:26,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 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) [2024-06-04 16:30:26,122 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:30:26,122 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:30:26,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-04 16:30:26,122 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-04 16:30:26,123 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:30:26,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1854631479, now seen corresponding path program 1 times [2024-06-04 16:30:26,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:30:26,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049302246] [2024-06-04 16:30:26,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:30:26,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:30:26,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:30:26,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:30:26,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:30:26,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049302246] [2024-06-04 16:30:26,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049302246] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:30:26,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:30:26,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 16:30:26,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254644119] [2024-06-04 16:30:26,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:30:26,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 16:30:26,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:30:26,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 16:30:26,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-06-04 16:30:26,467 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 58 [2024-06-04 16:30:26,468 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 129 transitions, 1303 flow. Second operand has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 7 states have internal predecessors, (121), 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) [2024-06-04 16:30:26,468 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:30:26,468 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 58 [2024-06-04 16:30:26,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:30:29,196 INFO L124 PetriNetUnfolderBase]: 17435/27922 cut-off events. [2024-06-04 16:30:29,196 INFO L125 PetriNetUnfolderBase]: For 183337/183949 co-relation queries the response was YES. [2024-06-04 16:30:29,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115331 conditions, 27922 events. 17435/27922 cut-off events. For 183337/183949 co-relation queries the response was YES. Maximal size of possible extension queue 1123. Compared 207667 event pairs, 6677 based on Foata normal form. 284/27883 useless extension candidates. Maximal degree in co-relation 115287. Up to 22452 conditions per place. [2024-06-04 16:30:29,399 INFO L140 encePairwiseOnDemand]: 44/58 looper letters, 153 selfloop transitions, 46 changer transitions 0/217 dead transitions. [2024-06-04 16:30:29,399 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 217 transitions, 2297 flow [2024-06-04 16:30:29,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:30:29,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:30:29,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 272 transitions. [2024-06-04 16:30:29,400 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5210727969348659 [2024-06-04 16:30:29,400 INFO L175 Difference]: Start difference. First operand has 105 places, 129 transitions, 1303 flow. Second operand 9 states and 272 transitions. [2024-06-04 16:30:29,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 217 transitions, 2297 flow [2024-06-04 16:30:29,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 217 transitions, 2263 flow, removed 16 selfloop flow, removed 1 redundant places. [2024-06-04 16:30:29,710 INFO L231 Difference]: Finished difference. Result has 118 places, 151 transitions, 1738 flow [2024-06-04 16:30:29,710 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=1269, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1738, PETRI_PLACES=118, PETRI_TRANSITIONS=151} [2024-06-04 16:30:29,710 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 57 predicate places. [2024-06-04 16:30:29,711 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 151 transitions, 1738 flow [2024-06-04 16:30:29,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 7 states have internal predecessors, (121), 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) [2024-06-04 16:30:29,711 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:30:29,711 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:30:29,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-04 16:30:29,711 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-04 16:30:29,712 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:30:29,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1659002539, now seen corresponding path program 1 times [2024-06-04 16:30:29,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:30:29,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306823039] [2024-06-04 16:30:29,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:30:29,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:30:29,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:30:29,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:30:29,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:30:29,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306823039] [2024-06-04 16:30:29,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306823039] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:30:29,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:30:29,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 16:30:29,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961007678] [2024-06-04 16:30:29,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:30:29,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 16:30:29,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:30:29,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 16:30:29,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-04 16:30:29,899 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 58 [2024-06-04 16:30:29,900 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 151 transitions, 1738 flow. Second operand has 7 states, 7 states have (on average 17.428571428571427) internal successors, (122), 7 states have internal predecessors, (122), 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) [2024-06-04 16:30:29,900 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:30:29,900 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 58 [2024-06-04 16:30:29,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:30:33,986 INFO L124 PetriNetUnfolderBase]: 23329/36864 cut-off events. [2024-06-04 16:30:33,987 INFO L125 PetriNetUnfolderBase]: For 324726/325400 co-relation queries the response was YES. [2024-06-04 16:30:34,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 161289 conditions, 36864 events. 23329/36864 cut-off events. For 324726/325400 co-relation queries the response was YES. Maximal size of possible extension queue 1658. Compared 284259 event pairs, 5165 based on Foata normal form. 532/36972 useless extension candidates. Maximal degree in co-relation 161237. Up to 18687 conditions per place. [2024-06-04 16:30:34,326 INFO L140 encePairwiseOnDemand]: 43/58 looper letters, 244 selfloop transitions, 87 changer transitions 0/349 dead transitions. [2024-06-04 16:30:34,326 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 349 transitions, 3794 flow [2024-06-04 16:30:34,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-06-04 16:30:34,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2024-06-04 16:30:34,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 478 transitions. [2024-06-04 16:30:34,328 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5494252873563218 [2024-06-04 16:30:34,328 INFO L175 Difference]: Start difference. First operand has 118 places, 151 transitions, 1738 flow. Second operand 15 states and 478 transitions. [2024-06-04 16:30:34,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 349 transitions, 3794 flow [2024-06-04 16:30:35,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 349 transitions, 3740 flow, removed 26 selfloop flow, removed 1 redundant places. [2024-06-04 16:30:35,540 INFO L231 Difference]: Finished difference. Result has 138 places, 183 transitions, 2436 flow [2024-06-04 16:30:35,541 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=1686, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=2436, PETRI_PLACES=138, PETRI_TRANSITIONS=183} [2024-06-04 16:30:35,541 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 77 predicate places. [2024-06-04 16:30:35,541 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 183 transitions, 2436 flow [2024-06-04 16:30:35,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.428571428571427) internal successors, (122), 7 states have internal predecessors, (122), 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) [2024-06-04 16:30:35,542 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:30:35,542 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:30:35,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-04 16:30:35,542 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-04 16:30:35,542 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:30:35,542 INFO L85 PathProgramCache]: Analyzing trace with hash 360468436, now seen corresponding path program 1 times [2024-06-04 16:30:35,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:30:35,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869821874] [2024-06-04 16:30:35,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:30:35,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:30:35,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:30:35,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:30:35,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:30:35,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869821874] [2024-06-04 16:30:35,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869821874] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:30:35,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:30:35,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 16:30:35,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441302742] [2024-06-04 16:30:35,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:30:35,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 16:30:35,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:30:35,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 16:30:35,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-04 16:30:35,738 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 58 [2024-06-04 16:30:35,739 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 183 transitions, 2436 flow. Second operand has 7 states, 7 states have (on average 17.571428571428573) internal successors, (123), 7 states have internal predecessors, (123), 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) [2024-06-04 16:30:35,739 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:30:35,739 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 58 [2024-06-04 16:30:35,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:30:40,729 INFO L124 PetriNetUnfolderBase]: 26346/41702 cut-off events. [2024-06-04 16:30:40,729 INFO L125 PetriNetUnfolderBase]: For 516271/516977 co-relation queries the response was YES. [2024-06-04 16:30:40,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 204502 conditions, 41702 events. 26346/41702 cut-off events. For 516271/516977 co-relation queries the response was YES. Maximal size of possible extension queue 1944. Compared 328418 event pairs, 5240 based on Foata normal form. 646/41856 useless extension candidates. Maximal degree in co-relation 204442. Up to 18671 conditions per place. [2024-06-04 16:30:41,151 INFO L140 encePairwiseOnDemand]: 44/58 looper letters, 264 selfloop transitions, 80 changer transitions 0/362 dead transitions. [2024-06-04 16:30:41,152 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 362 transitions, 4716 flow [2024-06-04 16:30:41,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-04 16:30:41,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-04 16:30:41,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 417 transitions. [2024-06-04 16:30:41,158 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.553050397877984 [2024-06-04 16:30:41,159 INFO L175 Difference]: Start difference. First operand has 138 places, 183 transitions, 2436 flow. Second operand 13 states and 417 transitions. [2024-06-04 16:30:41,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 362 transitions, 4716 flow [2024-06-04 16:30:43,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 362 transitions, 4496 flow, removed 65 selfloop flow, removed 7 redundant places. [2024-06-04 16:30:43,095 INFO L231 Difference]: Finished difference. Result has 148 places, 211 transitions, 2934 flow [2024-06-04 16:30:43,095 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=2244, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2934, PETRI_PLACES=148, PETRI_TRANSITIONS=211} [2024-06-04 16:30:43,095 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 87 predicate places. [2024-06-04 16:30:43,095 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 211 transitions, 2934 flow [2024-06-04 16:30:43,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.571428571428573) internal successors, (123), 7 states have internal predecessors, (123), 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) [2024-06-04 16:30:43,096 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:30:43,096 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:30:43,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-04 16:30:43,096 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-04 16:30:43,096 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:30:43,096 INFO L85 PathProgramCache]: Analyzing trace with hash -728996352, now seen corresponding path program 1 times [2024-06-04 16:30:43,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:30:43,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495998158] [2024-06-04 16:30:43,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:30:43,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:30:43,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:30:43,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:30:43,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:30:43,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495998158] [2024-06-04 16:30:43,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495998158] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:30:43,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:30:43,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 16:30:43,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111548985] [2024-06-04 16:30:43,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:30:43,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-04 16:30:43,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:30:43,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-04 16:30:43,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-06-04 16:30:43,358 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 58 [2024-06-04 16:30:43,359 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 211 transitions, 2934 flow. Second operand has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 6 states have internal predecessors, (112), 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) [2024-06-04 16:30:43,359 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:30:43,359 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 58 [2024-06-04 16:30:43,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:30:48,243 INFO L124 PetriNetUnfolderBase]: 24993/39017 cut-off events. [2024-06-04 16:30:48,243 INFO L125 PetriNetUnfolderBase]: For 643959/644644 co-relation queries the response was YES. [2024-06-04 16:30:48,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 210640 conditions, 39017 events. 24993/39017 cut-off events. For 643959/644644 co-relation queries the response was YES. Maximal size of possible extension queue 1924. Compared 303919 event pairs, 3388 based on Foata normal form. 705/38899 useless extension candidates. Maximal degree in co-relation 210574. Up to 18127 conditions per place. [2024-06-04 16:30:48,624 INFO L140 encePairwiseOnDemand]: 45/58 looper letters, 197 selfloop transitions, 86 changer transitions 6/321 dead transitions. [2024-06-04 16:30:48,624 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 321 transitions, 4511 flow [2024-06-04 16:30:48,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 16:30:48,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 16:30:48,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 251 transitions. [2024-06-04 16:30:48,626 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6182266009852216 [2024-06-04 16:30:48,626 INFO L175 Difference]: Start difference. First operand has 148 places, 211 transitions, 2934 flow. Second operand 7 states and 251 transitions. [2024-06-04 16:30:48,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 321 transitions, 4511 flow [2024-06-04 16:30:51,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 321 transitions, 4361 flow, removed 39 selfloop flow, removed 7 redundant places. [2024-06-04 16:30:51,170 INFO L231 Difference]: Finished difference. Result has 151 places, 224 transitions, 3305 flow [2024-06-04 16:30:51,171 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=2822, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3305, PETRI_PLACES=151, PETRI_TRANSITIONS=224} [2024-06-04 16:30:51,171 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 90 predicate places. [2024-06-04 16:30:51,171 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 224 transitions, 3305 flow [2024-06-04 16:30:51,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 6 states have internal predecessors, (112), 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) [2024-06-04 16:30:51,172 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:30:51,172 INFO L208 CegarLoopForPetriNet]: trace histogram [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] [2024-06-04 16:30:51,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-04 16:30:51,172 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-04 16:30:51,172 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:30:51,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1209041438, now seen corresponding path program 1 times [2024-06-04 16:30:51,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:30:51,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825497089] [2024-06-04 16:30:51,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:30:51,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:30:51,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:30:51,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:30:51,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:30:51,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825497089] [2024-06-04 16:30:51,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825497089] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:30:51,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:30:51,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 16:30:51,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610683427] [2024-06-04 16:30:51,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:30:51,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 16:30:51,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:30:51,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 16:30:51,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-06-04 16:30:51,491 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 58 [2024-06-04 16:30:51,492 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 224 transitions, 3305 flow. Second operand has 7 states, 7 states have (on average 18.142857142857142) internal successors, (127), 7 states have internal predecessors, (127), 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) [2024-06-04 16:30:51,492 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:30:51,492 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 58 [2024-06-04 16:30:51,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand