./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix053.opt.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/mix053.opt.yml/witness.yml --architecture 32bit


--------------------------------------------------------------------------------


Checking for ERROR reachability
Using default analysis
Version 76401ed0
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-wmm/mix053.opt.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/mix053.opt.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-76401ed-m
[2024-06-20 19:20:03,227 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-06-20 19:20:03,303 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-06-20 19:20:03,308 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-06-20 19:20:03,309 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-06-20 19:20:03,331 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-06-20 19:20:03,332 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-06-20 19:20:03,332 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-06-20 19:20:03,333 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-06-20 19:20:03,336 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-06-20 19:20:03,336 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-06-20 19:20:03,336 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-06-20 19:20:03,337 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-06-20 19:20:03,338 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-06-20 19:20:03,338 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-06-20 19:20:03,338 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-06-20 19:20:03,339 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-06-20 19:20:03,339 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-06-20 19:20:03,339 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-06-20 19:20:03,339 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-06-20 19:20:03,340 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-06-20 19:20:03,341 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-06-20 19:20:03,341 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-06-20 19:20:03,341 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-06-20 19:20:03,341 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-06-20 19:20:03,341 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-06-20 19:20:03,342 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-06-20 19:20:03,342 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-06-20 19:20:03,342 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-06-20 19:20:03,343 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-06-20 19:20:03,343 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-06-20 19:20:03,344 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-06-20 19:20:03,344 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-06-20 19:20:03,344 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-06-20 19:20:03,344 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-06-20 19:20:03,345 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-06-20 19:20:03,345 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-06-20 19:20:03,345 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-06-20 19:20:03,345 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-06-20 19:20:03,345 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-06-20 19:20:03,345 INFO  L153        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-06-20 19:20:03,346 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-06-20 19:20:03,346 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-06-20 19:20:03,346 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-20 19:20:03,552 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-06-20 19:20:03,573 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-06-20 19:20:03,575 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-06-20 19:20:03,576 INFO  L270        PluginConnector]: Initializing Witness Parser...
[2024-06-20 19:20:03,577 INFO  L274        PluginConnector]: Witness Parser initialized
[2024-06-20 19:20:03,577 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/mix053.opt.yml/witness.yml
[2024-06-20 19:20:03,787 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-06-20 19:20:03,787 INFO  L274        PluginConnector]: CDTParser initialized
[2024-06-20 19:20:03,787 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix053.opt.i
[2024-06-20 19:20:04,783 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-06-20 19:20:05,040 INFO  L384              CDTParser]: Found 1 translation units.
[2024-06-20 19:20:05,041 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix053.opt.i
[2024-06-20 19:20:05,057 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50e543a39/977c4c2af2fb4ce0a0195076d382c1ff/FLAG784ccea0c
[2024-06-20 19:20:05,071 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50e543a39/977c4c2af2fb4ce0a0195076d382c1ff
[2024-06-20 19:20:05,072 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-06-20 19:20:05,073 INFO  L133        ToolchainWalker]: Walking toolchain with 5 elements.
[2024-06-20 19:20:05,075 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-06-20 19:20:05,076 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-06-20 19:20:05,080 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-06-20 19:20:05,080 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.06 07:20:03" (1/2) ...
[2024-06-20 19:20:05,081 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51fee158 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:20:05, skipping insertion in model container
[2024-06-20 19:20:05,081 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.06 07:20:03" (1/2) ...
[2024-06-20 19:20:05,082 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@6f0a32c9 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:20:05, skipping insertion in model container
[2024-06-20 19:20:05,083 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.06 07:20:05" (2/2) ...
[2024-06-20 19:20:05,083 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51fee158 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:20:05, skipping insertion in model container
[2024-06-20 19:20:05,083 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.06 07:20:05" (2/2) ...
[2024-06-20 19:20:05,083 INFO  L83    nessWitnessExtractor]: Extracting all invariants from correctness witness
[2024-06-20 19:20:05,182 INFO  L95    edCorrectnessWitness]: Found the following entries in the witness:
[2024-06-20 19:20:05,184 INFO  L97    edCorrectnessWitness]: Location invariant before [L852-L852] (((((((((((((((((((((! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1))) && (! multithreaded || z$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= z$w_buff0 && z$w_buff0 <= 1) && (z$w_buff0 == 0 || z$w_buff0 == 1)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p3_EAX) + (long long )a >= 0LL && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd4 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd4 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff0_thd4 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd4 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff0_thd4 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd4 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff0_thd4 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd4 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd4 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$r_buff1_thd4 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$r_buff1_thd4 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$r_buff1_thd4 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )z$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )z$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )z$r_buff0_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )z$r_buff1_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )z$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a) + (long long )x >= 0LL) && (1LL - (long long )a) + (long long )y >= 0LL) && (1LL - (long long )a) + (long long )z >= 0LL) && (1LL - (long long )a) + (long long )z$flush_delayed >= 0LL) && (1LL - (long long )a) + (long long )z$mem_tmp >= 0LL) && (1LL - (long long )a) + (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )a) + (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )a) + (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )a) + (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )a) + (long long )z$r_buff0_thd4 >= 0LL) && (1LL - (long long )a) + (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )a) + (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )a) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )a) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )a) + (long long )z$r_buff1_thd4 >= 0LL) && (1LL - (long long )a) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )a) + (long long )z$w_buff0 >= 0LL) && (1LL - (long long )a) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )a) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p3_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )a >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd4 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd4 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_p3_EAX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd4 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd4 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )a >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$r_buff0_thd4 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$r_buff1_thd4 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )weak$$choice2 >= 0LL) && (long long )a + (long long )main$tmp_guard1 >= 0LL) && (long long )a + (long long )x >= 0LL) && (long long )a + (long long )y >= 0LL) && (long long )a + (long long )z >= 0LL) && (long long )a + (long long )z$flush_delayed >= 0LL) && (long long )a + (long long )z$mem_tmp >= 0LL) && (long long )a + (long long )z$r_buff0_thd0 >= 0LL) && (long long )a + (long long )z$r_buff0_thd1 >= 0LL) && (long long )a + (long long )z$r_buff0_thd2 >= 0LL) && (long long )a + (long long )z$r_buff0_thd3 >= 0LL) && (long long )a + (long long )z$r_buff0_thd4 >= 0LL) && (long long )a + (long long )z$r_buff1_thd0 >= 0LL) && (long long )a + (long long )z$r_buff1_thd1 >= 0LL) && (long long )a + (long long )z$r_buff1_thd2 >= 0LL) && (long long )a + (long long )z$r_buff1_thd3 >= 0LL) && (long long )a + (long long )z$r_buff1_thd4 >= 0LL) && (long long )a + (long long )z$read_delayed >= 0LL) && (long long )a + (long long )z$w_buff0 >= 0LL) && (long long )a + (long long )z$w_buff1 >= 0LL) && (long long )a + (long long )weak$$choice0 >= 0LL) && (long long )a + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )z$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd4 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd4 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )x + (long long )z$flush_delayed >= 0LL) && (long long )x + (long long )z$mem_tmp >= 0LL) && (long long )x + (long long )z$r_buff0_thd0 >= 0LL) && (long long )x + (long long )z$r_buff0_thd1 >= 0LL) && (long long )x + (long long )z$r_buff0_thd2 >= 0LL) && (long long )x + (long long )z$r_buff0_thd3 >= 0LL) && (long long )x + (long long )z$r_buff0_thd4 >= 0LL) && (long long )x + (long long )z$r_buff1_thd0 >= 0LL) && (long long )x + (long long )z$r_buff1_thd1 >= 0LL) && (long long )x + (long long )z$r_buff1_thd2 >= 0LL) && (long long )x + (long long )z$r_buff1_thd3 >= 0LL) && (long long )x + (long long )z$r_buff1_thd4 >= 0LL) && (long long )x + (long long )z$read_delayed >= 0LL) && (long long )x + (long long )z$w_buff0 >= 0LL) && (long long )x + (long long )z$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y + (long long )z$flush_delayed >= 0LL) && (long long )y + (long long )z$mem_tmp >= 0LL) && (long long )y + (long long )z$r_buff0_thd0 >= 0LL) && (long long )y + (long long )z$r_buff0_thd1 >= 0LL) && (long long )y + (long long )z$r_buff0_thd2 >= 0LL) && (long long )y + (long long )z$r_buff0_thd3 >= 0LL) && (long long )y + (long long )z$r_buff0_thd4 >= 0LL) && (long long )y + (long long )z$r_buff1_thd0 >= 0LL) && (long long )y + (long long )z$r_buff1_thd1 >= 0LL) && (long long )y + (long long )z$r_buff1_thd2 >= 0LL) && (long long )y + (long long )z$r_buff1_thd3 >= 0LL) && (long long )y + (long long )z$r_buff1_thd4 >= 0LL) && (long long )y + (long long )z$read_delayed >= 0LL) && (long long )y + (long long )z$w_buff0 >= 0LL) && (long long )y + (long long )z$w_buff1 >= 0LL) && (long long )z + (long long )z$flush_delayed >= 0LL) && (long long )z + (long long )z$mem_tmp >= 0LL) && (long long )z + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z + (long long )z$r_buff0_thd1 >= 0LL) && (long long )z + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z + (long long )z$r_buff0_thd4 >= 0LL) && (long long )z + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z + (long long )z$r_buff1_thd4 >= 0LL) && (long long )z + (long long )z$read_delayed >= 0LL) && (long long )z + (long long )z$w_buff0 >= 0LL) && (long long )z + (long long )z$w_buff1 >= 0LL) && (long long )z$flush_delayed + (long long )z$mem_tmp >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd4 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd4 >= 0LL) && (long long )z$flush_delayed + (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd4 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd4 >= 0LL) && (long long )z$mem_tmp + (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff0 >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd4 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd4 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff0_thd4 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd4 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff0_thd4 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd4 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff0_thd4 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd4 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd4 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd4 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd4 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd4 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd4 + (long long )z$r_buff1_thd4 >= 0LL) && (long long )z$r_buff0_thd4 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd4 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd4 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd4 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$r_buff1_thd4 >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$r_buff1_thd4 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$r_buff1_thd4 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd4 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd4 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd4 + (long long )z$w_buff1 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$w_buff0 + (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd4 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd4 >= 0LL) && (long long )weak$$choice0 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (long long )weak$$choice2 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd4 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd4 >= 0LL) && (long long )weak$$choice2 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p3_EAX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )__unbuffered_p3_EAX >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_p3_EAX) - (long long )a >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd1) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd3) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) - (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) - (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) - (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) - (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) - (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )a) - (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )a) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )a) - (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )a) - (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )a) - (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )a) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )a) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )a) - (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )a) - (long long )z$read_delayed >= 0LL) && (2LL - (long long )__unbuffered_p3_EAX) - (long long )a >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )z$read_delayed >= 0LL) && (long long )a - (long long )z$r_buff0_thd0 >= 0LL) && (long long )a - (long long )z$r_buff0_thd1 >= 0LL) && (long long )a - (long long )z$r_buff0_thd2 >= 0LL) && (long long )a - (long long )z$r_buff0_thd3 >= 0LL) && (long long )a - (long long )z$r_buff1_thd0 >= 0LL) && (long long )a - (long long )z$r_buff1_thd1 >= 0LL) && (long long )a - (long long )z$r_buff1_thd2 >= 0LL) && (long long )a - (long long )z$r_buff1_thd3 >= 0LL) && (long long )a - (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$read_delayed >= 0LL) && (long long )x - (long long )z$r_buff0_thd0 >= 0LL) && (long long )x - (long long )z$r_buff0_thd1 >= 0LL) && (long long )x - (long long )z$r_buff0_thd2 >= 0LL) && (long long )x - (long long )z$r_buff0_thd3 >= 0LL) && (long long )x - (long long )z$r_buff1_thd0 >= 0LL) && (long long )x - (long long )z$r_buff1_thd1 >= 0LL) && (long long )x - (long long )z$r_buff1_thd2 >= 0LL) && (long long )x - (long long )z$r_buff1_thd3 >= 0LL) && (long long )x - (long long )z$read_delayed >= 0LL) && (long long )y - (long long )z$r_buff0_thd0 >= 0LL) && (long long )y - (long long )z$r_buff0_thd1 >= 0LL) && (long long )y - (long long )z$r_buff0_thd2 >= 0LL) && (long long )y - (long long )z$r_buff0_thd3 >= 0LL) && (long long )y - (long long )z$r_buff1_thd0 >= 0LL) && (long long )y - (long long )z$r_buff1_thd1 >= 0LL) && (long long )y - (long long )z$r_buff1_thd2 >= 0LL) && (long long )y - (long long )z$r_buff1_thd3 >= 0LL) && (long long )y - (long long )z$read_delayed >= 0LL) && (long long )z - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z - (long long )z$r_buff0_thd1 >= 0LL) && (long long )z - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z - (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$flush_delayed - (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$mem_tmp - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd4 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd4 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd4 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd4 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd4 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd1 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd1 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd1 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd3 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd4 - (long long )z$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )z$read_delayed >= 0LL))) && (! multithreaded || ((0 <= z$w_buff1 && z$w_buff1 <= 1) && (z$w_buff1 == 0 || z$w_buff1 == 1)))) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p3_EAX) && 0 <= a) && 0 <= x) && 0 <= y) && 0 <= z) && 0 <= z$mem_tmp) && 0 <= z$w_buff0) && 0 <= z$w_buff1) && __unbuffered_p2_EAX <= 1) && __unbuffered_p3_EAX <= 1) && a <= 1) && z <= 1) && z$mem_tmp <= 1) && z$w_buff0 <= 1) && z$w_buff1 <= 1) && z$flush_delayed == (_Bool)0) && z$r_buff0_thd0 == (_Bool)0) && z$r_buff0_thd1 == (_Bool)0) && z$r_buff0_thd2 == (_Bool)0) && z$r_buff0_thd3 == (_Bool)0) && z$r_buff1_thd0 == (_Bool)0) && z$r_buff1_thd1 == (_Bool)0) && z$r_buff1_thd2 == (_Bool)0) && z$r_buff1_thd3 == (_Bool)0) && z$read_delayed == (_Bool)0) && z$read_delayed_var == 0) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1)) && (a == 0 || a == 1)) && (z == 0 || z == 1)) && (z$mem_tmp == 0 || z$mem_tmp == 1)) && (z$w_buff0 == 0 || z$w_buff0 == 1)) && (z$w_buff1 == 0 || z$w_buff1 == 1)) && ((x == 0 || x == 1) || x == 2)) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || ((0 <= z$mem_tmp && z$mem_tmp <= 1) && (z$mem_tmp == 0 || z$mem_tmp == 1)))) && (! multithreaded || z$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || z$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || z$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p3_EAX && __unbuffered_p3_EAX <= 1) && (__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || ((0 <= a && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || z$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || z$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0)
[2024-06-20 19:20:05,184 INFO  L97    edCorrectnessWitness]: Location invariant before [L849-L849] (((((((((((((((((((((! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1))) && (! multithreaded || z$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= z$w_buff0 && z$w_buff0 <= 1) && (z$w_buff0 == 0 || z$w_buff0 == 1)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p3_EAX) + (long long )a >= 0LL && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd4 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd4 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff0_thd4 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd4 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff0_thd4 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd4 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff0_thd4 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd4 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd4 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$r_buff1_thd4 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$r_buff1_thd4 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$r_buff1_thd4 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )z$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )z$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )z$r_buff0_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )z$r_buff1_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )z$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a) + (long long )x >= 0LL) && (1LL - (long long )a) + (long long )y >= 0LL) && (1LL - (long long )a) + (long long )z >= 0LL) && (1LL - (long long )a) + (long long )z$flush_delayed >= 0LL) && (1LL - (long long )a) + (long long )z$mem_tmp >= 0LL) && (1LL - (long long )a) + (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )a) + (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )a) + (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )a) + (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )a) + (long long )z$r_buff0_thd4 >= 0LL) && (1LL - (long long )a) + (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )a) + (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )a) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )a) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )a) + (long long )z$r_buff1_thd4 >= 0LL) && (1LL - (long long )a) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )a) + (long long )z$w_buff0 >= 0LL) && (1LL - (long long )a) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )a) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p3_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )a >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd4 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd4 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_p3_EAX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd4 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd4 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )a >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$r_buff0_thd4 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$r_buff1_thd4 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )weak$$choice2 >= 0LL) && (long long )a + (long long )main$tmp_guard1 >= 0LL) && (long long )a + (long long )x >= 0LL) && (long long )a + (long long )y >= 0LL) && (long long )a + (long long )z >= 0LL) && (long long )a + (long long )z$flush_delayed >= 0LL) && (long long )a + (long long )z$mem_tmp >= 0LL) && (long long )a + (long long )z$r_buff0_thd0 >= 0LL) && (long long )a + (long long )z$r_buff0_thd1 >= 0LL) && (long long )a + (long long )z$r_buff0_thd2 >= 0LL) && (long long )a + (long long )z$r_buff0_thd3 >= 0LL) && (long long )a + (long long )z$r_buff0_thd4 >= 0LL) && (long long )a + (long long )z$r_buff1_thd0 >= 0LL) && (long long )a + (long long )z$r_buff1_thd1 >= 0LL) && (long long )a + (long long )z$r_buff1_thd2 >= 0LL) && (long long )a + (long long )z$r_buff1_thd3 >= 0LL) && (long long )a + (long long )z$r_buff1_thd4 >= 0LL) && (long long )a + (long long )z$read_delayed >= 0LL) && (long long )a + (long long )z$w_buff0 >= 0LL) && (long long )a + (long long )z$w_buff1 >= 0LL) && (long long )a + (long long )weak$$choice0 >= 0LL) && (long long )a + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )z$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd4 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd4 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )x + (long long )z$flush_delayed >= 0LL) && (long long )x + (long long )z$mem_tmp >= 0LL) && (long long )x + (long long )z$r_buff0_thd0 >= 0LL) && (long long )x + (long long )z$r_buff0_thd1 >= 0LL) && (long long )x + (long long )z$r_buff0_thd2 >= 0LL) && (long long )x + (long long )z$r_buff0_thd3 >= 0LL) && (long long )x + (long long )z$r_buff0_thd4 >= 0LL) && (long long )x + (long long )z$r_buff1_thd0 >= 0LL) && (long long )x + (long long )z$r_buff1_thd1 >= 0LL) && (long long )x + (long long )z$r_buff1_thd2 >= 0LL) && (long long )x + (long long )z$r_buff1_thd3 >= 0LL) && (long long )x + (long long )z$r_buff1_thd4 >= 0LL) && (long long )x + (long long )z$read_delayed >= 0LL) && (long long )x + (long long )z$w_buff0 >= 0LL) && (long long )x + (long long )z$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y + (long long )z$flush_delayed >= 0LL) && (long long )y + (long long )z$mem_tmp >= 0LL) && (long long )y + (long long )z$r_buff0_thd0 >= 0LL) && (long long )y + (long long )z$r_buff0_thd1 >= 0LL) && (long long )y + (long long )z$r_buff0_thd2 >= 0LL) && (long long )y + (long long )z$r_buff0_thd3 >= 0LL) && (long long )y + (long long )z$r_buff0_thd4 >= 0LL) && (long long )y + (long long )z$r_buff1_thd0 >= 0LL) && (long long )y + (long long )z$r_buff1_thd1 >= 0LL) && (long long )y + (long long )z$r_buff1_thd2 >= 0LL) && (long long )y + (long long )z$r_buff1_thd3 >= 0LL) && (long long )y + (long long )z$r_buff1_thd4 >= 0LL) && (long long )y + (long long )z$read_delayed >= 0LL) && (long long )y + (long long )z$w_buff0 >= 0LL) && (long long )y + (long long )z$w_buff1 >= 0LL) && (long long )z + (long long )z$flush_delayed >= 0LL) && (long long )z + (long long )z$mem_tmp >= 0LL) && (long long )z + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z + (long long )z$r_buff0_thd1 >= 0LL) && (long long )z + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z + (long long )z$r_buff0_thd4 >= 0LL) && (long long )z + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z + (long long )z$r_buff1_thd4 >= 0LL) && (long long )z + (long long )z$read_delayed >= 0LL) && (long long )z + (long long )z$w_buff0 >= 0LL) && (long long )z + (long long )z$w_buff1 >= 0LL) && (long long )z$flush_delayed + (long long )z$mem_tmp >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd4 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd4 >= 0LL) && (long long )z$flush_delayed + (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd4 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd4 >= 0LL) && (long long )z$mem_tmp + (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff0 >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd4 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd4 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff0_thd4 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd4 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff0_thd4 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd4 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff0_thd4 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd4 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd4 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd4 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd4 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd4 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd4 + (long long )z$r_buff1_thd4 >= 0LL) && (long long )z$r_buff0_thd4 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd4 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd4 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd4 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$r_buff1_thd4 >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$r_buff1_thd4 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$r_buff1_thd4 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd4 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd4 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd4 + (long long )z$w_buff1 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$w_buff0 + (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd4 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd4 >= 0LL) && (long long )weak$$choice0 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (long long )weak$$choice2 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd4 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd4 >= 0LL) && (long long )weak$$choice2 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p3_EAX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )__unbuffered_p3_EAX >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_p3_EAX) - (long long )a >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd1) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd3) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) - (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) - (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) - (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) - (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) - (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )a) - (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )a) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )a) - (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )a) - (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )a) - (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )a) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )a) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )a) - (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )a) - (long long )z$read_delayed >= 0LL) && (2LL - (long long )__unbuffered_p3_EAX) - (long long )a >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )z$read_delayed >= 0LL) && (long long )a - (long long )z$r_buff0_thd0 >= 0LL) && (long long )a - (long long )z$r_buff0_thd1 >= 0LL) && (long long )a - (long long )z$r_buff0_thd2 >= 0LL) && (long long )a - (long long )z$r_buff0_thd3 >= 0LL) && (long long )a - (long long )z$r_buff1_thd0 >= 0LL) && (long long )a - (long long )z$r_buff1_thd1 >= 0LL) && (long long )a - (long long )z$r_buff1_thd2 >= 0LL) && (long long )a - (long long )z$r_buff1_thd3 >= 0LL) && (long long )a - (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$read_delayed >= 0LL) && (long long )x - (long long )z$r_buff0_thd0 >= 0LL) && (long long )x - (long long )z$r_buff0_thd1 >= 0LL) && (long long )x - (long long )z$r_buff0_thd2 >= 0LL) && (long long )x - (long long )z$r_buff0_thd3 >= 0LL) && (long long )x - (long long )z$r_buff1_thd0 >= 0LL) && (long long )x - (long long )z$r_buff1_thd1 >= 0LL) && (long long )x - (long long )z$r_buff1_thd2 >= 0LL) && (long long )x - (long long )z$r_buff1_thd3 >= 0LL) && (long long )x - (long long )z$read_delayed >= 0LL) && (long long )y - (long long )z$r_buff0_thd0 >= 0LL) && (long long )y - (long long )z$r_buff0_thd1 >= 0LL) && (long long )y - (long long )z$r_buff0_thd2 >= 0LL) && (long long )y - (long long )z$r_buff0_thd3 >= 0LL) && (long long )y - (long long )z$r_buff1_thd0 >= 0LL) && (long long )y - (long long )z$r_buff1_thd1 >= 0LL) && (long long )y - (long long )z$r_buff1_thd2 >= 0LL) && (long long )y - (long long )z$r_buff1_thd3 >= 0LL) && (long long )y - (long long )z$read_delayed >= 0LL) && (long long )z - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z - (long long )z$r_buff0_thd1 >= 0LL) && (long long )z - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z - (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$flush_delayed - (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$mem_tmp - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd4 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd4 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd4 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd4 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd4 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd1 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd1 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd1 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd3 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd4 - (long long )z$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )z$read_delayed >= 0LL))) && (! multithreaded || ((0 <= z$w_buff1 && z$w_buff1 <= 1) && (z$w_buff1 == 0 || z$w_buff1 == 1)))) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p3_EAX) && 0 <= a) && 0 <= x) && 0 <= y) && 0 <= z) && 0 <= z$mem_tmp) && 0 <= z$w_buff0) && 0 <= z$w_buff1) && __unbuffered_p2_EAX <= 1) && __unbuffered_p3_EAX <= 1) && a <= 1) && z <= 1) && z$mem_tmp <= 1) && z$w_buff0 <= 1) && z$w_buff1 <= 1) && z$flush_delayed == (_Bool)0) && z$r_buff0_thd0 == (_Bool)0) && z$r_buff0_thd1 == (_Bool)0) && z$r_buff0_thd2 == (_Bool)0) && z$r_buff0_thd3 == (_Bool)0) && z$r_buff1_thd0 == (_Bool)0) && z$r_buff1_thd1 == (_Bool)0) && z$r_buff1_thd2 == (_Bool)0) && z$r_buff1_thd3 == (_Bool)0) && z$read_delayed == (_Bool)0) && z$read_delayed_var == 0) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1)) && (a == 0 || a == 1)) && (z == 0 || z == 1)) && (z$mem_tmp == 0 || z$mem_tmp == 1)) && (z$w_buff0 == 0 || z$w_buff0 == 1)) && (z$w_buff1 == 0 || z$w_buff1 == 1)) && ((x == 0 || x == 1) || x == 2)) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || ((0 <= z$mem_tmp && z$mem_tmp <= 1) && (z$mem_tmp == 0 || z$mem_tmp == 1)))) && (! multithreaded || z$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || z$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || z$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p3_EAX && __unbuffered_p3_EAX <= 1) && (__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || ((0 <= a && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || z$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || z$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0)
[2024-06-20 19:20:05,186 INFO  L97    edCorrectnessWitness]: Location invariant before [L851-L851] (((((((((((((((((((((! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1))) && (! multithreaded || z$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= z$w_buff0 && z$w_buff0 <= 1) && (z$w_buff0 == 0 || z$w_buff0 == 1)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p3_EAX) + (long long )a >= 0LL && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd4 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd4 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff0_thd4 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd4 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff0_thd4 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd4 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff0_thd4 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd4 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd4 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$r_buff1_thd4 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$r_buff1_thd4 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$r_buff1_thd4 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )z$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )z$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )z$r_buff0_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )z$r_buff1_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )z$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a) + (long long )x >= 0LL) && (1LL - (long long )a) + (long long )y >= 0LL) && (1LL - (long long )a) + (long long )z >= 0LL) && (1LL - (long long )a) + (long long )z$flush_delayed >= 0LL) && (1LL - (long long )a) + (long long )z$mem_tmp >= 0LL) && (1LL - (long long )a) + (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )a) + (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )a) + (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )a) + (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )a) + (long long )z$r_buff0_thd4 >= 0LL) && (1LL - (long long )a) + (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )a) + (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )a) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )a) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )a) + (long long )z$r_buff1_thd4 >= 0LL) && (1LL - (long long )a) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )a) + (long long )z$w_buff0 >= 0LL) && (1LL - (long long )a) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )a) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p3_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )a >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd4 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd4 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_p3_EAX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd4 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd4 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )a >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$r_buff0_thd4 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$r_buff1_thd4 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )weak$$choice2 >= 0LL) && (long long )a + (long long )main$tmp_guard1 >= 0LL) && (long long )a + (long long )x >= 0LL) && (long long )a + (long long )y >= 0LL) && (long long )a + (long long )z >= 0LL) && (long long )a + (long long )z$flush_delayed >= 0LL) && (long long )a + (long long )z$mem_tmp >= 0LL) && (long long )a + (long long )z$r_buff0_thd0 >= 0LL) && (long long )a + (long long )z$r_buff0_thd1 >= 0LL) && (long long )a + (long long )z$r_buff0_thd2 >= 0LL) && (long long )a + (long long )z$r_buff0_thd3 >= 0LL) && (long long )a + (long long )z$r_buff0_thd4 >= 0LL) && (long long )a + (long long )z$r_buff1_thd0 >= 0LL) && (long long )a + (long long )z$r_buff1_thd1 >= 0LL) && (long long )a + (long long )z$r_buff1_thd2 >= 0LL) && (long long )a + (long long )z$r_buff1_thd3 >= 0LL) && (long long )a + (long long )z$r_buff1_thd4 >= 0LL) && (long long )a + (long long )z$read_delayed >= 0LL) && (long long )a + (long long )z$w_buff0 >= 0LL) && (long long )a + (long long )z$w_buff1 >= 0LL) && (long long )a + (long long )weak$$choice0 >= 0LL) && (long long )a + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )z$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd4 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd4 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )x + (long long )z$flush_delayed >= 0LL) && (long long )x + (long long )z$mem_tmp >= 0LL) && (long long )x + (long long )z$r_buff0_thd0 >= 0LL) && (long long )x + (long long )z$r_buff0_thd1 >= 0LL) && (long long )x + (long long )z$r_buff0_thd2 >= 0LL) && (long long )x + (long long )z$r_buff0_thd3 >= 0LL) && (long long )x + (long long )z$r_buff0_thd4 >= 0LL) && (long long )x + (long long )z$r_buff1_thd0 >= 0LL) && (long long )x + (long long )z$r_buff1_thd1 >= 0LL) && (long long )x + (long long )z$r_buff1_thd2 >= 0LL) && (long long )x + (long long )z$r_buff1_thd3 >= 0LL) && (long long )x + (long long )z$r_buff1_thd4 >= 0LL) && (long long )x + (long long )z$read_delayed >= 0LL) && (long long )x + (long long )z$w_buff0 >= 0LL) && (long long )x + (long long )z$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y + (long long )z$flush_delayed >= 0LL) && (long long )y + (long long )z$mem_tmp >= 0LL) && (long long )y + (long long )z$r_buff0_thd0 >= 0LL) && (long long )y + (long long )z$r_buff0_thd1 >= 0LL) && (long long )y + (long long )z$r_buff0_thd2 >= 0LL) && (long long )y + (long long )z$r_buff0_thd3 >= 0LL) && (long long )y + (long long )z$r_buff0_thd4 >= 0LL) && (long long )y + (long long )z$r_buff1_thd0 >= 0LL) && (long long )y + (long long )z$r_buff1_thd1 >= 0LL) && (long long )y + (long long )z$r_buff1_thd2 >= 0LL) && (long long )y + (long long )z$r_buff1_thd3 >= 0LL) && (long long )y + (long long )z$r_buff1_thd4 >= 0LL) && (long long )y + (long long )z$read_delayed >= 0LL) && (long long )y + (long long )z$w_buff0 >= 0LL) && (long long )y + (long long )z$w_buff1 >= 0LL) && (long long )z + (long long )z$flush_delayed >= 0LL) && (long long )z + (long long )z$mem_tmp >= 0LL) && (long long )z + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z + (long long )z$r_buff0_thd1 >= 0LL) && (long long )z + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z + (long long )z$r_buff0_thd4 >= 0LL) && (long long )z + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z + (long long )z$r_buff1_thd4 >= 0LL) && (long long )z + (long long )z$read_delayed >= 0LL) && (long long )z + (long long )z$w_buff0 >= 0LL) && (long long )z + (long long )z$w_buff1 >= 0LL) && (long long )z$flush_delayed + (long long )z$mem_tmp >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd4 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd4 >= 0LL) && (long long )z$flush_delayed + (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd4 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd4 >= 0LL) && (long long )z$mem_tmp + (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff0 >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd4 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd4 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff0_thd4 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd4 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff0_thd4 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd4 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff0_thd4 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd4 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd4 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd4 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd4 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd4 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd4 + (long long )z$r_buff1_thd4 >= 0LL) && (long long )z$r_buff0_thd4 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd4 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd4 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd4 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$r_buff1_thd4 >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$r_buff1_thd4 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$r_buff1_thd4 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd4 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd4 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd4 + (long long )z$w_buff1 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$w_buff0 + (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd4 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd4 >= 0LL) && (long long )weak$$choice0 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (long long )weak$$choice2 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd4 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd4 >= 0LL) && (long long )weak$$choice2 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p3_EAX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )__unbuffered_p3_EAX >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_p3_EAX) - (long long )a >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd1) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd3) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) - (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) - (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) - (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) - (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) - (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )a) - (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )a) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )a) - (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )a) - (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )a) - (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )a) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )a) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )a) - (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )a) - (long long )z$read_delayed >= 0LL) && (2LL - (long long )__unbuffered_p3_EAX) - (long long )a >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )z$read_delayed >= 0LL) && (long long )a - (long long )z$r_buff0_thd0 >= 0LL) && (long long )a - (long long )z$r_buff0_thd1 >= 0LL) && (long long )a - (long long )z$r_buff0_thd2 >= 0LL) && (long long )a - (long long )z$r_buff0_thd3 >= 0LL) && (long long )a - (long long )z$r_buff1_thd0 >= 0LL) && (long long )a - (long long )z$r_buff1_thd1 >= 0LL) && (long long )a - (long long )z$r_buff1_thd2 >= 0LL) && (long long )a - (long long )z$r_buff1_thd3 >= 0LL) && (long long )a - (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$read_delayed >= 0LL) && (long long )x - (long long )z$r_buff0_thd0 >= 0LL) && (long long )x - (long long )z$r_buff0_thd1 >= 0LL) && (long long )x - (long long )z$r_buff0_thd2 >= 0LL) && (long long )x - (long long )z$r_buff0_thd3 >= 0LL) && (long long )x - (long long )z$r_buff1_thd0 >= 0LL) && (long long )x - (long long )z$r_buff1_thd1 >= 0LL) && (long long )x - (long long )z$r_buff1_thd2 >= 0LL) && (long long )x - (long long )z$r_buff1_thd3 >= 0LL) && (long long )x - (long long )z$read_delayed >= 0LL) && (long long )y - (long long )z$r_buff0_thd0 >= 0LL) && (long long )y - (long long )z$r_buff0_thd1 >= 0LL) && (long long )y - (long long )z$r_buff0_thd2 >= 0LL) && (long long )y - (long long )z$r_buff0_thd3 >= 0LL) && (long long )y - (long long )z$r_buff1_thd0 >= 0LL) && (long long )y - (long long )z$r_buff1_thd1 >= 0LL) && (long long )y - (long long )z$r_buff1_thd2 >= 0LL) && (long long )y - (long long )z$r_buff1_thd3 >= 0LL) && (long long )y - (long long )z$read_delayed >= 0LL) && (long long )z - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z - (long long )z$r_buff0_thd1 >= 0LL) && (long long )z - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z - (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$flush_delayed - (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$mem_tmp - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd4 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd4 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd4 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd4 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd4 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd1 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd1 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd1 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd3 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd4 - (long long )z$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )z$read_delayed >= 0LL))) && (! multithreaded || ((0 <= z$w_buff1 && z$w_buff1 <= 1) && (z$w_buff1 == 0 || z$w_buff1 == 1)))) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p3_EAX) && 0 <= a) && 0 <= x) && 0 <= y) && 0 <= z) && 0 <= z$mem_tmp) && 0 <= z$w_buff0) && 0 <= z$w_buff1) && __unbuffered_p2_EAX <= 1) && __unbuffered_p3_EAX <= 1) && a <= 1) && z <= 1) && z$mem_tmp <= 1) && z$w_buff0 <= 1) && z$w_buff1 <= 1) && z$flush_delayed == (_Bool)0) && z$r_buff0_thd0 == (_Bool)0) && z$r_buff0_thd1 == (_Bool)0) && z$r_buff0_thd2 == (_Bool)0) && z$r_buff0_thd3 == (_Bool)0) && z$r_buff1_thd0 == (_Bool)0) && z$r_buff1_thd1 == (_Bool)0) && z$r_buff1_thd2 == (_Bool)0) && z$r_buff1_thd3 == (_Bool)0) && z$read_delayed == (_Bool)0) && z$read_delayed_var == 0) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1)) && (a == 0 || a == 1)) && (z == 0 || z == 1)) && (z$mem_tmp == 0 || z$mem_tmp == 1)) && (z$w_buff0 == 0 || z$w_buff0 == 1)) && (z$w_buff1 == 0 || z$w_buff1 == 1)) && ((x == 0 || x == 1) || x == 2)) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || ((0 <= z$mem_tmp && z$mem_tmp <= 1) && (z$mem_tmp == 0 || z$mem_tmp == 1)))) && (! multithreaded || z$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || z$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || z$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p3_EAX && __unbuffered_p3_EAX <= 1) && (__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || ((0 <= a && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || z$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || z$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0)
[2024-06-20 19:20:05,186 INFO  L97    edCorrectnessWitness]: Location invariant before [L847-L847] (((((((((((((((((((((! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1))) && (! multithreaded || z$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= z$w_buff0 && z$w_buff0 <= 1) && (z$w_buff0 == 0 || z$w_buff0 == 1)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p3_EAX) + (long long )a >= 0LL && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd4 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd4 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff0_thd4 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd4 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff0_thd4 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd4 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff0_thd4 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd4 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd4 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$r_buff1_thd4 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$r_buff1_thd4 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$r_buff1_thd4 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )z$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )z$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )z$r_buff0_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )z$r_buff1_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )z$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a) + (long long )x >= 0LL) && (1LL - (long long )a) + (long long )y >= 0LL) && (1LL - (long long )a) + (long long )z >= 0LL) && (1LL - (long long )a) + (long long )z$flush_delayed >= 0LL) && (1LL - (long long )a) + (long long )z$mem_tmp >= 0LL) && (1LL - (long long )a) + (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )a) + (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )a) + (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )a) + (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )a) + (long long )z$r_buff0_thd4 >= 0LL) && (1LL - (long long )a) + (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )a) + (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )a) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )a) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )a) + (long long )z$r_buff1_thd4 >= 0LL) && (1LL - (long long )a) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )a) + (long long )z$w_buff0 >= 0LL) && (1LL - (long long )a) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )a) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p3_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )a >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd4 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd4 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_p3_EAX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd4 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd4 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )a >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$r_buff0_thd4 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$r_buff1_thd4 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )weak$$choice2 >= 0LL) && (long long )a + (long long )main$tmp_guard1 >= 0LL) && (long long )a + (long long )x >= 0LL) && (long long )a + (long long )y >= 0LL) && (long long )a + (long long )z >= 0LL) && (long long )a + (long long )z$flush_delayed >= 0LL) && (long long )a + (long long )z$mem_tmp >= 0LL) && (long long )a + (long long )z$r_buff0_thd0 >= 0LL) && (long long )a + (long long )z$r_buff0_thd1 >= 0LL) && (long long )a + (long long )z$r_buff0_thd2 >= 0LL) && (long long )a + (long long )z$r_buff0_thd3 >= 0LL) && (long long )a + (long long )z$r_buff0_thd4 >= 0LL) && (long long )a + (long long )z$r_buff1_thd0 >= 0LL) && (long long )a + (long long )z$r_buff1_thd1 >= 0LL) && (long long )a + (long long )z$r_buff1_thd2 >= 0LL) && (long long )a + (long long )z$r_buff1_thd3 >= 0LL) && (long long )a + (long long )z$r_buff1_thd4 >= 0LL) && (long long )a + (long long )z$read_delayed >= 0LL) && (long long )a + (long long )z$w_buff0 >= 0LL) && (long long )a + (long long )z$w_buff1 >= 0LL) && (long long )a + (long long )weak$$choice0 >= 0LL) && (long long )a + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )z$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd4 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd4 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )x + (long long )z$flush_delayed >= 0LL) && (long long )x + (long long )z$mem_tmp >= 0LL) && (long long )x + (long long )z$r_buff0_thd0 >= 0LL) && (long long )x + (long long )z$r_buff0_thd1 >= 0LL) && (long long )x + (long long )z$r_buff0_thd2 >= 0LL) && (long long )x + (long long )z$r_buff0_thd3 >= 0LL) && (long long )x + (long long )z$r_buff0_thd4 >= 0LL) && (long long )x + (long long )z$r_buff1_thd0 >= 0LL) && (long long )x + (long long )z$r_buff1_thd1 >= 0LL) && (long long )x + (long long )z$r_buff1_thd2 >= 0LL) && (long long )x + (long long )z$r_buff1_thd3 >= 0LL) && (long long )x + (long long )z$r_buff1_thd4 >= 0LL) && (long long )x + (long long )z$read_delayed >= 0LL) && (long long )x + (long long )z$w_buff0 >= 0LL) && (long long )x + (long long )z$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y + (long long )z$flush_delayed >= 0LL) && (long long )y + (long long )z$mem_tmp >= 0LL) && (long long )y + (long long )z$r_buff0_thd0 >= 0LL) && (long long )y + (long long )z$r_buff0_thd1 >= 0LL) && (long long )y + (long long )z$r_buff0_thd2 >= 0LL) && (long long )y + (long long )z$r_buff0_thd3 >= 0LL) && (long long )y + (long long )z$r_buff0_thd4 >= 0LL) && (long long )y + (long long )z$r_buff1_thd0 >= 0LL) && (long long )y + (long long )z$r_buff1_thd1 >= 0LL) && (long long )y + (long long )z$r_buff1_thd2 >= 0LL) && (long long )y + (long long )z$r_buff1_thd3 >= 0LL) && (long long )y + (long long )z$r_buff1_thd4 >= 0LL) && (long long )y + (long long )z$read_delayed >= 0LL) && (long long )y + (long long )z$w_buff0 >= 0LL) && (long long )y + (long long )z$w_buff1 >= 0LL) && (long long )z + (long long )z$flush_delayed >= 0LL) && (long long )z + (long long )z$mem_tmp >= 0LL) && (long long )z + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z + (long long )z$r_buff0_thd1 >= 0LL) && (long long )z + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z + (long long )z$r_buff0_thd4 >= 0LL) && (long long )z + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z + (long long )z$r_buff1_thd4 >= 0LL) && (long long )z + (long long )z$read_delayed >= 0LL) && (long long )z + (long long )z$w_buff0 >= 0LL) && (long long )z + (long long )z$w_buff1 >= 0LL) && (long long )z$flush_delayed + (long long )z$mem_tmp >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd4 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd4 >= 0LL) && (long long )z$flush_delayed + (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd4 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd4 >= 0LL) && (long long )z$mem_tmp + (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff0 >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd4 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd4 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff0_thd4 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd4 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff0_thd4 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd4 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff0_thd4 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd4 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd4 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd4 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd4 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd4 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd4 + (long long )z$r_buff1_thd4 >= 0LL) && (long long )z$r_buff0_thd4 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd4 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd4 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd4 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$r_buff1_thd4 >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$r_buff1_thd4 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$r_buff1_thd4 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd4 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd4 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd4 + (long long )z$w_buff1 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$w_buff0 + (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd4 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd4 >= 0LL) && (long long )weak$$choice0 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (long long )weak$$choice2 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd4 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd4 >= 0LL) && (long long )weak$$choice2 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p3_EAX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )__unbuffered_p3_EAX >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_p3_EAX) - (long long )a >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd1) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd3) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) - (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) - (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) - (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) - (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) - (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EAX) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )a) - (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )a) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )a) - (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )a) - (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )a) - (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )a) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )a) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )a) - (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )a) - (long long )z$read_delayed >= 0LL) && (2LL - (long long )__unbuffered_p3_EAX) - (long long )a >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )z$read_delayed >= 0LL) && (long long )a - (long long )z$r_buff0_thd0 >= 0LL) && (long long )a - (long long )z$r_buff0_thd1 >= 0LL) && (long long )a - (long long )z$r_buff0_thd2 >= 0LL) && (long long )a - (long long )z$r_buff0_thd3 >= 0LL) && (long long )a - (long long )z$r_buff1_thd0 >= 0LL) && (long long )a - (long long )z$r_buff1_thd1 >= 0LL) && (long long )a - (long long )z$r_buff1_thd2 >= 0LL) && (long long )a - (long long )z$r_buff1_thd3 >= 0LL) && (long long )a - (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$read_delayed >= 0LL) && (long long )x - (long long )z$r_buff0_thd0 >= 0LL) && (long long )x - (long long )z$r_buff0_thd1 >= 0LL) && (long long )x - (long long )z$r_buff0_thd2 >= 0LL) && (long long )x - (long long )z$r_buff0_thd3 >= 0LL) && (long long )x - (long long )z$r_buff1_thd0 >= 0LL) && (long long )x - (long long )z$r_buff1_thd1 >= 0LL) && (long long )x - (long long )z$r_buff1_thd2 >= 0LL) && (long long )x - (long long )z$r_buff1_thd3 >= 0LL) && (long long )x - (long long )z$read_delayed >= 0LL) && (long long )y - (long long )z$r_buff0_thd0 >= 0LL) && (long long )y - (long long )z$r_buff0_thd1 >= 0LL) && (long long )y - (long long )z$r_buff0_thd2 >= 0LL) && (long long )y - (long long )z$r_buff0_thd3 >= 0LL) && (long long )y - (long long )z$r_buff1_thd0 >= 0LL) && (long long )y - (long long )z$r_buff1_thd1 >= 0LL) && (long long )y - (long long )z$r_buff1_thd2 >= 0LL) && (long long )y - (long long )z$r_buff1_thd3 >= 0LL) && (long long )y - (long long )z$read_delayed >= 0LL) && (long long )z - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z - (long long )z$r_buff0_thd1 >= 0LL) && (long long )z - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z - (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$flush_delayed - (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$mem_tmp - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd4 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd4 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd4 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd4 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd4 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd1 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd1 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd1 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd3 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd4 - (long long )z$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )z$read_delayed >= 0LL))) && (! multithreaded || ((0 <= z$w_buff1 && z$w_buff1 <= 1) && (z$w_buff1 == 0 || z$w_buff1 == 1)))) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p3_EAX) && 0 <= a) && 0 <= x) && 0 <= y) && 0 <= z) && 0 <= z$mem_tmp) && 0 <= z$w_buff0) && 0 <= z$w_buff1) && __unbuffered_p2_EAX <= 1) && __unbuffered_p3_EAX <= 1) && a <= 1) && z <= 1) && z$mem_tmp <= 1) && z$w_buff0 <= 1) && z$w_buff1 <= 1) && z$flush_delayed == (_Bool)0) && z$r_buff0_thd0 == (_Bool)0) && z$r_buff0_thd1 == (_Bool)0) && z$r_buff0_thd2 == (_Bool)0) && z$r_buff0_thd3 == (_Bool)0) && z$r_buff1_thd0 == (_Bool)0) && z$r_buff1_thd1 == (_Bool)0) && z$r_buff1_thd2 == (_Bool)0) && z$r_buff1_thd3 == (_Bool)0) && z$read_delayed == (_Bool)0) && z$read_delayed_var == 0) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1)) && (a == 0 || a == 1)) && (z == 0 || z == 1)) && (z$mem_tmp == 0 || z$mem_tmp == 1)) && (z$w_buff0 == 0 || z$w_buff0 == 1)) && (z$w_buff1 == 0 || z$w_buff1 == 1)) && ((x == 0 || x == 1) || x == 2)) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || ((0 <= z$mem_tmp && z$mem_tmp <= 1) && (z$mem_tmp == 0 || z$mem_tmp == 1)))) && (! multithreaded || z$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || z$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || z$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p3_EAX && __unbuffered_p3_EAX <= 1) && (__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || ((0 <= a && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || z$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || z$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0)
[2024-06-20 19:20:05,187 INFO  L103   edCorrectnessWitness]: ghost_variable multithreaded = 0
[2024-06-20 19:20:05,188 INFO  L106   edCorrectnessWitness]: ghost_update [L845-L845] multithreaded = 1;
[2024-06-20 19:20:05,224 INFO  L177         MainTranslator]: Built tables and reachable declarations
[2024-06-20 19:20:05,562 INFO  L207          PostProcessor]: Analyzing one entry point: main
[2024-06-20 19:20:05,573 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-20 19:20:05,952 INFO  L207          PostProcessor]: Analyzing one entry point: main
[2024-06-20 19:20:05,981 INFO  L206         MainTranslator]: Completed translation
[2024-06-20 19:20:05,982 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:20:05 WrapperNode
[2024-06-20 19:20:05,982 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-06-20 19:20:05,983 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-06-20 19:20:05,983 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-06-20 19:20:05,984 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-06-20 19:20:05,989 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:20:05" (1/1) ...
[2024-06-20 19:20:06,025 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:20:05" (1/1) ...
[2024-06-20 19:20:06,277 INFO  L138                Inliner]: procedures = 176, calls = 52, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 137
[2024-06-20 19:20:06,277 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-06-20 19:20:06,278 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-06-20 19:20:06,278 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-06-20 19:20:06,278 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-06-20 19:20:06,287 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:20:05" (1/1) ...
[2024-06-20 19:20:06,287 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:20:05" (1/1) ...
[2024-06-20 19:20:06,310 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:20:05" (1/1) ...
[2024-06-20 19:20:06,357 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-20 19:20:06,358 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:20:05" (1/1) ...
[2024-06-20 19:20:06,358 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:20:05" (1/1) ...
[2024-06-20 19:20:06,393 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:20:05" (1/1) ...
[2024-06-20 19:20:06,394 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:20:05" (1/1) ...
[2024-06-20 19:20:06,414 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:20:05" (1/1) ...
[2024-06-20 19:20:06,420 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:20:05" (1/1) ...
[2024-06-20 19:20:06,493 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-06-20 19:20:06,494 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-06-20 19:20:06,494 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-06-20 19:20:06,494 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-06-20 19:20:06,495 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:20:05" (1/1) ...
[2024-06-20 19:20:06,499 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-06-20 19:20:06,506 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-06-20 19:20:06,517 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-20 19:20:06,534 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-20 19:20:06,559 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2024-06-20 19:20:06,559 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-06-20 19:20:06,559 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2024-06-20 19:20:06,559 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2024-06-20 19:20:06,560 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2024-06-20 19:20:06,560 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2024-06-20 19:20:06,560 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2024-06-20 19:20:06,560 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2024-06-20 19:20:06,560 INFO  L130     BoogieDeclarations]: Found specification of procedure P3
[2024-06-20 19:20:06,560 INFO  L138     BoogieDeclarations]: Found implementation of procedure P3
[2024-06-20 19:20:06,560 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-06-20 19:20:06,560 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2024-06-20 19:20:06,561 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-06-20 19:20:06,561 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-06-20 19:20:06,562 WARN  L214             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement
[2024-06-20 19:20:06,672 INFO  L244             CfgBuilder]: Building ICFG
[2024-06-20 19:20:06,673 INFO  L270             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-06-20 19:20:08,448 INFO  L289             CfgBuilder]: Ommited future-live optimization because the input is a concurrent program.
[2024-06-20 19:20:08,448 INFO  L293             CfgBuilder]: Performing block encoding
[2024-06-20 19:20:08,780 INFO  L315             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-06-20 19:20:08,781 INFO  L320             CfgBuilder]: Removed 0 assume(true) statements.
[2024-06-20 19:20:08,781 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.06 07:20:08 BoogieIcfgContainer
[2024-06-20 19:20:08,781 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-06-20 19:20:08,783 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-06-20 19:20:08,783 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-06-20 19:20:08,785 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-06-20 19:20:08,785 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.06 07:20:03" (1/4) ...
[2024-06-20 19:20:08,786 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b4ab6fb and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 20.06 07:20:08, skipping insertion in model container
[2024-06-20 19:20:08,786 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.06 07:20:05" (2/4) ...
[2024-06-20 19:20:08,786 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b4ab6fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.06 07:20:08, skipping insertion in model container
[2024-06-20 19:20:08,786 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:20:05" (3/4) ...
[2024-06-20 19:20:08,786 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b4ab6fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.06 07:20:08, skipping insertion in model container
[2024-06-20 19:20:08,786 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.06 07:20:08" (4/4) ...
[2024-06-20 19:20:08,787 INFO  L112   eAbstractionObserver]: Analyzing ICFG mix053.opt.i
[2024-06-20 19:20:08,800 INFO  L204   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-06-20 19:20:08,800 INFO  L163   ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations.
[2024-06-20 19:20:08,800 INFO  L522   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-06-20 19:20:08,939 INFO  L144    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-06-20 19:20:08,968 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 64 places, 51 transitions, 118 flow
[2024-06-20 19:20:09,030 INFO  L124   PetriNetUnfolderBase]: 0/47 cut-off events.
[2024-06-20 19:20:09,030 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-06-20 19:20:09,033 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 60 conditions, 47 events. 0/47 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 83 event pairs, 0 based on Foata normal form. 0/43 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. 
[2024-06-20 19:20:09,033 INFO  L82        GeneralOperation]: Start removeDead. Operand has 64 places, 51 transitions, 118 flow
[2024-06-20 19:20:09,035 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 54 places, 41 transitions, 94 flow
[2024-06-20 19:20:09,084 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-06-20 19:20:09,091 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;@5a651fac, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-06-20 19:20:09,091 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 8 error locations.
[2024-06-20 19:20:09,098 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-06-20 19:20:09,098 INFO  L124   PetriNetUnfolderBase]: 0/5 cut-off events.
[2024-06-20 19:20:09,099 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-06-20 19:20:09,099 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:20:09,099 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1]
[2024-06-20 19:20:09,100 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-20 19:20:09,121 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:20:09,122 INFO  L85        PathProgramCache]: Analyzing trace with hash 372441680, now seen corresponding path program 1 times
[2024-06-20 19:20:09,129 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:20:09,129 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541593419]
[2024-06-20 19:20:09,129 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:20:09,130 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:20:09,560 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:20:15,730 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-20 19:20:15,731 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:20:15,731 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541593419]
[2024-06-20 19:20:15,732 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541593419] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:20:15,732 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:20:15,732 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-06-20 19:20:15,733 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686803623]
[2024-06-20 19:20:15,734 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:20:15,739 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-06-20 19:20:15,743 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:20:15,759 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-06-20 19:20:15,760 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-06-20 19:20:15,848 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 16 out of 51
[2024-06-20 19:20:15,850 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 41 transitions, 94 flow. Second operand  has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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-20 19:20:15,850 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:20:15,850 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 51
[2024-06-20 19:20:15,851 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:20:19,568 INFO  L124   PetriNetUnfolderBase]: 6742/9590 cut-off events.
[2024-06-20 19:20:19,568 INFO  L125   PetriNetUnfolderBase]: For 153/153 co-relation queries the response was YES.
[2024-06-20 19:20:19,584 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 19142 conditions, 9590 events. 6742/9590 cut-off events. For 153/153 co-relation queries the response was YES. Maximal size of possible extension queue 375. Compared 52856 event pairs, 5078 based on Foata normal form. 1/9336 useless extension candidates. Maximal degree in co-relation 19129. Up to 9223 conditions per place. 
[2024-06-20 19:20:19,621 INFO  L140   encePairwiseOnDemand]: 42/51 looper letters, 41 selfloop transitions, 5 changer transitions 0/55 dead transitions.
[2024-06-20 19:20:19,621 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 55 transitions, 223 flow
[2024-06-20 19:20:19,622 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-06-20 19:20:19,624 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-06-20 19:20:19,629 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 98 transitions.
[2024-06-20 19:20:19,631 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.6405228758169934
[2024-06-20 19:20:19,632 INFO  L175             Difference]: Start difference. First operand has 54 places, 41 transitions, 94 flow. Second operand 3 states and 98 transitions.
[2024-06-20 19:20:19,633 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 55 transitions, 223 flow
[2024-06-20 19:20:19,635 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 55 transitions, 216 flow, removed 0 selfloop flow, removed 4 redundant places.
[2024-06-20 19:20:19,639 INFO  L231             Difference]: Finished difference. Result has 53 places, 45 transitions, 129 flow
[2024-06-20 19:20:19,641 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=129, PETRI_PLACES=53, PETRI_TRANSITIONS=45}
[2024-06-20 19:20:19,643 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, -1 predicate places.
[2024-06-20 19:20:19,643 INFO  L495      AbstractCegarLoop]: Abstraction has has 53 places, 45 transitions, 129 flow
[2024-06-20 19:20:19,644 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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-20 19:20:19,644 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:20:19,644 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:20:19,644 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-06-20 19:20:19,645 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-20 19:20:19,645 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:20:19,646 INFO  L85        PathProgramCache]: Analyzing trace with hash 1435499765, now seen corresponding path program 1 times
[2024-06-20 19:20:19,646 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:20:19,646 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117825147]
[2024-06-20 19:20:19,646 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:20:19,646 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:20:19,712 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:20:24,720 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-20 19:20:24,720 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:20:24,720 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117825147]
[2024-06-20 19:20:24,721 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117825147] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:20:24,721 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:20:24,721 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-06-20 19:20:24,721 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020177319]
[2024-06-20 19:20:24,721 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:20:24,723 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-06-20 19:20:24,723 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:20:24,724 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-06-20 19:20:24,724 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-06-20 19:20:24,814 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 15 out of 51
[2024-06-20 19:20:24,814 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 45 transitions, 129 flow. Second operand  has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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-20 19:20:24,814 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:20:24,814 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 51
[2024-06-20 19:20:24,814 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:20:28,704 INFO  L124   PetriNetUnfolderBase]: 7882/10901 cut-off events.
[2024-06-20 19:20:28,704 INFO  L125   PetriNetUnfolderBase]: For 2113/2113 co-relation queries the response was YES.
[2024-06-20 19:20:28,713 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 24939 conditions, 10901 events. 7882/10901 cut-off events. For 2113/2113 co-relation queries the response was YES. Maximal size of possible extension queue 422. Compared 58033 event pairs, 5323 based on Foata normal form. 4/10853 useless extension candidates. Maximal degree in co-relation 24927. Up to 10713 conditions per place. 
[2024-06-20 19:20:28,752 INFO  L140   encePairwiseOnDemand]: 41/51 looper letters, 52 selfloop transitions, 9 changer transitions 0/69 dead transitions.
[2024-06-20 19:20:28,752 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 69 transitions, 317 flow
[2024-06-20 19:20:28,753 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-06-20 19:20:28,753 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-06-20 19:20:28,753 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 125 transitions.
[2024-06-20 19:20:28,754 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.6127450980392157
[2024-06-20 19:20:28,754 INFO  L175             Difference]: Start difference. First operand has 53 places, 45 transitions, 129 flow. Second operand 4 states and 125 transitions.
[2024-06-20 19:20:28,754 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 69 transitions, 317 flow
[2024-06-20 19:20:28,755 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 69 transitions, 312 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-06-20 19:20:28,756 INFO  L231             Difference]: Finished difference. Result has 56 places, 49 transitions, 177 flow
[2024-06-20 19:20:28,756 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=177, PETRI_PLACES=56, PETRI_TRANSITIONS=49}
[2024-06-20 19:20:28,757 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 2 predicate places.
[2024-06-20 19:20:28,757 INFO  L495      AbstractCegarLoop]: Abstraction has has 56 places, 49 transitions, 177 flow
[2024-06-20 19:20:28,757 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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-20 19:20:28,758 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:20:28,758 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:20:28,758 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-06-20 19:20:28,758 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-20 19:20:28,758 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:20:28,758 INFO  L85        PathProgramCache]: Analyzing trace with hash 1550820863, now seen corresponding path program 1 times
[2024-06-20 19:20:28,759 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:20:28,759 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284488183]
[2024-06-20 19:20:28,759 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:20:28,759 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:20:28,796 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:20:33,799 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-20 19:20:33,800 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:20:33,800 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284488183]
[2024-06-20 19:20:33,800 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284488183] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:20:33,800 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:20:33,801 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-06-20 19:20:33,801 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270350151]
[2024-06-20 19:20:33,801 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:20:33,801 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-06-20 19:20:33,802 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:20:33,803 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-06-20 19:20:33,803 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20
[2024-06-20 19:20:33,943 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 15 out of 51
[2024-06-20 19:20:33,944 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 49 transitions, 177 flow. Second operand  has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 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-20 19:20:33,944 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:20:33,944 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 51
[2024-06-20 19:20:33,944 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:20:37,834 INFO  L124   PetriNetUnfolderBase]: 7900/10989 cut-off events.
[2024-06-20 19:20:37,834 INFO  L125   PetriNetUnfolderBase]: For 6160/6160 co-relation queries the response was YES.
[2024-06-20 19:20:37,844 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 28019 conditions, 10989 events. 7900/10989 cut-off events. For 6160/6160 co-relation queries the response was YES. Maximal size of possible extension queue 425. Compared 59132 event pairs, 4142 based on Foata normal form. 7/10978 useless extension candidates. Maximal degree in co-relation 28005. Up to 10634 conditions per place. 
[2024-06-20 19:20:37,877 INFO  L140   encePairwiseOnDemand]: 39/51 looper letters, 70 selfloop transitions, 21 changer transitions 0/99 dead transitions.
[2024-06-20 19:20:37,878 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 99 transitions, 533 flow
[2024-06-20 19:20:37,878 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-20 19:20:37,878 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-20 19:20:37,879 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 164 transitions.
[2024-06-20 19:20:37,879 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.6431372549019608
[2024-06-20 19:20:37,880 INFO  L175             Difference]: Start difference. First operand has 56 places, 49 transitions, 177 flow. Second operand 5 states and 164 transitions.
[2024-06-20 19:20:37,880 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 99 transitions, 533 flow
[2024-06-20 19:20:37,882 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 99 transitions, 514 flow, removed 3 selfloop flow, removed 2 redundant places.
[2024-06-20 19:20:37,883 INFO  L231             Difference]: Finished difference. Result has 61 places, 63 transitions, 308 flow
[2024-06-20 19:20:37,883 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=308, PETRI_PLACES=61, PETRI_TRANSITIONS=63}
[2024-06-20 19:20:37,884 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 7 predicate places.
[2024-06-20 19:20:37,884 INFO  L495      AbstractCegarLoop]: Abstraction has has 61 places, 63 transitions, 308 flow
[2024-06-20 19:20:37,884 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 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-20 19:20:37,884 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:20:37,884 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:20:37,885 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-06-20 19:20:37,885 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-20 19:20:37,885 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:20:37,885 INFO  L85        PathProgramCache]: Analyzing trace with hash -9414076, now seen corresponding path program 1 times
[2024-06-20 19:20:37,885 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:20:37,886 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760530924]
[2024-06-20 19:20:37,886 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:20:37,886 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:20:37,927 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:20:43,940 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-20 19:20:43,940 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:20:43,940 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760530924]
[2024-06-20 19:20:43,940 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760530924] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:20:43,941 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:20:43,941 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-06-20 19:20:43,941 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450232449]
[2024-06-20 19:20:43,941 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:20:43,941 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-06-20 19:20:43,942 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:20:43,942 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-06-20 19:20:43,942 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2024-06-20 19:20:44,065 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 15 out of 51
[2024-06-20 19:20:44,067 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 63 transitions, 308 flow. Second operand  has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:20:44,067 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:20:44,067 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 51
[2024-06-20 19:20:44,067 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:20:48,170 INFO  L124   PetriNetUnfolderBase]: 7929/11036 cut-off events.
[2024-06-20 19:20:48,170 INFO  L125   PetriNetUnfolderBase]: For 14683/14688 co-relation queries the response was YES.
[2024-06-20 19:20:48,182 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 32942 conditions, 11036 events. 7929/11036 cut-off events. For 14683/14688 co-relation queries the response was YES. Maximal size of possible extension queue 426. Compared 59549 event pairs, 3337 based on Foata normal form. 18/11036 useless extension candidates. Maximal degree in co-relation 32925. Up to 10599 conditions per place. 
[2024-06-20 19:20:48,220 INFO  L140   encePairwiseOnDemand]: 39/51 looper letters, 77 selfloop transitions, 25 changer transitions 0/110 dead transitions.
[2024-06-20 19:20:48,220 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 110 transitions, 678 flow
[2024-06-20 19:20:48,223 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-20 19:20:48,223 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-20 19:20:48,223 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 190 transitions.
[2024-06-20 19:20:48,224 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.6209150326797386
[2024-06-20 19:20:48,224 INFO  L175             Difference]: Start difference. First operand has 61 places, 63 transitions, 308 flow. Second operand 6 states and 190 transitions.
[2024-06-20 19:20:48,224 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 110 transitions, 678 flow
[2024-06-20 19:20:48,229 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 110 transitions, 666 flow, removed 6 selfloop flow, removed 0 redundant places.
[2024-06-20 19:20:48,230 INFO  L231             Difference]: Finished difference. Result has 66 places, 66 transitions, 385 flow
[2024-06-20 19:20:48,231 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=288, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=385, PETRI_PLACES=66, PETRI_TRANSITIONS=66}
[2024-06-20 19:20:48,231 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 12 predicate places.
[2024-06-20 19:20:48,231 INFO  L495      AbstractCegarLoop]: Abstraction has has 66 places, 66 transitions, 385 flow
[2024-06-20 19:20:48,232 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:20:48,232 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:20:48,232 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:20:48,232 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-06-20 19:20:48,232 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-20 19:20:48,232 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:20:48,233 INFO  L85        PathProgramCache]: Analyzing trace with hash -586491835, now seen corresponding path program 1 times
[2024-06-20 19:20:48,233 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:20:48,233 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346541793]
[2024-06-20 19:20:48,233 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:20:48,233 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:20:48,266 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:21:01,257 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-20 19:21:01,257 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:21:01,257 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346541793]
[2024-06-20 19:21:01,258 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346541793] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:21:01,258 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:21:01,258 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-06-20 19:21:01,258 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124154791]
[2024-06-20 19:21:01,258 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:21:01,258 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-06-20 19:21:01,258 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:21:01,259 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-06-20 19:21:01,259 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2024-06-20 19:21:01,374 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 14 out of 51
[2024-06-20 19:21:01,374 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 66 transitions, 385 flow. Second operand  has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 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-20 19:21:01,374 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:21:01,374 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 51
[2024-06-20 19:21:01,374 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:21:04,889 INFO  L124   PetriNetUnfolderBase]: 6770/9678 cut-off events.
[2024-06-20 19:21:04,889 INFO  L125   PetriNetUnfolderBase]: For 18698/18698 co-relation queries the response was YES.
[2024-06-20 19:21:04,900 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 31444 conditions, 9678 events. 6770/9678 cut-off events. For 18698/18698 co-relation queries the response was YES. Maximal size of possible extension queue 379. Compared 53991 event pairs, 3368 based on Foata normal form. 3/9620 useless extension candidates. Maximal degree in co-relation 31423. Up to 9250 conditions per place. 
[2024-06-20 19:21:04,928 INFO  L140   encePairwiseOnDemand]: 41/51 looper letters, 65 selfloop transitions, 10 changer transitions 0/83 dead transitions.
[2024-06-20 19:21:04,929 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 83 transitions, 579 flow
[2024-06-20 19:21:04,929 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-20 19:21:04,929 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-20 19:21:04,930 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 130 transitions.
[2024-06-20 19:21:04,930 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5098039215686274
[2024-06-20 19:21:04,930 INFO  L175             Difference]: Start difference. First operand has 66 places, 66 transitions, 385 flow. Second operand 5 states and 130 transitions.
[2024-06-20 19:21:04,930 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 83 transitions, 579 flow
[2024-06-20 19:21:04,935 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 83 transitions, 510 flow, removed 12 selfloop flow, removed 4 redundant places.
[2024-06-20 19:21:04,936 INFO  L231             Difference]: Finished difference. Result has 67 places, 66 transitions, 347 flow
[2024-06-20 19:21:04,936 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=316, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=347, PETRI_PLACES=67, PETRI_TRANSITIONS=66}
[2024-06-20 19:21:04,937 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 13 predicate places.
[2024-06-20 19:21:04,937 INFO  L495      AbstractCegarLoop]: Abstraction has has 67 places, 66 transitions, 347 flow
[2024-06-20 19:21:04,937 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 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-20 19:21:04,937 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:21:04,937 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:21:04,938 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-06-20 19:21:04,938 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-20 19:21:04,938 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:21:04,938 INFO  L85        PathProgramCache]: Analyzing trace with hash -1007863547, now seen corresponding path program 1 times
[2024-06-20 19:21:04,938 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:21:04,938 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701132744]
[2024-06-20 19:21:04,939 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:21:04,939 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:21:04,971 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:21:19,670 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-20 19:21:19,671 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:21:19,671 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701132744]
[2024-06-20 19:21:19,671 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701132744] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:21:19,671 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:21:19,671 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-20 19:21:19,671 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238347022]
[2024-06-20 19:21:19,672 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:21:19,672 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-20 19:21:19,672 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:21:19,672 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-20 19:21:19,673 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-06-20 19:21:19,858 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 14 out of 51
[2024-06-20 19:21:19,858 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 66 transitions, 347 flow. Second operand  has 7 states, 7 states have (on average 15.428571428571429) internal successors, (108), 7 states have internal predecessors, (108), 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-20 19:21:19,858 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:21:19,858 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 51
[2024-06-20 19:21:19,858 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:21:23,432 INFO  L124   PetriNetUnfolderBase]: 6803/9900 cut-off events.
[2024-06-20 19:21:23,433 INFO  L125   PetriNetUnfolderBase]: For 21745/21745 co-relation queries the response was YES.
[2024-06-20 19:21:23,446 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 32154 conditions, 9900 events. 6803/9900 cut-off events. For 21745/21745 co-relation queries the response was YES. Maximal size of possible extension queue 388. Compared 56208 event pairs, 3194 based on Foata normal form. 7/9900 useless extension candidates. Maximal degree in co-relation 32131. Up to 9164 conditions per place. 
[2024-06-20 19:21:23,477 INFO  L140   encePairwiseOnDemand]: 39/51 looper letters, 87 selfloop transitions, 24 changer transitions 0/119 dead transitions.
[2024-06-20 19:21:23,478 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 119 transitions, 789 flow
[2024-06-20 19:21:23,478 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:21:23,478 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:21:23,480 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 208 transitions.
[2024-06-20 19:21:23,480 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5098039215686274
[2024-06-20 19:21:23,480 INFO  L175             Difference]: Start difference. First operand has 67 places, 66 transitions, 347 flow. Second operand 8 states and 208 transitions.
[2024-06-20 19:21:23,480 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 119 transitions, 789 flow
[2024-06-20 19:21:23,488 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 119 transitions, 760 flow, removed 3 selfloop flow, removed 4 redundant places.
[2024-06-20 19:21:23,490 INFO  L231             Difference]: Finished difference. Result has 73 places, 80 transitions, 490 flow
[2024-06-20 19:21:23,490 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=318, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=490, PETRI_PLACES=73, PETRI_TRANSITIONS=80}
[2024-06-20 19:21:23,492 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 19 predicate places.
[2024-06-20 19:21:23,493 INFO  L495      AbstractCegarLoop]: Abstraction has has 73 places, 80 transitions, 490 flow
[2024-06-20 19:21:23,493 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 15.428571428571429) internal successors, (108), 7 states have internal predecessors, (108), 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-20 19:21:23,493 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:21:23,493 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:21:23,493 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-06-20 19:21:23,494 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-20 19:21:23,494 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:21:23,494 INFO  L85        PathProgramCache]: Analyzing trace with hash -1184719806, now seen corresponding path program 1 times
[2024-06-20 19:21:23,494 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:21:23,497 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673103900]
[2024-06-20 19:21:23,497 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:21:23,498 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:21:23,533 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:21:37,578 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-20 19:21:37,579 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:21:37,579 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673103900]
[2024-06-20 19:21:37,580 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673103900] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:21:37,580 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:21:37,581 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-20 19:21:37,581 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589109532]
[2024-06-20 19:21:37,581 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:21:37,581 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-20 19:21:37,581 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:21:37,582 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-20 19:21:37,582 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-06-20 19:21:37,713 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 51
[2024-06-20 19:21:37,713 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 80 transitions, 490 flow. Second operand  has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 7 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:21:37,713 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:21:37,713 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 51
[2024-06-20 19:21:37,713 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:21:41,823 INFO  L124   PetriNetUnfolderBase]: 7966/11091 cut-off events.
[2024-06-20 19:21:41,823 INFO  L125   PetriNetUnfolderBase]: For 39075/39082 co-relation queries the response was YES.
[2024-06-20 19:21:41,837 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 41326 conditions, 11091 events. 7966/11091 cut-off events. For 39075/39082 co-relation queries the response was YES. Maximal size of possible extension queue 425. Compared 59573 event pairs, 3875 based on Foata normal form. 12/11091 useless extension candidates. Maximal degree in co-relation 41301. Up to 10721 conditions per place. 
[2024-06-20 19:21:41,872 INFO  L140   encePairwiseOnDemand]: 39/51 looper letters, 82 selfloop transitions, 25 changer transitions 0/114 dead transitions.
[2024-06-20 19:21:41,872 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 114 transitions, 847 flow
[2024-06-20 19:21:41,873 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-20 19:21:41,873 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-20 19:21:41,873 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 160 transitions.
[2024-06-20 19:21:41,874 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5228758169934641
[2024-06-20 19:21:41,874 INFO  L175             Difference]: Start difference. First operand has 73 places, 80 transitions, 490 flow. Second operand 6 states and 160 transitions.
[2024-06-20 19:21:41,874 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 114 transitions, 847 flow
[2024-06-20 19:21:41,893 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 114 transitions, 795 flow, removed 16 selfloop flow, removed 4 redundant places.
[2024-06-20 19:21:41,894 INFO  L231             Difference]: Finished difference. Result has 75 places, 84 transitions, 534 flow
[2024-06-20 19:21:41,895 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=438, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=534, PETRI_PLACES=75, PETRI_TRANSITIONS=84}
[2024-06-20 19:21:41,895 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 21 predicate places.
[2024-06-20 19:21:41,895 INFO  L495      AbstractCegarLoop]: Abstraction has has 75 places, 84 transitions, 534 flow
[2024-06-20 19:21:41,895 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 7 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:21:41,896 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:21:41,896 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:21:41,896 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-06-20 19:21:41,896 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] ===
[2024-06-20 19:21:41,896 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:21:41,896 INFO  L85        PathProgramCache]: Analyzing trace with hash -977887806, now seen corresponding path program 2 times
[2024-06-20 19:21:41,897 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:21:41,897 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778364345]
[2024-06-20 19:21:41,897 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:21:41,897 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:21:41,930 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:21:51,725 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-20 19:21:51,725 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:21:51,725 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778364345]
[2024-06-20 19:21:51,725 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778364345] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:21:51,726 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:21:51,726 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-20 19:21:51,726 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564660953]
[2024-06-20 19:21:51,726 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:21:51,726 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-20 19:21:51,726 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:21:51,727 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-20 19:21:51,727 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-06-20 19:21:51,951 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 51
[2024-06-20 19:21:51,952 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 84 transitions, 534 flow. Second operand  has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 7 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:21:51,952 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:21:51,952 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 51
[2024-06-20 19:21:51,952 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:21:56,069 INFO  L124   PetriNetUnfolderBase]: 8054/11232 cut-off events.
[2024-06-20 19:21:56,069 INFO  L125   PetriNetUnfolderBase]: For 46609/46609 co-relation queries the response was YES.
[2024-06-20 19:21:56,084 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 42360 conditions, 11232 events. 8054/11232 cut-off events. For 46609/46609 co-relation queries the response was YES. Maximal size of possible extension queue 423. Compared 61193 event pairs, 4854 based on Foata normal form. 3/11201 useless extension candidates. Maximal degree in co-relation 42334. Up to 10853 conditions per place. 
[2024-06-20 19:21:56,123 INFO  L140   encePairwiseOnDemand]: 38/51 looper letters, 102 selfloop transitions, 29 changer transitions 0/138 dead transitions.
[2024-06-20 19:21:56,123 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 138 transitions, 1032 flow
[2024-06-20 19:21:56,123 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:21:56,124 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:21:56,124 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 216 transitions.
[2024-06-20 19:21:56,125 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.47058823529411764
[2024-06-20 19:21:56,125 INFO  L175             Difference]: Start difference. First operand has 75 places, 84 transitions, 534 flow. Second operand 9 states and 216 transitions.
[2024-06-20 19:21:56,125 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 138 transitions, 1032 flow
[2024-06-20 19:21:56,170 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 138 transitions, 968 flow, removed 12 selfloop flow, removed 3 redundant places.
[2024-06-20 19:21:56,172 INFO  L231             Difference]: Finished difference. Result has 84 places, 99 transitions, 716 flow
[2024-06-20 19:21:56,175 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=491, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=716, PETRI_PLACES=84, PETRI_TRANSITIONS=99}
[2024-06-20 19:21:56,177 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 30 predicate places.
[2024-06-20 19:21:56,177 INFO  L495      AbstractCegarLoop]: Abstraction has has 84 places, 99 transitions, 716 flow
[2024-06-20 19:21:56,177 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 7 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:21:56,177 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:21:56,178 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:21:56,178 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-06-20 19:21:56,178 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] ===
[2024-06-20 19:21:56,178 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:21:56,178 INFO  L85        PathProgramCache]: Analyzing trace with hash 470581122, now seen corresponding path program 1 times
[2024-06-20 19:21:56,179 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:21:56,179 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816982624]
[2024-06-20 19:21:56,179 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:21:56,179 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:21:56,215 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:22:11,291 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-20 19:22:11,291 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:22:11,291 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816982624]
[2024-06-20 19:22:11,291 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816982624] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:22:11,291 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:22:11,291 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:22:11,291 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125043854]
[2024-06-20 19:22:11,292 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:22:11,292 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:22:11,292 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:22:11,292 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:22:11,293 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:22:11,534 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 51
[2024-06-20 19:22:11,535 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 99 transitions, 716 flow. Second operand  has 8 states, 8 states have (on average 14.375) internal successors, (115), 8 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-20 19:22:11,535 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:22:11,535 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 51
[2024-06-20 19:22:11,535 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:22:16,185 INFO  L124   PetriNetUnfolderBase]: 8842/12388 cut-off events.
[2024-06-20 19:22:16,186 INFO  L125   PetriNetUnfolderBase]: For 55632/55643 co-relation queries the response was YES.
[2024-06-20 19:22:16,205 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 48109 conditions, 12388 events. 8842/12388 cut-off events. For 55632/55643 co-relation queries the response was YES. Maximal size of possible extension queue 427. Compared 67599 event pairs, 3590 based on Foata normal form. 24/12400 useless extension candidates. Maximal degree in co-relation 48079. Up to 11154 conditions per place. 
[2024-06-20 19:22:16,247 INFO  L140   encePairwiseOnDemand]: 34/51 looper letters, 119 selfloop transitions, 77 changer transitions 0/203 dead transitions.
[2024-06-20 19:22:16,247 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 203 transitions, 1737 flow
[2024-06-20 19:22:16,250 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 19:22:16,250 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 19:22:16,251 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 269 transitions.
[2024-06-20 19:22:16,251 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5274509803921569
[2024-06-20 19:22:16,251 INFO  L175             Difference]: Start difference. First operand has 84 places, 99 transitions, 716 flow. Second operand 10 states and 269 transitions.
[2024-06-20 19:22:16,251 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 203 transitions, 1737 flow
[2024-06-20 19:22:16,277 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 203 transitions, 1591 flow, removed 8 selfloop flow, removed 6 redundant places.
[2024-06-20 19:22:16,279 INFO  L231             Difference]: Finished difference. Result has 93 places, 140 transitions, 1208 flow
[2024-06-20 19:22:16,280 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=627, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1208, PETRI_PLACES=93, PETRI_TRANSITIONS=140}
[2024-06-20 19:22:16,280 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 39 predicate places.
[2024-06-20 19:22:16,280 INFO  L495      AbstractCegarLoop]: Abstraction has has 93 places, 140 transitions, 1208 flow
[2024-06-20 19:22:16,280 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 14.375) internal successors, (115), 8 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-20 19:22:16,280 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:22:16,280 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:22:16,281 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-06-20 19:22:16,281 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-20 19:22:16,281 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:22:16,281 INFO  L85        PathProgramCache]: Analyzing trace with hash 1928392582, now seen corresponding path program 2 times
[2024-06-20 19:22:16,281 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:22:16,281 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63622907]
[2024-06-20 19:22:16,281 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:22:16,281 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:22:16,312 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:22:33,451 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-20 19:22:33,451 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:22:33,452 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63622907]
[2024-06-20 19:22:33,452 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63622907] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:22:33,452 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:22:33,452 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:22:33,452 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432722508]
[2024-06-20 19:22:33,452 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:22:33,452 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:22:33,452 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:22:33,453 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:22:33,453 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:22:33,572 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 51
[2024-06-20 19:22:33,573 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 140 transitions, 1208 flow. Second operand  has 8 states, 8 states have (on average 14.375) internal successors, (115), 8 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-20 19:22:33,573 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:22:33,573 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 51
[2024-06-20 19:22:33,573 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:22:38,701 INFO  L124   PetriNetUnfolderBase]: 9458/13316 cut-off events.
[2024-06-20 19:22:38,701 INFO  L125   PetriNetUnfolderBase]: For 83986/83999 co-relation queries the response was YES.
[2024-06-20 19:22:38,729 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 59529 conditions, 13316 events. 9458/13316 cut-off events. For 83986/83999 co-relation queries the response was YES. Maximal size of possible extension queue 433. Compared 73642 event pairs, 3431 based on Foata normal form. 36/13346 useless extension candidates. Maximal degree in co-relation 59493. Up to 11043 conditions per place. 
[2024-06-20 19:22:38,786 INFO  L140   encePairwiseOnDemand]: 37/51 looper letters, 117 selfloop transitions, 96 changer transitions 0/220 dead transitions.
[2024-06-20 19:22:38,786 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 220 transitions, 2176 flow
[2024-06-20 19:22:38,788 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:22:38,789 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:22:38,789 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 225 transitions.
[2024-06-20 19:22:38,789 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5514705882352942
[2024-06-20 19:22:38,789 INFO  L175             Difference]: Start difference. First operand has 93 places, 140 transitions, 1208 flow. Second operand 8 states and 225 transitions.
[2024-06-20 19:22:38,789 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 220 transitions, 2176 flow
[2024-06-20 19:22:38,880 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 220 transitions, 2072 flow, removed 34 selfloop flow, removed 3 redundant places.
[2024-06-20 19:22:38,882 INFO  L231             Difference]: Finished difference. Result has 100 places, 165 transitions, 1650 flow
[2024-06-20 19:22:38,883 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=1116, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1650, PETRI_PLACES=100, PETRI_TRANSITIONS=165}
[2024-06-20 19:22:38,883 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 46 predicate places.
[2024-06-20 19:22:38,883 INFO  L495      AbstractCegarLoop]: Abstraction has has 100 places, 165 transitions, 1650 flow
[2024-06-20 19:22:38,884 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 14.375) internal successors, (115), 8 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-20 19:22:38,884 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:22:38,884 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:22:38,884 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-06-20 19:22:38,884 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-20 19:22:38,885 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:22:38,885 INFO  L85        PathProgramCache]: Analyzing trace with hash -250406590, now seen corresponding path program 3 times
[2024-06-20 19:22:38,885 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:22:38,885 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490140506]
[2024-06-20 19:22:38,885 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:22:38,885 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:22:38,920 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:22:49,413 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-20 19:22:49,414 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:22:49,414 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490140506]
[2024-06-20 19:22:49,414 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490140506] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:22:49,414 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:22:49,414 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:22:49,414 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538547258]
[2024-06-20 19:22:49,414 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:22:49,414 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:22:49,414 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:22:49,415 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:22:49,415 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:22:49,595 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 51
[2024-06-20 19:22:49,596 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 165 transitions, 1650 flow. Second operand  has 8 states, 8 states have (on average 14.375) internal successors, (115), 8 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-20 19:22:49,596 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:22:49,596 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 51
[2024-06-20 19:22:49,596 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:22:55,110 INFO  L124   PetriNetUnfolderBase]: 9614/13540 cut-off events.
[2024-06-20 19:22:55,110 INFO  L125   PetriNetUnfolderBase]: For 117306/117318 co-relation queries the response was YES.
[2024-06-20 19:22:55,139 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 68726 conditions, 13540 events. 9614/13540 cut-off events. For 117306/117318 co-relation queries the response was YES. Maximal size of possible extension queue 437. Compared 74891 event pairs, 3471 based on Foata normal form. 17/13503 useless extension candidates. Maximal degree in co-relation 68686. Up to 11134 conditions per place. 
[2024-06-20 19:22:55,207 INFO  L140   encePairwiseOnDemand]: 37/51 looper letters, 109 selfloop transitions, 117 changer transitions 0/233 dead transitions.
[2024-06-20 19:22:55,208 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 233 transitions, 2689 flow
[2024-06-20 19:22:55,210 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 19:22:55,210 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 19:22:55,211 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 199 transitions.
[2024-06-20 19:22:55,211 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5574229691876751
[2024-06-20 19:22:55,211 INFO  L175             Difference]: Start difference. First operand has 100 places, 165 transitions, 1650 flow. Second operand 7 states and 199 transitions.
[2024-06-20 19:22:55,211 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 233 transitions, 2689 flow
[2024-06-20 19:22:55,369 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 233 transitions, 2580 flow, removed 42 selfloop flow, removed 3 redundant places.
[2024-06-20 19:22:55,372 INFO  L231             Difference]: Finished difference. Result has 106 places, 187 transitions, 2171 flow
[2024-06-20 19:22:55,373 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=1559, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=97, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2171, PETRI_PLACES=106, PETRI_TRANSITIONS=187}
[2024-06-20 19:22:55,373 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 52 predicate places.
[2024-06-20 19:22:55,373 INFO  L495      AbstractCegarLoop]: Abstraction has has 106 places, 187 transitions, 2171 flow
[2024-06-20 19:22:55,374 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 14.375) internal successors, (115), 8 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-20 19:22:55,374 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:22:55,374 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:22:55,374 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-06-20 19:22:55,374 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-20 19:22:55,375 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:22:55,375 INFO  L85        PathProgramCache]: Analyzing trace with hash -695812674, now seen corresponding path program 4 times
[2024-06-20 19:22:55,375 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:22:55,375 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665162824]
[2024-06-20 19:22:55,375 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:22:55,375 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:22:55,412 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:23:13,656 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-20 19:23:13,657 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:23:13,657 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665162824]
[2024-06-20 19:23:13,657 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665162824] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:23:13,657 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:23:13,657 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:23:13,657 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052575843]
[2024-06-20 19:23:13,657 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:23:13,658 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:23:13,658 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:23:13,658 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:23:13,658 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:23:13,877 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 51
[2024-06-20 19:23:13,878 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 187 transitions, 2171 flow. Second operand  has 8 states, 8 states have (on average 14.375) internal successors, (115), 8 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-20 19:23:13,878 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:23:13,878 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 51
[2024-06-20 19:23:13,878 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:23:19,121 INFO  L124   PetriNetUnfolderBase]: 9590/13515 cut-off events.
[2024-06-20 19:23:19,121 INFO  L125   PetriNetUnfolderBase]: For 138985/138991 co-relation queries the response was YES.
[2024-06-20 19:23:19,148 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 72291 conditions, 13515 events. 9590/13515 cut-off events. For 138985/138991 co-relation queries the response was YES. Maximal size of possible extension queue 435. Compared 74817 event pairs, 3474 based on Foata normal form. 17/13520 useless extension candidates. Maximal degree in co-relation 72247. Up to 11127 conditions per place. 
[2024-06-20 19:23:19,202 INFO  L140   encePairwiseOnDemand]: 37/51 looper letters, 131 selfloop transitions, 112 changer transitions 0/250 dead transitions.
[2024-06-20 19:23:19,202 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 250 transitions, 3035 flow
[2024-06-20 19:23:19,204 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:23:19,204 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:23:19,205 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 248 transitions.
[2024-06-20 19:23:19,205 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5403050108932462
[2024-06-20 19:23:19,205 INFO  L175             Difference]: Start difference. First operand has 106 places, 187 transitions, 2171 flow. Second operand 9 states and 248 transitions.
[2024-06-20 19:23:19,205 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 250 transitions, 3035 flow
[2024-06-20 19:23:19,385 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 250 transitions, 2943 flow, removed 45 selfloop flow, removed 1 redundant places.
[2024-06-20 19:23:19,388 INFO  L231             Difference]: Finished difference. Result has 114 places, 187 transitions, 2324 flow
[2024-06-20 19:23:19,388 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=2083, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=112, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2324, PETRI_PLACES=114, PETRI_TRANSITIONS=187}
[2024-06-20 19:23:19,389 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 60 predicate places.
[2024-06-20 19:23:19,389 INFO  L495      AbstractCegarLoop]: Abstraction has has 114 places, 187 transitions, 2324 flow
[2024-06-20 19:23:19,389 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 14.375) internal successors, (115), 8 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-20 19:23:19,389 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:23:19,389 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:23:19,390 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-06-20 19:23:19,390 INFO  L420      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] ===
[2024-06-20 19:23:19,390 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:23:19,390 INFO  L85        PathProgramCache]: Analyzing trace with hash 2105770180, now seen corresponding path program 1 times
[2024-06-20 19:23:19,390 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:23:19,390 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181974321]
[2024-06-20 19:23:19,390 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:23:19,391 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:23:19,421 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:23:30,273 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-20 19:23:30,273 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:23:30,273 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181974321]
[2024-06-20 19:23:30,273 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181974321] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:23:30,273 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:23:30,273 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:23:30,273 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411191161]
[2024-06-20 19:23:30,273 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:23:30,274 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:23:30,274 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:23:30,274 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:23:30,274 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:23:30,464 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 14 out of 51
[2024-06-20 19:23:30,465 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 187 transitions, 2324 flow. Second operand  has 8 states, 8 states have (on average 15.375) internal successors, (123), 8 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-20 19:23:30,465 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:23:30,465 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 51
[2024-06-20 19:23:30,465 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:23:35,269 INFO  L124   PetriNetUnfolderBase]: 8586/12372 cut-off events.
[2024-06-20 19:23:35,269 INFO  L125   PetriNetUnfolderBase]: For 130506/130508 co-relation queries the response was YES.
[2024-06-20 19:23:35,301 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 66388 conditions, 12372 events. 8586/12372 cut-off events. For 130506/130508 co-relation queries the response was YES. Maximal size of possible extension queue 420. Compared 71182 event pairs, 3914 based on Foata normal form. 26/12339 useless extension candidates. Maximal degree in co-relation 66341. Up to 11356 conditions per place. 
[2024-06-20 19:23:35,353 INFO  L140   encePairwiseOnDemand]: 39/51 looper letters, 204 selfloop transitions, 28 changer transitions 0/240 dead transitions.
[2024-06-20 19:23:35,354 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 240 transitions, 3074 flow
[2024-06-20 19:23:35,356 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:23:35,356 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:23:35,356 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 237 transitions.
[2024-06-20 19:23:35,357 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5163398692810458
[2024-06-20 19:23:35,357 INFO  L175             Difference]: Start difference. First operand has 114 places, 187 transitions, 2324 flow. Second operand 9 states and 237 transitions.
[2024-06-20 19:23:35,357 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 240 transitions, 3074 flow
[2024-06-20 19:23:35,512 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 240 transitions, 2861 flow, removed 8 selfloop flow, removed 7 redundant places.
[2024-06-20 19:23:35,515 INFO  L231             Difference]: Finished difference. Result has 116 places, 190 transitions, 2224 flow
[2024-06-20 19:23:35,515 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=2111, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2224, PETRI_PLACES=116, PETRI_TRANSITIONS=190}
[2024-06-20 19:23:35,516 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 62 predicate places.
[2024-06-20 19:23:35,516 INFO  L495      AbstractCegarLoop]: Abstraction has has 116 places, 190 transitions, 2224 flow
[2024-06-20 19:23:35,516 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 15.375) internal successors, (123), 8 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-20 19:23:35,516 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:23:35,516 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:23:35,516 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2024-06-20 19:23:35,517 INFO  L420      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] ===
[2024-06-20 19:23:35,517 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:23:35,517 INFO  L85        PathProgramCache]: Analyzing trace with hash 1720843616, now seen corresponding path program 1 times
[2024-06-20 19:23:35,517 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:23:35,517 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657362217]
[2024-06-20 19:23:35,517 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:23:35,517 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:23:35,553 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:23:53,542 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-20 19:23:53,542 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:23:53,542 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657362217]
[2024-06-20 19:23:53,542 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657362217] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:23:53,542 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:23:53,542 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-20 19:23:53,543 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361266468]
[2024-06-20 19:23:53,543 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:23:53,543 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-20 19:23:53,543 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:23:53,543 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-20 19:23:53,543 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2024-06-20 19:23:53,756 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 14 out of 51
[2024-06-20 19:23:53,757 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 190 transitions, 2224 flow. Second operand  has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 7 states have internal predecessors, (110), 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-20 19:23:53,757 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:23:53,757 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 51
[2024-06-20 19:23:53,757 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:23:58,182 INFO  L124   PetriNetUnfolderBase]: 8572/12357 cut-off events.
[2024-06-20 19:23:58,183 INFO  L125   PetriNetUnfolderBase]: For 138170/138172 co-relation queries the response was YES.
[2024-06-20 19:23:58,215 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 66697 conditions, 12357 events. 8572/12357 cut-off events. For 138170/138172 co-relation queries the response was YES. Maximal size of possible extension queue 419. Compared 70984 event pairs, 4044 based on Foata normal form. 4/12307 useless extension candidates. Maximal degree in co-relation 66650. Up to 11647 conditions per place. 
[2024-06-20 19:23:58,269 INFO  L140   encePairwiseOnDemand]: 42/51 looper letters, 185 selfloop transitions, 11 changer transitions 0/204 dead transitions.
[2024-06-20 19:23:58,269 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 204 transitions, 2658 flow
[2024-06-20 19:23:58,271 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-20 19:23:58,271 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-20 19:23:58,271 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 127 transitions.
[2024-06-20 19:23:58,271 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4980392156862745
[2024-06-20 19:23:58,271 INFO  L175             Difference]: Start difference. First operand has 116 places, 190 transitions, 2224 flow. Second operand 5 states and 127 transitions.
[2024-06-20 19:23:58,271 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 204 transitions, 2658 flow
[2024-06-20 19:23:58,410 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 204 transitions, 2563 flow, removed 22 selfloop flow, removed 7 redundant places.
[2024-06-20 19:23:58,412 INFO  L231             Difference]: Finished difference. Result has 114 places, 190 transitions, 2160 flow
[2024-06-20 19:23:58,413 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=2129, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2160, PETRI_PLACES=114, PETRI_TRANSITIONS=190}
[2024-06-20 19:23:58,413 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 60 predicate places.
[2024-06-20 19:23:58,413 INFO  L495      AbstractCegarLoop]: Abstraction has has 114 places, 190 transitions, 2160 flow
[2024-06-20 19:23:58,413 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 7 states have internal predecessors, (110), 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-20 19:23:58,413 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:23:58,414 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:23:58,414 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2024-06-20 19:23:58,414 INFO  L420      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] ===
[2024-06-20 19:23:58,414 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:23:58,414 INFO  L85        PathProgramCache]: Analyzing trace with hash 1703108032, now seen corresponding path program 1 times
[2024-06-20 19:23:58,414 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:23:58,414 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499869065]
[2024-06-20 19:23:58,414 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:23:58,414 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:23:58,443 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:24:15,755 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-20 19:24:15,755 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:24:15,756 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499869065]
[2024-06-20 19:24:15,756 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499869065] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:24:15,756 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:24:15,756 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:24:15,756 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653237649]
[2024-06-20 19:24:15,756 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:24:15,756 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:24:15,756 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:24:15,756 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:24:15,757 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:24:15,957 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 51
[2024-06-20 19:24:15,958 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 190 transitions, 2160 flow. Second operand  has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:24:15,958 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:24:15,958 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 51
[2024-06-20 19:24:15,958 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:24:21,285 INFO  L124   PetriNetUnfolderBase]: 10008/14173 cut-off events.
[2024-06-20 19:24:21,286 INFO  L125   PetriNetUnfolderBase]: For 173019/173075 co-relation queries the response was YES.
[2024-06-20 19:24:21,322 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 77024 conditions, 14173 events. 10008/14173 cut-off events. For 173019/173075 co-relation queries the response was YES. Maximal size of possible extension queue 466. Compared 79794 event pairs, 3652 based on Foata normal form. 54/14224 useless extension candidates. Maximal degree in co-relation 76976. Up to 12310 conditions per place. 
[2024-06-20 19:24:21,382 INFO  L140   encePairwiseOnDemand]: 34/51 looper letters, 167 selfloop transitions, 112 changer transitions 0/286 dead transitions.
[2024-06-20 19:24:21,382 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 286 transitions, 3549 flow
[2024-06-20 19:24:21,392 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 19:24:21,392 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 19:24:21,394 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 273 transitions.
[2024-06-20 19:24:21,394 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5352941176470588
[2024-06-20 19:24:21,394 INFO  L175             Difference]: Start difference. First operand has 114 places, 190 transitions, 2160 flow. Second operand 10 states and 273 transitions.
[2024-06-20 19:24:21,394 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 286 transitions, 3549 flow
[2024-06-20 19:24:21,537 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 286 transitions, 3527 flow, removed 0 selfloop flow, removed 4 redundant places.
[2024-06-20 19:24:21,540 INFO  L231             Difference]: Finished difference. Result has 124 places, 218 transitions, 2927 flow
[2024-06-20 19:24:21,540 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=2138, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2927, PETRI_PLACES=124, PETRI_TRANSITIONS=218}
[2024-06-20 19:24:21,541 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 70 predicate places.
[2024-06-20 19:24:21,541 INFO  L495      AbstractCegarLoop]: Abstraction has has 124 places, 218 transitions, 2927 flow
[2024-06-20 19:24:21,541 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:24:21,541 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:24:21,541 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:24:21,541 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2024-06-20 19:24:21,542 INFO  L420      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] ===
[2024-06-20 19:24:21,542 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:24:21,542 INFO  L85        PathProgramCache]: Analyzing trace with hash -1597113082, now seen corresponding path program 2 times
[2024-06-20 19:24:21,542 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:24:21,542 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913188988]
[2024-06-20 19:24:21,542 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:24:21,542 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:24:21,571 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:24:38,412 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-20 19:24:38,412 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:24:38,412 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913188988]
[2024-06-20 19:24:38,412 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913188988] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:24:38,412 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:24:38,413 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:24:38,413 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158541431]
[2024-06-20 19:24:38,413 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:24:38,413 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:24:38,413 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:24:38,414 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:24:38,414 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:24:38,594 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 51
[2024-06-20 19:24:38,595 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 218 transitions, 2927 flow. Second operand  has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:24:38,595 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:24:38,595 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 51
[2024-06-20 19:24:38,595 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:24:44,165 INFO  L124   PetriNetUnfolderBase]: 10087/14287 cut-off events.
[2024-06-20 19:24:44,166 INFO  L125   PetriNetUnfolderBase]: For 203170/203202 co-relation queries the response was YES.
[2024-06-20 19:24:44,211 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 82641 conditions, 14287 events. 10087/14287 cut-off events. For 203170/203202 co-relation queries the response was YES. Maximal size of possible extension queue 473. Compared 80302 event pairs, 3631 based on Foata normal form. 33/14317 useless extension candidates. Maximal degree in co-relation 82588. Up to 12385 conditions per place. 
[2024-06-20 19:24:44,280 INFO  L140   encePairwiseOnDemand]: 35/51 looper letters, 158 selfloop transitions, 117 changer transitions 0/282 dead transitions.
[2024-06-20 19:24:44,281 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 282 transitions, 3979 flow
[2024-06-20 19:24:44,283 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:24:44,283 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:24:44,283 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 241 transitions.
[2024-06-20 19:24:44,284 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5250544662309368
[2024-06-20 19:24:44,284 INFO  L175             Difference]: Start difference. First operand has 124 places, 218 transitions, 2927 flow. Second operand 9 states and 241 transitions.
[2024-06-20 19:24:44,284 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 282 transitions, 3979 flow
[2024-06-20 19:24:44,520 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 282 transitions, 3827 flow, removed 21 selfloop flow, removed 4 redundant places.
[2024-06-20 19:24:44,523 INFO  L231             Difference]: Finished difference. Result has 131 places, 233 transitions, 3352 flow
[2024-06-20 19:24:44,523 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=2783, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=103, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3352, PETRI_PLACES=131, PETRI_TRANSITIONS=233}
[2024-06-20 19:24:44,524 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 77 predicate places.
[2024-06-20 19:24:44,524 INFO  L495      AbstractCegarLoop]: Abstraction has has 131 places, 233 transitions, 3352 flow
[2024-06-20 19:24:44,524 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:24:44,524 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:24:44,524 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:24:44,524 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2024-06-20 19:24:44,525 INFO  L420      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] ===
[2024-06-20 19:24:44,525 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:24:44,525 INFO  L85        PathProgramCache]: Analyzing trace with hash -349376964, now seen corresponding path program 3 times
[2024-06-20 19:24:44,525 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:24:44,525 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164354576]
[2024-06-20 19:24:44,525 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:24:44,525 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:24:44,556 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:25:01,869 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-20 19:25:01,869 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:25:01,869 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164354576]
[2024-06-20 19:25:01,869 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164354576] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:25:01,869 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:25:01,869 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:25:01,870 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179859496]
[2024-06-20 19:25:01,870 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:25:01,870 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:25:01,870 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:25:01,870 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:25:01,870 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:25:02,050 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 51
[2024-06-20 19:25:02,050 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 233 transitions, 3352 flow. Second operand  has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:25:02,050 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:25:02,050 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 51
[2024-06-20 19:25:02,050 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:25:07,815 INFO  L124   PetriNetUnfolderBase]: 10140/14390 cut-off events.
[2024-06-20 19:25:07,816 INFO  L125   PetriNetUnfolderBase]: For 235040/235083 co-relation queries the response was YES.
[2024-06-20 19:25:07,853 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 86208 conditions, 14390 events. 10140/14390 cut-off events. For 235040/235083 co-relation queries the response was YES. Maximal size of possible extension queue 473. Compared 81290 event pairs, 3926 based on Foata normal form. 53/14440 useless extension candidates. Maximal degree in co-relation 86152. Up to 11662 conditions per place. 
[2024-06-20 19:25:07,919 INFO  L140   encePairwiseOnDemand]: 37/51 looper letters, 139 selfloop transitions, 155 changer transitions 0/301 dead transitions.
[2024-06-20 19:25:07,920 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 301 transitions, 4570 flow
[2024-06-20 19:25:07,922 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:25:07,922 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:25:07,922 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 227 transitions.
[2024-06-20 19:25:07,923 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5563725490196079
[2024-06-20 19:25:07,923 INFO  L175             Difference]: Start difference. First operand has 131 places, 233 transitions, 3352 flow. Second operand 8 states and 227 transitions.
[2024-06-20 19:25:07,923 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 301 transitions, 4570 flow
[2024-06-20 19:25:08,280 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 301 transitions, 4416 flow, removed 40 selfloop flow, removed 4 redundant places.
[2024-06-20 19:25:08,284 INFO  L231             Difference]: Finished difference. Result has 136 places, 245 transitions, 3818 flow
[2024-06-20 19:25:08,284 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=3206, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=143, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3818, PETRI_PLACES=136, PETRI_TRANSITIONS=245}
[2024-06-20 19:25:08,284 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 82 predicate places.
[2024-06-20 19:25:08,284 INFO  L495      AbstractCegarLoop]: Abstraction has has 136 places, 245 transitions, 3818 flow
[2024-06-20 19:25:08,285 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:25:08,285 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:25:08,285 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:25:08,285 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2024-06-20 19:25:08,285 INFO  L420      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] ===
[2024-06-20 19:25:08,285 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:25:08,286 INFO  L85        PathProgramCache]: Analyzing trace with hash -1956400640, now seen corresponding path program 4 times
[2024-06-20 19:25:08,286 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:25:08,286 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510300894]
[2024-06-20 19:25:08,286 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:25:08,286 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:25:08,315 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:25:25,984 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-20 19:25:25,984 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:25:25,984 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510300894]
[2024-06-20 19:25:25,984 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510300894] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:25:25,984 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:25:25,984 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:25:25,984 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263946015]
[2024-06-20 19:25:25,984 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:25:25,985 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:25:25,985 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:25:25,985 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:25:25,985 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:25:26,213 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 51
[2024-06-20 19:25:26,213 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 245 transitions, 3818 flow. Second operand  has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:25:26,213 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:25:26,214 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 51
[2024-06-20 19:25:26,214 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:25:31,986 INFO  L124   PetriNetUnfolderBase]: 10204/14495 cut-off events.
[2024-06-20 19:25:31,986 INFO  L125   PetriNetUnfolderBase]: For 267516/267542 co-relation queries the response was YES.
[2024-06-20 19:25:32,026 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 91341 conditions, 14495 events. 10204/14495 cut-off events. For 267516/267542 co-relation queries the response was YES. Maximal size of possible extension queue 479. Compared 82035 event pairs, 3520 based on Foata normal form. 25/14517 useless extension candidates. Maximal degree in co-relation 91282. Up to 11721 conditions per place. 
[2024-06-20 19:25:32,095 INFO  L140   encePairwiseOnDemand]: 38/51 looper letters, 139 selfloop transitions, 153 changer transitions 0/299 dead transitions.
[2024-06-20 19:25:32,095 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 299 transitions, 4828 flow
[2024-06-20 19:25:32,098 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:25:32,098 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:25:32,098 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 221 transitions.
[2024-06-20 19:25:32,098 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5416666666666666
[2024-06-20 19:25:32,099 INFO  L175             Difference]: Start difference. First operand has 136 places, 245 transitions, 3818 flow. Second operand 8 states and 221 transitions.
[2024-06-20 19:25:32,099 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 299 transitions, 4828 flow
[2024-06-20 19:25:32,483 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 299 transitions, 4623 flow, removed 35 selfloop flow, removed 4 redundant places.
[2024-06-20 19:25:32,487 INFO  L231             Difference]: Finished difference. Result has 140 places, 250 transitions, 4044 flow
[2024-06-20 19:25:32,487 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=3631, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=148, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4044, PETRI_PLACES=140, PETRI_TRANSITIONS=250}
[2024-06-20 19:25:32,487 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 86 predicate places.
[2024-06-20 19:25:32,488 INFO  L495      AbstractCegarLoop]: Abstraction has has 140 places, 250 transitions, 4044 flow
[2024-06-20 19:25:32,488 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:25:32,488 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:25:32,488 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:25:32,488 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2024-06-20 19:25:32,488 INFO  L420      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] ===
[2024-06-20 19:25:32,488 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:25:32,488 INFO  L85        PathProgramCache]: Analyzing trace with hash 827331020, now seen corresponding path program 5 times
[2024-06-20 19:25:32,489 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:25:32,489 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679437852]
[2024-06-20 19:25:32,489 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:25:32,489 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:25:32,518 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:25:50,015 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-20 19:25:50,016 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:25:50,016 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679437852]
[2024-06-20 19:25:50,016 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679437852] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:25:50,016 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:25:50,016 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:25:50,016 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329455188]
[2024-06-20 19:25:50,016 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:25:50,016 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:25:50,017 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:25:50,017 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:25:50,017 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:25:50,213 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 51
[2024-06-20 19:25:50,213 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 250 transitions, 4044 flow. Second operand  has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:25:50,213 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:25:50,213 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 51
[2024-06-20 19:25:50,214 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:25:56,072 INFO  L124   PetriNetUnfolderBase]: 10237/14516 cut-off events.
[2024-06-20 19:25:56,073 INFO  L125   PetriNetUnfolderBase]: For 273808/273834 co-relation queries the response was YES.
[2024-06-20 19:25:56,116 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 91513 conditions, 14516 events. 10237/14516 cut-off events. For 273808/273834 co-relation queries the response was YES. Maximal size of possible extension queue 479. Compared 81953 event pairs, 3443 based on Foata normal form. 25/14529 useless extension candidates. Maximal degree in co-relation 91453. Up to 11755 conditions per place. 
[2024-06-20 19:25:56,189 INFO  L140   encePairwiseOnDemand]: 38/51 looper letters, 138 selfloop transitions, 155 changer transitions 0/300 dead transitions.
[2024-06-20 19:25:56,189 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 300 transitions, 4926 flow
[2024-06-20 19:25:56,190 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:25:56,190 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:25:56,190 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 218 transitions.
[2024-06-20 19:25:56,191 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5343137254901961
[2024-06-20 19:25:56,191 INFO  L175             Difference]: Start difference. First operand has 140 places, 250 transitions, 4044 flow. Second operand 8 states and 218 transitions.
[2024-06-20 19:25:56,191 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 300 transitions, 4926 flow
[2024-06-20 19:25:56,616 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 300 transitions, 4670 flow, removed 24 selfloop flow, removed 6 redundant places.
[2024-06-20 19:25:56,620 INFO  L231             Difference]: Finished difference. Result has 142 places, 255 transitions, 4210 flow
[2024-06-20 19:25:56,621 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=3796, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=150, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4210, PETRI_PLACES=142, PETRI_TRANSITIONS=255}
[2024-06-20 19:25:56,621 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 88 predicate places.
[2024-06-20 19:25:56,621 INFO  L495      AbstractCegarLoop]: Abstraction has has 142 places, 255 transitions, 4210 flow
[2024-06-20 19:25:56,622 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:25:56,622 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:25:56,622 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:25:56,622 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2024-06-20 19:25:56,622 INFO  L420      AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] ===
[2024-06-20 19:25:56,622 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:25:56,623 INFO  L85        PathProgramCache]: Analyzing trace with hash -1705907885, now seen corresponding path program 1 times
[2024-06-20 19:25:56,623 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:25:56,623 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529788708]
[2024-06-20 19:25:56,623 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:25:56,623 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:25:56,653 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:26:14,500 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-20 19:26:14,500 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:26:14,500 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529788708]
[2024-06-20 19:26:14,500 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529788708] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:26:14,500 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:26:14,500 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:26:14,500 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498003331]
[2024-06-20 19:26:14,500 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:26:14,501 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:26:14,501 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:26:14,501 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:26:14,501 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:26:14,692 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 51
[2024-06-20 19:26:14,693 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 255 transitions, 4210 flow. Second operand  has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:26:14,693 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:26:14,693 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 51
[2024-06-20 19:26:14,693 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:26:20,496 INFO  L124   PetriNetUnfolderBase]: 10397/14775 cut-off events.
[2024-06-20 19:26:20,496 INFO  L125   PetriNetUnfolderBase]: For 287718/287744 co-relation queries the response was YES.
[2024-06-20 19:26:20,538 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 93324 conditions, 14775 events. 10397/14775 cut-off events. For 287718/287744 co-relation queries the response was YES. Maximal size of possible extension queue 486. Compared 83883 event pairs, 3456 based on Foata normal form. 26/14790 useless extension candidates. Maximal degree in co-relation 93264. Up to 13619 conditions per place. 
[2024-06-20 19:26:20,605 INFO  L140   encePairwiseOnDemand]: 37/51 looper letters, 231 selfloop transitions, 71 changer transitions 0/309 dead transitions.
[2024-06-20 19:26:20,605 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 309 transitions, 5182 flow
[2024-06-20 19:26:20,607 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:26:20,607 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:26:20,608 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 212 transitions.
[2024-06-20 19:26:20,608 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5196078431372549
[2024-06-20 19:26:20,608 INFO  L175             Difference]: Start difference. First operand has 142 places, 255 transitions, 4210 flow. Second operand 8 states and 212 transitions.
[2024-06-20 19:26:20,608 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 309 transitions, 5182 flow
[2024-06-20 19:26:21,015 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 309 transitions, 4934 flow, removed 22 selfloop flow, removed 5 redundant places.
[2024-06-20 19:26:21,019 INFO  L231             Difference]: Finished difference. Result has 146 places, 265 transitions, 4278 flow
[2024-06-20 19:26:21,019 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=3962, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4278, PETRI_PLACES=146, PETRI_TRANSITIONS=265}
[2024-06-20 19:26:21,019 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 92 predicate places.
[2024-06-20 19:26:21,019 INFO  L495      AbstractCegarLoop]: Abstraction has has 146 places, 265 transitions, 4278 flow
[2024-06-20 19:26:21,019 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:26:21,020 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:26:21,020 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:26:21,020 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2024-06-20 19:26:21,020 INFO  L420      AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] ===
[2024-06-20 19:26:21,020 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:26:21,020 INFO  L85        PathProgramCache]: Analyzing trace with hash -1674167189, now seen corresponding path program 2 times
[2024-06-20 19:26:21,020 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:26:21,020 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333146130]
[2024-06-20 19:26:21,020 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:26:21,021 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:26:21,049 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:26:38,332 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-20 19:26:38,333 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:26:38,333 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333146130]
[2024-06-20 19:26:38,333 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333146130] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:26:38,333 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:26:38,333 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:26:38,333 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358480949]
[2024-06-20 19:26:38,333 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:26:38,333 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:26:38,334 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:26:38,334 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:26:38,334 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:26:38,535 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 51
[2024-06-20 19:26:38,536 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 265 transitions, 4278 flow. Second operand  has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:26:38,536 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:26:38,536 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 51
[2024-06-20 19:26:38,536 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:26:44,303 INFO  L124   PetriNetUnfolderBase]: 10424/14808 cut-off events.
[2024-06-20 19:26:44,303 INFO  L125   PetriNetUnfolderBase]: For 312817/312835 co-relation queries the response was YES.
[2024-06-20 19:26:44,355 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 94398 conditions, 14808 events. 10424/14808 cut-off events. For 312817/312835 co-relation queries the response was YES. Maximal size of possible extension queue 487. Compared 83931 event pairs, 3463 based on Foata normal form. 22/14827 useless extension candidates. Maximal degree in co-relation 94336. Up to 13806 conditions per place. 
[2024-06-20 19:26:44,433 INFO  L140   encePairwiseOnDemand]: 36/51 looper letters, 228 selfloop transitions, 72 changer transitions 0/307 dead transitions.
[2024-06-20 19:26:44,433 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 307 transitions, 5067 flow
[2024-06-20 19:26:44,436 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:26:44,436 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:26:44,436 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 208 transitions.
[2024-06-20 19:26:44,436 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5098039215686274
[2024-06-20 19:26:44,437 INFO  L175             Difference]: Start difference. First operand has 146 places, 265 transitions, 4278 flow. Second operand 8 states and 208 transitions.
[2024-06-20 19:26:44,437 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 307 transitions, 5067 flow
[2024-06-20 19:26:44,921 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 307 transitions, 4901 flow, removed 49 selfloop flow, removed 4 redundant places.
[2024-06-20 19:26:44,925 INFO  L231             Difference]: Finished difference. Result has 150 places, 268 transitions, 4342 flow
[2024-06-20 19:26:44,925 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=4134, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=265, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4342, PETRI_PLACES=150, PETRI_TRANSITIONS=268}
[2024-06-20 19:26:44,925 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 96 predicate places.
[2024-06-20 19:26:44,926 INFO  L495      AbstractCegarLoop]: Abstraction has has 150 places, 268 transitions, 4342 flow
[2024-06-20 19:26:44,926 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:26:44,926 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:26:44,926 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:26:44,926 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2024-06-20 19:26:44,926 INFO  L420      AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] ===
[2024-06-20 19:26:44,926 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:26:44,926 INFO  L85        PathProgramCache]: Analyzing trace with hash 1206540497, now seen corresponding path program 3 times
[2024-06-20 19:26:44,926 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:26:44,927 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524331885]
[2024-06-20 19:26:44,927 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:26:44,927 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:26:44,956 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:26:59,886 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-20 19:26:59,886 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:26:59,886 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524331885]
[2024-06-20 19:26:59,886 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524331885] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:26:59,887 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:26:59,887 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:26:59,887 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036912281]
[2024-06-20 19:26:59,887 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:26:59,887 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:26:59,887 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:26:59,888 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:26:59,888 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:27:00,121 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 51
[2024-06-20 19:27:00,121 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 268 transitions, 4342 flow. Second operand  has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:27:00,121 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:27:00,121 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 51
[2024-06-20 19:27:00,121 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:27:06,301 INFO  L124   PetriNetUnfolderBase]: 10743/15287 cut-off events.
[2024-06-20 19:27:06,302 INFO  L125   PetriNetUnfolderBase]: For 338489/338515 co-relation queries the response was YES.
[2024-06-20 19:27:06,349 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 97950 conditions, 15287 events. 10743/15287 cut-off events. For 338489/338515 co-relation queries the response was YES. Maximal size of possible extension queue 505. Compared 87084 event pairs, 2906 based on Foata normal form. 24/15308 useless extension candidates. Maximal degree in co-relation 97886. Up to 13762 conditions per place. 
[2024-06-20 19:27:06,422 INFO  L140   encePairwiseOnDemand]: 37/51 looper letters, 233 selfloop transitions, 105 changer transitions 0/345 dead transitions.
[2024-06-20 19:27:06,423 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 345 transitions, 5738 flow
[2024-06-20 19:27:06,425 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:27:06,425 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:27:06,425 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 212 transitions.
[2024-06-20 19:27:06,426 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5196078431372549
[2024-06-20 19:27:06,426 INFO  L175             Difference]: Start difference. First operand has 150 places, 268 transitions, 4342 flow. Second operand 8 states and 212 transitions.
[2024-06-20 19:27:06,426 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 345 transitions, 5738 flow
[2024-06-20 19:27:06,888 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 345 transitions, 5532 flow, removed 32 selfloop flow, removed 6 redundant places.
[2024-06-20 19:27:06,893 INFO  L231             Difference]: Finished difference. Result has 154 places, 299 transitions, 4826 flow
[2024-06-20 19:27:06,893 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=4171, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=268, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4826, PETRI_PLACES=154, PETRI_TRANSITIONS=299}
[2024-06-20 19:27:06,893 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 100 predicate places.
[2024-06-20 19:27:06,893 INFO  L495      AbstractCegarLoop]: Abstraction has has 154 places, 299 transitions, 4826 flow
[2024-06-20 19:27:06,893 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:27:06,893 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:27:06,894 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:27:06,894 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2024-06-20 19:27:06,894 INFO  L420      AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] ===
[2024-06-20 19:27:06,894 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:27:06,894 INFO  L85        PathProgramCache]: Analyzing trace with hash 1256922113, now seen corresponding path program 1 times
[2024-06-20 19:27:06,894 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:27:06,894 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969239794]
[2024-06-20 19:27:06,894 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:27:06,895 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:27:06,929 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:27:21,366 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-20 19:27:21,366 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:27:21,366 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969239794]
[2024-06-20 19:27:21,366 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969239794] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:27:21,367 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:27:21,367 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:27:21,367 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871972192]
[2024-06-20 19:27:21,367 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:27:21,368 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:27:21,368 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:27:21,368 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:27:21,368 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:27:21,583 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 51
[2024-06-20 19:27:21,583 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 299 transitions, 4826 flow. Second operand  has 9 states, 9 states have (on average 14.333333333333334) internal successors, (129), 9 states have internal predecessors, (129), 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-20 19:27:21,583 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:27:21,583 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 51
[2024-06-20 19:27:21,583 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:27:28,502 INFO  L124   PetriNetUnfolderBase]: 11551/16499 cut-off events.
[2024-06-20 19:27:28,503 INFO  L125   PetriNetUnfolderBase]: For 405859/405877 co-relation queries the response was YES.
[2024-06-20 19:27:28,561 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 106860 conditions, 16499 events. 11551/16499 cut-off events. For 405859/405877 co-relation queries the response was YES. Maximal size of possible extension queue 557. Compared 96213 event pairs, 3610 based on Foata normal form. 134/16620 useless extension candidates. Maximal degree in co-relation 106793. Up to 13522 conditions per place. 
[2024-06-20 19:27:28,643 INFO  L140   encePairwiseOnDemand]: 34/51 looper letters, 242 selfloop transitions, 123 changer transitions 0/372 dead transitions.
[2024-06-20 19:27:28,643 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 372 transitions, 6022 flow
[2024-06-20 19:27:28,645 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-20 19:27:28,645 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-20 19:27:28,646 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 298 transitions.
[2024-06-20 19:27:28,646 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5311942959001783
[2024-06-20 19:27:28,646 INFO  L175             Difference]: Start difference. First operand has 154 places, 299 transitions, 4826 flow. Second operand 11 states and 298 transitions.
[2024-06-20 19:27:28,646 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 372 transitions, 6022 flow
[2024-06-20 19:27:29,175 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 372 transitions, 5841 flow, removed 58 selfloop flow, removed 4 redundant places.
[2024-06-20 19:27:29,180 INFO  L231             Difference]: Finished difference. Result has 161 places, 302 transitions, 4975 flow
[2024-06-20 19:27:29,180 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=4649, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=120, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=4975, PETRI_PLACES=161, PETRI_TRANSITIONS=302}
[2024-06-20 19:27:29,181 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 107 predicate places.
[2024-06-20 19:27:29,181 INFO  L495      AbstractCegarLoop]: Abstraction has has 161 places, 302 transitions, 4975 flow
[2024-06-20 19:27:29,181 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 14.333333333333334) internal successors, (129), 9 states have internal predecessors, (129), 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-20 19:27:29,181 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:27:29,181 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:27:29,182 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2024-06-20 19:27:29,182 INFO  L420      AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] ===
[2024-06-20 19:27:29,182 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:27:29,182 INFO  L85        PathProgramCache]: Analyzing trace with hash -1066803905, now seen corresponding path program 1 times
[2024-06-20 19:27:29,182 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:27:29,182 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959648734]
[2024-06-20 19:27:29,182 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:27:29,183 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:27:29,218 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:27:50,427 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-20 19:27:50,428 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:27:50,428 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959648734]
[2024-06-20 19:27:50,428 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959648734] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:27:50,428 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:27:50,428 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:27:50,428 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188330123]
[2024-06-20 19:27:50,428 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:27:50,428 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:27:50,429 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:27:50,429 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:27:50,429 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:27:50,604 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 51
[2024-06-20 19:27:50,605 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 302 transitions, 4975 flow. Second operand  has 8 states, 8 states have (on average 14.625) internal successors, (117), 8 states have internal predecessors, (117), 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-20 19:27:50,605 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:27:50,605 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 51
[2024-06-20 19:27:50,605 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:27:57,423 INFO  L124   PetriNetUnfolderBase]: 11537/16474 cut-off events.
[2024-06-20 19:27:57,423 INFO  L125   PetriNetUnfolderBase]: For 409364/409380 co-relation queries the response was YES.
[2024-06-20 19:27:57,482 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 108780 conditions, 16474 events. 11537/16474 cut-off events. For 409364/409380 co-relation queries the response was YES. Maximal size of possible extension queue 559. Compared 96391 event pairs, 4683 based on Foata normal form. 20/16472 useless extension candidates. Maximal degree in co-relation 108712. Up to 15715 conditions per place. 
[2024-06-20 19:27:57,566 INFO  L140   encePairwiseOnDemand]: 38/51 looper letters, 302 selfloop transitions, 25 changer transitions 0/334 dead transitions.
[2024-06-20 19:27:57,566 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 334 transitions, 5757 flow
[2024-06-20 19:27:57,568 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 19:27:57,568 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 19:27:57,569 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 175 transitions.
[2024-06-20 19:27:57,569 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.49019607843137253
[2024-06-20 19:27:57,569 INFO  L175             Difference]: Start difference. First operand has 161 places, 302 transitions, 4975 flow. Second operand 7 states and 175 transitions.
[2024-06-20 19:27:57,569 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 334 transitions, 5757 flow
[2024-06-20 19:27:58,185 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 334 transitions, 5517 flow, removed 24 selfloop flow, removed 8 redundant places.
[2024-06-20 19:27:58,189 INFO  L231             Difference]: Finished difference. Result has 161 places, 305 transitions, 4840 flow
[2024-06-20 19:27:58,190 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=4741, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=277, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4840, PETRI_PLACES=161, PETRI_TRANSITIONS=305}
[2024-06-20 19:27:58,190 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 107 predicate places.
[2024-06-20 19:27:58,190 INFO  L495      AbstractCegarLoop]: Abstraction has has 161 places, 305 transitions, 4840 flow
[2024-06-20 19:27:58,190 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 14.625) internal successors, (117), 8 states have internal predecessors, (117), 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-20 19:27:58,190 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:27:58,190 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:27:58,191 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2024-06-20 19:27:58,191 INFO  L420      AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] ===
[2024-06-20 19:27:58,191 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:27:58,191 INFO  L85        PathProgramCache]: Analyzing trace with hash -637142381, now seen corresponding path program 4 times
[2024-06-20 19:27:58,191 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:27:58,191 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999461323]
[2024-06-20 19:27:58,191 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:27:58,191 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:27:58,221 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:28:16,421 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-20 19:28:16,422 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:28:16,422 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999461323]
[2024-06-20 19:28:16,422 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999461323] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:28:16,422 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:28:16,422 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:28:16,422 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031219129]
[2024-06-20 19:28:16,422 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:28:16,422 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:28:16,422 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:28:16,423 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:28:16,423 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:28:16,565 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 51
[2024-06-20 19:28:16,565 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 305 transitions, 4840 flow. Second operand  has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:28:16,565 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:28:16,565 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 51
[2024-06-20 19:28:16,565 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:28:23,013 INFO  L124   PetriNetUnfolderBase]: 11584/16531 cut-off events.
[2024-06-20 19:28:23,014 INFO  L125   PetriNetUnfolderBase]: For 409152/409164 co-relation queries the response was YES.
[2024-06-20 19:28:23,071 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 106830 conditions, 16531 events. 11584/16531 cut-off events. For 409152/409164 co-relation queries the response was YES. Maximal size of possible extension queue 554. Compared 95915 event pairs, 3730 based on Foata normal form. 26/16550 useless extension candidates. Maximal degree in co-relation 106760. Up to 15411 conditions per place. 
[2024-06-20 19:28:23,153 INFO  L140   encePairwiseOnDemand]: 39/51 looper letters, 252 selfloop transitions, 88 changer transitions 0/347 dead transitions.
[2024-06-20 19:28:23,154 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 347 transitions, 5770 flow
[2024-06-20 19:28:23,156 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 19:28:23,156 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 19:28:23,156 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 181 transitions.
[2024-06-20 19:28:23,156 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5070028011204482
[2024-06-20 19:28:23,156 INFO  L175             Difference]: Start difference. First operand has 161 places, 305 transitions, 4840 flow. Second operand 7 states and 181 transitions.
[2024-06-20 19:28:23,157 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 347 transitions, 5770 flow
[2024-06-20 19:28:23,830 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 347 transitions, 5652 flow, removed 40 selfloop flow, removed 4 redundant places.
[2024-06-20 19:28:23,835 INFO  L231             Difference]: Finished difference. Result has 164 places, 311 transitions, 5044 flow
[2024-06-20 19:28:23,835 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=4722, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=305, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=5044, PETRI_PLACES=164, PETRI_TRANSITIONS=311}
[2024-06-20 19:28:23,835 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 110 predicate places.
[2024-06-20 19:28:23,835 INFO  L495      AbstractCegarLoop]: Abstraction has has 164 places, 311 transitions, 5044 flow
[2024-06-20 19:28:23,836 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:28:23,836 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:28:23,836 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:28:23,836 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2024-06-20 19:28:23,836 INFO  L420      AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] ===
[2024-06-20 19:28:23,836 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:28:23,836 INFO  L85        PathProgramCache]: Analyzing trace with hash -491113905, now seen corresponding path program 5 times
[2024-06-20 19:28:23,837 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:28:23,837 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134527702]
[2024-06-20 19:28:23,837 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:28:23,837 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:28:23,870 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:28:35,133 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-20 19:28:35,134 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:28:35,134 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134527702]
[2024-06-20 19:28:35,134 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134527702] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:28:35,134 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:28:35,134 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:28:35,134 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101470840]
[2024-06-20 19:28:35,134 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:28:35,135 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:28:35,135 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:28:35,135 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:28:35,135 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:28:35,265 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 51
[2024-06-20 19:28:35,265 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 311 transitions, 5044 flow. Second operand  has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:28:35,265 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:28:35,265 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 51
[2024-06-20 19:28:35,265 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:28:41,818 INFO  L124   PetriNetUnfolderBase]: 11557/16505 cut-off events.
[2024-06-20 19:28:41,818 INFO  L125   PetriNetUnfolderBase]: For 429117/429141 co-relation queries the response was YES.
[2024-06-20 19:28:41,885 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 107724 conditions, 16505 events. 11557/16505 cut-off events. For 429117/429141 co-relation queries the response was YES. Maximal size of possible extension queue 553. Compared 95955 event pairs, 3109 based on Foata normal form. 28/16530 useless extension candidates. Maximal degree in co-relation 107653. Up to 14958 conditions per place. 
[2024-06-20 19:28:41,968 INFO  L140   encePairwiseOnDemand]: 40/51 looper letters, 230 selfloop transitions, 110 changer transitions 0/347 dead transitions.
[2024-06-20 19:28:41,968 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 347 transitions, 5856 flow
[2024-06-20 19:28:41,970 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 19:28:41,970 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 19:28:41,970 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 181 transitions.
[2024-06-20 19:28:41,971 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5070028011204482
[2024-06-20 19:28:41,971 INFO  L175             Difference]: Start difference. First operand has 164 places, 311 transitions, 5044 flow. Second operand 7 states and 181 transitions.
[2024-06-20 19:28:41,971 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 347 transitions, 5856 flow
[2024-06-20 19:28:42,914 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 347 transitions, 5568 flow, removed 67 selfloop flow, removed 5 redundant places.
[2024-06-20 19:28:42,918 INFO  L231             Difference]: Finished difference. Result has 166 places, 311 transitions, 5004 flow
[2024-06-20 19:28:42,919 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=4756, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=311, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=110, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=5004, PETRI_PLACES=166, PETRI_TRANSITIONS=311}
[2024-06-20 19:28:42,919 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 112 predicate places.
[2024-06-20 19:28:42,919 INFO  L495      AbstractCegarLoop]: Abstraction has has 166 places, 311 transitions, 5004 flow
[2024-06-20 19:28:42,920 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:28:42,920 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:28:42,920 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:28:42,920 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2024-06-20 19:28:42,920 INFO  L420      AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] ===
[2024-06-20 19:28:42,920 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:28:42,920 INFO  L85        PathProgramCache]: Analyzing trace with hash 2054396677, now seen corresponding path program 2 times
[2024-06-20 19:28:42,920 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:28:42,920 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90197495]
[2024-06-20 19:28:42,920 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:28:42,921 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:28:42,950 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:29:01,065 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-20 19:29:01,066 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:29:01,066 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90197495]
[2024-06-20 19:29:01,066 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90197495] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:29:01,066 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:29:01,066 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:29:01,066 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028628670]
[2024-06-20 19:29:01,066 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:29:01,067 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:29:01,067 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:29:01,067 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:29:01,067 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:29:01,211 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 51
[2024-06-20 19:29:01,212 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 311 transitions, 5004 flow. Second operand  has 9 states, 9 states have (on average 14.333333333333334) internal successors, (129), 9 states have internal predecessors, (129), 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-20 19:29:01,212 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:29:01,212 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 51
[2024-06-20 19:29:01,212 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:29:08,415 INFO  L124   PetriNetUnfolderBase]: 12365/17751 cut-off events.
[2024-06-20 19:29:08,415 INFO  L125   PetriNetUnfolderBase]: For 475124/475135 co-relation queries the response was YES.
[2024-06-20 19:29:08,488 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 113579 conditions, 17751 events. 12365/17751 cut-off events. For 475124/475135 co-relation queries the response was YES. Maximal size of possible extension queue 610. Compared 105776 event pairs, 3670 based on Foata normal form. 128/17876 useless extension candidates. Maximal degree in co-relation 113507. Up to 12843 conditions per place. 
[2024-06-20 19:29:08,581 INFO  L140   encePairwiseOnDemand]: 37/51 looper letters, 209 selfloop transitions, 163 changer transitions 0/379 dead transitions.
[2024-06-20 19:29:08,582 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 379 transitions, 6326 flow
[2024-06-20 19:29:08,584 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:29:08,584 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:29:08,584 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 254 transitions.
[2024-06-20 19:29:08,584 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5533769063180828
[2024-06-20 19:29:08,584 INFO  L175             Difference]: Start difference. First operand has 166 places, 311 transitions, 5004 flow. Second operand 9 states and 254 transitions.
[2024-06-20 19:29:08,585 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 379 transitions, 6326 flow
[2024-06-20 19:29:09,382 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 379 transitions, 6049 flow, removed 30 selfloop flow, removed 7 redundant places.
[2024-06-20 19:29:09,386 INFO  L231             Difference]: Finished difference. Result has 168 places, 314 transitions, 5172 flow
[2024-06-20 19:29:09,387 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=4751, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=311, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=160, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5172, PETRI_PLACES=168, PETRI_TRANSITIONS=314}
[2024-06-20 19:29:09,387 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 114 predicate places.
[2024-06-20 19:29:09,387 INFO  L495      AbstractCegarLoop]: Abstraction has has 168 places, 314 transitions, 5172 flow
[2024-06-20 19:29:09,387 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 14.333333333333334) internal successors, (129), 9 states have internal predecessors, (129), 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-20 19:29:09,388 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:29:09,388 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:29:09,388 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26
[2024-06-20 19:29:09,388 INFO  L420      AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] ===
[2024-06-20 19:29:09,388 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:29:09,388 INFO  L85        PathProgramCache]: Analyzing trace with hash 156927039, now seen corresponding path program 2 times
[2024-06-20 19:29:09,388 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:29:09,388 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869093302]
[2024-06-20 19:29:09,388 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:29:09,389 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:29:09,427 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:29:29,322 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-20 19:29:29,322 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:29:29,322 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869093302]
[2024-06-20 19:29:29,322 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869093302] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:29:29,322 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:29:29,323 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:29:29,323 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107876072]
[2024-06-20 19:29:29,323 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:29:29,323 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:29:29,323 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:29:29,324 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:29:29,324 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:29:29,563 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 51
[2024-06-20 19:29:29,563 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 314 transitions, 5172 flow. Second operand  has 8 states, 8 states have (on average 14.625) internal successors, (117), 8 states have internal predecessors, (117), 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-20 19:29:29,563 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:29:29,563 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 51
[2024-06-20 19:29:29,563 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:29:36,184 INFO  L124   PetriNetUnfolderBase]: 12397/17783 cut-off events.
[2024-06-20 19:29:36,184 INFO  L125   PetriNetUnfolderBase]: For 451944/451960 co-relation queries the response was YES.
[2024-06-20 19:29:36,250 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 116448 conditions, 17783 events. 12397/17783 cut-off events. For 451944/451960 co-relation queries the response was YES. Maximal size of possible extension queue 615. Compared 106211 event pairs, 4890 based on Foata normal form. 20/17799 useless extension candidates. Maximal degree in co-relation 116377. Up to 16920 conditions per place. 
[2024-06-20 19:29:36,336 INFO  L140   encePairwiseOnDemand]: 41/51 looper letters, 308 selfloop transitions, 34 changer transitions 0/349 dead transitions.
[2024-06-20 19:29:36,336 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 349 transitions, 6125 flow
[2024-06-20 19:29:36,336 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 19:29:36,336 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 19:29:36,337 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 176 transitions.
[2024-06-20 19:29:36,337 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.49299719887955185
[2024-06-20 19:29:36,337 INFO  L175             Difference]: Start difference. First operand has 168 places, 314 transitions, 5172 flow. Second operand 7 states and 176 transitions.
[2024-06-20 19:29:36,337 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 349 transitions, 6125 flow
[2024-06-20 19:29:37,280 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 349 transitions, 5744 flow, removed 32 selfloop flow, removed 7 redundant places.
[2024-06-20 19:29:37,285 INFO  L231             Difference]: Finished difference. Result has 168 places, 318 transitions, 4957 flow
[2024-06-20 19:29:37,285 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=4801, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=314, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=284, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4957, PETRI_PLACES=168, PETRI_TRANSITIONS=318}
[2024-06-20 19:29:37,285 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 114 predicate places.
[2024-06-20 19:29:37,286 INFO  L495      AbstractCegarLoop]: Abstraction has has 168 places, 318 transitions, 4957 flow
[2024-06-20 19:29:37,286 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 14.625) internal successors, (117), 8 states have internal predecessors, (117), 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-20 19:29:37,286 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:29:37,286 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:29:37,286 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27
[2024-06-20 19:29:37,286 INFO  L420      AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] ===
[2024-06-20 19:29:37,287 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:29:37,287 INFO  L85        PathProgramCache]: Analyzing trace with hash 479095557, now seen corresponding path program 3 times
[2024-06-20 19:29:37,287 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:29:37,287 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708944603]
[2024-06-20 19:29:37,287 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:29:37,288 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:29:37,317 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:29:55,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-20 19:29:55,212 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:29:55,212 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708944603]
[2024-06-20 19:29:55,212 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708944603] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:29:55,212 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:29:55,212 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:29:55,212 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089885994]
[2024-06-20 19:29:55,212 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:29:55,212 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:29:55,212 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:29:55,213 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:29:55,213 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:29:55,376 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 51
[2024-06-20 19:29:55,376 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 318 transitions, 4957 flow. Second operand  has 9 states, 9 states have (on average 14.333333333333334) internal successors, (129), 9 states have internal predecessors, (129), 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-20 19:29:55,376 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:29:55,376 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 51
[2024-06-20 19:29:55,376 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:30:02,746 INFO  L124   PetriNetUnfolderBase]: 12594/18061 cut-off events.
[2024-06-20 19:30:02,746 INFO  L125   PetriNetUnfolderBase]: For 421531/421533 co-relation queries the response was YES.
[2024-06-20 19:30:02,812 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 112658 conditions, 18061 events. 12594/18061 cut-off events. For 421531/421533 co-relation queries the response was YES. Maximal size of possible extension queue 625. Compared 107497 event pairs, 3730 based on Foata normal form. 28/18081 useless extension candidates. Maximal degree in co-relation 112586. Up to 14976 conditions per place. 
[2024-06-20 19:30:02,901 INFO  L140   encePairwiseOnDemand]: 37/51 looper letters, 219 selfloop transitions, 167 changer transitions 0/393 dead transitions.
[2024-06-20 19:30:02,902 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 393 transitions, 6333 flow
[2024-06-20 19:30:02,904 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 19:30:02,904 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 19:30:02,905 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 275 transitions.
[2024-06-20 19:30:02,905 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5392156862745098
[2024-06-20 19:30:02,905 INFO  L175             Difference]: Start difference. First operand has 168 places, 318 transitions, 4957 flow. Second operand 10 states and 275 transitions.
[2024-06-20 19:30:02,905 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 393 transitions, 6333 flow
[2024-06-20 19:30:03,466 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 393 transitions, 5853 flow, removed 26 selfloop flow, removed 9 redundant places.
[2024-06-20 19:30:03,471 INFO  L231             Difference]: Finished difference. Result has 169 places, 321 transitions, 4910 flow
[2024-06-20 19:30:03,471 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=4489, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=318, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=164, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4910, PETRI_PLACES=169, PETRI_TRANSITIONS=321}
[2024-06-20 19:30:03,472 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 115 predicate places.
[2024-06-20 19:30:03,472 INFO  L495      AbstractCegarLoop]: Abstraction has has 169 places, 321 transitions, 4910 flow
[2024-06-20 19:30:03,473 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 14.333333333333334) internal successors, (129), 9 states have internal predecessors, (129), 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-20 19:30:03,473 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:30:03,473 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:30:03,473 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28
[2024-06-20 19:30:03,473 INFO  L420      AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] ===
[2024-06-20 19:30:03,473 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:30:03,473 INFO  L85        PathProgramCache]: Analyzing trace with hash 1624946897, now seen corresponding path program 4 times
[2024-06-20 19:30:03,474 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:30:03,474 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364439782]
[2024-06-20 19:30:03,474 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:30:03,474 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:30:03,504 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:30:21,670 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-20 19:30:21,671 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:30:21,671 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364439782]
[2024-06-20 19:30:21,671 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364439782] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:30:21,671 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:30:21,671 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:30:21,671 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128476066]
[2024-06-20 19:30:21,671 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:30:21,671 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:30:21,672 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:30:21,672 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:30:21,672 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:30:22,053 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 51
[2024-06-20 19:30:22,054 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 321 transitions, 4910 flow. Second operand  has 9 states, 9 states have (on average 14.333333333333334) internal successors, (129), 9 states have internal predecessors, (129), 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-20 19:30:22,054 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:30:22,054 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 51
[2024-06-20 19:30:22,054 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:30:29,370 INFO  L124   PetriNetUnfolderBase]: 12791/18339 cut-off events.
[2024-06-20 19:30:29,370 INFO  L125   PetriNetUnfolderBase]: For 421965/421965 co-relation queries the response was YES.
[2024-06-20 19:30:29,448 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 116785 conditions, 18339 events. 12791/18339 cut-off events. For 421965/421965 co-relation queries the response was YES. Maximal size of possible extension queue 646. Compared 109433 event pairs, 3665 based on Foata normal form. 26/18357 useless extension candidates. Maximal degree in co-relation 116714. Up to 15286 conditions per place. 
[2024-06-20 19:30:29,544 INFO  L140   encePairwiseOnDemand]: 37/51 looper letters, 206 selfloop transitions, 179 changer transitions 0/392 dead transitions.
[2024-06-20 19:30:29,544 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 392 transitions, 6178 flow
[2024-06-20 19:30:29,546 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 19:30:29,547 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 19:30:29,547 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 274 transitions.
[2024-06-20 19:30:29,547 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5372549019607843
[2024-06-20 19:30:29,547 INFO  L175             Difference]: Start difference. First operand has 169 places, 321 transitions, 4910 flow. Second operand 10 states and 274 transitions.
[2024-06-20 19:30:29,547 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 392 transitions, 6178 flow
[2024-06-20 19:30:30,127 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 392 transitions, 5793 flow, removed 29 selfloop flow, removed 8 redundant places.
[2024-06-20 19:30:30,132 INFO  L231             Difference]: Finished difference. Result has 171 places, 324 transitions, 4974 flow
[2024-06-20 19:30:30,132 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=4525, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=321, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=176, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4974, PETRI_PLACES=171, PETRI_TRANSITIONS=324}
[2024-06-20 19:30:30,132 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 117 predicate places.
[2024-06-20 19:30:30,132 INFO  L495      AbstractCegarLoop]: Abstraction has has 171 places, 324 transitions, 4974 flow
[2024-06-20 19:30:30,133 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 14.333333333333334) internal successors, (129), 9 states have internal predecessors, (129), 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-20 19:30:30,133 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:30:30,133 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:30:30,133 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29
[2024-06-20 19:30:30,133 INFO  L420      AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] ===
[2024-06-20 19:30:30,133 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:30:30,133 INFO  L85        PathProgramCache]: Analyzing trace with hash 715567587, now seen corresponding path program 5 times
[2024-06-20 19:30:30,133 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:30:30,133 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362632255]
[2024-06-20 19:30:30,133 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:30:30,133 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:30:30,163 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:30:48,829 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-20 19:30:48,829 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:30:48,829 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362632255]
[2024-06-20 19:30:48,829 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362632255] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:30:48,829 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:30:48,829 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:30:48,829 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161415379]
[2024-06-20 19:30:48,829 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:30:48,830 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:30:48,830 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:30:48,830 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:30:48,830 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:30:49,185 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 51
[2024-06-20 19:30:49,185 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 324 transitions, 4974 flow. Second operand  has 9 states, 9 states have (on average 14.333333333333334) internal successors, (129), 9 states have internal predecessors, (129), 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-20 19:30:49,185 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:30:49,185 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 51
[2024-06-20 19:30:49,185 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:30:56,617 INFO  L124   PetriNetUnfolderBase]: 12937/18549 cut-off events.
[2024-06-20 19:30:56,618 INFO  L125   PetriNetUnfolderBase]: For 449505/449505 co-relation queries the response was YES.
[2024-06-20 19:30:56,679 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 119501 conditions, 18549 events. 12937/18549 cut-off events. For 449505/449505 co-relation queries the response was YES. Maximal size of possible extension queue 667. Compared 111152 event pairs, 3345 based on Foata normal form. 26/18567 useless extension candidates. Maximal degree in co-relation 119429. Up to 12816 conditions per place. 
[2024-06-20 19:30:56,766 INFO  L140   encePairwiseOnDemand]: 37/51 looper letters, 201 selfloop transitions, 193 changer transitions 0/401 dead transitions.
[2024-06-20 19:30:56,766 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 401 transitions, 6298 flow
[2024-06-20 19:30:56,767 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 19:30:56,767 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 19:30:56,767 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 279 transitions.
[2024-06-20 19:30:56,768 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5470588235294118
[2024-06-20 19:30:56,768 INFO  L175             Difference]: Start difference. First operand has 171 places, 324 transitions, 4974 flow. Second operand 10 states and 279 transitions.
[2024-06-20 19:30:56,768 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 401 transitions, 6298 flow
[2024-06-20 19:30:57,379 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 401 transitions, 5880 flow, removed 32 selfloop flow, removed 8 redundant places.
[2024-06-20 19:30:57,384 INFO  L231             Difference]: Finished difference. Result has 173 places, 327 transitions, 5038 flow
[2024-06-20 19:30:57,384 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=4556, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=324, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=190, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5038, PETRI_PLACES=173, PETRI_TRANSITIONS=327}
[2024-06-20 19:30:57,384 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 119 predicate places.
[2024-06-20 19:30:57,384 INFO  L495      AbstractCegarLoop]: Abstraction has has 173 places, 327 transitions, 5038 flow
[2024-06-20 19:30:57,384 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 14.333333333333334) internal successors, (129), 9 states have internal predecessors, (129), 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-20 19:30:57,384 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:30:57,384 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:30:57,385 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30
[2024-06-20 19:30:57,385 INFO  L420      AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] ===
[2024-06-20 19:30:57,385 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:30:57,385 INFO  L85        PathProgramCache]: Analyzing trace with hash 168354879, now seen corresponding path program 3 times
[2024-06-20 19:30:57,385 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:30:57,385 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771850840]
[2024-06-20 19:30:57,385 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:30:57,385 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:30:57,420 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:31:16,998 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-20 19:31:16,999 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:31:17,000 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771850840]
[2024-06-20 19:31:17,000 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771850840] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:31:17,000 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:31:17,000 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:31:17,000 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865147987]
[2024-06-20 19:31:17,000 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:31:17,000 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:31:17,000 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:31:17,001 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:31:17,001 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:31:17,256 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 51
[2024-06-20 19:31:17,256 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 327 transitions, 5038 flow. Second operand  has 8 states, 8 states have (on average 14.625) internal successors, (117), 8 states have internal predecessors, (117), 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-20 19:31:17,256 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:31:17,256 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 51
[2024-06-20 19:31:17,256 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:31:24,024 INFO  L124   PetriNetUnfolderBase]: 12923/18542 cut-off events.
[2024-06-20 19:31:24,024 INFO  L125   PetriNetUnfolderBase]: For 478957/478973 co-relation queries the response was YES.
[2024-06-20 19:31:24,103 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 121464 conditions, 18542 events. 12923/18542 cut-off events. For 478957/478973 co-relation queries the response was YES. Maximal size of possible extension queue 672. Compared 111840 event pairs, 5028 based on Foata normal form. 20/18558 useless extension candidates. Maximal degree in co-relation 121391. Up to 17684 conditions per place. 
[2024-06-20 19:31:24,195 INFO  L140   encePairwiseOnDemand]: 41/51 looper letters, 314 selfloop transitions, 34 changer transitions 0/355 dead transitions.
[2024-06-20 19:31:24,195 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 355 transitions, 5830 flow
[2024-06-20 19:31:24,195 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 19:31:24,196 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 19:31:24,196 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 173 transitions.
[2024-06-20 19:31:24,196 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.484593837535014
[2024-06-20 19:31:24,196 INFO  L175             Difference]: Start difference. First operand has 173 places, 327 transitions, 5038 flow. Second operand 7 states and 173 transitions.
[2024-06-20 19:31:24,196 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 355 transitions, 5830 flow
[2024-06-20 19:31:24,924 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 355 transitions, 5442 flow, removed 42 selfloop flow, removed 7 redundant places.
[2024-06-20 19:31:24,928 INFO  L231             Difference]: Finished difference. Result has 173 places, 327 transitions, 4727 flow
[2024-06-20 19:31:24,928 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=4650, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=327, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=293, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4727, PETRI_PLACES=173, PETRI_TRANSITIONS=327}
[2024-06-20 19:31:24,929 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 119 predicate places.
[2024-06-20 19:31:24,929 INFO  L495      AbstractCegarLoop]: Abstraction has has 173 places, 327 transitions, 4727 flow
[2024-06-20 19:31:24,929 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 14.625) internal successors, (117), 8 states have internal predecessors, (117), 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-20 19:31:24,929 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:31:24,929 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:31:24,929 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31
[2024-06-20 19:31:24,929 INFO  L420      AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] ===
[2024-06-20 19:31:24,930 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:31:24,930 INFO  L85        PathProgramCache]: Analyzing trace with hash 162646911, now seen corresponding path program 1 times
[2024-06-20 19:31:24,930 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:31:24,930 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89565110]
[2024-06-20 19:31:24,930 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:31:24,930 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:31:24,967 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:31:44,733 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-20 19:31:44,733 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:31:44,733 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89565110]
[2024-06-20 19:31:44,734 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89565110] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:31:44,734 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:31:44,734 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:31:44,734 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230956772]
[2024-06-20 19:31:44,734 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:31:44,734 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:31:44,734 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:31:44,734 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:31:44,734 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:31:45,234 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 14 out of 51
[2024-06-20 19:31:45,234 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 327 transitions, 4727 flow. Second operand  has 8 states, 8 states have (on average 15.625) internal successors, (125), 8 states have internal predecessors, (125), 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-20 19:31:45,234 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:31:45,234 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 51
[2024-06-20 19:31:45,235 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:31:52,127 INFO  L124   PetriNetUnfolderBase]: 11791/17190 cut-off events.
[2024-06-20 19:31:52,127 INFO  L125   PetriNetUnfolderBase]: For 426118/426118 co-relation queries the response was YES.
[2024-06-20 19:31:52,274 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 108319 conditions, 17190 events. 11791/17190 cut-off events. For 426118/426118 co-relation queries the response was YES. Maximal size of possible extension queue 638. Compared 105707 event pairs, 4770 based on Foata normal form. 8/17130 useless extension candidates. Maximal degree in co-relation 108245. Up to 16147 conditions per place. 
[2024-06-20 19:31:52,353 INFO  L140   encePairwiseOnDemand]: 40/51 looper letters, 331 selfloop transitions, 28 changer transitions 0/367 dead transitions.
[2024-06-20 19:31:52,353 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 367 transitions, 5714 flow
[2024-06-20 19:31:52,354 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:31:52,354 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:31:52,354 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 206 transitions.
[2024-06-20 19:31:52,354 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5049019607843137
[2024-06-20 19:31:52,354 INFO  L175             Difference]: Start difference. First operand has 173 places, 327 transitions, 4727 flow. Second operand 8 states and 206 transitions.
[2024-06-20 19:31:52,355 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 367 transitions, 5714 flow
[2024-06-20 19:31:52,868 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 367 transitions, 5619 flow, removed 7 selfloop flow, removed 6 redundant places.
[2024-06-20 19:31:52,873 INFO  L231             Difference]: Finished difference. Result has 175 places, 331 transitions, 4748 flow
[2024-06-20 19:31:52,873 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=4632, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=327, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=302, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4748, PETRI_PLACES=175, PETRI_TRANSITIONS=331}
[2024-06-20 19:31:52,874 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 121 predicate places.
[2024-06-20 19:31:52,874 INFO  L495      AbstractCegarLoop]: Abstraction has has 175 places, 331 transitions, 4748 flow
[2024-06-20 19:31:52,874 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 15.625) internal successors, (125), 8 states have internal predecessors, (125), 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-20 19:31:52,875 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:31:52,875 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:31:52,875 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32
[2024-06-20 19:31:52,875 INFO  L420      AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] ===
[2024-06-20 19:31:52,875 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:31:52,875 INFO  L85        PathProgramCache]: Analyzing trace with hash 1668620703, now seen corresponding path program 2 times
[2024-06-20 19:31:52,876 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:31:52,876 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913685860]
[2024-06-20 19:31:52,876 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:31:52,876 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:31:52,912 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:32:14,051 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-20 19:32:14,051 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:32:14,051 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913685860]
[2024-06-20 19:32:14,052 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913685860] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:32:14,052 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:32:14,052 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:32:14,052 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468784642]
[2024-06-20 19:32:14,052 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:32:14,052 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:32:14,052 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:32:14,052 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:32:14,053 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:32:14,242 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 14 out of 51
[2024-06-20 19:32:14,242 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 331 transitions, 4748 flow. Second operand  has 8 states, 8 states have (on average 15.625) internal successors, (125), 8 states have internal predecessors, (125), 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-20 19:32:14,242 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:32:14,242 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 51
[2024-06-20 19:32:14,242 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:32:20,661 INFO  L124   PetriNetUnfolderBase]: 11639/16929 cut-off events.
[2024-06-20 19:32:20,661 INFO  L125   PetriNetUnfolderBase]: For 440899/440906 co-relation queries the response was YES.
[2024-06-20 19:32:20,734 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 108049 conditions, 16929 events. 11639/16929 cut-off events. For 440899/440906 co-relation queries the response was YES. Maximal size of possible extension queue 618. Compared 103231 event pairs, 4689 based on Foata normal form. 10/16874 useless extension candidates. Maximal degree in co-relation 107974. Up to 15931 conditions per place. 
[2024-06-20 19:32:21,062 INFO  L140   encePairwiseOnDemand]: 40/51 looper letters, 322 selfloop transitions, 28 changer transitions 0/358 dead transitions.
[2024-06-20 19:32:21,063 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 358 transitions, 5540 flow
[2024-06-20 19:32:21,063 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 19:32:21,063 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 19:32:21,064 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 180 transitions.
[2024-06-20 19:32:21,064 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5042016806722689
[2024-06-20 19:32:21,064 INFO  L175             Difference]: Start difference. First operand has 175 places, 331 transitions, 4748 flow. Second operand 7 states and 180 transitions.
[2024-06-20 19:32:21,064 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 358 transitions, 5540 flow
[2024-06-20 19:32:21,627 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 358 transitions, 5482 flow, removed 10 selfloop flow, removed 5 redundant places.
[2024-06-20 19:32:21,632 INFO  L231             Difference]: Finished difference. Result has 177 places, 331 transitions, 4755 flow
[2024-06-20 19:32:21,632 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=4690, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=331, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=303, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4755, PETRI_PLACES=177, PETRI_TRANSITIONS=331}
[2024-06-20 19:32:21,632 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 123 predicate places.
[2024-06-20 19:32:21,632 INFO  L495      AbstractCegarLoop]: Abstraction has has 177 places, 331 transitions, 4755 flow
[2024-06-20 19:32:21,633 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 15.625) internal successors, (125), 8 states have internal predecessors, (125), 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-20 19:32:21,633 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:32:21,633 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:32:21,633 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33
[2024-06-20 19:32:21,633 INFO  L420      AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] ===
[2024-06-20 19:32:21,633 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:32:21,633 INFO  L85        PathProgramCache]: Analyzing trace with hash 573813955, now seen corresponding path program 1 times
[2024-06-20 19:32:21,633 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:32:21,634 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602823985]
[2024-06-20 19:32:21,634 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:32:21,634 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:32:21,663 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:32:40,147 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-20 19:32:40,148 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:32:40,148 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602823985]
[2024-06-20 19:32:40,148 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602823985] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:32:40,148 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:32:40,148 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:32:40,148 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950617560]
[2024-06-20 19:32:40,148 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:32:40,148 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:32:40,148 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:32:40,149 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:32:40,149 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:32:40,394 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 51
[2024-06-20 19:32:40,395 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 331 transitions, 4755 flow. Second operand  has 9 states, 9 states have (on average 14.444444444444445) internal successors, (130), 9 states have internal predecessors, (130), 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-20 19:32:40,395 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:32:40,395 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 51
[2024-06-20 19:32:40,395 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:32:50,105 INFO  L124   PetriNetUnfolderBase]: 16302/23652 cut-off events.
[2024-06-20 19:32:50,106 INFO  L125   PetriNetUnfolderBase]: For 688843/688867 co-relation queries the response was YES.
[2024-06-20 19:32:50,206 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 149868 conditions, 23652 events. 16302/23652 cut-off events. For 688843/688867 co-relation queries the response was YES. Maximal size of possible extension queue 972. Compared 151871 event pairs, 4739 based on Foata normal form. 108/23753 useless extension candidates. Maximal degree in co-relation 149792. Up to 14731 conditions per place. 
[2024-06-20 19:32:50,315 INFO  L140   encePairwiseOnDemand]: 34/51 looper letters, 293 selfloop transitions, 133 changer transitions 0/433 dead transitions.
[2024-06-20 19:32:50,315 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 433 transitions, 6585 flow
[2024-06-20 19:32:50,318 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 19:32:50,318 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 19:32:50,319 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 289 transitions.
[2024-06-20 19:32:50,319 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5666666666666667
[2024-06-20 19:32:50,319 INFO  L175             Difference]: Start difference. First operand has 177 places, 331 transitions, 4755 flow. Second operand 10 states and 289 transitions.
[2024-06-20 19:32:50,319 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 433 transitions, 6585 flow
[2024-06-20 19:32:51,107 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 433 transitions, 6509 flow, removed 1 selfloop flow, removed 7 redundant places.
[2024-06-20 19:32:51,113 INFO  L231             Difference]: Finished difference. Result has 182 places, 341 transitions, 5251 flow
[2024-06-20 19:32:51,113 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=4679, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=331, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=124, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5251, PETRI_PLACES=182, PETRI_TRANSITIONS=341}
[2024-06-20 19:32:51,114 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 128 predicate places.
[2024-06-20 19:32:51,114 INFO  L495      AbstractCegarLoop]: Abstraction has has 182 places, 341 transitions, 5251 flow
[2024-06-20 19:32:51,114 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 14.444444444444445) internal successors, (130), 9 states have internal predecessors, (130), 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-20 19:32:51,114 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:32:51,114 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:32:51,114 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34
[2024-06-20 19:32:51,114 INFO  L420      AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] ===
[2024-06-20 19:32:51,115 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:32:51,115 INFO  L85        PathProgramCache]: Analyzing trace with hash 687404155, now seen corresponding path program 2 times
[2024-06-20 19:32:51,115 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:32:51,115 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729230485]
[2024-06-20 19:32:51,115 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:32:51,115 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:32:51,145 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat