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


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


Checking for ERROR reachability
Using default analysis
Version cde23df1
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/mix008.opt.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/mix008.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-cde23df-m
[2024-06-14 14:29:31,491 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-06-14 14:29:31,569 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-06-14 14:29:31,575 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-06-14 14:29:31,576 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-06-14 14:29:31,601 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-06-14 14:29:31,602 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-06-14 14:29:31,602 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-06-14 14:29:31,603 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-06-14 14:29:31,606 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-06-14 14:29:31,606 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-06-14 14:29:31,606 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-06-14 14:29:31,607 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-06-14 14:29:31,608 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-06-14 14:29:31,608 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-06-14 14:29:31,609 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-06-14 14:29:31,609 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-06-14 14:29:31,609 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-06-14 14:29:31,609 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-06-14 14:29:31,610 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-06-14 14:29:31,610 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-06-14 14:29:31,610 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-06-14 14:29:31,610 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-06-14 14:29:31,611 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-06-14 14:29:31,611 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-06-14 14:29:31,611 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-06-14 14:29:31,611 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-06-14 14:29:31,611 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-06-14 14:29:31,612 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-06-14 14:29:31,612 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-06-14 14:29:31,613 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-06-14 14:29:31,613 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-06-14 14:29:31,613 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-06-14 14:29:31,614 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-06-14 14:29:31,614 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-06-14 14:29:31,614 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-06-14 14:29:31,614 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-06-14 14:29:31,614 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-06-14 14:29:31,615 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-06-14 14:29:31,615 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-06-14 14:29:31,615 INFO  L153        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-06-14 14:29:31,615 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-06-14 14:29:31,615 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-06-14 14:29:31,616 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-14 14:29:31,858 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-06-14 14:29:31,878 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-06-14 14:29:31,880 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-06-14 14:29:31,881 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-06-14 14:29:31,881 INFO  L274        PluginConnector]: CDTParser initialized
[2024-06-14 14:29:31,882 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix008.opt.i
[2024-06-14 14:29:32,993 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-06-14 14:29:33,185 INFO  L384              CDTParser]: Found 1 translation units.
[2024-06-14 14:29:33,185 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix008.opt.i
[2024-06-14 14:29:33,197 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe1003fbe/c386d0fba20d4cc99d8e3d1cb0090cdc/FLAGc7c772d0a
[2024-06-14 14:29:33,214 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe1003fbe/c386d0fba20d4cc99d8e3d1cb0090cdc
[2024-06-14 14:29:33,216 INFO  L270        PluginConnector]: Initializing Witness Parser...
[2024-06-14 14:29:33,217 INFO  L274        PluginConnector]: Witness Parser initialized
[2024-06-14 14:29:33,218 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/mix008.opt.yml/witness.yml
[2024-06-14 14:29:33,466 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-06-14 14:29:33,467 INFO  L133        ToolchainWalker]: Walking toolchain with 5 elements.
[2024-06-14 14:29:33,469 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-06-14 14:29:33,469 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-06-14 14:29:33,472 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-06-14 14:29:33,472 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 02:29:33" (1/2) ...
[2024-06-14 14:29:33,473 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7732e702 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:29:33, skipping insertion in model container
[2024-06-14 14:29:33,473 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 02:29:33" (1/2) ...
[2024-06-14 14:29:33,475 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@3f38eaaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:29:33, skipping insertion in model container
[2024-06-14 14:29:33,475 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 02:29:33" (2/2) ...
[2024-06-14 14:29:33,475 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7732e702 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:29:33, skipping insertion in model container
[2024-06-14 14:29:33,475 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 02:29:33" (2/2) ...
[2024-06-14 14:29:33,475 INFO  L83    nessWitnessExtractor]: Extracting all invariants from correctness witness
[2024-06-14 14:29:33,574 INFO  L95    edCorrectnessWitness]: Found the following entries in the witness:
[2024-06-14 14:29:33,575 INFO  L97    edCorrectnessWitness]: Location invariant before [L875-L875] (((((((((((((((((((((((! multithreaded || ((0 <= z$w_buff1 && z$w_buff1 <= 1) && (z$w_buff1 == 0 || z$w_buff1 == 1))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p3_EBX) + (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_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_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_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_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_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_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_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$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$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$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$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_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (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_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) && (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_p2_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p3_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p3_EBX >= 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_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_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_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_p3_EAX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_p3_EBX >= 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_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_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_p2_EBX + (long long )__unbuffered_p3_EAX >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )__unbuffered_p3_EBX >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )__unbuffered_p3_EBX >= 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_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 )__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 )__unbuffered_p3_EBX + (long long )a >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p3_EBX + (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_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 )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_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 )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_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 )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_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 )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_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 + (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_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$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_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$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_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_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_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_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_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_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_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_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd3 + (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$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$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$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$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$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_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$$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_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) && (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_EBX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )__unbuffered_p3_EBX >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )__unbuffered_p3_EBX >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_p3_EAX) - (long long )__unbuffered_p3_EBX >= 0LL) && (1LL + (long long )__unbuffered_p3_EAX) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_p3_EBX) - (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_EBX) - (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (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_EBX) - (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_p2_EBX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (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 )__unbuffered_p3_EBX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p3_EBX - (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_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 )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 <= a && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= __unbuffered_p3_EAX) && 0 <= __unbuffered_p3_EBX) && 0 <= a) && 0 <= x) && 0 <= y) && 0 <= z) && 0 <= z$mem_tmp) && 0 <= z$w_buff0) && 0 <= z$w_buff1) && __unbuffered_p2_EBX <= 1) && __unbuffered_p3_EAX <= 1) && __unbuffered_p3_EBX <= 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_EBX == 0 || __unbuffered_p2_EBX == 1)) && (__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1)) && (__unbuffered_p3_EBX == 0 || __unbuffered_p3_EBX == 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)) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)) && ((x == 0 || x == 1) || x == 2)) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || z$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || (0 <= __unbuffered_p2_EAX && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)))) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p3_EAX && __unbuffered_p3_EAX <= 1) && (__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1)))) && (! multithreaded || ((0 <= z$w_buff0 && z$w_buff0 <= 1) && (z$w_buff0 == 0 || z$w_buff0 == 1)))) && (! multithreaded || z$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || z$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || z$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || ((0 <= __unbuffered_p3_EBX && __unbuffered_p3_EBX <= 1) && (__unbuffered_p3_EBX == 0 || __unbuffered_p3_EBX == 1)))) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || z$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || z$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= z$mem_tmp && z$mem_tmp <= 1) && (z$mem_tmp == 0 || z$mem_tmp == 1)))
[2024-06-14 14:29:33,576 INFO  L97    edCorrectnessWitness]: Location invariant before [L874-L874] (((((((((((((((((((((((! multithreaded || ((0 <= z$w_buff1 && z$w_buff1 <= 1) && (z$w_buff1 == 0 || z$w_buff1 == 1))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p3_EBX) + (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_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_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_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_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_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_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_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$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$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$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$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_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (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_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) && (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_p2_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p3_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p3_EBX >= 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_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_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_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_p3_EAX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_p3_EBX >= 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_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_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_p2_EBX + (long long )__unbuffered_p3_EAX >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )__unbuffered_p3_EBX >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )__unbuffered_p3_EBX >= 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_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 )__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 )__unbuffered_p3_EBX + (long long )a >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p3_EBX + (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_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 )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_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 )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_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 )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_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 )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_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 + (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_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$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_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$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_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_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_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_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_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_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_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_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd3 + (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$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$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$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$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$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_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$$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_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) && (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_EBX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )__unbuffered_p3_EBX >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )__unbuffered_p3_EBX >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_p3_EAX) - (long long )__unbuffered_p3_EBX >= 0LL) && (1LL + (long long )__unbuffered_p3_EAX) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_p3_EBX) - (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_EBX) - (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (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_EBX) - (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_p2_EBX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (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 )__unbuffered_p3_EBX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p3_EBX - (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_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 )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 <= a && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= __unbuffered_p3_EAX) && 0 <= __unbuffered_p3_EBX) && 0 <= a) && 0 <= x) && 0 <= y) && 0 <= z) && 0 <= z$mem_tmp) && 0 <= z$w_buff0) && 0 <= z$w_buff1) && __unbuffered_p2_EBX <= 1) && __unbuffered_p3_EAX <= 1) && __unbuffered_p3_EBX <= 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_EBX == 0 || __unbuffered_p2_EBX == 1)) && (__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1)) && (__unbuffered_p3_EBX == 0 || __unbuffered_p3_EBX == 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)) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)) && ((x == 0 || x == 1) || x == 2)) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || z$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || (0 <= __unbuffered_p2_EAX && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)))) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p3_EAX && __unbuffered_p3_EAX <= 1) && (__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1)))) && (! multithreaded || ((0 <= z$w_buff0 && z$w_buff0 <= 1) && (z$w_buff0 == 0 || z$w_buff0 == 1)))) && (! multithreaded || z$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || z$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || z$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || ((0 <= __unbuffered_p3_EBX && __unbuffered_p3_EBX <= 1) && (__unbuffered_p3_EBX == 0 || __unbuffered_p3_EBX == 1)))) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || z$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || z$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= z$mem_tmp && z$mem_tmp <= 1) && (z$mem_tmp == 0 || z$mem_tmp == 1)))
[2024-06-14 14:29:33,576 INFO  L97    edCorrectnessWitness]: Location invariant before [L872-L872] (((((((((((((((((((((((! multithreaded || ((0 <= z$w_buff1 && z$w_buff1 <= 1) && (z$w_buff1 == 0 || z$w_buff1 == 1))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p3_EBX) + (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_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_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_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_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_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_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_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$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$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$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$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_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (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_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) && (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_p2_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p3_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p3_EBX >= 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_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_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_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_p3_EAX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_p3_EBX >= 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_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_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_p2_EBX + (long long )__unbuffered_p3_EAX >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )__unbuffered_p3_EBX >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )__unbuffered_p3_EBX >= 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_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 )__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 )__unbuffered_p3_EBX + (long long )a >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p3_EBX + (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_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 )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_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 )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_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 )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_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 )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_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 + (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_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$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_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$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_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_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_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_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_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_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_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_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd3 + (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$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$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$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$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$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_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$$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_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) && (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_EBX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )__unbuffered_p3_EBX >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )__unbuffered_p3_EBX >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_p3_EAX) - (long long )__unbuffered_p3_EBX >= 0LL) && (1LL + (long long )__unbuffered_p3_EAX) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_p3_EBX) - (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_EBX) - (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (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_EBX) - (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_p2_EBX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (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 )__unbuffered_p3_EBX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p3_EBX - (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_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 )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 <= a && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= __unbuffered_p3_EAX) && 0 <= __unbuffered_p3_EBX) && 0 <= a) && 0 <= x) && 0 <= y) && 0 <= z) && 0 <= z$mem_tmp) && 0 <= z$w_buff0) && 0 <= z$w_buff1) && __unbuffered_p2_EBX <= 1) && __unbuffered_p3_EAX <= 1) && __unbuffered_p3_EBX <= 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_EBX == 0 || __unbuffered_p2_EBX == 1)) && (__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1)) && (__unbuffered_p3_EBX == 0 || __unbuffered_p3_EBX == 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)) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)) && ((x == 0 || x == 1) || x == 2)) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || z$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || (0 <= __unbuffered_p2_EAX && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)))) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p3_EAX && __unbuffered_p3_EAX <= 1) && (__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1)))) && (! multithreaded || ((0 <= z$w_buff0 && z$w_buff0 <= 1) && (z$w_buff0 == 0 || z$w_buff0 == 1)))) && (! multithreaded || z$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || z$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || z$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || ((0 <= __unbuffered_p3_EBX && __unbuffered_p3_EBX <= 1) && (__unbuffered_p3_EBX == 0 || __unbuffered_p3_EBX == 1)))) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || z$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || z$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= z$mem_tmp && z$mem_tmp <= 1) && (z$mem_tmp == 0 || z$mem_tmp == 1)))
[2024-06-14 14:29:33,577 INFO  L97    edCorrectnessWitness]: Location invariant before [L870-L870] (((((((((((((((((((((((! multithreaded || ((0 <= z$w_buff1 && z$w_buff1 <= 1) && (z$w_buff1 == 0 || z$w_buff1 == 1))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p3_EBX) + (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_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_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_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_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_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_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_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$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$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$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$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_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (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_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) && (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_p2_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p3_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p3_EBX >= 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_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_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_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_p3_EAX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_p3_EBX >= 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_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_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_p2_EBX + (long long )__unbuffered_p3_EAX >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )__unbuffered_p3_EBX >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )__unbuffered_p3_EBX >= 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_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 )__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 )__unbuffered_p3_EBX + (long long )a >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p3_EBX + (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_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 )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_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 )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_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 )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_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 )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_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 + (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_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$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_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$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_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_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_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_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_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_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_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_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd3 + (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$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$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$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$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$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_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$$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_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) && (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_EBX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )__unbuffered_p3_EBX >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )__unbuffered_p3_EBX >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_p3_EAX) - (long long )__unbuffered_p3_EBX >= 0LL) && (1LL + (long long )__unbuffered_p3_EAX) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_p3_EBX) - (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_EBX) - (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (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_EBX) - (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_p2_EBX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (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 )__unbuffered_p3_EBX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p3_EBX - (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_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 )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 <= a && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= __unbuffered_p3_EAX) && 0 <= __unbuffered_p3_EBX) && 0 <= a) && 0 <= x) && 0 <= y) && 0 <= z) && 0 <= z$mem_tmp) && 0 <= z$w_buff0) && 0 <= z$w_buff1) && __unbuffered_p2_EBX <= 1) && __unbuffered_p3_EAX <= 1) && __unbuffered_p3_EBX <= 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_EBX == 0 || __unbuffered_p2_EBX == 1)) && (__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1)) && (__unbuffered_p3_EBX == 0 || __unbuffered_p3_EBX == 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)) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)) && ((x == 0 || x == 1) || x == 2)) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || z$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || (0 <= __unbuffered_p2_EAX && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)))) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p3_EAX && __unbuffered_p3_EAX <= 1) && (__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1)))) && (! multithreaded || ((0 <= z$w_buff0 && z$w_buff0 <= 1) && (z$w_buff0 == 0 || z$w_buff0 == 1)))) && (! multithreaded || z$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || z$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || z$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || ((0 <= __unbuffered_p3_EBX && __unbuffered_p3_EBX <= 1) && (__unbuffered_p3_EBX == 0 || __unbuffered_p3_EBX == 1)))) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || z$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || z$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= z$mem_tmp && z$mem_tmp <= 1) && (z$mem_tmp == 0 || z$mem_tmp == 1)))
[2024-06-14 14:29:33,578 INFO  L103   edCorrectnessWitness]: ghost_variable multithreaded = 0
[2024-06-14 14:29:33,578 INFO  L106   edCorrectnessWitness]: ghost_update [L868-L868] multithreaded = 1;
[2024-06-14 14:29:33,620 INFO  L177         MainTranslator]: Built tables and reachable declarations
[2024-06-14 14:29:33,943 INFO  L207          PostProcessor]: Analyzing one entry point: main
[2024-06-14 14:29:33,953 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-14 14:29:34,293 INFO  L207          PostProcessor]: Analyzing one entry point: main
[2024-06-14 14:29:34,328 INFO  L206         MainTranslator]: Completed translation
[2024-06-14 14:29:34,329 INFO  L201        PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:29:34 WrapperNode
[2024-06-14 14:29:34,329 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-06-14 14:29:34,330 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-06-14 14:29:34,330 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-06-14 14:29:34,330 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-06-14 14:29:34,336 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:29:34" (1/1) ...
[2024-06-14 14:29:34,391 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:29:34" (1/1) ...
[2024-06-14 14:29:34,660 INFO  L138                Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 161
[2024-06-14 14:29:34,660 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-06-14 14:29:34,662 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-06-14 14:29:34,662 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-06-14 14:29:34,662 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-06-14 14:29:34,671 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:29:34" (1/1) ...
[2024-06-14 14:29:34,671 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:29:34" (1/1) ...
[2024-06-14 14:29:34,724 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:29:34" (1/1) ...
[2024-06-14 14:29:34,766 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-14 14:29:34,767 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:29:34" (1/1) ...
[2024-06-14 14:29:34,767 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:29:34" (1/1) ...
[2024-06-14 14:29:34,821 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:29:34" (1/1) ...
[2024-06-14 14:29:34,823 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:29:34" (1/1) ...
[2024-06-14 14:29:34,835 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:29:34" (1/1) ...
[2024-06-14 14:29:34,842 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:29:34" (1/1) ...
[2024-06-14 14:29:34,861 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-06-14 14:29:34,862 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-06-14 14:29:34,862 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-06-14 14:29:34,863 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-06-14 14:29:34,863 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:29:34" (1/1) ...
[2024-06-14 14:29:34,867 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-06-14 14:29:34,874 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-06-14 14:29:34,887 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-14 14:29:34,906 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-14 14:29:34,918 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2024-06-14 14:29:34,918 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-06-14 14:29:34,918 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2024-06-14 14:29:34,918 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2024-06-14 14:29:34,919 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2024-06-14 14:29:34,919 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2024-06-14 14:29:34,919 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2024-06-14 14:29:34,919 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2024-06-14 14:29:34,919 INFO  L130     BoogieDeclarations]: Found specification of procedure P3
[2024-06-14 14:29:34,919 INFO  L138     BoogieDeclarations]: Found implementation of procedure P3
[2024-06-14 14:29:34,919 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-06-14 14:29:34,920 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2024-06-14 14:29:34,920 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-06-14 14:29:34,920 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-06-14 14:29:34,921 WARN  L214             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement
[2024-06-14 14:29:35,116 INFO  L244             CfgBuilder]: Building ICFG
[2024-06-14 14:29:35,118 INFO  L270             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-06-14 14:29:36,967 INFO  L289             CfgBuilder]: Ommited future-live optimization because the input is a concurrent program.
[2024-06-14 14:29:36,968 INFO  L293             CfgBuilder]: Performing block encoding
[2024-06-14 14:29:37,374 INFO  L315             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-06-14 14:29:37,374 INFO  L320             CfgBuilder]: Removed 0 assume(true) statements.
[2024-06-14 14:29:37,374 INFO  L201        PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 02:29:37 BoogieIcfgContainer
[2024-06-14 14:29:37,374 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-06-14 14:29:37,377 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-06-14 14:29:37,377 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-06-14 14:29:37,379 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-06-14 14:29:37,379 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.06 02:29:33" (1/4) ...
[2024-06-14 14:29:37,380 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ce870b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.06 02:29:37, skipping insertion in model container
[2024-06-14 14:29:37,380 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 02:29:33" (2/4) ...
[2024-06-14 14:29:37,380 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ce870b9 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 14.06 02:29:37, skipping insertion in model container
[2024-06-14 14:29:37,380 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:29:34" (3/4) ...
[2024-06-14 14:29:37,381 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ce870b9 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 14.06 02:29:37, skipping insertion in model container
[2024-06-14 14:29:37,381 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 02:29:37" (4/4) ...
[2024-06-14 14:29:37,381 INFO  L112   eAbstractionObserver]: Analyzing ICFG mix008.opt.i
[2024-06-14 14:29:37,394 INFO  L204   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-06-14 14:29:37,394 INFO  L163   ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations.
[2024-06-14 14:29:37,394 INFO  L522   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-06-14 14:29:37,529 INFO  L144    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-06-14 14:29:37,556 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 67 places, 54 transitions, 124 flow
[2024-06-14 14:29:37,641 INFO  L124   PetriNetUnfolderBase]: 0/50 cut-off events.
[2024-06-14 14:29:37,641 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-06-14 14:29:37,644 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 63 conditions, 50 events. 0/50 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 90 event pairs, 0 based on Foata normal form. 0/46 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. 
[2024-06-14 14:29:37,644 INFO  L82        GeneralOperation]: Start removeDead. Operand has 67 places, 54 transitions, 124 flow
[2024-06-14 14:29:37,646 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 57 places, 44 transitions, 100 flow
[2024-06-14 14:29:37,663 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-06-14 14:29:37,668 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;@63d64475, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-06-14 14:29:37,668 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 8 error locations.
[2024-06-14 14:29:37,675 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-06-14 14:29:37,676 INFO  L124   PetriNetUnfolderBase]: 0/6 cut-off events.
[2024-06-14 14:29:37,676 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-06-14 14:29:37,676 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:29:37,676 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1]
[2024-06-14 14:29:37,677 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-14 14:29:37,681 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:29:37,681 INFO  L85        PathProgramCache]: Analyzing trace with hash 335012853, now seen corresponding path program 1 times
[2024-06-14 14:29:37,688 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:29:37,688 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559520109]
[2024-06-14 14:29:37,688 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:29:37,689 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:29:38,038 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:29:46,073 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-14 14:29:46,074 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:29:46,074 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559520109]
[2024-06-14 14:29:46,075 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559520109] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:29:46,075 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:29:46,075 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-06-14 14:29:46,076 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626644407]
[2024-06-14 14:29:46,077 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:29:46,083 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-06-14 14:29:46,086 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:29:46,106 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-06-14 14:29:46,107 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-06-14 14:29:46,202 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 16 out of 54
[2024-06-14 14:29:46,204 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 44 transitions, 100 flow. Second operand  has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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-14 14:29:46,205 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:29:46,205 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 54
[2024-06-14 14:29:46,205 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:29:50,117 INFO  L124   PetriNetUnfolderBase]: 7892/11216 cut-off events.
[2024-06-14 14:29:50,117 INFO  L125   PetriNetUnfolderBase]: For 152/152 co-relation queries the response was YES.
[2024-06-14 14:29:50,135 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 22295 conditions, 11216 events. 7892/11216 cut-off events. For 152/152 co-relation queries the response was YES. Maximal size of possible extension queue 421. Compared 63270 event pairs, 6010 based on Foata normal form. 1/10838 useless extension candidates. Maximal degree in co-relation 22279. Up to 10748 conditions per place. 
[2024-06-14 14:29:50,179 INFO  L140   encePairwiseOnDemand]: 45/54 looper letters, 44 selfloop transitions, 5 changer transitions 0/58 dead transitions.
[2024-06-14 14:29:50,179 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 58 transitions, 235 flow
[2024-06-14 14:29:50,180 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-06-14 14:29:50,182 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-06-14 14:29:50,187 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions.
[2024-06-14 14:29:50,189 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.6234567901234568
[2024-06-14 14:29:50,190 INFO  L175             Difference]: Start difference. First operand has 57 places, 44 transitions, 100 flow. Second operand 3 states and 101 transitions.
[2024-06-14 14:29:50,191 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 58 transitions, 235 flow
[2024-06-14 14:29:50,193 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 58 transitions, 228 flow, removed 0 selfloop flow, removed 4 redundant places.
[2024-06-14 14:29:50,198 INFO  L231             Difference]: Finished difference. Result has 56 places, 48 transitions, 135 flow
[2024-06-14 14:29:50,199 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=135, PETRI_PLACES=56, PETRI_TRANSITIONS=48}
[2024-06-14 14:29:50,201 INFO  L281   CegarLoopForPetriNet]: 57 programPoint places, -1 predicate places.
[2024-06-14 14:29:50,201 INFO  L495      AbstractCegarLoop]: Abstraction has has 56 places, 48 transitions, 135 flow
[2024-06-14 14:29:50,202 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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-14 14:29:50,202 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:29:50,202 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:29:50,202 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-06-14 14:29:50,203 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-14 14:29:50,203 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:29:50,204 INFO  L85        PathProgramCache]: Analyzing trace with hash -175142252, now seen corresponding path program 1 times
[2024-06-14 14:29:50,204 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:29:50,204 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898891836]
[2024-06-14 14:29:50,204 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:29:50,204 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:29:50,294 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:29:56,067 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-14 14:29:56,067 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:29:56,067 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898891836]
[2024-06-14 14:29:56,068 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898891836] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:29:56,068 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:29:56,068 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-06-14 14:29:56,068 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673238868]
[2024-06-14 14:29:56,069 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:29:56,070 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-06-14 14:29:56,070 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:29:56,071 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-06-14 14:29:56,071 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-06-14 14:29:56,228 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 15 out of 54
[2024-06-14 14:29:56,229 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 48 transitions, 135 flow. Second operand  has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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-14 14:29:56,229 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:29:56,229 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 54
[2024-06-14 14:29:56,229 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:30:00,195 INFO  L124   PetriNetUnfolderBase]: 9032/12527 cut-off events.
[2024-06-14 14:30:00,195 INFO  L125   PetriNetUnfolderBase]: For 2518/2518 co-relation queries the response was YES.
[2024-06-14 14:30:00,208 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 28442 conditions, 12527 events. 9032/12527 cut-off events. For 2518/2518 co-relation queries the response was YES. Maximal size of possible extension queue 463. Compared 68438 event pairs, 6162 based on Foata normal form. 4/12455 useless extension candidates. Maximal degree in co-relation 28427. Up to 12238 conditions per place. 
[2024-06-14 14:30:00,254 INFO  L140   encePairwiseOnDemand]: 44/54 looper letters, 55 selfloop transitions, 9 changer transitions 0/72 dead transitions.
[2024-06-14 14:30:00,254 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 72 transitions, 329 flow
[2024-06-14 14:30:00,255 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-06-14 14:30:00,255 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-06-14 14:30:00,256 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 128 transitions.
[2024-06-14 14:30:00,256 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5925925925925926
[2024-06-14 14:30:00,256 INFO  L175             Difference]: Start difference. First operand has 56 places, 48 transitions, 135 flow. Second operand 4 states and 128 transitions.
[2024-06-14 14:30:00,256 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 72 transitions, 329 flow
[2024-06-14 14:30:00,262 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 72 transitions, 324 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-06-14 14:30:00,263 INFO  L231             Difference]: Finished difference. Result has 59 places, 52 transitions, 183 flow
[2024-06-14 14:30:00,264 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=183, PETRI_PLACES=59, PETRI_TRANSITIONS=52}
[2024-06-14 14:30:00,264 INFO  L281   CegarLoopForPetriNet]: 57 programPoint places, 2 predicate places.
[2024-06-14 14:30:00,264 INFO  L495      AbstractCegarLoop]: Abstraction has has 59 places, 52 transitions, 183 flow
[2024-06-14 14:30:00,265 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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-14 14:30:00,265 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:30:00,265 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:30:00,265 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-06-14 14:30:00,265 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-14 14:30:00,266 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:30:00,266 INFO  L85        PathProgramCache]: Analyzing trace with hash -1134440792, now seen corresponding path program 1 times
[2024-06-14 14:30:00,266 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:30:00,266 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850679802]
[2024-06-14 14:30:00,266 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:30:00,266 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:30:00,335 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:30:06,779 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-14 14:30:06,779 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:30:06,779 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850679802]
[2024-06-14 14:30:06,779 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850679802] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:30:06,780 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:30:06,780 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-06-14 14:30:06,780 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594994822]
[2024-06-14 14:30:06,780 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:30:06,781 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-06-14 14:30:06,781 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:30:06,782 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-06-14 14:30:06,782 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20
[2024-06-14 14:30:06,898 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 15 out of 54
[2024-06-14 14:30:06,899 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 52 transitions, 183 flow. Second operand  has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 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-14 14:30:06,899 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:30:06,899 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 54
[2024-06-14 14:30:06,899 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:30:11,192 INFO  L124   PetriNetUnfolderBase]: 9050/12628 cut-off events.
[2024-06-14 14:30:11,192 INFO  L125   PetriNetUnfolderBase]: For 7273/7273 co-relation queries the response was YES.
[2024-06-14 14:30:11,205 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 31885 conditions, 12628 events. 9050/12628 cut-off events. For 7273/7273 co-relation queries the response was YES. Maximal size of possible extension queue 462. Compared 69843 event pairs, 4826 based on Foata normal form. 7/12608 useless extension candidates. Maximal degree in co-relation 31868. Up to 12159 conditions per place. 
[2024-06-14 14:30:11,246 INFO  L140   encePairwiseOnDemand]: 42/54 looper letters, 73 selfloop transitions, 21 changer transitions 0/102 dead transitions.
[2024-06-14 14:30:11,247 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 102 transitions, 545 flow
[2024-06-14 14:30:11,247 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-14 14:30:11,247 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-14 14:30:11,248 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 167 transitions.
[2024-06-14 14:30:11,248 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.6185185185185185
[2024-06-14 14:30:11,249 INFO  L175             Difference]: Start difference. First operand has 59 places, 52 transitions, 183 flow. Second operand 5 states and 167 transitions.
[2024-06-14 14:30:11,249 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 102 transitions, 545 flow
[2024-06-14 14:30:11,251 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 102 transitions, 526 flow, removed 3 selfloop flow, removed 2 redundant places.
[2024-06-14 14:30:11,252 INFO  L231             Difference]: Finished difference. Result has 64 places, 66 transitions, 314 flow
[2024-06-14 14:30:11,252 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=314, PETRI_PLACES=64, PETRI_TRANSITIONS=66}
[2024-06-14 14:30:11,253 INFO  L281   CegarLoopForPetriNet]: 57 programPoint places, 7 predicate places.
[2024-06-14 14:30:11,253 INFO  L495      AbstractCegarLoop]: Abstraction has has 64 places, 66 transitions, 314 flow
[2024-06-14 14:30:11,253 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 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-14 14:30:11,253 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:30:11,253 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:30:11,254 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-06-14 14:30:11,254 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-14 14:30:11,254 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:30:11,254 INFO  L85        PathProgramCache]: Analyzing trace with hash 724148263, now seen corresponding path program 1 times
[2024-06-14 14:30:11,254 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:30:11,255 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537034422]
[2024-06-14 14:30:11,255 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:30:11,255 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:30:11,297 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:30:18,198 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-14 14:30:18,199 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:30:18,203 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537034422]
[2024-06-14 14:30:18,206 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537034422] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:30:18,206 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:30:18,206 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-06-14 14:30:18,206 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774368231]
[2024-06-14 14:30:18,206 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:30:18,207 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-06-14 14:30:18,207 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:30:18,208 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-06-14 14:30:18,208 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2024-06-14 14:30:18,401 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 15 out of 54
[2024-06-14 14:30:18,403 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 66 transitions, 314 flow. Second operand  has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 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-14 14:30:18,403 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:30:18,403 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 54
[2024-06-14 14:30:18,403 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:30:22,755 INFO  L124   PetriNetUnfolderBase]: 9079/12673 cut-off events.
[2024-06-14 14:30:22,756 INFO  L125   PetriNetUnfolderBase]: For 17170/17175 co-relation queries the response was YES.
[2024-06-14 14:30:22,770 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 37381 conditions, 12673 events. 9079/12673 cut-off events. For 17170/17175 co-relation queries the response was YES. Maximal size of possible extension queue 463. Compared 70227 event pairs, 3910 based on Foata normal form. 18/12664 useless extension candidates. Maximal degree in co-relation 37361. Up to 12124 conditions per place. 
[2024-06-14 14:30:22,815 INFO  L140   encePairwiseOnDemand]: 42/54 looper letters, 80 selfloop transitions, 25 changer transitions 0/113 dead transitions.
[2024-06-14 14:30:22,816 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 113 transitions, 690 flow
[2024-06-14 14:30:22,816 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-14 14:30:22,816 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-14 14:30:22,817 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 193 transitions.
[2024-06-14 14:30:22,817 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.595679012345679
[2024-06-14 14:30:22,818 INFO  L175             Difference]: Start difference. First operand has 64 places, 66 transitions, 314 flow. Second operand 6 states and 193 transitions.
[2024-06-14 14:30:22,818 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 113 transitions, 690 flow
[2024-06-14 14:30:22,822 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 113 transitions, 678 flow, removed 6 selfloop flow, removed 0 redundant places.
[2024-06-14 14:30:22,824 INFO  L231             Difference]: Finished difference. Result has 69 places, 69 transitions, 391 flow
[2024-06-14 14:30:22,824 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=294, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=391, PETRI_PLACES=69, PETRI_TRANSITIONS=69}
[2024-06-14 14:30:22,824 INFO  L281   CegarLoopForPetriNet]: 57 programPoint places, 12 predicate places.
[2024-06-14 14:30:22,825 INFO  L495      AbstractCegarLoop]: Abstraction has has 69 places, 69 transitions, 391 flow
[2024-06-14 14:30:22,825 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 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-14 14:30:22,825 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:30:22,825 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:30:22,825 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-06-14 14:30:22,825 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-14 14:30:22,826 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:30:22,826 INFO  L85        PathProgramCache]: Analyzing trace with hash -391343180, now seen corresponding path program 1 times
[2024-06-14 14:30:22,826 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:30:22,826 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460323944]
[2024-06-14 14:30:22,826 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:30:22,826 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:30:22,858 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:30:37,793 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-14 14:30:37,794 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:30:37,794 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460323944]
[2024-06-14 14:30:37,794 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460323944] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:30:37,794 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:30:37,794 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-06-14 14:30:37,794 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849221435]
[2024-06-14 14:30:37,794 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:30:37,795 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-06-14 14:30:37,795 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:30:37,795 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-06-14 14:30:37,795 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2024-06-14 14:30:37,920 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 15 out of 54
[2024-06-14 14:30:37,920 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 69 transitions, 391 flow. Second operand  has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 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-14 14:30:37,920 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:30:37,920 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 54
[2024-06-14 14:30:37,920 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:30:41,744 INFO  L124   PetriNetUnfolderBase]: 7920/11331 cut-off events.
[2024-06-14 14:30:41,745 INFO  L125   PetriNetUnfolderBase]: For 22247/22247 co-relation queries the response was YES.
[2024-06-14 14:30:41,760 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 36248 conditions, 11331 events. 7920/11331 cut-off events. For 22247/22247 co-relation queries the response was YES. Maximal size of possible extension queue 423. Compared 64745 event pairs, 4036 based on Foata normal form. 3/11162 useless extension candidates. Maximal degree in co-relation 36225. Up to 10775 conditions per place. 
[2024-06-14 14:30:41,826 INFO  L140   encePairwiseOnDemand]: 44/54 looper letters, 67 selfloop transitions, 10 changer transitions 0/86 dead transitions.
[2024-06-14 14:30:41,826 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 86 transitions, 589 flow
[2024-06-14 14:30:41,827 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-14 14:30:41,827 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-14 14:30:41,828 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 137 transitions.
[2024-06-14 14:30:41,828 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5074074074074074
[2024-06-14 14:30:41,828 INFO  L175             Difference]: Start difference. First operand has 69 places, 69 transitions, 391 flow. Second operand 5 states and 137 transitions.
[2024-06-14 14:30:41,828 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 86 transitions, 589 flow
[2024-06-14 14:30:41,834 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 86 transitions, 520 flow, removed 12 selfloop flow, removed 4 redundant places.
[2024-06-14 14:30:41,836 INFO  L231             Difference]: Finished difference. Result has 70 places, 69 transitions, 353 flow
[2024-06-14 14:30:41,836 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=353, PETRI_PLACES=70, PETRI_TRANSITIONS=69}
[2024-06-14 14:30:41,836 INFO  L281   CegarLoopForPetriNet]: 57 programPoint places, 13 predicate places.
[2024-06-14 14:30:41,837 INFO  L495      AbstractCegarLoop]: Abstraction has has 70 places, 69 transitions, 353 flow
[2024-06-14 14:30:41,837 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 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-14 14:30:41,837 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:30:41,837 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:30:41,837 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-06-14 14:30:41,837 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-14 14:30:41,838 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:30:41,838 INFO  L85        PathProgramCache]: Analyzing trace with hash 719101608, now seen corresponding path program 1 times
[2024-06-14 14:30:41,838 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:30:41,838 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494653471]
[2024-06-14 14:30:41,838 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:30:41,838 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:30:41,870 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:30:58,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-14 14:30:58,984 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:30:58,985 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494653471]
[2024-06-14 14:30:58,985 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494653471] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:30:58,985 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:30:58,985 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-14 14:30:58,985 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825516969]
[2024-06-14 14:30:58,985 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:30:58,986 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-14 14:30:58,986 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:30:58,986 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-14 14:30:58,986 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-06-14 14:30:59,146 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 14 out of 54
[2024-06-14 14:30:59,147 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 69 transitions, 353 flow. Second operand  has 7 states, 7 states have (on average 15.571428571428571) internal successors, (109), 7 states have internal predecessors, (109), 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-14 14:30:59,147 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:30:59,147 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 54
[2024-06-14 14:30:59,147 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:31:04,016 INFO  L124   PetriNetUnfolderBase]: 9587/13502 cut-off events.
[2024-06-14 14:31:04,016 INFO  L125   PetriNetUnfolderBase]: For 29968/29968 co-relation queries the response was YES.
[2024-06-14 14:31:04,033 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 43616 conditions, 13502 events. 9587/13502 cut-off events. For 29968/29968 co-relation queries the response was YES. Maximal size of possible extension queue 492. Compared 75621 event pairs, 4724 based on Foata normal form. 5/13328 useless extension candidates. Maximal degree in co-relation 43591. Up to 12930 conditions per place. 
[2024-06-14 14:31:04,113 INFO  L140   encePairwiseOnDemand]: 42/54 looper letters, 84 selfloop transitions, 23 changer transitions 0/115 dead transitions.
[2024-06-14 14:31:04,114 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 115 transitions, 771 flow
[2024-06-14 14:31:04,114 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 14:31:04,114 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 14:31:04,115 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 187 transitions.
[2024-06-14 14:31:04,115 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4947089947089947
[2024-06-14 14:31:04,115 INFO  L175             Difference]: Start difference. First operand has 70 places, 69 transitions, 353 flow. Second operand 7 states and 187 transitions.
[2024-06-14 14:31:04,115 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 115 transitions, 771 flow
[2024-06-14 14:31:04,122 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 115 transitions, 742 flow, removed 3 selfloop flow, removed 4 redundant places.
[2024-06-14 14:31:04,123 INFO  L231             Difference]: Finished difference. Result has 75 places, 83 transitions, 497 flow
[2024-06-14 14:31:04,123 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=497, PETRI_PLACES=75, PETRI_TRANSITIONS=83}
[2024-06-14 14:31:04,124 INFO  L281   CegarLoopForPetriNet]: 57 programPoint places, 18 predicate places.
[2024-06-14 14:31:04,124 INFO  L495      AbstractCegarLoop]: Abstraction has has 75 places, 83 transitions, 497 flow
[2024-06-14 14:31:04,124 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 15.571428571428571) internal successors, (109), 7 states have internal predecessors, (109), 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-14 14:31:04,124 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:31:04,124 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:31:04,125 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-06-14 14:31:04,125 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-14 14:31:04,125 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:31:04,125 INFO  L85        PathProgramCache]: Analyzing trace with hash 41137883, now seen corresponding path program 1 times
[2024-06-14 14:31:04,125 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:31:04,125 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666769764]
[2024-06-14 14:31:04,126 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:31:04,126 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:31:04,160 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:31:17,993 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-14 14:31:17,994 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:31:17,994 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666769764]
[2024-06-14 14:31:17,994 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666769764] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:31:18,002 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:31:18,002 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-14 14:31:18,002 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749973706]
[2024-06-14 14:31:18,002 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:31:18,003 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-14 14:31:18,003 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:31:18,004 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-14 14:31:18,004 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-06-14 14:31:18,224 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 14 out of 54
[2024-06-14 14:31:18,225 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 83 transitions, 497 flow. Second operand  has 7 states, 7 states have (on average 15.571428571428571) internal successors, (109), 7 states have internal predecessors, (109), 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-14 14:31:18,225 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:31:18,225 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 54
[2024-06-14 14:31:18,225 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:31:23,530 INFO  L124   PetriNetUnfolderBase]: 10390/14515 cut-off events.
[2024-06-14 14:31:23,531 INFO  L125   PetriNetUnfolderBase]: For 52836/52852 co-relation queries the response was YES.
[2024-06-14 14:31:23,552 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 52887 conditions, 14515 events. 10390/14515 cut-off events. For 52836/52852 co-relation queries the response was YES. Maximal size of possible extension queue 557. Compared 81581 event pairs, 5061 based on Foata normal form. 14/14433 useless extension candidates. Maximal degree in co-relation 52860. Up to 13936 conditions per place. 
[2024-06-14 14:31:23,601 INFO  L140   encePairwiseOnDemand]: 42/54 looper letters, 81 selfloop transitions, 25 changer transitions 0/117 dead transitions.
[2024-06-14 14:31:23,601 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 117 transitions, 852 flow
[2024-06-14 14:31:23,601 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-14 14:31:23,602 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-14 14:31:23,602 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 168 transitions.
[2024-06-14 14:31:23,602 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5185185185185185
[2024-06-14 14:31:23,602 INFO  L175             Difference]: Start difference. First operand has 75 places, 83 transitions, 497 flow. Second operand 6 states and 168 transitions.
[2024-06-14 14:31:23,603 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 117 transitions, 852 flow
[2024-06-14 14:31:23,620 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 117 transitions, 819 flow, removed 13 selfloop flow, removed 2 redundant places.
[2024-06-14 14:31:23,622 INFO  L231             Difference]: Finished difference. Result has 79 places, 87 transitions, 560 flow
[2024-06-14 14:31:23,622 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=464, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=560, PETRI_PLACES=79, PETRI_TRANSITIONS=87}
[2024-06-14 14:31:23,622 INFO  L281   CegarLoopForPetriNet]: 57 programPoint places, 22 predicate places.
[2024-06-14 14:31:23,623 INFO  L495      AbstractCegarLoop]: Abstraction has has 79 places, 87 transitions, 560 flow
[2024-06-14 14:31:23,623 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 15.571428571428571) internal successors, (109), 7 states have internal predecessors, (109), 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-14 14:31:23,623 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:31:23,623 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:31:23,623 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-06-14 14:31:23,623 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-14 14:31:23,624 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:31:23,624 INFO  L85        PathProgramCache]: Analyzing trace with hash 1876377363, now seen corresponding path program 2 times
[2024-06-14 14:31:23,624 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:31:23,624 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031242944]
[2024-06-14 14:31:23,624 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:31:23,624 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:31:23,656 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:31:41,536 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-14 14:31:41,536 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:31:41,536 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031242944]
[2024-06-14 14:31:41,537 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031242944] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:31:41,537 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:31:41,537 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-14 14:31:41,537 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643949804]
[2024-06-14 14:31:41,537 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:31:41,537 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-14 14:31:41,538 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:31:41,538 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-14 14:31:41,538 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-06-14 14:31:41,753 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 14 out of 54
[2024-06-14 14:31:41,754 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 87 transitions, 560 flow. Second operand  has 7 states, 7 states have (on average 15.571428571428571) internal successors, (109), 7 states have internal predecessors, (109), 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-14 14:31:41,754 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:31:41,754 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 54
[2024-06-14 14:31:41,754 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:31:46,895 INFO  L124   PetriNetUnfolderBase]: 10366/14474 cut-off events.
[2024-06-14 14:31:46,895 INFO  L125   PetriNetUnfolderBase]: For 58043/58049 co-relation queries the response was YES.
[2024-06-14 14:31:46,917 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 53268 conditions, 14474 events. 10366/14474 cut-off events. For 58043/58049 co-relation queries the response was YES. Maximal size of possible extension queue 557. Compared 81284 event pairs, 5054 based on Foata normal form. 3/14382 useless extension candidates. Maximal degree in co-relation 53239. Up to 13906 conditions per place. 
[2024-06-14 14:31:46,966 INFO  L140   encePairwiseOnDemand]: 42/54 looper letters, 90 selfloop transitions, 27 changer transitions 0/128 dead transitions.
[2024-06-14 14:31:46,967 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 128 transitions, 900 flow
[2024-06-14 14:31:46,967 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 14:31:46,967 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 14:31:46,968 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 214 transitions.
[2024-06-14 14:31:46,968 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.49537037037037035
[2024-06-14 14:31:46,968 INFO  L175             Difference]: Start difference. First operand has 79 places, 87 transitions, 560 flow. Second operand 8 states and 214 transitions.
[2024-06-14 14:31:46,969 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 128 transitions, 900 flow
[2024-06-14 14:31:46,988 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 128 transitions, 857 flow, removed 7 selfloop flow, removed 3 redundant places.
[2024-06-14 14:31:46,990 INFO  L231             Difference]: Finished difference. Result has 84 places, 87 transitions, 582 flow
[2024-06-14 14:31:46,990 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=517, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=582, PETRI_PLACES=84, PETRI_TRANSITIONS=87}
[2024-06-14 14:31:46,991 INFO  L281   CegarLoopForPetriNet]: 57 programPoint places, 27 predicate places.
[2024-06-14 14:31:46,991 INFO  L495      AbstractCegarLoop]: Abstraction has has 84 places, 87 transitions, 582 flow
[2024-06-14 14:31:46,991 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 15.571428571428571) internal successors, (109), 7 states have internal predecessors, (109), 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-14 14:31:46,991 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:31:46,992 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:31:46,992 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-06-14 14:31:46,992 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-14 14:31:46,992 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:31:46,992 INFO  L85        PathProgramCache]: Analyzing trace with hash -610406743, now seen corresponding path program 1 times
[2024-06-14 14:31:46,992 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:31:46,993 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671221333]
[2024-06-14 14:31:46,993 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:31:46,993 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:31:47,023 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:32:05,585 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-14 14:32:05,586 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:32:05,586 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671221333]
[2024-06-14 14:32:05,586 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671221333] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:32:05,586 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:32:05,586 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 14:32:05,587 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298204736]
[2024-06-14 14:32:05,587 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:32:05,588 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 14:32:05,588 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:32:05,588 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 14:32:05,589 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2024-06-14 14:32:05,835 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 54
[2024-06-14 14:32:05,836 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 87 transitions, 582 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-14 14:32:05,836 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:32:05,836 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 54
[2024-06-14 14:32:05,836 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:32:11,367 INFO  L124   PetriNetUnfolderBase]: 11149/15496 cut-off events.
[2024-06-14 14:32:11,368 INFO  L125   PetriNetUnfolderBase]: For 71661/71661 co-relation queries the response was YES.
[2024-06-14 14:32:11,392 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 57922 conditions, 15496 events. 11149/15496 cut-off events. For 71661/71661 co-relation queries the response was YES. Maximal size of possible extension queue 553. Compared 86778 event pairs, 4952 based on Foata normal form. 10/15499 useless extension candidates. Maximal degree in co-relation 57892. Up to 14556 conditions per place. 
[2024-06-14 14:32:11,449 INFO  L140   encePairwiseOnDemand]: 40/54 looper letters, 102 selfloop transitions, 46 changer transitions 0/155 dead transitions.
[2024-06-14 14:32:11,450 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 155 transitions, 1252 flow
[2024-06-14 14:32:11,453 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 14:32:11,453 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 14:32:11,454 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 223 transitions.
[2024-06-14 14:32:11,454 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5162037037037037
[2024-06-14 14:32:11,455 INFO  L175             Difference]: Start difference. First operand has 84 places, 87 transitions, 582 flow. Second operand 8 states and 223 transitions.
[2024-06-14 14:32:11,455 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 155 transitions, 1252 flow
[2024-06-14 14:32:11,500 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 155 transitions, 1166 flow, removed 4 selfloop flow, removed 8 redundant places.
[2024-06-14 14:32:11,502 INFO  L231             Difference]: Finished difference. Result has 86 places, 104 transitions, 769 flow
[2024-06-14 14:32:11,502 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=496, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=769, PETRI_PLACES=86, PETRI_TRANSITIONS=104}
[2024-06-14 14:32:11,502 INFO  L281   CegarLoopForPetriNet]: 57 programPoint places, 29 predicate places.
[2024-06-14 14:32:11,503 INFO  L495      AbstractCegarLoop]: Abstraction has has 86 places, 104 transitions, 769 flow
[2024-06-14 14:32:11,503 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-14 14:32:11,503 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:32:11,503 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:32:11,503 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-06-14 14:32:11,503 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-14 14:32:11,504 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:32:11,504 INFO  L85        PathProgramCache]: Analyzing trace with hash 1280311315, now seen corresponding path program 2 times
[2024-06-14 14:32:11,504 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:32:11,504 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814499155]
[2024-06-14 14:32:11,504 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:32:11,504 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:32:11,534 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:32:30,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-14 14:32:30,671 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:32:30,671 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814499155]
[2024-06-14 14:32:30,671 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814499155] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:32:30,671 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:32:30,671 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 14:32:30,671 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485143221]
[2024-06-14 14:32:30,671 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:32:30,671 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 14:32:30,672 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:32:30,672 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 14:32:30,672 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2024-06-14 14:32:30,957 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 54
[2024-06-14 14:32:30,958 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 104 transitions, 769 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-14 14:32:30,958 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:32:30,958 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 54
[2024-06-14 14:32:30,958 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:32:36,672 INFO  L124   PetriNetUnfolderBase]: 11192/15561 cut-off events.
[2024-06-14 14:32:36,672 INFO  L125   PetriNetUnfolderBase]: For 101947/101947 co-relation queries the response was YES.
[2024-06-14 14:32:36,703 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 66036 conditions, 15561 events. 11192/15561 cut-off events. For 101947/101947 co-relation queries the response was YES. Maximal size of possible extension queue 553. Compared 87011 event pairs, 4952 based on Foata normal form. 5/15559 useless extension candidates. Maximal degree in co-relation 66003. Up to 14583 conditions per place. 
[2024-06-14 14:32:36,767 INFO  L140   encePairwiseOnDemand]: 40/54 looper letters, 105 selfloop transitions, 55 changer transitions 0/167 dead transitions.
[2024-06-14 14:32:36,768 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 167 transitions, 1505 flow
[2024-06-14 14:32:36,768 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 14:32:36,768 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 14:32:36,769 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 224 transitions.
[2024-06-14 14:32:36,769 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5185185185185185
[2024-06-14 14:32:36,770 INFO  L175             Difference]: Start difference. First operand has 86 places, 104 transitions, 769 flow. Second operand 8 states and 224 transitions.
[2024-06-14 14:32:36,770 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 167 transitions, 1505 flow
[2024-06-14 14:32:36,822 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 167 transitions, 1425 flow, removed 29 selfloop flow, removed 3 redundant places.
[2024-06-14 14:32:36,824 INFO  L231             Difference]: Finished difference. Result has 92 places, 114 transitions, 934 flow
[2024-06-14 14:32:36,825 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=701, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=934, PETRI_PLACES=92, PETRI_TRANSITIONS=114}
[2024-06-14 14:32:36,825 INFO  L281   CegarLoopForPetriNet]: 57 programPoint places, 35 predicate places.
[2024-06-14 14:32:36,826 INFO  L495      AbstractCegarLoop]: Abstraction has has 92 places, 114 transitions, 934 flow
[2024-06-14 14:32:36,826 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-14 14:32:36,826 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:32:36,826 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:32:36,826 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-06-14 14:32:36,826 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-14 14:32:36,827 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:32:36,827 INFO  L85        PathProgramCache]: Analyzing trace with hash -1989934623, now seen corresponding path program 3 times
[2024-06-14 14:32:36,827 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:32:36,827 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062969564]
[2024-06-14 14:32:36,827 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:32:36,827 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:32:36,862 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:32:55,485 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-14 14:32:55,485 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:32:55,485 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062969564]
[2024-06-14 14:32:55,485 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062969564] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:32:55,485 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:32:55,485 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 14:32:55,485 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753988725]
[2024-06-14 14:32:55,485 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:32:55,486 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 14:32:55,486 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:32:55,486 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 14:32:55,486 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2024-06-14 14:32:55,682 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 54
[2024-06-14 14:32:55,682 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 114 transitions, 934 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-14 14:32:55,682 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:32:55,682 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 54
[2024-06-14 14:32:55,682 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:33:01,433 INFO  L124   PetriNetUnfolderBase]: 11204/15577 cut-off events.
[2024-06-14 14:33:01,433 INFO  L125   PetriNetUnfolderBase]: For 127842/127842 co-relation queries the response was YES.
[2024-06-14 14:33:01,458 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 70383 conditions, 15577 events. 11204/15577 cut-off events. For 127842/127842 co-relation queries the response was YES. Maximal size of possible extension queue 553. Compared 87133 event pairs, 4950 based on Foata normal form. 5/15575 useless extension candidates. Maximal degree in co-relation 70347. Up to 14596 conditions per place. 
[2024-06-14 14:33:01,518 INFO  L140   encePairwiseOnDemand]: 40/54 looper letters, 102 selfloop transitions, 66 changer transitions 0/175 dead transitions.
[2024-06-14 14:33:01,518 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 175 transitions, 1607 flow
[2024-06-14 14:33:01,519 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 14:33:01,519 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 14:33:01,520 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 246 transitions.
[2024-06-14 14:33:01,520 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5061728395061729
[2024-06-14 14:33:01,520 INFO  L175             Difference]: Start difference. First operand has 92 places, 114 transitions, 934 flow. Second operand 9 states and 246 transitions.
[2024-06-14 14:33:01,520 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 175 transitions, 1607 flow
[2024-06-14 14:33:01,586 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 175 transitions, 1498 flow, removed 18 selfloop flow, removed 4 redundant places.
[2024-06-14 14:33:01,588 INFO  L231             Difference]: Finished difference. Result has 97 places, 119 transitions, 1032 flow
[2024-06-14 14:33:01,588 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=830, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1032, PETRI_PLACES=97, PETRI_TRANSITIONS=119}
[2024-06-14 14:33:01,588 INFO  L281   CegarLoopForPetriNet]: 57 programPoint places, 40 predicate places.
[2024-06-14 14:33:01,589 INFO  L495      AbstractCegarLoop]: Abstraction has has 97 places, 119 transitions, 1032 flow
[2024-06-14 14:33:01,589 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-14 14:33:01,589 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:33:01,589 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:33:01,589 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-06-14 14:33:01,589 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-14 14:33:01,590 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:33:01,590 INFO  L85        PathProgramCache]: Analyzing trace with hash -433029145, now seen corresponding path program 1 times
[2024-06-14 14:33:01,590 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:33:01,590 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647092172]
[2024-06-14 14:33:01,590 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:33:01,590 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:33:01,620 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:33:20,423 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-14 14:33:20,423 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:33:20,423 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647092172]
[2024-06-14 14:33:20,424 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647092172] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:33:20,424 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:33:20,424 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 14:33:20,424 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495572396]
[2024-06-14 14:33:20,424 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:33:20,424 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 14:33:20,424 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:33:20,424 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 14:33:20,425 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-14 14:33:20,705 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 14 out of 54
[2024-06-14 14:33:20,706 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 119 transitions, 1032 flow. Second operand  has 8 states, 8 states have (on average 15.5) internal successors, (124), 8 states have internal predecessors, (124), 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-14 14:33:20,706 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:33:20,706 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 54
[2024-06-14 14:33:20,706 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:33:25,982 INFO  L124   PetriNetUnfolderBase]: 9829/13922 cut-off events.
[2024-06-14 14:33:25,982 INFO  L125   PetriNetUnfolderBase]: For 123437/123437 co-relation queries the response was YES.
[2024-06-14 14:33:26,009 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 64286 conditions, 13922 events. 9829/13922 cut-off events. For 123437/123437 co-relation queries the response was YES. Maximal size of possible extension queue 498. Compared 79562 event pairs, 4162 based on Foata normal form. 10/13841 useless extension candidates. Maximal degree in co-relation 64249. Up to 13198 conditions per place. 
[2024-06-14 14:33:26,068 INFO  L140   encePairwiseOnDemand]: 42/54 looper letters, 128 selfloop transitions, 27 changer transitions 0/163 dead transitions.
[2024-06-14 14:33:26,068 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 163 transitions, 1574 flow
[2024-06-14 14:33:26,068 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 14:33:26,069 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 14:33:26,069 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 213 transitions.
[2024-06-14 14:33:26,069 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4930555555555556
[2024-06-14 14:33:26,070 INFO  L175             Difference]: Start difference. First operand has 97 places, 119 transitions, 1032 flow. Second operand 8 states and 213 transitions.
[2024-06-14 14:33:26,070 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 163 transitions, 1574 flow
[2024-06-14 14:33:26,131 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 163 transitions, 1452 flow, removed 14 selfloop flow, removed 6 redundant places.
[2024-06-14 14:33:26,133 INFO  L231             Difference]: Finished difference. Result has 99 places, 123 transitions, 1027 flow
[2024-06-14 14:33:26,133 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=910, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1027, PETRI_PLACES=99, PETRI_TRANSITIONS=123}
[2024-06-14 14:33:26,134 INFO  L281   CegarLoopForPetriNet]: 57 programPoint places, 42 predicate places.
[2024-06-14 14:33:26,134 INFO  L495      AbstractCegarLoop]: Abstraction has has 99 places, 123 transitions, 1027 flow
[2024-06-14 14:33:26,134 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 15.5) internal successors, (124), 8 states have internal predecessors, (124), 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-14 14:33:26,134 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:33:26,134 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:33:26,135 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-06-14 14:33:26,135 INFO  L420      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] ===
[2024-06-14 14:33:26,135 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:33:26,135 INFO  L85        PathProgramCache]: Analyzing trace with hash -1670453981, now seen corresponding path program 1 times
[2024-06-14 14:33:26,135 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:33:26,135 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657256888]
[2024-06-14 14:33:26,136 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:33:26,136 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:33:26,173 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:33:46,783 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-14 14:33:46,784 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:33:46,784 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657256888]
[2024-06-14 14:33:46,784 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657256888] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:33:46,784 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:33:46,784 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-14 14:33:46,785 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312264134]
[2024-06-14 14:33:46,785 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:33:46,785 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-14 14:33:46,785 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:33:46,786 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-14 14:33:46,786 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-06-14 14:33:46,906 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 14 out of 54
[2024-06-14 14:33:46,907 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 123 transitions, 1027 flow. Second operand  has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:33:46,907 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:33:46,907 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 54
[2024-06-14 14:33:46,907 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:33:52,057 INFO  L124   PetriNetUnfolderBase]: 9822/13909 cut-off events.
[2024-06-14 14:33:52,057 INFO  L125   PetriNetUnfolderBase]: For 139286/139286 co-relation queries the response was YES.
[2024-06-14 14:33:52,104 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 66788 conditions, 13909 events. 9822/13909 cut-off events. For 139286/139286 co-relation queries the response was YES. Maximal size of possible extension queue 498. Compared 79478 event pairs, 4323 based on Foata normal form. 2/13818 useless extension candidates. Maximal degree in co-relation 66750. Up to 13313 conditions per place. 
[2024-06-14 14:33:52,178 INFO  L140   encePairwiseOnDemand]: 45/54 looper letters, 119 selfloop transitions, 10 changer transitions 0/137 dead transitions.
[2024-06-14 14:33:52,178 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 137 transitions, 1321 flow
[2024-06-14 14:33:52,179 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-14 14:33:52,179 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-14 14:33:52,179 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 129 transitions.
[2024-06-14 14:33:52,179 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4777777777777778
[2024-06-14 14:33:52,180 INFO  L175             Difference]: Start difference. First operand has 99 places, 123 transitions, 1027 flow. Second operand 5 states and 129 transitions.
[2024-06-14 14:33:52,180 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 137 transitions, 1321 flow
[2024-06-14 14:33:52,292 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 137 transitions, 1220 flow, removed 26 selfloop flow, removed 6 redundant places.
[2024-06-14 14:33:52,294 INFO  L231             Difference]: Finished difference. Result has 98 places, 123 transitions, 955 flow
[2024-06-14 14:33:52,294 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=926, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=955, PETRI_PLACES=98, PETRI_TRANSITIONS=123}
[2024-06-14 14:33:52,295 INFO  L281   CegarLoopForPetriNet]: 57 programPoint places, 41 predicate places.
[2024-06-14 14:33:52,295 INFO  L495      AbstractCegarLoop]: Abstraction has has 98 places, 123 transitions, 955 flow
[2024-06-14 14:33:52,295 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:33:52,295 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:33:52,296 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:33:52,296 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2024-06-14 14:33:52,296 INFO  L420      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] ===
[2024-06-14 14:33:52,296 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:33:52,296 INFO  L85        PathProgramCache]: Analyzing trace with hash 878853333, now seen corresponding path program 1 times
[2024-06-14 14:33:52,297 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:33:52,297 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531347740]
[2024-06-14 14:33:52,297 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:33:52,297 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:33:52,340 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:34:10,682 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:34:10,682 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:34:10,682 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531347740]
[2024-06-14 14:34:10,682 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531347740] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:34:10,683 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:34:10,683 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 14:34:10,683 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757412951]
[2024-06-14 14:34:10,683 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:34:10,683 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 14:34:10,683 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:34:10,684 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 14:34:10,684 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2024-06-14 14:34:10,910 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 54
[2024-06-14 14:34:10,911 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 123 transitions, 955 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-14 14:34:10,911 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:34:10,911 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 54
[2024-06-14 14:34:10,911 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:34:16,648 INFO  L124   PetriNetUnfolderBase]: 11260/15663 cut-off events.
[2024-06-14 14:34:16,648 INFO  L125   PetriNetUnfolderBase]: For 178037/178044 co-relation queries the response was YES.
[2024-06-14 14:34:16,682 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 76254 conditions, 15663 events. 11260/15663 cut-off events. For 178037/178044 co-relation queries the response was YES. Maximal size of possible extension queue 553. Compared 87750 event pairs, 5015 based on Foata normal form. 11/15663 useless extension candidates. Maximal degree in co-relation 76215. Up to 14663 conditions per place. 
[2024-06-14 14:34:16,745 INFO  L140   encePairwiseOnDemand]: 40/54 looper letters, 111 selfloop transitions, 67 changer transitions 0/185 dead transitions.
[2024-06-14 14:34:16,745 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 185 transitions, 1755 flow
[2024-06-14 14:34:16,748 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 14:34:16,748 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 14:34:16,749 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 226 transitions.
[2024-06-14 14:34:16,749 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5231481481481481
[2024-06-14 14:34:16,749 INFO  L175             Difference]: Start difference. First operand has 98 places, 123 transitions, 955 flow. Second operand 8 states and 226 transitions.
[2024-06-14 14:34:16,749 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 185 transitions, 1755 flow
[2024-06-14 14:34:16,823 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 185 transitions, 1735 flow, removed 0 selfloop flow, removed 4 redundant places.
[2024-06-14 14:34:16,826 INFO  L231             Difference]: Finished difference. Result has 104 places, 133 transitions, 1265 flow
[2024-06-14 14:34:16,826 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=935, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1265, PETRI_PLACES=104, PETRI_TRANSITIONS=133}
[2024-06-14 14:34:16,826 INFO  L281   CegarLoopForPetriNet]: 57 programPoint places, 47 predicate places.
[2024-06-14 14:34:16,827 INFO  L495      AbstractCegarLoop]: Abstraction has has 104 places, 133 transitions, 1265 flow
[2024-06-14 14:34:16,827 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-14 14:34:16,827 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:34:16,827 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:34:16,827 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2024-06-14 14:34:16,827 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-14 14:34:16,828 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:34:16,828 INFO  L85        PathProgramCache]: Analyzing trace with hash -1742738185, now seen corresponding path program 2 times
[2024-06-14 14:34:16,828 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:34:16,828 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051884767]
[2024-06-14 14:34:16,828 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:34:16,828 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:34:16,857 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:34:36,239 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:34:36,239 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:34:36,239 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051884767]
[2024-06-14 14:34:36,239 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051884767] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:34:36,240 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:34:36,240 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 14:34:36,240 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780605785]
[2024-06-14 14:34:36,240 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:34:36,240 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 14:34:36,245 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:34:36,245 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 14:34:36,245 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2024-06-14 14:34:36,485 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 54
[2024-06-14 14:34:36,485 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 133 transitions, 1265 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-14 14:34:36,485 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:34:36,485 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 54
[2024-06-14 14:34:36,485 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:34:42,250 INFO  L124   PetriNetUnfolderBase]: 11303/15736 cut-off events.
[2024-06-14 14:34:42,250 INFO  L125   PetriNetUnfolderBase]: For 209590/209597 co-relation queries the response was YES.
[2024-06-14 14:34:42,279 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 80983 conditions, 15736 events. 11303/15736 cut-off events. For 209590/209597 co-relation queries the response was YES. Maximal size of possible extension queue 553. Compared 88264 event pairs, 5015 based on Foata normal form. 11/15736 useless extension candidates. Maximal degree in co-relation 80941. Up to 14705 conditions per place. 
[2024-06-14 14:34:42,342 INFO  L140   encePairwiseOnDemand]: 41/54 looper letters, 109 selfloop transitions, 69 changer transitions 0/185 dead transitions.
[2024-06-14 14:34:42,342 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 185 transitions, 1965 flow
[2024-06-14 14:34:42,344 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 14:34:42,345 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 14:34:42,345 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 220 transitions.
[2024-06-14 14:34:42,345 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5092592592592593
[2024-06-14 14:34:42,345 INFO  L175             Difference]: Start difference. First operand has 104 places, 133 transitions, 1265 flow. Second operand 8 states and 220 transitions.
[2024-06-14 14:34:42,346 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 185 transitions, 1965 flow
[2024-06-14 14:34:42,459 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 185 transitions, 1861 flow, removed 19 selfloop flow, removed 4 redundant places.
[2024-06-14 14:34:42,461 INFO  L231             Difference]: Finished difference. Result has 108 places, 138 transitions, 1382 flow
[2024-06-14 14:34:42,461 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=1165, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1382, PETRI_PLACES=108, PETRI_TRANSITIONS=138}
[2024-06-14 14:34:42,462 INFO  L281   CegarLoopForPetriNet]: 57 programPoint places, 51 predicate places.
[2024-06-14 14:34:42,462 INFO  L495      AbstractCegarLoop]: Abstraction has has 108 places, 138 transitions, 1382 flow
[2024-06-14 14:34:42,462 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-14 14:34:42,462 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:34:42,462 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:34:42,462 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2024-06-14 14:34:42,463 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-14 14:34:42,463 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:34:42,463 INFO  L85        PathProgramCache]: Analyzing trace with hash -680207813, now seen corresponding path program 3 times
[2024-06-14 14:34:42,463 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:34:42,463 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848401744]
[2024-06-14 14:34:42,463 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:34:42,463 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:34:42,492 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:35:00,680 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-14 14:35:00,681 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:35:00,681 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848401744]
[2024-06-14 14:35:00,683 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848401744] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:35:00,683 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:35:00,683 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 14:35:00,683 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698634827]
[2024-06-14 14:35:00,683 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:35:00,684 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 14:35:00,684 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:35:00,684 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 14:35:00,689 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2024-06-14 14:35:00,871 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 54
[2024-06-14 14:35:00,872 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 138 transitions, 1382 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-14 14:35:00,872 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:35:00,872 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 54
[2024-06-14 14:35:00,872 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:35:06,563 INFO  L124   PetriNetUnfolderBase]: 11315/15759 cut-off events.
[2024-06-14 14:35:06,563 INFO  L125   PetriNetUnfolderBase]: For 228288/228295 co-relation queries the response was YES.
[2024-06-14 14:35:06,599 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 82135 conditions, 15759 events. 11315/15759 cut-off events. For 228288/228295 co-relation queries the response was YES. Maximal size of possible extension queue 553. Compared 88495 event pairs, 5015 based on Foata normal form. 11/15759 useless extension candidates. Maximal degree in co-relation 82093. Up to 14722 conditions per place. 
[2024-06-14 14:35:06,669 INFO  L140   encePairwiseOnDemand]: 41/54 looper letters, 105 selfloop transitions, 74 changer transitions 0/186 dead transitions.
[2024-06-14 14:35:06,669 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 186 transitions, 1984 flow
[2024-06-14 14:35:06,671 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 14:35:06,671 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 14:35:06,672 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 217 transitions.
[2024-06-14 14:35:06,672 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5023148148148148
[2024-06-14 14:35:06,672 INFO  L175             Difference]: Start difference. First operand has 108 places, 138 transitions, 1382 flow. Second operand 8 states and 217 transitions.
[2024-06-14 14:35:06,672 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 186 transitions, 1984 flow
[2024-06-14 14:35:06,794 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 186 transitions, 1856 flow, removed 15 selfloop flow, removed 5 redundant places.
[2024-06-14 14:35:06,798 INFO  L231             Difference]: Finished difference. Result has 111 places, 143 transitions, 1490 flow
[2024-06-14 14:35:06,798 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=1258, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1490, PETRI_PLACES=111, PETRI_TRANSITIONS=143}
[2024-06-14 14:35:06,799 INFO  L281   CegarLoopForPetriNet]: 57 programPoint places, 54 predicate places.
[2024-06-14 14:35:06,799 INFO  L495      AbstractCegarLoop]: Abstraction has has 111 places, 143 transitions, 1490 flow
[2024-06-14 14:35:06,799 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-14 14:35:06,799 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:35:06,799 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:35:06,799 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2024-06-14 14:35:06,799 INFO  L420      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] ===
[2024-06-14 14:35:06,800 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:35:06,800 INFO  L85        PathProgramCache]: Analyzing trace with hash -271275543, now seen corresponding path program 1 times
[2024-06-14 14:35:06,800 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:35:06,800 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189556169]
[2024-06-14 14:35:06,800 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:35:06,800 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:35:06,838 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:35:29,137 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-14 14:35:29,138 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:35:29,138 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189556169]
[2024-06-14 14:35:29,138 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189556169] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:35:29,138 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:35:29,138 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 14:35:29,139 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932511524]
[2024-06-14 14:35:29,139 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:35:29,139 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 14:35:29,140 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:35:29,140 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 14:35:29,140 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56
[2024-06-14 14:35:29,365 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 14 out of 54
[2024-06-14 14:35:29,366 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 143 transitions, 1490 flow. Second operand  has 8 states, 8 states have (on average 15.75) internal successors, (126), 8 states have internal predecessors, (126), 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-14 14:35:29,366 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:35:29,366 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 54
[2024-06-14 14:35:29,366 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:35:34,258 INFO  L124   PetriNetUnfolderBase]: 9906/14192 cut-off events.
[2024-06-14 14:35:34,258 INFO  L125   PetriNetUnfolderBase]: For 214550/214550 co-relation queries the response was YES.
[2024-06-14 14:35:34,291 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 74601 conditions, 14192 events. 9906/14192 cut-off events. For 214550/214550 co-relation queries the response was YES. Maximal size of possible extension queue 505. Compared 81633 event pairs, 4285 based on Foata normal form. 4/14179 useless extension candidates. Maximal degree in co-relation 74558. Up to 13409 conditions per place. 
[2024-06-14 14:35:34,353 INFO  L140   encePairwiseOnDemand]: 44/54 looper letters, 144 selfloop transitions, 14 changer transitions 0/166 dead transitions.
[2024-06-14 14:35:34,354 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 166 transitions, 1894 flow
[2024-06-14 14:35:34,354 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-14 14:35:34,354 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-14 14:35:34,355 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 152 transitions.
[2024-06-14 14:35:34,355 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4691358024691358
[2024-06-14 14:35:34,355 INFO  L175             Difference]: Start difference. First operand has 111 places, 143 transitions, 1490 flow. Second operand 6 states and 152 transitions.
[2024-06-14 14:35:34,355 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 166 transitions, 1894 flow
[2024-06-14 14:35:34,469 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 166 transitions, 1762 flow, removed 16 selfloop flow, removed 5 redundant places.
[2024-06-14 14:35:34,471 INFO  L231             Difference]: Finished difference. Result has 112 places, 147 transitions, 1443 flow
[2024-06-14 14:35:34,472 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=1358, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1443, PETRI_PLACES=112, PETRI_TRANSITIONS=147}
[2024-06-14 14:35:34,472 INFO  L281   CegarLoopForPetriNet]: 57 programPoint places, 55 predicate places.
[2024-06-14 14:35:34,472 INFO  L495      AbstractCegarLoop]: Abstraction has has 112 places, 147 transitions, 1443 flow
[2024-06-14 14:35:34,472 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 15.75) internal successors, (126), 8 states have internal predecessors, (126), 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-14 14:35:34,472 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:35:34,473 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:35:34,473 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2024-06-14 14:35:34,473 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-14 14:35:34,473 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:35:34,473 INFO  L85        PathProgramCache]: Analyzing trace with hash 1691366924, now seen corresponding path program 1 times
[2024-06-14 14:35:34,473 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:35:34,474 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102499898]
[2024-06-14 14:35:34,474 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:35:34,474 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:35:34,505 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:35:54,525 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-14 14:35:54,525 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:35:54,525 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102499898]
[2024-06-14 14:35:54,525 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102499898] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:35:54,526 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:35:54,526 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 14:35:54,526 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894848583]
[2024-06-14 14:35:54,526 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:35:54,526 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 14:35:54,526 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:35:54,527 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 14:35:54,527 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-14 14:35:54,710 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 14 out of 54
[2024-06-14 14:35:54,711 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 147 transitions, 1443 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-14 14:35:54,711 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:35:54,711 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 54
[2024-06-14 14:35:54,711 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:36:00,259 INFO  L124   PetriNetUnfolderBase]: 10768/15090 cut-off events.
[2024-06-14 14:36:00,259 INFO  L125   PetriNetUnfolderBase]: For 271544/271583 co-relation queries the response was YES.
[2024-06-14 14:36:00,296 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 83951 conditions, 15090 events. 10768/15090 cut-off events. For 271544/271583 co-relation queries the response was YES. Maximal size of possible extension queue 542. Compared 85038 event pairs, 3662 based on Foata normal form. 28/15088 useless extension candidates. Maximal degree in co-relation 83907. Up to 14168 conditions per place. 
[2024-06-14 14:36:00,365 INFO  L140   encePairwiseOnDemand]: 43/54 looper letters, 138 selfloop transitions, 32 changer transitions 0/192 dead transitions.
[2024-06-14 14:36:00,365 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 192 transitions, 2095 flow
[2024-06-14 14:36:00,368 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 14:36:00,368 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 14:36:00,369 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 193 transitions.
[2024-06-14 14:36:00,369 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5105820105820106
[2024-06-14 14:36:00,369 INFO  L175             Difference]: Start difference. First operand has 112 places, 147 transitions, 1443 flow. Second operand 7 states and 193 transitions.
[2024-06-14 14:36:00,369 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 192 transitions, 2095 flow
[2024-06-14 14:36:00,507 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 192 transitions, 2040 flow, removed 16 selfloop flow, removed 4 redundant places.
[2024-06-14 14:36:00,509 INFO  L231             Difference]: Finished difference. Result has 115 places, 153 transitions, 1584 flow
[2024-06-14 14:36:00,510 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=1388, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1584, PETRI_PLACES=115, PETRI_TRANSITIONS=153}
[2024-06-14 14:36:00,510 INFO  L281   CegarLoopForPetriNet]: 57 programPoint places, 58 predicate places.
[2024-06-14 14:36:00,510 INFO  L495      AbstractCegarLoop]: Abstraction has has 115 places, 153 transitions, 1584 flow
[2024-06-14 14:36:00,510 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-14 14:36:00,511 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:36:00,511 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:36:00,511 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2024-06-14 14:36:00,511 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-14 14:36:00,511 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:36:00,511 INFO  L85        PathProgramCache]: Analyzing trace with hash 1694223884, now seen corresponding path program 2 times
[2024-06-14 14:36:00,511 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:36:00,512 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245772483]
[2024-06-14 14:36:00,512 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:36:00,512 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:36:00,541 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:36:19,157 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-14 14:36:19,158 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:36:19,159 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245772483]
[2024-06-14 14:36:19,159 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245772483] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:36:19,159 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:36:19,159 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 14:36:19,160 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941619673]
[2024-06-14 14:36:19,160 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:36:19,160 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 14:36:19,160 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:36:19,161 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 14:36:19,161 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-14 14:36:19,420 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 14 out of 54
[2024-06-14 14:36:19,420 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 153 transitions, 1584 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-14 14:36:19,421 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:36:19,421 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 54
[2024-06-14 14:36:19,421 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:36:24,950 INFO  L124   PetriNetUnfolderBase]: 10753/15069 cut-off events.
[2024-06-14 14:36:24,950 INFO  L125   PetriNetUnfolderBase]: For 303170/303209 co-relation queries the response was YES.
[2024-06-14 14:36:24,986 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 86569 conditions, 15069 events. 10753/15069 cut-off events. For 303170/303209 co-relation queries the response was YES. Maximal size of possible extension queue 542. Compared 84753 event pairs, 4376 based on Foata normal form. 28/15067 useless extension candidates. Maximal degree in co-relation 86524. Up to 14266 conditions per place. 
[2024-06-14 14:36:25,056 INFO  L140   encePairwiseOnDemand]: 42/54 looper letters, 138 selfloop transitions, 28 changer transitions 0/188 dead transitions.
[2024-06-14 14:36:25,056 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 188 transitions, 2006 flow
[2024-06-14 14:36:25,059 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 14:36:25,059 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 14:36:25,059 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 190 transitions.
[2024-06-14 14:36:25,060 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5026455026455027
[2024-06-14 14:36:25,060 INFO  L175             Difference]: Start difference. First operand has 115 places, 153 transitions, 1584 flow. Second operand 7 states and 190 transitions.
[2024-06-14 14:36:25,060 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 188 transitions, 2006 flow
[2024-06-14 14:36:25,269 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 188 transitions, 1883 flow, removed 49 selfloop flow, removed 3 redundant places.
[2024-06-14 14:36:25,271 INFO  L231             Difference]: Finished difference. Result has 119 places, 153 transitions, 1527 flow
[2024-06-14 14:36:25,272 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=1461, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1527, PETRI_PLACES=119, PETRI_TRANSITIONS=153}
[2024-06-14 14:36:25,272 INFO  L281   CegarLoopForPetriNet]: 57 programPoint places, 62 predicate places.
[2024-06-14 14:36:25,272 INFO  L495      AbstractCegarLoop]: Abstraction has has 119 places, 153 transitions, 1527 flow
[2024-06-14 14:36:25,273 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-14 14:36:25,273 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:36:25,273 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:36:25,273 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2024-06-14 14:36:25,273 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-14 14:36:25,273 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:36:25,274 INFO  L85        PathProgramCache]: Analyzing trace with hash 1474831166, now seen corresponding path program 1 times
[2024-06-14 14:36:25,274 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:36:25,274 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036641848]
[2024-06-14 14:36:25,274 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:36:25,274 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:36:25,304 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:36:46,031 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-14 14:36:46,031 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:36:46,031 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036641848]
[2024-06-14 14:36:46,031 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036641848] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:36:46,031 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:36:46,032 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 14:36:46,032 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701080820]
[2024-06-14 14:36:46,032 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:36:46,032 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 14:36:46,032 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:36:46,033 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 14:36:46,033 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-06-14 14:36:46,203 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 54
[2024-06-14 14:36:46,204 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 153 transitions, 1527 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-14 14:36:46,204 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:36:46,204 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 54
[2024-06-14 14:36:46,204 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:36:52,528 INFO  L124   PetriNetUnfolderBase]: 11647/16161 cut-off events.
[2024-06-14 14:36:52,529 INFO  L125   PetriNetUnfolderBase]: For 344725/344732 co-relation queries the response was YES.
[2024-06-14 14:36:52,575 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 93163 conditions, 16161 events. 11647/16161 cut-off events. For 344725/344732 co-relation queries the response was YES. Maximal size of possible extension queue 548. Compared 89664 event pairs, 4592 based on Foata normal form. 56/16215 useless extension candidates. Maximal degree in co-relation 93116. Up to 14890 conditions per place. 
[2024-06-14 14:36:52,816 INFO  L140   encePairwiseOnDemand]: 40/54 looper letters, 133 selfloop transitions, 75 changer transitions 0/215 dead transitions.
[2024-06-14 14:36:52,817 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 215 transitions, 2393 flow
[2024-06-14 14:36:52,819 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 14:36:52,819 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 14:36:52,820 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 251 transitions.
[2024-06-14 14:36:52,820 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5164609053497943
[2024-06-14 14:36:52,820 INFO  L175             Difference]: Start difference. First operand has 119 places, 153 transitions, 1527 flow. Second operand 9 states and 251 transitions.
[2024-06-14 14:36:52,820 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 215 transitions, 2393 flow
[2024-06-14 14:36:53,010 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 215 transitions, 2326 flow, removed 3 selfloop flow, removed 6 redundant places.
[2024-06-14 14:36:53,012 INFO  L231             Difference]: Finished difference. Result has 122 places, 157 transitions, 1700 flow
[2024-06-14 14:36:53,013 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=1460, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1700, PETRI_PLACES=122, PETRI_TRANSITIONS=157}
[2024-06-14 14:36:53,013 INFO  L281   CegarLoopForPetriNet]: 57 programPoint places, 65 predicate places.
[2024-06-14 14:36:53,013 INFO  L495      AbstractCegarLoop]: Abstraction has has 122 places, 157 transitions, 1700 flow
[2024-06-14 14:36:53,013 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-14 14:36:53,013 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:36:53,014 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:36:53,014 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2024-06-14 14:36:53,014 INFO  L420      AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] ===
[2024-06-14 14:36:53,014 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:36:53,014 INFO  L85        PathProgramCache]: Analyzing trace with hash 168953278, now seen corresponding path program 1 times
[2024-06-14 14:36:53,014 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:36:53,015 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005891083]
[2024-06-14 14:36:53,015 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:36:53,015 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:36:53,052 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:37:17,303 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-14 14:37:17,304 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:37:17,304 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005891083]
[2024-06-14 14:37:17,304 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005891083] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:37:17,304 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:37:17,304 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 14:37:17,304 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220726941]
[2024-06-14 14:37:17,304 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:37:17,304 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 14:37:17,304 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:37:17,305 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 14:37:17,305 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56
[2024-06-14 14:37:17,490 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 54
[2024-06-14 14:37:17,490 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 157 transitions, 1700 flow. Second operand  has 8 states, 8 states have (on average 14.75) internal successors, (118), 8 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:37:17,490 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:37:17,490 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 54
[2024-06-14 14:37:17,490 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:37:23,331 INFO  L124   PetriNetUnfolderBase]: 11663/16180 cut-off events.
[2024-06-14 14:37:23,331 INFO  L125   PetriNetUnfolderBase]: For 371981/371981 co-relation queries the response was YES.
[2024-06-14 14:37:23,377 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 97528 conditions, 16180 events. 11663/16180 cut-off events. For 371981/371981 co-relation queries the response was YES. Maximal size of possible extension queue 548. Compared 89660 event pairs, 4632 based on Foata normal form. 2/16181 useless extension candidates. Maximal degree in co-relation 97480. Up to 15758 conditions per place. 
[2024-06-14 14:37:23,460 INFO  L140   encePairwiseOnDemand]: 44/54 looper letters, 162 selfloop transitions, 22 changer transitions 0/191 dead transitions.
[2024-06-14 14:37:23,460 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 191 transitions, 2294 flow
[2024-06-14 14:37:23,461 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 14:37:23,461 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 14:37:23,461 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 176 transitions.
[2024-06-14 14:37:23,461 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4656084656084656
[2024-06-14 14:37:23,461 INFO  L175             Difference]: Start difference. First operand has 122 places, 157 transitions, 1700 flow. Second operand 7 states and 176 transitions.
[2024-06-14 14:37:23,461 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 191 transitions, 2294 flow
[2024-06-14 14:37:23,868 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 191 transitions, 2094 flow, removed 25 selfloop flow, removed 7 redundant places.
[2024-06-14 14:37:23,871 INFO  L231             Difference]: Finished difference. Result has 122 places, 161 transitions, 1623 flow
[2024-06-14 14:37:23,872 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=1506, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1623, PETRI_PLACES=122, PETRI_TRANSITIONS=161}
[2024-06-14 14:37:23,872 INFO  L281   CegarLoopForPetriNet]: 57 programPoint places, 65 predicate places.
[2024-06-14 14:37:23,872 INFO  L495      AbstractCegarLoop]: Abstraction has has 122 places, 161 transitions, 1623 flow
[2024-06-14 14:37:23,873 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 14.75) internal successors, (118), 8 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:37:23,873 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:37:23,873 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:37:23,873 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2024-06-14 14:37:23,873 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-14 14:37:23,874 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:37:23,874 INFO  L85        PathProgramCache]: Analyzing trace with hash 462299782, now seen corresponding path program 2 times
[2024-06-14 14:37:23,874 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:37:23,874 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259953000]
[2024-06-14 14:37:23,874 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:37:23,874 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:37:23,923 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:37:45,141 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-14 14:37:45,142 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:37:45,142 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259953000]
[2024-06-14 14:37:45,142 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259953000] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:37:45,142 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:37:45,142 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 14:37:45,142 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131936258]
[2024-06-14 14:37:45,142 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:37:45,142 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 14:37:45,143 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:37:45,143 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 14:37:45,143 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-06-14 14:37:45,313 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 54
[2024-06-14 14:37:45,313 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 161 transitions, 1623 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-14 14:37:45,313 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:37:45,313 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 54
[2024-06-14 14:37:45,313 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:37:51,567 INFO  L124   PetriNetUnfolderBase]: 11734/16284 cut-off events.
[2024-06-14 14:37:51,567 INFO  L125   PetriNetUnfolderBase]: For 392368/392368 co-relation queries the response was YES.
[2024-06-14 14:37:51,609 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 97540 conditions, 16284 events. 11734/16284 cut-off events. For 392368/392368 co-relation queries the response was YES. Maximal size of possible extension queue 548. Compared 90365 event pairs, 4598 based on Foata normal form. 10/16293 useless extension candidates. Maximal degree in co-relation 97491. Up to 15266 conditions per place. 
[2024-06-14 14:37:51,688 INFO  L140   encePairwiseOnDemand]: 40/54 looper letters, 125 selfloop transitions, 86 changer transitions 0/218 dead transitions.
[2024-06-14 14:37:51,688 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 218 transitions, 2425 flow
[2024-06-14 14:37:51,691 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 14:37:51,691 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 14:37:51,692 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 246 transitions.
[2024-06-14 14:37:51,692 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5061728395061729
[2024-06-14 14:37:51,692 INFO  L175             Difference]: Start difference. First operand has 122 places, 161 transitions, 1623 flow. Second operand 9 states and 246 transitions.
[2024-06-14 14:37:51,692 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 218 transitions, 2425 flow
[2024-06-14 14:37:51,927 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 218 transitions, 2232 flow, removed 18 selfloop flow, removed 7 redundant places.
[2024-06-14 14:37:51,929 INFO  L231             Difference]: Finished difference. Result has 124 places, 165 transitions, 1699 flow
[2024-06-14 14:37:51,929 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=1430, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1699, PETRI_PLACES=124, PETRI_TRANSITIONS=165}
[2024-06-14 14:37:51,930 INFO  L281   CegarLoopForPetriNet]: 57 programPoint places, 67 predicate places.
[2024-06-14 14:37:51,930 INFO  L495      AbstractCegarLoop]: Abstraction has has 124 places, 165 transitions, 1699 flow
[2024-06-14 14:37:51,930 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-14 14:37:51,931 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:37:51,931 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:37:51,931 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2024-06-14 14:37:51,931 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-14 14:37:51,931 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:37:51,931 INFO  L85        PathProgramCache]: Analyzing trace with hash -2039907984, now seen corresponding path program 3 times
[2024-06-14 14:37:51,931 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:37:51,932 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242850693]
[2024-06-14 14:37:51,932 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:37:51,932 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:37:51,963 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:38:11,817 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-14 14:38:11,818 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:38:11,818 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242850693]
[2024-06-14 14:38:11,818 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242850693] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:38:11,818 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:38:11,818 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 14:38:11,818 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314598328]
[2024-06-14 14:38:11,818 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:38:11,818 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 14:38:11,819 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:38:11,819 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 14:38:11,819 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-14 14:38:12,104 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 54
[2024-06-14 14:38:12,104 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 165 transitions, 1699 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-14 14:38:12,104 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:38:12,104 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 54
[2024-06-14 14:38:12,104 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:38:18,459 INFO  L124   PetriNetUnfolderBase]: 11844/16438 cut-off events.
[2024-06-14 14:38:18,460 INFO  L125   PetriNetUnfolderBase]: For 432484/432484 co-relation queries the response was YES.
[2024-06-14 14:38:18,504 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 102591 conditions, 16438 events. 11844/16438 cut-off events. For 432484/432484 co-relation queries the response was YES. Maximal size of possible extension queue 548. Compared 91283 event pairs, 4161 based on Foata normal form. 10/16447 useless extension candidates. Maximal degree in co-relation 102541. Up to 14916 conditions per place. 
[2024-06-14 14:38:18,587 INFO  L140   encePairwiseOnDemand]: 40/54 looper letters, 125 selfloop transitions, 101 changer transitions 0/233 dead transitions.
[2024-06-14 14:38:18,588 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 233 transitions, 2781 flow
[2024-06-14 14:38:18,590 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 14:38:18,590 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 14:38:18,591 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 253 transitions.
[2024-06-14 14:38:18,591 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5205761316872428
[2024-06-14 14:38:18,591 INFO  L175             Difference]: Start difference. First operand has 124 places, 165 transitions, 1699 flow. Second operand 9 states and 253 transitions.
[2024-06-14 14:38:18,591 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 233 transitions, 2781 flow
[2024-06-14 14:38:18,850 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 233 transitions, 2544 flow, removed 35 selfloop flow, removed 7 redundant places.
[2024-06-14 14:38:18,853 INFO  L231             Difference]: Finished difference. Result has 126 places, 173 transitions, 1855 flow
[2024-06-14 14:38:18,853 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=1462, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=97, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1855, PETRI_PLACES=126, PETRI_TRANSITIONS=173}
[2024-06-14 14:38:18,854 INFO  L281   CegarLoopForPetriNet]: 57 programPoint places, 69 predicate places.
[2024-06-14 14:38:18,854 INFO  L495      AbstractCegarLoop]: Abstraction has has 126 places, 173 transitions, 1855 flow
[2024-06-14 14:38:18,854 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-14 14:38:18,854 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:38:18,854 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:38:18,854 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2024-06-14 14:38:18,854 INFO  L420      AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] ===
[2024-06-14 14:38:18,855 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:38:18,855 INFO  L85        PathProgramCache]: Analyzing trace with hash 2018587282, now seen corresponding path program 4 times
[2024-06-14 14:38:18,855 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:38:18,855 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441941319]
[2024-06-14 14:38:18,855 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:38:18,855 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:38:18,887 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:38:40,155 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-14 14:38:40,156 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:38:40,156 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441941319]
[2024-06-14 14:38:40,156 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441941319] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:38:40,156 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:38:40,157 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 14:38:40,157 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927105833]
[2024-06-14 14:38:40,157 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:38:40,157 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 14:38:40,158 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:38:40,158 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 14:38:40,158 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-06-14 14:38:40,294 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 54
[2024-06-14 14:38:40,295 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 173 transitions, 1855 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-14 14:38:40,295 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:38:40,295 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 54
[2024-06-14 14:38:40,297 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:38:47,620 INFO  L124   PetriNetUnfolderBase]: 11825/16413 cut-off events.
[2024-06-14 14:38:47,621 INFO  L125   PetriNetUnfolderBase]: For 473858/473858 co-relation queries the response was YES.
[2024-06-14 14:38:47,663 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 105452 conditions, 16413 events. 11825/16413 cut-off events. For 473858/473858 co-relation queries the response was YES. Maximal size of possible extension queue 548. Compared 91182 event pairs, 4602 based on Foata normal form. 10/16422 useless extension candidates. Maximal degree in co-relation 105401. Up to 15395 conditions per place. 
[2024-06-14 14:38:47,754 INFO  L140   encePairwiseOnDemand]: 40/54 looper letters, 140 selfloop transitions, 81 changer transitions 0/228 dead transitions.
[2024-06-14 14:38:47,754 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 228 transitions, 2711 flow
[2024-06-14 14:38:47,757 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 14:38:47,757 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 14:38:47,757 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 247 transitions.
[2024-06-14 14:38:47,757 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5082304526748971
[2024-06-14 14:38:47,758 INFO  L175             Difference]: Start difference. First operand has 126 places, 173 transitions, 1855 flow. Second operand 9 states and 247 transitions.
[2024-06-14 14:38:47,758 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 228 transitions, 2711 flow
[2024-06-14 14:38:48,183 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 228 transitions, 2437 flow, removed 62 selfloop flow, removed 6 redundant places.
[2024-06-14 14:38:48,186 INFO  L231             Difference]: Finished difference. Result has 129 places, 173 transitions, 1754 flow
[2024-06-14 14:38:48,186 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=1581, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1754, PETRI_PLACES=129, PETRI_TRANSITIONS=173}
[2024-06-14 14:38:48,187 INFO  L281   CegarLoopForPetriNet]: 57 programPoint places, 72 predicate places.
[2024-06-14 14:38:48,187 INFO  L495      AbstractCegarLoop]: Abstraction has has 129 places, 173 transitions, 1754 flow
[2024-06-14 14:38:48,187 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-14 14:38:48,187 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:38:48,187 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:38:48,187 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2024-06-14 14:38:48,188 INFO  L420      AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] ===
[2024-06-14 14:38:48,189 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:38:48,189 INFO  L85        PathProgramCache]: Analyzing trace with hash 180381118, now seen corresponding path program 2 times
[2024-06-14 14:38:48,189 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:38:48,189 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768965733]
[2024-06-14 14:38:48,189 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:38:48,190 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:38:48,253 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:39:12,343 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-14 14:39:12,344 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:39:12,344 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768965733]
[2024-06-14 14:39:12,344 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768965733] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:39:12,344 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:39:12,344 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 14:39:12,344 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172497594]
[2024-06-14 14:39:12,344 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:39:12,345 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 14:39:12,345 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:39:12,345 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 14:39:12,345 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56
[2024-06-14 14:39:12,482 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 54
[2024-06-14 14:39:12,482 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 173 transitions, 1754 flow. Second operand  has 8 states, 8 states have (on average 14.75) internal successors, (118), 8 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:39:12,482 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:39:12,482 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 54
[2024-06-14 14:39:12,482 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:39:18,331 INFO  L124   PetriNetUnfolderBase]: 11818/16401 cut-off events.
[2024-06-14 14:39:18,332 INFO  L125   PetriNetUnfolderBase]: For 487302/487302 co-relation queries the response was YES.
[2024-06-14 14:39:18,382 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 105174 conditions, 16401 events. 11818/16401 cut-off events. For 487302/487302 co-relation queries the response was YES. Maximal size of possible extension queue 548. Compared 91000 event pairs, 4644 based on Foata normal form. 2/16402 useless extension candidates. Maximal degree in co-relation 105122. Up to 15981 conditions per place. 
[2024-06-14 14:39:18,465 INFO  L140   encePairwiseOnDemand]: 44/54 looper letters, 172 selfloop transitions, 22 changer transitions 0/201 dead transitions.
[2024-06-14 14:39:18,466 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 201 transitions, 2214 flow
[2024-06-14 14:39:18,466 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 14:39:18,466 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 14:39:18,466 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 174 transitions.
[2024-06-14 14:39:18,467 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4603174603174603
[2024-06-14 14:39:18,467 INFO  L175             Difference]: Start difference. First operand has 129 places, 173 transitions, 1754 flow. Second operand 7 states and 174 transitions.
[2024-06-14 14:39:18,467 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 201 transitions, 2214 flow
[2024-06-14 14:39:18,734 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 201 transitions, 1988 flow, removed 24 selfloop flow, removed 8 redundant places.
[2024-06-14 14:39:18,736 INFO  L231             Difference]: Finished difference. Result has 128 places, 173 transitions, 1581 flow
[2024-06-14 14:39:18,737 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=1528, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1581, PETRI_PLACES=128, PETRI_TRANSITIONS=173}
[2024-06-14 14:39:18,737 INFO  L281   CegarLoopForPetriNet]: 57 programPoint places, 71 predicate places.
[2024-06-14 14:39:18,737 INFO  L495      AbstractCegarLoop]: Abstraction has has 128 places, 173 transitions, 1581 flow
[2024-06-14 14:39:18,737 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 14.75) internal successors, (118), 8 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:39:18,737 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:39:18,737 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:39:18,738 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2024-06-14 14:39:18,738 INFO  L420      AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] ===
[2024-06-14 14:39:18,738 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:39:18,738 INFO  L85        PathProgramCache]: Analyzing trace with hash 174673150, now seen corresponding path program 1 times
[2024-06-14 14:39:18,738 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:39:18,738 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068396064]
[2024-06-14 14:39:18,738 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:39:18,739 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:39:18,775 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:39:43,911 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-14 14:39:43,911 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:39:43,912 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068396064]
[2024-06-14 14:39:43,912 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068396064] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:39:43,912 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:39:43,912 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 14:39:43,912 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310022899]
[2024-06-14 14:39:43,912 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:39:43,912 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 14:39:43,912 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:39:43,912 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 14:39:43,913 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56
[2024-06-14 14:39:44,208 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 14 out of 54
[2024-06-14 14:39:44,209 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 173 transitions, 1581 flow. Second operand  has 8 states, 8 states have (on average 15.75) internal successors, (126), 8 states have internal predecessors, (126), 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-14 14:39:44,209 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:39:44,209 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 54
[2024-06-14 14:39:44,209 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:39:49,939 INFO  L124   PetriNetUnfolderBase]: 10432/14915 cut-off events.
[2024-06-14 14:39:49,939 INFO  L125   PetriNetUnfolderBase]: For 438697/438697 co-relation queries the response was YES.
[2024-06-14 14:39:49,980 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 93840 conditions, 14915 events. 10432/14915 cut-off events. For 438697/438697 co-relation queries the response was YES. Maximal size of possible extension queue 509. Compared 86188 event pairs, 3966 based on Foata normal form. 4/14887 useless extension candidates. Maximal degree in co-relation 93787. Up to 14112 conditions per place. 
[2024-06-14 14:39:50,056 INFO  L140   encePairwiseOnDemand]: 43/54 looper letters, 176 selfloop transitions, 27 changer transitions 0/211 dead transitions.
[2024-06-14 14:39:50,057 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 211 transitions, 2225 flow
[2024-06-14 14:39:50,057 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 14:39:50,058 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 14:39:50,058 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 206 transitions.
[2024-06-14 14:39:50,058 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.47685185185185186
[2024-06-14 14:39:50,058 INFO  L175             Difference]: Start difference. First operand has 128 places, 173 transitions, 1581 flow. Second operand 8 states and 206 transitions.
[2024-06-14 14:39:50,058 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 211 transitions, 2225 flow
[2024-06-14 14:39:50,486 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 211 transitions, 2166 flow, removed 5 selfloop flow, removed 6 redundant places.
[2024-06-14 14:39:50,488 INFO  L231             Difference]: Finished difference. Result has 130 places, 177 transitions, 1641 flow
[2024-06-14 14:39:50,488 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=1522, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1641, PETRI_PLACES=130, PETRI_TRANSITIONS=177}
[2024-06-14 14:39:50,489 INFO  L281   CegarLoopForPetriNet]: 57 programPoint places, 73 predicate places.
[2024-06-14 14:39:50,489 INFO  L495      AbstractCegarLoop]: Abstraction has has 130 places, 177 transitions, 1641 flow
[2024-06-14 14:39:50,489 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 15.75) internal successors, (126), 8 states have internal predecessors, (126), 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-14 14:39:50,489 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:39:50,489 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:39:50,489 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2024-06-14 14:39:50,490 INFO  L420      AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] ===
[2024-06-14 14:39:50,490 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:39:50,490 INFO  L85        PathProgramCache]: Analyzing trace with hash 1011555970, now seen corresponding path program 2 times
[2024-06-14 14:39:50,490 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:39:50,490 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480507165]
[2024-06-14 14:39:50,490 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:39:50,491 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:39:50,528 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:40:15,329 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-14 14:40:15,329 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:40:15,329 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480507165]
[2024-06-14 14:40:15,329 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480507165] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:40:15,329 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:40:15,329 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 14:40:15,330 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251874196]
[2024-06-14 14:40:15,330 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:40:15,330 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 14:40:15,330 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:40:15,331 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 14:40:15,331 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56
[2024-06-14 14:40:15,556 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 14 out of 54
[2024-06-14 14:40:15,556 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 177 transitions, 1641 flow. Second operand  has 8 states, 8 states have (on average 15.75) internal successors, (126), 8 states have internal predecessors, (126), 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-14 14:40:15,556 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:40:15,556 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 54
[2024-06-14 14:40:15,556 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:40:21,287 INFO  L124   PetriNetUnfolderBase]: 10386/14845 cut-off events.
[2024-06-14 14:40:21,287 INFO  L125   PetriNetUnfolderBase]: For 462432/462432 co-relation queries the response was YES.
[2024-06-14 14:40:21,325 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 94533 conditions, 14845 events. 10386/14845 cut-off events. For 462432/462432 co-relation queries the response was YES. Maximal size of possible extension queue 509. Compared 85693 event pairs, 3964 based on Foata normal form. 2/14815 useless extension candidates. Maximal degree in co-relation 94479. Up to 14050 conditions per place. 
[2024-06-14 14:40:21,397 INFO  L140   encePairwiseOnDemand]: 43/54 looper letters, 167 selfloop transitions, 27 changer transitions 0/202 dead transitions.
[2024-06-14 14:40:21,398 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 202 transitions, 2093 flow
[2024-06-14 14:40:21,398 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 14:40:21,398 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 14:40:21,399 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 180 transitions.
[2024-06-14 14:40:21,399 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.47619047619047616
[2024-06-14 14:40:21,399 INFO  L175             Difference]: Start difference. First operand has 130 places, 177 transitions, 1641 flow. Second operand 7 states and 180 transitions.
[2024-06-14 14:40:21,399 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 202 transitions, 2093 flow
[2024-06-14 14:40:21,657 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 202 transitions, 2016 flow, removed 12 selfloop flow, removed 6 redundant places.
[2024-06-14 14:40:21,659 INFO  L231             Difference]: Finished difference. Result has 131 places, 177 transitions, 1627 flow
[2024-06-14 14:40:21,659 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=1564, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1627, PETRI_PLACES=131, PETRI_TRANSITIONS=177}
[2024-06-14 14:40:21,660 INFO  L281   CegarLoopForPetriNet]: 57 programPoint places, 74 predicate places.
[2024-06-14 14:40:21,660 INFO  L495      AbstractCegarLoop]: Abstraction has has 131 places, 177 transitions, 1627 flow
[2024-06-14 14:40:21,660 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 15.75) internal successors, (126), 8 states have internal predecessors, (126), 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-14 14:40:21,660 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:40:21,660 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:40:21,660 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26
[2024-06-14 14:40:21,661 INFO  L420      AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] ===
[2024-06-14 14:40:21,661 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:40:21,661 INFO  L85        PathProgramCache]: Analyzing trace with hash -898222632, now seen corresponding path program 1 times
[2024-06-14 14:40:21,661 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:40:21,661 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582096510]
[2024-06-14 14:40:21,661 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:40:21,662 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:40:21,694 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:40:43,001 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-14 14:40:43,001 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:40:43,002 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582096510]
[2024-06-14 14:40:43,003 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582096510] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:40:43,004 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:40:43,004 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 14:40:43,004 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336528555]
[2024-06-14 14:40:43,004 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:40:43,011 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 14:40:43,013 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:40:43,013 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 14:40:43,013 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-14 14:40:43,237 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 54
[2024-06-14 14:40:43,238 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 177 transitions, 1627 flow. Second operand  has 9 states, 9 states have (on average 14.555555555555555) internal successors, (131), 9 states have internal predecessors, (131), 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-14 14:40:43,238 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:40:43,238 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 54
[2024-06-14 14:40:43,238 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:40:50,257 INFO  L124   PetriNetUnfolderBase]: 12379/17282 cut-off events.
[2024-06-14 14:40:50,257 INFO  L125   PetriNetUnfolderBase]: For 609425/609425 co-relation queries the response was YES.
[2024-06-14 14:40:50,327 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 114145 conditions, 17282 events. 12379/17282 cut-off events. For 609425/609425 co-relation queries the response was YES. Maximal size of possible extension queue 577. Compared 97746 event pairs, 3557 based on Foata normal form. 30/17311 useless extension candidates. Maximal degree in co-relation 114090. Up to 14521 conditions per place. 
[2024-06-14 14:40:50,419 INFO  L140   encePairwiseOnDemand]: 41/54 looper letters, 162 selfloop transitions, 85 changer transitions 0/254 dead transitions.
[2024-06-14 14:40:50,419 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 254 transitions, 2915 flow
[2024-06-14 14:40:50,422 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 14:40:50,422 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 14:40:50,427 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 253 transitions.
[2024-06-14 14:40:50,428 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5205761316872428
[2024-06-14 14:40:50,428 INFO  L175             Difference]: Start difference. First operand has 131 places, 177 transitions, 1627 flow. Second operand 9 states and 253 transitions.
[2024-06-14 14:40:50,428 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 254 transitions, 2915 flow
[2024-06-14 14:40:50,756 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 254 transitions, 2834 flow, removed 3 selfloop flow, removed 7 redundant places.
[2024-06-14 14:40:50,759 INFO  L231             Difference]: Finished difference. Result has 135 places, 186 transitions, 1960 flow
[2024-06-14 14:40:50,760 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=1546, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=78, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1960, PETRI_PLACES=135, PETRI_TRANSITIONS=186}
[2024-06-14 14:40:50,764 INFO  L281   CegarLoopForPetriNet]: 57 programPoint places, 78 predicate places.
[2024-06-14 14:40:50,764 INFO  L495      AbstractCegarLoop]: Abstraction has has 135 places, 186 transitions, 1960 flow
[2024-06-14 14:40:50,764 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 14.555555555555555) internal successors, (131), 9 states have internal predecessors, (131), 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-14 14:40:50,764 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:40:50,765 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:40:50,765 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27
[2024-06-14 14:40:50,765 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-14 14:40:50,766 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:40:50,766 INFO  L85        PathProgramCache]: Analyzing trace with hash 981334702, now seen corresponding path program 2 times
[2024-06-14 14:40:50,766 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:40:50,766 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785089485]
[2024-06-14 14:40:50,766 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:40:50,766 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:40:50,801 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:41:13,258 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-14 14:41:13,258 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:41:13,258 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785089485]
[2024-06-14 14:41:13,258 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785089485] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:41:13,258 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:41:13,258 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 14:41:13,258 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451386582]
[2024-06-14 14:41:13,258 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:41:13,259 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 14:41:13,259 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:41:13,259 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 14:41:13,259 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-14 14:41:13,590 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 54
[2024-06-14 14:41:13,590 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 186 transitions, 1960 flow. Second operand  has 9 states, 9 states have (on average 14.555555555555555) internal successors, (131), 9 states have internal predecessors, (131), 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-14 14:41:13,590 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:41:13,590 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 54
[2024-06-14 14:41:13,590 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:41:20,887 INFO  L124   PetriNetUnfolderBase]: 12782/17905 cut-off events.
[2024-06-14 14:41:20,887 INFO  L125   PetriNetUnfolderBase]: For 684177/684177 co-relation queries the response was YES.
[2024-06-14 14:41:20,943 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 124395 conditions, 17905 events. 12782/17905 cut-off events. For 684177/684177 co-relation queries the response was YES. Maximal size of possible extension queue 607. Compared 102335 event pairs, 4752 based on Foata normal form. 30/17934 useless extension candidates. Maximal degree in co-relation 124337. Up to 16008 conditions per place. 
[2024-06-14 14:41:21,038 INFO  L140   encePairwiseOnDemand]: 40/54 looper letters, 162 selfloop transitions, 85 changer transitions 0/254 dead transitions.
[2024-06-14 14:41:21,039 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 254 transitions, 3116 flow
[2024-06-14 14:41:21,041 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 14:41:21,041 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 14:41:21,042 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 251 transitions.
[2024-06-14 14:41:21,042 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5164609053497943
[2024-06-14 14:41:21,042 INFO  L175             Difference]: Start difference. First operand has 135 places, 186 transitions, 1960 flow. Second operand 9 states and 251 transitions.
[2024-06-14 14:41:21,042 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 254 transitions, 3116 flow
[2024-06-14 14:41:21,451 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 254 transitions, 2962 flow, removed 40 selfloop flow, removed 4 redundant places.
[2024-06-14 14:41:21,454 INFO  L231             Difference]: Finished difference. Result has 141 places, 193 transitions, 2176 flow
[2024-06-14 14:41:21,454 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=1806, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2176, PETRI_PLACES=141, PETRI_TRANSITIONS=193}
[2024-06-14 14:41:21,455 INFO  L281   CegarLoopForPetriNet]: 57 programPoint places, 84 predicate places.
[2024-06-14 14:41:21,455 INFO  L495      AbstractCegarLoop]: Abstraction has has 141 places, 193 transitions, 2176 flow
[2024-06-14 14:41:21,455 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 14.555555555555555) internal successors, (131), 9 states have internal predecessors, (131), 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-14 14:41:21,455 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:41:21,456 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:41:21,456 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28
[2024-06-14 14:41:21,456 INFO  L420      AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] ===
[2024-06-14 14:41:21,456 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:41:21,456 INFO  L85        PathProgramCache]: Analyzing trace with hash 942575936, now seen corresponding path program 1 times
[2024-06-14 14:41:21,456 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:41:21,456 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733428481]
[2024-06-14 14:41:21,457 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:41:21,457 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:41:21,640 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:41:46,592 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-14 14:41:46,592 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:41:46,592 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733428481]
[2024-06-14 14:41:46,593 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733428481] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:41:46,593 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:41:46,593 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 14:41:46,593 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986381562]
[2024-06-14 14:41:46,593 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:41:46,593 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 14:41:46,593 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:41:46,593 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 14:41:46,593 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2024-06-14 14:41:46,769 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 54
[2024-06-14 14:41:46,769 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 193 transitions, 2176 flow. Second operand  has 9 states, 9 states have (on average 14.666666666666666) internal successors, (132), 9 states have internal predecessors, (132), 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-14 14:41:46,770 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:41:46,770 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 54
[2024-06-14 14:41:46,770 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:41:53,534 INFO  L124   PetriNetUnfolderBase]: 12830/17990 cut-off events.
[2024-06-14 14:41:53,534 INFO  L125   PetriNetUnfolderBase]: For 732911/732911 co-relation queries the response was YES.
[2024-06-14 14:41:53,612 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 128522 conditions, 17990 events. 12830/17990 cut-off events. For 732911/732911 co-relation queries the response was YES. Maximal size of possible extension queue 608. Compared 103115 event pairs, 4822 based on Foata normal form. 6/17995 useless extension candidates. Maximal degree in co-relation 128461. Up to 16874 conditions per place. 
[2024-06-14 14:41:53,713 INFO  L140   encePairwiseOnDemand]: 41/54 looper letters, 150 selfloop transitions, 87 changer transitions 0/244 dead transitions.
[2024-06-14 14:41:53,714 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 244 transitions, 3086 flow
[2024-06-14 14:41:53,716 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 14:41:53,716 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 14:41:53,717 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 219 transitions.
[2024-06-14 14:41:53,717 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5069444444444444
[2024-06-14 14:41:53,717 INFO  L175             Difference]: Start difference. First operand has 141 places, 193 transitions, 2176 flow. Second operand 8 states and 219 transitions.
[2024-06-14 14:41:53,717 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 244 transitions, 3086 flow
[2024-06-14 14:41:54,239 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 244 transitions, 2914 flow, removed 38 selfloop flow, removed 5 redundant places.
[2024-06-14 14:41:54,242 INFO  L231             Difference]: Finished difference. Result has 144 places, 199 transitions, 2284 flow
[2024-06-14 14:41:54,242 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=2010, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2284, PETRI_PLACES=144, PETRI_TRANSITIONS=199}
[2024-06-14 14:41:54,242 INFO  L281   CegarLoopForPetriNet]: 57 programPoint places, 87 predicate places.
[2024-06-14 14:41:54,243 INFO  L495      AbstractCegarLoop]: Abstraction has has 144 places, 199 transitions, 2284 flow
[2024-06-14 14:41:54,243 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 14.666666666666666) internal successors, (132), 9 states have internal predecessors, (132), 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-14 14:41:54,243 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:41:54,243 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:41:54,243 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29
[2024-06-14 14:41:54,243 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-14 14:41:54,244 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:41:54,244 INFO  L85        PathProgramCache]: Analyzing trace with hash 260393676, now seen corresponding path program 3 times
[2024-06-14 14:41:54,244 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:41:54,244 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277069472]
[2024-06-14 14:41:54,244 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:41:54,244 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:41:54,274 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:42:16,862 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-14 14:42:16,862 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:42:16,862 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277069472]
[2024-06-14 14:42:16,863 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277069472] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:42:16,863 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:42:16,863 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 14:42:16,863 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820271008]
[2024-06-14 14:42:16,863 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:42:16,863 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 14:42:16,863 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:42:16,864 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 14:42:16,864 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-14 14:42:17,214 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 54
[2024-06-14 14:42:17,214 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 199 transitions, 2284 flow. Second operand  has 9 states, 9 states have (on average 14.555555555555555) internal successors, (131), 9 states have internal predecessors, (131), 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-14 14:42:17,215 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:42:17,215 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 54
[2024-06-14 14:42:17,215 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:42:25,198 INFO  L124   PetriNetUnfolderBase]: 13247/18631 cut-off events.
[2024-06-14 14:42:25,198 INFO  L125   PetriNetUnfolderBase]: For 796518/796518 co-relation queries the response was YES.
[2024-06-14 14:42:25,259 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 134722 conditions, 18631 events. 13247/18631 cut-off events. For 796518/796518 co-relation queries the response was YES. Maximal size of possible extension queue 640. Compared 107921 event pairs, 4121 based on Foata normal form. 30/18660 useless extension candidates. Maximal degree in co-relation 134659. Up to 16630 conditions per place. 
[2024-06-14 14:42:25,353 INFO  L140   encePairwiseOnDemand]: 40/54 looper letters, 172 selfloop transitions, 92 changer transitions 0/271 dead transitions.
[2024-06-14 14:42:25,353 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 271 transitions, 3586 flow
[2024-06-14 14:42:25,355 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 14:42:25,356 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 14:42:25,356 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 255 transitions.
[2024-06-14 14:42:25,356 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5246913580246914
[2024-06-14 14:42:25,356 INFO  L175             Difference]: Start difference. First operand has 144 places, 199 transitions, 2284 flow. Second operand 9 states and 255 transitions.
[2024-06-14 14:42:25,356 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 271 transitions, 3586 flow
[2024-06-14 14:42:25,867 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 271 transitions, 3435 flow, removed 11 selfloop flow, removed 5 redundant places.
[2024-06-14 14:42:25,870 INFO  L231             Difference]: Finished difference. Result has 149 places, 205 transitions, 2513 flow
[2024-06-14 14:42:25,871 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=2133, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=88, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2513, PETRI_PLACES=149, PETRI_TRANSITIONS=205}
[2024-06-14 14:42:25,871 INFO  L281   CegarLoopForPetriNet]: 57 programPoint places, 92 predicate places.
[2024-06-14 14:42:25,871 INFO  L495      AbstractCegarLoop]: Abstraction has has 149 places, 205 transitions, 2513 flow
[2024-06-14 14:42:25,871 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 14.555555555555555) internal successors, (131), 9 states have internal predecessors, (131), 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-14 14:42:25,871 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:42:25,872 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:42:25,872 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30
[2024-06-14 14:42:25,872 INFO  L420      AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] ===
[2024-06-14 14:42:25,872 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:42:25,872 INFO  L85        PathProgramCache]: Analyzing trace with hash -109371486, now seen corresponding path program 4 times
[2024-06-14 14:42:25,872 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:42:25,872 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859770194]
[2024-06-14 14:42:25,873 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:42:25,873 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:42:25,902 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:42:47,623 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-14 14:42:47,624 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:42:47,624 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859770194]
[2024-06-14 14:42:47,624 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859770194] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:42:47,624 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:42:47,624 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 14:42:47,624 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736855309]
[2024-06-14 14:42:47,624 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:42:47,625 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 14:42:47,625 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:42:47,625 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 14:42:47,625 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-06-14 14:42:47,873 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 54
[2024-06-14 14:42:47,874 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 205 transitions, 2513 flow. Second operand  has 9 states, 9 states have (on average 14.555555555555555) internal successors, (131), 9 states have internal predecessors, (131), 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-14 14:42:47,874 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:42:47,874 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 54
[2024-06-14 14:42:47,874 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:42:55,591 INFO  L124   PetriNetUnfolderBase]: 13501/19009 cut-off events.
[2024-06-14 14:42:55,591 INFO  L125   PetriNetUnfolderBase]: For 870381/870381 co-relation queries the response was YES.
[2024-06-14 14:42:55,658 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 141009 conditions, 19009 events. 13501/19009 cut-off events. For 870381/870381 co-relation queries the response was YES. Maximal size of possible extension queue 662. Compared 110740 event pairs, 4974 based on Foata normal form. 40/19048 useless extension candidates. Maximal degree in co-relation 140944. Up to 17595 conditions per place. 
[2024-06-14 14:42:55,758 INFO  L140   encePairwiseOnDemand]: 40/54 looper letters, 171 selfloop transitions, 89 changer transitions 0/267 dead transitions.
[2024-06-14 14:42:55,758 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 267 transitions, 3533 flow
[2024-06-14 14:42:55,761 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 14:42:55,761 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 14:42:55,762 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 249 transitions.
[2024-06-14 14:42:55,762 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5123456790123457
[2024-06-14 14:42:55,762 INFO  L175             Difference]: Start difference. First operand has 149 places, 205 transitions, 2513 flow. Second operand 9 states and 249 transitions.
[2024-06-14 14:42:55,762 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 267 transitions, 3533 flow
[2024-06-14 14:42:56,490 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 267 transitions, 3341 flow, removed 44 selfloop flow, removed 5 redundant places.
[2024-06-14 14:42:56,493 INFO  L231             Difference]: Finished difference. Result has 153 places, 208 transitions, 2612 flow
[2024-06-14 14:42:56,493 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=2325, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=86, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2612, PETRI_PLACES=153, PETRI_TRANSITIONS=208}
[2024-06-14 14:42:56,494 INFO  L281   CegarLoopForPetriNet]: 57 programPoint places, 96 predicate places.
[2024-06-14 14:42:56,494 INFO  L495      AbstractCegarLoop]: Abstraction has has 153 places, 208 transitions, 2612 flow
[2024-06-14 14:42:56,494 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 14.555555555555555) internal successors, (131), 9 states have internal predecessors, (131), 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-14 14:42:56,494 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:42:56,494 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:42:56,494 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31
[2024-06-14 14:42:56,495 INFO  L420      AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] ===
[2024-06-14 14:42:56,495 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:42:56,495 INFO  L85        PathProgramCache]: Analyzing trace with hash -1525087648, now seen corresponding path program 5 times
[2024-06-14 14:42:56,495 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:42:56,495 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028317469]
[2024-06-14 14:42:56,495 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:42:56,495 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:42:56,527 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat