./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix030_power.opt_pso.opt_rmo.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/mix030_power.opt_pso.opt_rmo.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/mix030_power.opt_pso.opt_rmo.opt.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/mix030_power.opt_pso.opt_rmo.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 15:03:48,907 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-06-14 15:03:48,986 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-06-14 15:03:48,991 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-06-14 15:03:48,992 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-06-14 15:03:49,030 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-06-14 15:03:49,031 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-06-14 15:03:49,031 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-06-14 15:03:49,032 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-06-14 15:03:49,036 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-06-14 15:03:49,036 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-06-14 15:03:49,036 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-06-14 15:03:49,037 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-06-14 15:03:49,038 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-06-14 15:03:49,038 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-06-14 15:03:49,039 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-06-14 15:03:49,039 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-06-14 15:03:49,039 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-06-14 15:03:49,039 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-06-14 15:03:49,040 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-06-14 15:03:49,040 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-06-14 15:03:49,040 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-06-14 15:03:49,041 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-06-14 15:03:49,041 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-06-14 15:03:49,041 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-06-14 15:03:49,041 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-06-14 15:03:49,042 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-06-14 15:03:49,042 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-06-14 15:03:49,042 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-06-14 15:03:49,043 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-06-14 15:03:49,044 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-06-14 15:03:49,044 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-06-14 15:03:49,044 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-06-14 15:03:49,044 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-06-14 15:03:49,045 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-06-14 15:03:49,045 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-06-14 15:03:49,045 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-06-14 15:03:49,045 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-06-14 15:03:49,045 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-06-14 15:03:49,046 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-06-14 15:03:49,046 INFO  L153        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-06-14 15:03:49,046 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-06-14 15:03:49,046 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-06-14 15:03:49,047 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 15:03:49,303 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-06-14 15:03:49,320 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-06-14 15:03:49,324 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-06-14 15:03:49,325 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-06-14 15:03:49,325 INFO  L274        PluginConnector]: CDTParser initialized
[2024-06-14 15:03:49,326 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix030_power.opt_pso.opt_rmo.opt.i
[2024-06-14 15:03:50,465 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-06-14 15:03:50,728 INFO  L384              CDTParser]: Found 1 translation units.
[2024-06-14 15:03:50,729 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix030_power.opt_pso.opt_rmo.opt.i
[2024-06-14 15:03:50,747 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ac2c08c5/bc5ccc79b01141759b5f5b17774ffddb/FLAG5d5540885
[2024-06-14 15:03:50,759 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ac2c08c5/bc5ccc79b01141759b5f5b17774ffddb
[2024-06-14 15:03:50,761 INFO  L270        PluginConnector]: Initializing Witness Parser...
[2024-06-14 15:03:50,762 INFO  L274        PluginConnector]: Witness Parser initialized
[2024-06-14 15:03:50,762 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/mix030_power.opt_pso.opt_rmo.opt.yml/witness.yml
[2024-06-14 15:03:51,023 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-06-14 15:03:51,024 INFO  L133        ToolchainWalker]: Walking toolchain with 5 elements.
[2024-06-14 15:03:51,025 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-06-14 15:03:51,026 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-06-14 15:03:51,030 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-06-14 15:03:51,030 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 03:03:50" (1/2) ...
[2024-06-14 15:03:51,031 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20ba2164 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:03:51, skipping insertion in model container
[2024-06-14 15:03:51,032 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 03:03:50" (1/2) ...
[2024-06-14 15:03:51,033 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@203d2ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:03:51, skipping insertion in model container
[2024-06-14 15:03:51,034 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 03:03:51" (2/2) ...
[2024-06-14 15:03:51,035 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20ba2164 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:03:51, skipping insertion in model container
[2024-06-14 15:03:51,035 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 03:03:51" (2/2) ...
[2024-06-14 15:03:51,035 INFO  L83    nessWitnessExtractor]: Extracting all invariants from correctness witness
[2024-06-14 15:03:51,155 INFO  L95    edCorrectnessWitness]: Found the following entries in the witness:
[2024-06-14 15:03:51,157 INFO  L97    edCorrectnessWitness]: Location invariant before [L847-L847] (((((((((((((((((((((! multithreaded || y$r_buff0_thd4 == (_Bool)0) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p3_EBX) + (long long )a >= 0LL && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd4 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd4 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd4 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd4 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff0_thd4 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd4 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd4) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd4) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd4) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd4) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd4) + (long long )y$r_buff1_thd4 >= 0LL) && (0LL - (long long )y$r_buff0_thd4) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd4) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd4) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd4) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd4 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd4 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$r_buff1_thd4 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd4) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd4) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd4) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd4) + (long long )z >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )z >= 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 )y$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y$r_buff0_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y$r_buff1_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z >= 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 )y$flush_delayed >= 0LL) && (1LL - (long long )a) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff0_thd3 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff0_thd4 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff1_thd3 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff1_thd4 >= 0LL) && (1LL - (long long )a) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )a) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )a) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )a) + (long long )z >= 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_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 )y$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd4 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd4 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (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 )y$flush_delayed >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )y$r_buff0_thd4 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )y$r_buff1_thd4 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z >= 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 )y$flush_delayed >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )y$r_buff0_thd4 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )y$r_buff1_thd4 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )z >= 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 )y$flush_delayed >= 0LL) && (long long )a + (long long )y$mem_tmp >= 0LL) && (long long )a + (long long )y$r_buff0_thd0 >= 0LL) && (long long )a + (long long )y$r_buff0_thd1 >= 0LL) && (long long )a + (long long )y$r_buff0_thd2 >= 0LL) && (long long )a + (long long )y$r_buff0_thd3 >= 0LL) && (long long )a + (long long )y$r_buff0_thd4 >= 0LL) && (long long )a + (long long )y$r_buff1_thd0 >= 0LL) && (long long )a + (long long )y$r_buff1_thd1 >= 0LL) && (long long )a + (long long )y$r_buff1_thd2 >= 0LL) && (long long )a + (long long )y$r_buff1_thd3 >= 0LL) && (long long )a + (long long )y$r_buff1_thd4 >= 0LL) && (long long )a + (long long )y$read_delayed >= 0LL) && (long long )a + (long long )y$w_buff0 >= 0LL) && (long long )a + (long long )y$w_buff1 >= 0LL) && (long long )a + (long long )z >= 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 )y$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd4 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd4 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 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 )y$flush_delayed >= 0LL) && (long long )x + (long long )y$mem_tmp >= 0LL) && (long long )x + (long long )y$r_buff0_thd0 >= 0LL) && (long long )x + (long long )y$r_buff0_thd1 >= 0LL) && (long long )x + (long long )y$r_buff0_thd2 >= 0LL) && (long long )x + (long long )y$r_buff0_thd3 >= 0LL) && (long long )x + (long long )y$r_buff0_thd4 >= 0LL) && (long long )x + (long long )y$r_buff1_thd0 >= 0LL) && (long long )x + (long long )y$r_buff1_thd1 >= 0LL) && (long long )x + (long long )y$r_buff1_thd2 >= 0LL) && (long long )x + (long long )y$r_buff1_thd3 >= 0LL) && (long long )x + (long long )y$r_buff1_thd4 >= 0LL) && (long long )x + (long long )y$read_delayed >= 0LL) && (long long )x + (long long )y$w_buff0 >= 0LL) && (long long )x + (long long )y$w_buff1 >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )y + (long long )y$flush_delayed >= 0LL) && (long long )y + (long long )y$mem_tmp >= 0LL) && (long long )y + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y + (long long )y$r_buff0_thd4 >= 0LL) && (long long )y + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y + (long long )y$r_buff1_thd4 >= 0LL) && (long long )y + (long long )y$read_delayed >= 0LL) && (long long )y + (long long )y$w_buff0 >= 0LL) && (long long )y + (long long )y$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y$flush_delayed + (long long )y$mem_tmp >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd4 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd4 >= 0LL) && (long long )y$flush_delayed + (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$flush_delayed + (long long )z >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd4 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd4 >= 0LL) && (long long )y$mem_tmp + (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff1 >= 0LL) && (long long )y$mem_tmp + (long long )z >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd4 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd4 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )z >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff0_thd4 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd4 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )z >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff0_thd4 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd4 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )z >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff0_thd4 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd4 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )z >= 0LL) && (long long )y$r_buff0_thd4 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd4 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd4 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd4 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd4 + (long long )y$r_buff1_thd4 >= 0LL) && (long long )y$r_buff0_thd4 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd4 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd4 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd4 + (long long )z >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd4 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )z >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$r_buff1_thd4 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )z >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$r_buff1_thd4 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )z >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$r_buff1_thd4 >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd3 + (long long )z >= 0LL) && (long long )y$r_buff1_thd4 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd4 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd4 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd4 + (long long )z >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$read_delayed + (long long )z >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )z >= 0LL) && (long long )y$w_buff1 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd4 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd4 >= 0LL) && (long long )weak$$choice0 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )z >= 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 )y$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd4 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd4 >= 0LL) && (long long )weak$$choice2 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )z >= 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_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 )y$r_buff0_thd0) - (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd4 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd4 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff0_thd4 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd4 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff0_thd4 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd4 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd4) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd4) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd4) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd4) - (long long )y$r_buff1_thd4 >= 0LL) && (0LL - (long long )y$r_buff0_thd4) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd4 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$r_buff1_thd4 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) - (long long )y$r_buff1_thd4 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd4) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )y$r_buff0_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )y$r_buff1_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff0_thd4 >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff1_thd4 >= 0LL) && (1LL - (long long )a) - (long long )y$read_delayed >= 0LL) && (2LL - (long long )__unbuffered_p3_EBX) - (long long )a >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd4 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd4 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )y$r_buff0_thd4 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )y$r_buff1_thd4 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )y$r_buff0_thd4 >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )y$r_buff1_thd4 >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )y$read_delayed >= 0LL) && (long long )a - (long long )y$r_buff0_thd0 >= 0LL) && (long long )a - (long long )y$r_buff0_thd1 >= 0LL) && (long long )a - (long long )y$r_buff0_thd2 >= 0LL) && (long long )a - (long long )y$r_buff0_thd4 >= 0LL) && (long long )a - (long long )y$r_buff1_thd0 >= 0LL) && (long long )a - (long long )y$r_buff1_thd1 >= 0LL) && (long long )a - (long long )y$r_buff1_thd2 >= 0LL) && (long long )a - (long long )y$r_buff1_thd4 >= 0LL) && (long long )a - (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd4 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd4 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$read_delayed >= 0LL) && (long long )x - (long long )y$r_buff0_thd0 >= 0LL) && (long long )x - (long long )y$r_buff0_thd1 >= 0LL) && (long long )x - (long long )y$r_buff0_thd2 >= 0LL) && (long long )x - (long long )y$r_buff0_thd4 >= 0LL) && (long long )x - (long long )y$r_buff1_thd0 >= 0LL) && (long long )x - (long long )y$r_buff1_thd1 >= 0LL) && (long long )x - (long long )y$r_buff1_thd2 >= 0LL) && (long long )x - (long long )y$r_buff1_thd4 >= 0LL) && (long long )x - (long long )y$read_delayed >= 0LL) && (long long )y - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y - (long long )y$r_buff0_thd4 >= 0LL) && (long long )y - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y - (long long )y$r_buff1_thd4 >= 0LL) && (long long )y - (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd4 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd4 >= 0LL) && (long long )y$flush_delayed - (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd4 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd4 >= 0LL) && (long long )y$mem_tmp - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd4 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd4 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff0_thd4 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd4 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff0_thd4 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd4 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff0_thd4 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd4 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd4 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd4 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd4 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd4 - (long long )y$r_buff1_thd4 >= 0LL) && (long long )y$r_buff0_thd4 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd4 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$r_buff1_thd4 >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$r_buff1_thd4 >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd3 - (long long )y$r_buff1_thd4 >= 0LL) && (long long )y$r_buff1_thd3 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd4 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd4 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd4 >= 0LL) && (long long )weak$$choice0 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd4 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd4 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p3_EAX) && 0 <= __unbuffered_p3_EBX) && 0 <= a) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && 0 <= z) && __unbuffered_p3_EBX <= 1) && a <= 1) && y$w_buff0 <= 127) && y$w_buff1 <= 127) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd1 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff0_thd4 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd1 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$r_buff1_thd4 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && y$w_buff0 % 2 == 0) && y$w_buff1 % 2 == 0) && (__unbuffered_p3_EBX == 0 || __unbuffered_p3_EBX == 1)) && (a == 0 || a == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 2)) && (y$w_buff1 == 0 || y$w_buff1 == 2)) && ((__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1) || __unbuffered_p3_EAX == 2)) && ((x == 0 || x == 1) || x == 2)) && ((y == 0 || y == 1) || y == 2)) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)) && ((z == 0 || z == 1) || z == 2)))) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (((0 <= y$w_buff0 && y$w_buff0 <= 127) && y$w_buff0 % 2 == 0) && (y$w_buff0 == 0 || y$w_buff0 == 2)))) && (! multithreaded || ((0 <= __unbuffered_p3_EBX && __unbuffered_p3_EBX <= 1) && (__unbuffered_p3_EBX == 0 || __unbuffered_p3_EBX == 1)))) && (! multithreaded || (0 <= __unbuffered_p3_EAX && ((__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1) || __unbuffered_p3_EAX == 2)))) && (! multithreaded || ((0 <= a && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || y$r_buff1_thd4 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (((0 <= y$w_buff1 && y$w_buff1 <= 127) && y$w_buff1 % 2 == 0) && (y$w_buff1 == 0 || y$w_buff1 == 2)))) && (! multithreaded || (((0 <= z && z <= 2) && z <= 127) && ((z == 0 || z == 1) || z == 2)))) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || (0 <= y$mem_tmp && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || (0 <= y && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || y$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)
[2024-06-14 15:03:51,157 INFO  L97    edCorrectnessWitness]: Location invariant before [L849-L849] (((((((((((((((((((((! multithreaded || y$r_buff0_thd4 == (_Bool)0) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p3_EBX) + (long long )a >= 0LL && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd4 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd4 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd4 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd4 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff0_thd4 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd4 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd4) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd4) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd4) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd4) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd4) + (long long )y$r_buff1_thd4 >= 0LL) && (0LL - (long long )y$r_buff0_thd4) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd4) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd4) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd4) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd4 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd4 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$r_buff1_thd4 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd4) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd4) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd4) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd4) + (long long )z >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )z >= 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 )y$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y$r_buff0_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y$r_buff1_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z >= 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 )y$flush_delayed >= 0LL) && (1LL - (long long )a) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff0_thd3 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff0_thd4 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff1_thd3 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff1_thd4 >= 0LL) && (1LL - (long long )a) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )a) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )a) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )a) + (long long )z >= 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_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 )y$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd4 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd4 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (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 )y$flush_delayed >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )y$r_buff0_thd4 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )y$r_buff1_thd4 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z >= 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 )y$flush_delayed >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )y$r_buff0_thd4 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )y$r_buff1_thd4 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )z >= 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 )y$flush_delayed >= 0LL) && (long long )a + (long long )y$mem_tmp >= 0LL) && (long long )a + (long long )y$r_buff0_thd0 >= 0LL) && (long long )a + (long long )y$r_buff0_thd1 >= 0LL) && (long long )a + (long long )y$r_buff0_thd2 >= 0LL) && (long long )a + (long long )y$r_buff0_thd3 >= 0LL) && (long long )a + (long long )y$r_buff0_thd4 >= 0LL) && (long long )a + (long long )y$r_buff1_thd0 >= 0LL) && (long long )a + (long long )y$r_buff1_thd1 >= 0LL) && (long long )a + (long long )y$r_buff1_thd2 >= 0LL) && (long long )a + (long long )y$r_buff1_thd3 >= 0LL) && (long long )a + (long long )y$r_buff1_thd4 >= 0LL) && (long long )a + (long long )y$read_delayed >= 0LL) && (long long )a + (long long )y$w_buff0 >= 0LL) && (long long )a + (long long )y$w_buff1 >= 0LL) && (long long )a + (long long )z >= 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 )y$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd4 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd4 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 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 )y$flush_delayed >= 0LL) && (long long )x + (long long )y$mem_tmp >= 0LL) && (long long )x + (long long )y$r_buff0_thd0 >= 0LL) && (long long )x + (long long )y$r_buff0_thd1 >= 0LL) && (long long )x + (long long )y$r_buff0_thd2 >= 0LL) && (long long )x + (long long )y$r_buff0_thd3 >= 0LL) && (long long )x + (long long )y$r_buff0_thd4 >= 0LL) && (long long )x + (long long )y$r_buff1_thd0 >= 0LL) && (long long )x + (long long )y$r_buff1_thd1 >= 0LL) && (long long )x + (long long )y$r_buff1_thd2 >= 0LL) && (long long )x + (long long )y$r_buff1_thd3 >= 0LL) && (long long )x + (long long )y$r_buff1_thd4 >= 0LL) && (long long )x + (long long )y$read_delayed >= 0LL) && (long long )x + (long long )y$w_buff0 >= 0LL) && (long long )x + (long long )y$w_buff1 >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )y + (long long )y$flush_delayed >= 0LL) && (long long )y + (long long )y$mem_tmp >= 0LL) && (long long )y + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y + (long long )y$r_buff0_thd4 >= 0LL) && (long long )y + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y + (long long )y$r_buff1_thd4 >= 0LL) && (long long )y + (long long )y$read_delayed >= 0LL) && (long long )y + (long long )y$w_buff0 >= 0LL) && (long long )y + (long long )y$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y$flush_delayed + (long long )y$mem_tmp >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd4 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd4 >= 0LL) && (long long )y$flush_delayed + (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$flush_delayed + (long long )z >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd4 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd4 >= 0LL) && (long long )y$mem_tmp + (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff1 >= 0LL) && (long long )y$mem_tmp + (long long )z >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd4 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd4 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )z >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff0_thd4 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd4 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )z >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff0_thd4 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd4 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )z >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff0_thd4 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd4 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )z >= 0LL) && (long long )y$r_buff0_thd4 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd4 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd4 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd4 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd4 + (long long )y$r_buff1_thd4 >= 0LL) && (long long )y$r_buff0_thd4 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd4 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd4 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd4 + (long long )z >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd4 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )z >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$r_buff1_thd4 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )z >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$r_buff1_thd4 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )z >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$r_buff1_thd4 >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd3 + (long long )z >= 0LL) && (long long )y$r_buff1_thd4 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd4 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd4 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd4 + (long long )z >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$read_delayed + (long long )z >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )z >= 0LL) && (long long )y$w_buff1 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd4 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd4 >= 0LL) && (long long )weak$$choice0 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )z >= 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 )y$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd4 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd4 >= 0LL) && (long long )weak$$choice2 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )z >= 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_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 )y$r_buff0_thd0) - (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd4 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd4 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff0_thd4 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd4 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff0_thd4 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd4 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd4) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd4) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd4) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd4) - (long long )y$r_buff1_thd4 >= 0LL) && (0LL - (long long )y$r_buff0_thd4) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd4 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$r_buff1_thd4 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) - (long long )y$r_buff1_thd4 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd4) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )y$r_buff0_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )y$r_buff1_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff0_thd4 >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff1_thd4 >= 0LL) && (1LL - (long long )a) - (long long )y$read_delayed >= 0LL) && (2LL - (long long )__unbuffered_p3_EBX) - (long long )a >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd4 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd4 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )y$r_buff0_thd4 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )y$r_buff1_thd4 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )y$r_buff0_thd4 >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )y$r_buff1_thd4 >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )y$read_delayed >= 0LL) && (long long )a - (long long )y$r_buff0_thd0 >= 0LL) && (long long )a - (long long )y$r_buff0_thd1 >= 0LL) && (long long )a - (long long )y$r_buff0_thd2 >= 0LL) && (long long )a - (long long )y$r_buff0_thd4 >= 0LL) && (long long )a - (long long )y$r_buff1_thd0 >= 0LL) && (long long )a - (long long )y$r_buff1_thd1 >= 0LL) && (long long )a - (long long )y$r_buff1_thd2 >= 0LL) && (long long )a - (long long )y$r_buff1_thd4 >= 0LL) && (long long )a - (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd4 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd4 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$read_delayed >= 0LL) && (long long )x - (long long )y$r_buff0_thd0 >= 0LL) && (long long )x - (long long )y$r_buff0_thd1 >= 0LL) && (long long )x - (long long )y$r_buff0_thd2 >= 0LL) && (long long )x - (long long )y$r_buff0_thd4 >= 0LL) && (long long )x - (long long )y$r_buff1_thd0 >= 0LL) && (long long )x - (long long )y$r_buff1_thd1 >= 0LL) && (long long )x - (long long )y$r_buff1_thd2 >= 0LL) && (long long )x - (long long )y$r_buff1_thd4 >= 0LL) && (long long )x - (long long )y$read_delayed >= 0LL) && (long long )y - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y - (long long )y$r_buff0_thd4 >= 0LL) && (long long )y - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y - (long long )y$r_buff1_thd4 >= 0LL) && (long long )y - (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd4 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd4 >= 0LL) && (long long )y$flush_delayed - (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd4 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd4 >= 0LL) && (long long )y$mem_tmp - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd4 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd4 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff0_thd4 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd4 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff0_thd4 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd4 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff0_thd4 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd4 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd4 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd4 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd4 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd4 - (long long )y$r_buff1_thd4 >= 0LL) && (long long )y$r_buff0_thd4 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd4 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$r_buff1_thd4 >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$r_buff1_thd4 >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd3 - (long long )y$r_buff1_thd4 >= 0LL) && (long long )y$r_buff1_thd3 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd4 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd4 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd4 >= 0LL) && (long long )weak$$choice0 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd4 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd4 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p3_EAX) && 0 <= __unbuffered_p3_EBX) && 0 <= a) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && 0 <= z) && __unbuffered_p3_EBX <= 1) && a <= 1) && y$w_buff0 <= 127) && y$w_buff1 <= 127) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd1 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff0_thd4 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd1 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$r_buff1_thd4 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && y$w_buff0 % 2 == 0) && y$w_buff1 % 2 == 0) && (__unbuffered_p3_EBX == 0 || __unbuffered_p3_EBX == 1)) && (a == 0 || a == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 2)) && (y$w_buff1 == 0 || y$w_buff1 == 2)) && ((__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1) || __unbuffered_p3_EAX == 2)) && ((x == 0 || x == 1) || x == 2)) && ((y == 0 || y == 1) || y == 2)) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)) && ((z == 0 || z == 1) || z == 2)))) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (((0 <= y$w_buff0 && y$w_buff0 <= 127) && y$w_buff0 % 2 == 0) && (y$w_buff0 == 0 || y$w_buff0 == 2)))) && (! multithreaded || ((0 <= __unbuffered_p3_EBX && __unbuffered_p3_EBX <= 1) && (__unbuffered_p3_EBX == 0 || __unbuffered_p3_EBX == 1)))) && (! multithreaded || (0 <= __unbuffered_p3_EAX && ((__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1) || __unbuffered_p3_EAX == 2)))) && (! multithreaded || ((0 <= a && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || y$r_buff1_thd4 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (((0 <= y$w_buff1 && y$w_buff1 <= 127) && y$w_buff1 % 2 == 0) && (y$w_buff1 == 0 || y$w_buff1 == 2)))) && (! multithreaded || (((0 <= z && z <= 2) && z <= 127) && ((z == 0 || z == 1) || z == 2)))) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || (0 <= y$mem_tmp && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || (0 <= y && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || y$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)
[2024-06-14 15:03:51,158 INFO  L97    edCorrectnessWitness]: Location invariant before [L851-L851] (((((((((((((((((((((! multithreaded || y$r_buff0_thd4 == (_Bool)0) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p3_EBX) + (long long )a >= 0LL && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd4 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd4 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd4 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd4 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff0_thd4 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd4 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd4) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd4) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd4) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd4) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd4) + (long long )y$r_buff1_thd4 >= 0LL) && (0LL - (long long )y$r_buff0_thd4) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd4) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd4) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd4) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd4 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd4 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$r_buff1_thd4 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd4) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd4) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd4) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd4) + (long long )z >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )z >= 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 )y$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y$r_buff0_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y$r_buff1_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z >= 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 )y$flush_delayed >= 0LL) && (1LL - (long long )a) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff0_thd3 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff0_thd4 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff1_thd3 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff1_thd4 >= 0LL) && (1LL - (long long )a) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )a) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )a) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )a) + (long long )z >= 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_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 )y$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd4 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd4 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (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 )y$flush_delayed >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )y$r_buff0_thd4 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )y$r_buff1_thd4 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z >= 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 )y$flush_delayed >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )y$r_buff0_thd4 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )y$r_buff1_thd4 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )z >= 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 )y$flush_delayed >= 0LL) && (long long )a + (long long )y$mem_tmp >= 0LL) && (long long )a + (long long )y$r_buff0_thd0 >= 0LL) && (long long )a + (long long )y$r_buff0_thd1 >= 0LL) && (long long )a + (long long )y$r_buff0_thd2 >= 0LL) && (long long )a + (long long )y$r_buff0_thd3 >= 0LL) && (long long )a + (long long )y$r_buff0_thd4 >= 0LL) && (long long )a + (long long )y$r_buff1_thd0 >= 0LL) && (long long )a + (long long )y$r_buff1_thd1 >= 0LL) && (long long )a + (long long )y$r_buff1_thd2 >= 0LL) && (long long )a + (long long )y$r_buff1_thd3 >= 0LL) && (long long )a + (long long )y$r_buff1_thd4 >= 0LL) && (long long )a + (long long )y$read_delayed >= 0LL) && (long long )a + (long long )y$w_buff0 >= 0LL) && (long long )a + (long long )y$w_buff1 >= 0LL) && (long long )a + (long long )z >= 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 )y$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd4 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd4 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 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 )y$flush_delayed >= 0LL) && (long long )x + (long long )y$mem_tmp >= 0LL) && (long long )x + (long long )y$r_buff0_thd0 >= 0LL) && (long long )x + (long long )y$r_buff0_thd1 >= 0LL) && (long long )x + (long long )y$r_buff0_thd2 >= 0LL) && (long long )x + (long long )y$r_buff0_thd3 >= 0LL) && (long long )x + (long long )y$r_buff0_thd4 >= 0LL) && (long long )x + (long long )y$r_buff1_thd0 >= 0LL) && (long long )x + (long long )y$r_buff1_thd1 >= 0LL) && (long long )x + (long long )y$r_buff1_thd2 >= 0LL) && (long long )x + (long long )y$r_buff1_thd3 >= 0LL) && (long long )x + (long long )y$r_buff1_thd4 >= 0LL) && (long long )x + (long long )y$read_delayed >= 0LL) && (long long )x + (long long )y$w_buff0 >= 0LL) && (long long )x + (long long )y$w_buff1 >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )y + (long long )y$flush_delayed >= 0LL) && (long long )y + (long long )y$mem_tmp >= 0LL) && (long long )y + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y + (long long )y$r_buff0_thd4 >= 0LL) && (long long )y + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y + (long long )y$r_buff1_thd4 >= 0LL) && (long long )y + (long long )y$read_delayed >= 0LL) && (long long )y + (long long )y$w_buff0 >= 0LL) && (long long )y + (long long )y$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y$flush_delayed + (long long )y$mem_tmp >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd4 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd4 >= 0LL) && (long long )y$flush_delayed + (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$flush_delayed + (long long )z >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd4 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd4 >= 0LL) && (long long )y$mem_tmp + (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff1 >= 0LL) && (long long )y$mem_tmp + (long long )z >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd4 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd4 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )z >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff0_thd4 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd4 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )z >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff0_thd4 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd4 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )z >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff0_thd4 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd4 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )z >= 0LL) && (long long )y$r_buff0_thd4 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd4 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd4 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd4 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd4 + (long long )y$r_buff1_thd4 >= 0LL) && (long long )y$r_buff0_thd4 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd4 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd4 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd4 + (long long )z >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd4 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )z >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$r_buff1_thd4 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )z >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$r_buff1_thd4 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )z >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$r_buff1_thd4 >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd3 + (long long )z >= 0LL) && (long long )y$r_buff1_thd4 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd4 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd4 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd4 + (long long )z >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$read_delayed + (long long )z >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )z >= 0LL) && (long long )y$w_buff1 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd4 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd4 >= 0LL) && (long long )weak$$choice0 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )z >= 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 )y$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd4 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd4 >= 0LL) && (long long )weak$$choice2 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )z >= 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_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 )y$r_buff0_thd0) - (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd4 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd4 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff0_thd4 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd4 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff0_thd4 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd4 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd4) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd4) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd4) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd4) - (long long )y$r_buff1_thd4 >= 0LL) && (0LL - (long long )y$r_buff0_thd4) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd4 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$r_buff1_thd4 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) - (long long )y$r_buff1_thd4 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd4) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )y$r_buff0_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )y$r_buff1_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff0_thd4 >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff1_thd4 >= 0LL) && (1LL - (long long )a) - (long long )y$read_delayed >= 0LL) && (2LL - (long long )__unbuffered_p3_EBX) - (long long )a >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd4 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd4 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )y$r_buff0_thd4 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )y$r_buff1_thd4 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )y$r_buff0_thd4 >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )y$r_buff1_thd4 >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )y$read_delayed >= 0LL) && (long long )a - (long long )y$r_buff0_thd0 >= 0LL) && (long long )a - (long long )y$r_buff0_thd1 >= 0LL) && (long long )a - (long long )y$r_buff0_thd2 >= 0LL) && (long long )a - (long long )y$r_buff0_thd4 >= 0LL) && (long long )a - (long long )y$r_buff1_thd0 >= 0LL) && (long long )a - (long long )y$r_buff1_thd1 >= 0LL) && (long long )a - (long long )y$r_buff1_thd2 >= 0LL) && (long long )a - (long long )y$r_buff1_thd4 >= 0LL) && (long long )a - (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd4 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd4 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$read_delayed >= 0LL) && (long long )x - (long long )y$r_buff0_thd0 >= 0LL) && (long long )x - (long long )y$r_buff0_thd1 >= 0LL) && (long long )x - (long long )y$r_buff0_thd2 >= 0LL) && (long long )x - (long long )y$r_buff0_thd4 >= 0LL) && (long long )x - (long long )y$r_buff1_thd0 >= 0LL) && (long long )x - (long long )y$r_buff1_thd1 >= 0LL) && (long long )x - (long long )y$r_buff1_thd2 >= 0LL) && (long long )x - (long long )y$r_buff1_thd4 >= 0LL) && (long long )x - (long long )y$read_delayed >= 0LL) && (long long )y - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y - (long long )y$r_buff0_thd4 >= 0LL) && (long long )y - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y - (long long )y$r_buff1_thd4 >= 0LL) && (long long )y - (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd4 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd4 >= 0LL) && (long long )y$flush_delayed - (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd4 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd4 >= 0LL) && (long long )y$mem_tmp - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd4 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd4 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff0_thd4 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd4 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff0_thd4 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd4 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff0_thd4 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd4 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd4 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd4 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd4 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd4 - (long long )y$r_buff1_thd4 >= 0LL) && (long long )y$r_buff0_thd4 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd4 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$r_buff1_thd4 >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$r_buff1_thd4 >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd3 - (long long )y$r_buff1_thd4 >= 0LL) && (long long )y$r_buff1_thd3 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd4 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd4 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd4 >= 0LL) && (long long )weak$$choice0 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd4 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd4 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p3_EAX) && 0 <= __unbuffered_p3_EBX) && 0 <= a) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && 0 <= z) && __unbuffered_p3_EBX <= 1) && a <= 1) && y$w_buff0 <= 127) && y$w_buff1 <= 127) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd1 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff0_thd4 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd1 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$r_buff1_thd4 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && y$w_buff0 % 2 == 0) && y$w_buff1 % 2 == 0) && (__unbuffered_p3_EBX == 0 || __unbuffered_p3_EBX == 1)) && (a == 0 || a == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 2)) && (y$w_buff1 == 0 || y$w_buff1 == 2)) && ((__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1) || __unbuffered_p3_EAX == 2)) && ((x == 0 || x == 1) || x == 2)) && ((y == 0 || y == 1) || y == 2)) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)) && ((z == 0 || z == 1) || z == 2)))) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (((0 <= y$w_buff0 && y$w_buff0 <= 127) && y$w_buff0 % 2 == 0) && (y$w_buff0 == 0 || y$w_buff0 == 2)))) && (! multithreaded || ((0 <= __unbuffered_p3_EBX && __unbuffered_p3_EBX <= 1) && (__unbuffered_p3_EBX == 0 || __unbuffered_p3_EBX == 1)))) && (! multithreaded || (0 <= __unbuffered_p3_EAX && ((__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1) || __unbuffered_p3_EAX == 2)))) && (! multithreaded || ((0 <= a && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || y$r_buff1_thd4 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (((0 <= y$w_buff1 && y$w_buff1 <= 127) && y$w_buff1 % 2 == 0) && (y$w_buff1 == 0 || y$w_buff1 == 2)))) && (! multithreaded || (((0 <= z && z <= 2) && z <= 127) && ((z == 0 || z == 1) || z == 2)))) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || (0 <= y$mem_tmp && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || (0 <= y && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || y$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)
[2024-06-14 15:03:51,159 INFO  L97    edCorrectnessWitness]: Location invariant before [L852-L852] (((((((((((((((((((((! multithreaded || y$r_buff0_thd4 == (_Bool)0) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p3_EBX) + (long long )a >= 0LL && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd4 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd4 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd4 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd4 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff0_thd4 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd4 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd4) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd4) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd4) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd4) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd4) + (long long )y$r_buff1_thd4 >= 0LL) && (0LL - (long long )y$r_buff0_thd4) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd4) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd4) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd4) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd4 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd4 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$r_buff1_thd4 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd4) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd4) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd4) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd4) + (long long )z >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )z >= 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 )y$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y$r_buff0_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y$r_buff1_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z >= 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 )y$flush_delayed >= 0LL) && (1LL - (long long )a) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff0_thd3 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff0_thd4 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff1_thd3 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff1_thd4 >= 0LL) && (1LL - (long long )a) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )a) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )a) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )a) + (long long )z >= 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_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 )y$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd4 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd4 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (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 )y$flush_delayed >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )y$r_buff0_thd4 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )y$r_buff1_thd4 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z >= 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 )y$flush_delayed >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )y$r_buff0_thd4 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )y$r_buff1_thd4 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )z >= 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 )y$flush_delayed >= 0LL) && (long long )a + (long long )y$mem_tmp >= 0LL) && (long long )a + (long long )y$r_buff0_thd0 >= 0LL) && (long long )a + (long long )y$r_buff0_thd1 >= 0LL) && (long long )a + (long long )y$r_buff0_thd2 >= 0LL) && (long long )a + (long long )y$r_buff0_thd3 >= 0LL) && (long long )a + (long long )y$r_buff0_thd4 >= 0LL) && (long long )a + (long long )y$r_buff1_thd0 >= 0LL) && (long long )a + (long long )y$r_buff1_thd1 >= 0LL) && (long long )a + (long long )y$r_buff1_thd2 >= 0LL) && (long long )a + (long long )y$r_buff1_thd3 >= 0LL) && (long long )a + (long long )y$r_buff1_thd4 >= 0LL) && (long long )a + (long long )y$read_delayed >= 0LL) && (long long )a + (long long )y$w_buff0 >= 0LL) && (long long )a + (long long )y$w_buff1 >= 0LL) && (long long )a + (long long )z >= 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 )y$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd4 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd4 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 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 )y$flush_delayed >= 0LL) && (long long )x + (long long )y$mem_tmp >= 0LL) && (long long )x + (long long )y$r_buff0_thd0 >= 0LL) && (long long )x + (long long )y$r_buff0_thd1 >= 0LL) && (long long )x + (long long )y$r_buff0_thd2 >= 0LL) && (long long )x + (long long )y$r_buff0_thd3 >= 0LL) && (long long )x + (long long )y$r_buff0_thd4 >= 0LL) && (long long )x + (long long )y$r_buff1_thd0 >= 0LL) && (long long )x + (long long )y$r_buff1_thd1 >= 0LL) && (long long )x + (long long )y$r_buff1_thd2 >= 0LL) && (long long )x + (long long )y$r_buff1_thd3 >= 0LL) && (long long )x + (long long )y$r_buff1_thd4 >= 0LL) && (long long )x + (long long )y$read_delayed >= 0LL) && (long long )x + (long long )y$w_buff0 >= 0LL) && (long long )x + (long long )y$w_buff1 >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )y + (long long )y$flush_delayed >= 0LL) && (long long )y + (long long )y$mem_tmp >= 0LL) && (long long )y + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y + (long long )y$r_buff0_thd4 >= 0LL) && (long long )y + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y + (long long )y$r_buff1_thd4 >= 0LL) && (long long )y + (long long )y$read_delayed >= 0LL) && (long long )y + (long long )y$w_buff0 >= 0LL) && (long long )y + (long long )y$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y$flush_delayed + (long long )y$mem_tmp >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd4 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd4 >= 0LL) && (long long )y$flush_delayed + (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$flush_delayed + (long long )z >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd4 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd4 >= 0LL) && (long long )y$mem_tmp + (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff1 >= 0LL) && (long long )y$mem_tmp + (long long )z >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd4 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd4 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )z >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff0_thd4 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd4 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )z >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff0_thd4 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd4 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )z >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff0_thd4 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd4 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )z >= 0LL) && (long long )y$r_buff0_thd4 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd4 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd4 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd4 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd4 + (long long )y$r_buff1_thd4 >= 0LL) && (long long )y$r_buff0_thd4 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd4 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd4 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd4 + (long long )z >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd4 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )z >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$r_buff1_thd4 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )z >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$r_buff1_thd4 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )z >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$r_buff1_thd4 >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd3 + (long long )z >= 0LL) && (long long )y$r_buff1_thd4 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd4 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd4 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd4 + (long long )z >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$read_delayed + (long long )z >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )z >= 0LL) && (long long )y$w_buff1 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd4 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd4 >= 0LL) && (long long )weak$$choice0 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )z >= 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 )y$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd4 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd4 >= 0LL) && (long long )weak$$choice2 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )z >= 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_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 )y$r_buff0_thd0) - (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd4 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd4 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff0_thd4 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd4 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff0_thd4 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd4 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd4) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd4) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd4) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd4) - (long long )y$r_buff1_thd4 >= 0LL) && (0LL - (long long )y$r_buff0_thd4) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd4 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$r_buff1_thd4 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) - (long long )y$r_buff1_thd4 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd4) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )y$r_buff0_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )y$r_buff1_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff0_thd4 >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff1_thd4 >= 0LL) && (1LL - (long long )a) - (long long )y$read_delayed >= 0LL) && (2LL - (long long )__unbuffered_p3_EBX) - (long long )a >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd4 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd4 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )y$r_buff0_thd4 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )y$r_buff1_thd4 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )y$r_buff0_thd4 >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )y$r_buff1_thd4 >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )y$read_delayed >= 0LL) && (long long )a - (long long )y$r_buff0_thd0 >= 0LL) && (long long )a - (long long )y$r_buff0_thd1 >= 0LL) && (long long )a - (long long )y$r_buff0_thd2 >= 0LL) && (long long )a - (long long )y$r_buff0_thd4 >= 0LL) && (long long )a - (long long )y$r_buff1_thd0 >= 0LL) && (long long )a - (long long )y$r_buff1_thd1 >= 0LL) && (long long )a - (long long )y$r_buff1_thd2 >= 0LL) && (long long )a - (long long )y$r_buff1_thd4 >= 0LL) && (long long )a - (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd4 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd4 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$read_delayed >= 0LL) && (long long )x - (long long )y$r_buff0_thd0 >= 0LL) && (long long )x - (long long )y$r_buff0_thd1 >= 0LL) && (long long )x - (long long )y$r_buff0_thd2 >= 0LL) && (long long )x - (long long )y$r_buff0_thd4 >= 0LL) && (long long )x - (long long )y$r_buff1_thd0 >= 0LL) && (long long )x - (long long )y$r_buff1_thd1 >= 0LL) && (long long )x - (long long )y$r_buff1_thd2 >= 0LL) && (long long )x - (long long )y$r_buff1_thd4 >= 0LL) && (long long )x - (long long )y$read_delayed >= 0LL) && (long long )y - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y - (long long )y$r_buff0_thd4 >= 0LL) && (long long )y - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y - (long long )y$r_buff1_thd4 >= 0LL) && (long long )y - (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd4 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd4 >= 0LL) && (long long )y$flush_delayed - (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd4 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd4 >= 0LL) && (long long )y$mem_tmp - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd4 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd4 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff0_thd4 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd4 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff0_thd4 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd4 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff0_thd4 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd4 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd4 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd4 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd4 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd4 - (long long )y$r_buff1_thd4 >= 0LL) && (long long )y$r_buff0_thd4 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd4 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$r_buff1_thd4 >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$r_buff1_thd4 >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd3 - (long long )y$r_buff1_thd4 >= 0LL) && (long long )y$r_buff1_thd3 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd4 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd4 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd4 >= 0LL) && (long long )weak$$choice0 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd4 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd4 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p3_EAX) && 0 <= __unbuffered_p3_EBX) && 0 <= a) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && 0 <= z) && __unbuffered_p3_EBX <= 1) && a <= 1) && y$w_buff0 <= 127) && y$w_buff1 <= 127) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd1 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff0_thd4 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd1 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$r_buff1_thd4 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && y$w_buff0 % 2 == 0) && y$w_buff1 % 2 == 0) && (__unbuffered_p3_EBX == 0 || __unbuffered_p3_EBX == 1)) && (a == 0 || a == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 2)) && (y$w_buff1 == 0 || y$w_buff1 == 2)) && ((__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1) || __unbuffered_p3_EAX == 2)) && ((x == 0 || x == 1) || x == 2)) && ((y == 0 || y == 1) || y == 2)) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)) && ((z == 0 || z == 1) || z == 2)))) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (((0 <= y$w_buff0 && y$w_buff0 <= 127) && y$w_buff0 % 2 == 0) && (y$w_buff0 == 0 || y$w_buff0 == 2)))) && (! multithreaded || ((0 <= __unbuffered_p3_EBX && __unbuffered_p3_EBX <= 1) && (__unbuffered_p3_EBX == 0 || __unbuffered_p3_EBX == 1)))) && (! multithreaded || (0 <= __unbuffered_p3_EAX && ((__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1) || __unbuffered_p3_EAX == 2)))) && (! multithreaded || ((0 <= a && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || y$r_buff1_thd4 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (((0 <= y$w_buff1 && y$w_buff1 <= 127) && y$w_buff1 % 2 == 0) && (y$w_buff1 == 0 || y$w_buff1 == 2)))) && (! multithreaded || (((0 <= z && z <= 2) && z <= 127) && ((z == 0 || z == 1) || z == 2)))) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || (0 <= y$mem_tmp && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || (0 <= y && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || y$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)
[2024-06-14 15:03:51,160 INFO  L103   edCorrectnessWitness]: ghost_variable multithreaded = 0
[2024-06-14 15:03:51,161 INFO  L106   edCorrectnessWitness]: ghost_update [L845-L845] multithreaded = 1;
[2024-06-14 15:03:51,204 INFO  L177         MainTranslator]: Built tables and reachable declarations
[2024-06-14 15:03:51,541 INFO  L207          PostProcessor]: Analyzing one entry point: main
[2024-06-14 15:03:51,556 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 15:03:52,060 INFO  L207          PostProcessor]: Analyzing one entry point: main
[2024-06-14 15:03:52,102 INFO  L206         MainTranslator]: Completed translation
[2024-06-14 15:03:52,103 INFO  L201        PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:03:52 WrapperNode
[2024-06-14 15:03:52,103 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-06-14 15:03:52,104 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-06-14 15:03:52,104 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-06-14 15:03:52,104 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-06-14 15:03:52,110 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 03:03:52" (1/1) ...
[2024-06-14 15:03:52,176 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 03:03:52" (1/1) ...
[2024-06-14 15:03:52,437 INFO  L138                Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 156
[2024-06-14 15:03:52,438 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-06-14 15:03:52,439 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-06-14 15:03:52,439 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-06-14 15:03:52,440 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-06-14 15:03:52,451 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 03:03:52" (1/1) ...
[2024-06-14 15:03:52,451 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 03:03:52" (1/1) ...
[2024-06-14 15:03:52,515 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 03:03:52" (1/1) ...
[2024-06-14 15:03:52,595 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 15:03:52,596 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 03:03:52" (1/1) ...
[2024-06-14 15:03:52,596 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 03:03:52" (1/1) ...
[2024-06-14 15:03:52,661 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 03:03:52" (1/1) ...
[2024-06-14 15:03:52,663 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 03:03:52" (1/1) ...
[2024-06-14 15:03:52,683 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 03:03:52" (1/1) ...
[2024-06-14 15:03:52,692 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 03:03:52" (1/1) ...
[2024-06-14 15:03:52,741 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-06-14 15:03:52,742 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-06-14 15:03:52,743 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-06-14 15:03:52,743 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-06-14 15:03:52,743 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 03:03:52" (1/1) ...
[2024-06-14 15:03:52,749 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-06-14 15:03:52,757 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-06-14 15:03:52,772 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 15:03:52,797 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 15:03:52,808 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2024-06-14 15:03:52,808 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-06-14 15:03:52,809 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2024-06-14 15:03:52,809 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2024-06-14 15:03:52,809 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2024-06-14 15:03:52,809 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2024-06-14 15:03:52,810 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2024-06-14 15:03:52,810 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2024-06-14 15:03:52,810 INFO  L130     BoogieDeclarations]: Found specification of procedure P3
[2024-06-14 15:03:52,810 INFO  L138     BoogieDeclarations]: Found implementation of procedure P3
[2024-06-14 15:03:52,810 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-06-14 15:03:52,811 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2024-06-14 15:03:52,811 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-06-14 15:03:52,811 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-06-14 15:03:52,813 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 15:03:52,976 INFO  L244             CfgBuilder]: Building ICFG
[2024-06-14 15:03:52,978 INFO  L270             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-06-14 15:03:55,487 INFO  L289             CfgBuilder]: Ommited future-live optimization because the input is a concurrent program.
[2024-06-14 15:03:55,487 INFO  L293             CfgBuilder]: Performing block encoding
[2024-06-14 15:03:56,046 INFO  L315             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-06-14 15:03:56,047 INFO  L320             CfgBuilder]: Removed 0 assume(true) statements.
[2024-06-14 15:03:56,048 INFO  L201        PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 03:03:56 BoogieIcfgContainer
[2024-06-14 15:03:56,048 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-06-14 15:03:56,050 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-06-14 15:03:56,050 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-06-14 15:03:56,053 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-06-14 15:03:56,054 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.06 03:03:50" (1/4) ...
[2024-06-14 15:03:56,054 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a442098 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.06 03:03:56, skipping insertion in model container
[2024-06-14 15:03:56,054 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 03:03:51" (2/4) ...
[2024-06-14 15:03:56,055 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a442098 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 14.06 03:03:56, skipping insertion in model container
[2024-06-14 15:03:56,055 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 03:03:52" (3/4) ...
[2024-06-14 15:03:56,055 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a442098 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 14.06 03:03:56, skipping insertion in model container
[2024-06-14 15:03:56,055 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 03:03:56" (4/4) ...
[2024-06-14 15:03:56,057 INFO  L112   eAbstractionObserver]: Analyzing ICFG mix030_power.opt_pso.opt_rmo.opt.i
[2024-06-14 15:03:56,073 INFO  L204   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-06-14 15:03:56,073 INFO  L163   ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations.
[2024-06-14 15:03:56,073 INFO  L522   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-06-14 15:03:56,264 INFO  L144    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-06-14 15:03:56,293 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 66 places, 53 transitions, 122 flow
[2024-06-14 15:03:56,391 INFO  L124   PetriNetUnfolderBase]: 0/49 cut-off events.
[2024-06-14 15:03:56,391 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-06-14 15:03:56,394 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 62 conditions, 49 events. 0/49 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 88 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. 
[2024-06-14 15:03:56,395 INFO  L82        GeneralOperation]: Start removeDead. Operand has 66 places, 53 transitions, 122 flow
[2024-06-14 15:03:56,398 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 56 places, 43 transitions, 98 flow
[2024-06-14 15:03:56,406 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-06-14 15:03:56,412 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;@1de29506, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-06-14 15:03:56,412 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 8 error locations.
[2024-06-14 15:03:56,424 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-06-14 15:03:56,424 INFO  L124   PetriNetUnfolderBase]: 0/6 cut-off events.
[2024-06-14 15:03:56,425 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-06-14 15:03:56,425 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:03:56,426 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1]
[2024-06-14 15:03:56,426 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 15:03:56,432 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:03:56,433 INFO  L85        PathProgramCache]: Analyzing trace with hash -772795219, now seen corresponding path program 1 times
[2024-06-14 15:03:56,444 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:03:56,444 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430786075]
[2024-06-14 15:03:56,444 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:03:56,445 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:03:56,898 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:04:07,324 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:04:07,325 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:04:07,325 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430786075]
[2024-06-14 15:04:07,326 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430786075] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:04:07,327 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:04:07,327 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-06-14 15:04:07,328 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876795635]
[2024-06-14 15:04:07,329 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:04:07,337 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-06-14 15:04:07,343 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:04:07,371 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-06-14 15:04:07,372 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-06-14 15:04:07,581 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 53
[2024-06-14 15:04:07,583 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 43 transitions, 98 flow. Second operand  has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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 15:04:07,584 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:04:07,584 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 53
[2024-06-14 15:04:07,585 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:04:14,064 INFO  L124   PetriNetUnfolderBase]: 9899/14073 cut-off events.
[2024-06-14 15:04:14,064 INFO  L125   PetriNetUnfolderBase]: For 212/212 co-relation queries the response was YES.
[2024-06-14 15:04:14,086 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 27969 conditions, 14073 events. 9899/14073 cut-off events. For 212/212 co-relation queries the response was YES. Maximal size of possible extension queue 508. Compared 79678 event pairs, 7548 based on Foata normal form. 1/13649 useless extension candidates. Maximal degree in co-relation 27953. Up to 13445 conditions per place. 
[2024-06-14 15:04:14,248 INFO  L140   encePairwiseOnDemand]: 44/53 looper letters, 45 selfloop transitions, 5 changer transitions 0/57 dead transitions.
[2024-06-14 15:04:14,249 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 57 transitions, 235 flow
[2024-06-14 15:04:14,250 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-06-14 15:04:14,252 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-06-14 15:04:14,259 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions.
[2024-06-14 15:04:14,261 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5849056603773585
[2024-06-14 15:04:14,263 INFO  L175             Difference]: Start difference. First operand has 56 places, 43 transitions, 98 flow. Second operand 3 states and 93 transitions.
[2024-06-14 15:04:14,263 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 57 transitions, 235 flow
[2024-06-14 15:04:14,266 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 57 transitions, 228 flow, removed 0 selfloop flow, removed 4 redundant places.
[2024-06-14 15:04:14,273 INFO  L231             Difference]: Finished difference. Result has 55 places, 47 transitions, 133 flow
[2024-06-14 15:04:14,274 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=133, PETRI_PLACES=55, PETRI_TRANSITIONS=47}
[2024-06-14 15:04:14,278 INFO  L281   CegarLoopForPetriNet]: 56 programPoint places, -1 predicate places.
[2024-06-14 15:04:14,278 INFO  L495      AbstractCegarLoop]: Abstraction has has 55 places, 47 transitions, 133 flow
[2024-06-14 15:04:14,278 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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 15:04:14,279 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:04:14,279 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:04:14,279 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-06-14 15:04:14,279 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 15:04:14,280 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:04:14,281 INFO  L85        PathProgramCache]: Analyzing trace with hash 373169868, now seen corresponding path program 1 times
[2024-06-14 15:04:14,281 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:04:14,281 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703423298]
[2024-06-14 15:04:14,281 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:04:14,281 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:04:14,431 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:04:22,366 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:04:22,366 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:04:22,367 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703423298]
[2024-06-14 15:04:22,367 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703423298] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:04:22,367 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:04:22,367 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-06-14 15:04:22,367 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047079806]
[2024-06-14 15:04:22,368 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:04:22,369 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-06-14 15:04:22,369 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:04:22,369 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-06-14 15:04:22,370 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-06-14 15:04:22,572 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 53
[2024-06-14 15:04:22,572 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 47 transitions, 133 flow. Second operand  has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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 15:04:22,572 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:04:22,573 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 53
[2024-06-14 15:04:22,573 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:04:27,875 INFO  L124   PetriNetUnfolderBase]: 11581/15991 cut-off events.
[2024-06-14 15:04:27,875 INFO  L125   PetriNetUnfolderBase]: For 2904/2904 co-relation queries the response was YES.
[2024-06-14 15:04:27,891 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 36101 conditions, 15991 events. 11581/15991 cut-off events. For 2904/2904 co-relation queries the response was YES. Maximal size of possible extension queue 566. Compared 86933 event pairs, 7976 based on Foata normal form. 4/15993 useless extension candidates. Maximal degree in co-relation 36086. Up to 15642 conditions per place. 
[2024-06-14 15:04:27,943 INFO  L140   encePairwiseOnDemand]: 43/53 looper letters, 56 selfloop transitions, 9 changer transitions 0/71 dead transitions.
[2024-06-14 15:04:27,943 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 71 transitions, 329 flow
[2024-06-14 15:04:27,944 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-06-14 15:04:27,944 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-06-14 15:04:27,945 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 117 transitions.
[2024-06-14 15:04:27,946 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5518867924528302
[2024-06-14 15:04:27,946 INFO  L175             Difference]: Start difference. First operand has 55 places, 47 transitions, 133 flow. Second operand 4 states and 117 transitions.
[2024-06-14 15:04:27,946 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 71 transitions, 329 flow
[2024-06-14 15:04:27,948 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 71 transitions, 324 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-06-14 15:04:27,949 INFO  L231             Difference]: Finished difference. Result has 58 places, 51 transitions, 181 flow
[2024-06-14 15:04:27,949 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=181, PETRI_PLACES=58, PETRI_TRANSITIONS=51}
[2024-06-14 15:04:27,950 INFO  L281   CegarLoopForPetriNet]: 56 programPoint places, 2 predicate places.
[2024-06-14 15:04:27,950 INFO  L495      AbstractCegarLoop]: Abstraction has has 58 places, 51 transitions, 181 flow
[2024-06-14 15:04:27,951 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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 15:04:27,951 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:04:27,951 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:04:27,951 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-06-14 15:04:27,951 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 15:04:27,952 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:04:27,952 INFO  L85        PathProgramCache]: Analyzing trace with hash -1316634884, now seen corresponding path program 1 times
[2024-06-14 15:04:27,952 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:04:27,952 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702614255]
[2024-06-14 15:04:27,953 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:04:27,953 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:04:28,048 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:04:34,535 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 15:04:34,535 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:04:34,535 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702614255]
[2024-06-14 15:04:34,536 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702614255] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:04:34,536 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:04:34,536 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-06-14 15:04:34,536 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65763916]
[2024-06-14 15:04:34,536 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:04:34,537 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-06-14 15:04:34,537 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:04:34,538 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-06-14 15:04:34,538 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20
[2024-06-14 15:04:34,708 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 53
[2024-06-14 15:04:34,709 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 51 transitions, 181 flow. Second operand  has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:04:34,710 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:04:34,710 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 53
[2024-06-14 15:04:34,710 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:04:39,873 INFO  L124   PetriNetUnfolderBase]: 11599/16026 cut-off events.
[2024-06-14 15:04:39,874 INFO  L125   PetriNetUnfolderBase]: For 8436/8436 co-relation queries the response was YES.
[2024-06-14 15:04:39,891 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 40149 conditions, 16026 events. 11599/16026 cut-off events. For 8436/8436 co-relation queries the response was YES. Maximal size of possible extension queue 565. Compared 87312 event pairs, 6384 based on Foata normal form. 7/16030 useless extension candidates. Maximal degree in co-relation 40132. Up to 15563 conditions per place. 
[2024-06-14 15:04:39,949 INFO  L140   encePairwiseOnDemand]: 41/53 looper letters, 74 selfloop transitions, 21 changer transitions 0/101 dead transitions.
[2024-06-14 15:04:39,950 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 101 transitions, 545 flow
[2024-06-14 15:04:39,950 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-14 15:04:39,950 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-14 15:04:39,955 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 153 transitions.
[2024-06-14 15:04:39,956 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5773584905660377
[2024-06-14 15:04:39,957 INFO  L175             Difference]: Start difference. First operand has 58 places, 51 transitions, 181 flow. Second operand 5 states and 153 transitions.
[2024-06-14 15:04:39,957 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 101 transitions, 545 flow
[2024-06-14 15:04:39,963 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 101 transitions, 526 flow, removed 3 selfloop flow, removed 2 redundant places.
[2024-06-14 15:04:39,965 INFO  L231             Difference]: Finished difference. Result has 63 places, 65 transitions, 312 flow
[2024-06-14 15:04:39,965 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=312, PETRI_PLACES=63, PETRI_TRANSITIONS=65}
[2024-06-14 15:04:39,966 INFO  L281   CegarLoopForPetriNet]: 56 programPoint places, 7 predicate places.
[2024-06-14 15:04:39,966 INFO  L495      AbstractCegarLoop]: Abstraction has has 63 places, 65 transitions, 312 flow
[2024-06-14 15:04:39,967 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:04:39,967 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:04:39,967 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:04:39,967 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-06-14 15:04:39,967 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 15:04:39,968 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:04:39,968 INFO  L85        PathProgramCache]: Analyzing trace with hash 1729264891, now seen corresponding path program 1 times
[2024-06-14 15:04:39,968 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:04:39,969 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137256574]
[2024-06-14 15:04:39,969 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:04:39,969 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:04:40,034 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:04:46,601 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 15:04:46,602 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:04:46,605 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137256574]
[2024-06-14 15:04:46,605 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137256574] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:04:46,606 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:04:46,606 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-06-14 15:04:46,606 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736912210]
[2024-06-14 15:04:46,607 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:04:46,607 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-06-14 15:04:46,607 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:04:46,609 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-06-14 15:04:46,609 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2024-06-14 15:04:46,775 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 53
[2024-06-14 15:04:46,775 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 65 transitions, 312 flow. Second operand  has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:04:46,775 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:04:46,775 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 53
[2024-06-14 15:04:46,776 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:04:52,393 INFO  L124   PetriNetUnfolderBase]: 11628/16065 cut-off events.
[2024-06-14 15:04:52,393 INFO  L125   PetriNetUnfolderBase]: For 20158/20163 co-relation queries the response was YES.
[2024-06-14 15:04:52,409 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 46687 conditions, 16065 events. 11628/16065 cut-off events. For 20158/20163 co-relation queries the response was YES. Maximal size of possible extension queue 564. Compared 87595 event pairs, 5283 based on Foata normal form. 18/16080 useless extension candidates. Maximal degree in co-relation 46667. Up to 15528 conditions per place. 
[2024-06-14 15:04:52,473 INFO  L140   encePairwiseOnDemand]: 41/53 looper letters, 81 selfloop transitions, 25 changer transitions 0/112 dead transitions.
[2024-06-14 15:04:52,474 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 112 transitions, 690 flow
[2024-06-14 15:04:52,476 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-14 15:04:52,476 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-14 15:04:52,478 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 176 transitions.
[2024-06-14 15:04:52,478 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5534591194968553
[2024-06-14 15:04:52,478 INFO  L175             Difference]: Start difference. First operand has 63 places, 65 transitions, 312 flow. Second operand 6 states and 176 transitions.
[2024-06-14 15:04:52,479 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 112 transitions, 690 flow
[2024-06-14 15:04:52,490 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 112 transitions, 678 flow, removed 6 selfloop flow, removed 0 redundant places.
[2024-06-14 15:04:52,492 INFO  L231             Difference]: Finished difference. Result has 68 places, 68 transitions, 389 flow
[2024-06-14 15:04:52,492 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=389, PETRI_PLACES=68, PETRI_TRANSITIONS=68}
[2024-06-14 15:04:52,494 INFO  L281   CegarLoopForPetriNet]: 56 programPoint places, 12 predicate places.
[2024-06-14 15:04:52,494 INFO  L495      AbstractCegarLoop]: Abstraction has has 68 places, 68 transitions, 389 flow
[2024-06-14 15:04:52,494 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:04:52,494 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:04:52,495 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:04:52,495 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-06-14 15:04:52,495 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 15:04:52,495 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:04:52,496 INFO  L85        PathProgramCache]: Analyzing trace with hash 1185433888, now seen corresponding path program 1 times
[2024-06-14 15:04:52,496 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:04:52,496 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050773722]
[2024-06-14 15:04:52,497 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:04:52,497 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:04:52,557 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:05:10,588 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 15:05:10,588 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:05:10,588 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050773722]
[2024-06-14 15:05:10,588 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050773722] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:05:10,588 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:05:10,588 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-06-14 15:05:10,589 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353543704]
[2024-06-14 15:05:10,589 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:05:10,589 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-06-14 15:05:10,589 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:05:10,590 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-06-14 15:05:10,590 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2024-06-14 15:05:10,727 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 53
[2024-06-14 15:05:10,728 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 68 transitions, 389 flow. Second operand  has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 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 15:05:10,728 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:05:10,728 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 53
[2024-06-14 15:05:10,728 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:05:15,648 INFO  L124   PetriNetUnfolderBase]: 9927/14066 cut-off events.
[2024-06-14 15:05:15,648 INFO  L125   PetriNetUnfolderBase]: For 25660/25660 co-relation queries the response was YES.
[2024-06-14 15:05:15,669 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 44190 conditions, 14066 events. 9927/14066 cut-off events. For 25660/25660 co-relation queries the response was YES. Maximal size of possible extension queue 509. Compared 79521 event pairs, 5267 based on Foata normal form. 3/13873 useless extension candidates. Maximal degree in co-relation 44167. Up to 13472 conditions per place. 
[2024-06-14 15:05:15,731 INFO  L140   encePairwiseOnDemand]: 43/53 looper letters, 68 selfloop transitions, 10 changer transitions 0/85 dead transitions.
[2024-06-14 15:05:15,731 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 85 transitions, 589 flow
[2024-06-14 15:05:15,732 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-14 15:05:15,732 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-14 15:05:15,732 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 123 transitions.
[2024-06-14 15:05:15,733 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4641509433962264
[2024-06-14 15:05:15,736 INFO  L175             Difference]: Start difference. First operand has 68 places, 68 transitions, 389 flow. Second operand 5 states and 123 transitions.
[2024-06-14 15:05:15,736 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 85 transitions, 589 flow
[2024-06-14 15:05:15,748 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 85 transitions, 520 flow, removed 12 selfloop flow, removed 4 redundant places.
[2024-06-14 15:05:15,751 INFO  L231             Difference]: Finished difference. Result has 69 places, 68 transitions, 351 flow
[2024-06-14 15:05:15,751 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=351, PETRI_PLACES=69, PETRI_TRANSITIONS=68}
[2024-06-14 15:05:15,760 INFO  L281   CegarLoopForPetriNet]: 56 programPoint places, 13 predicate places.
[2024-06-14 15:05:15,760 INFO  L495      AbstractCegarLoop]: Abstraction has has 69 places, 68 transitions, 351 flow
[2024-06-14 15:05:15,761 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 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 15:05:15,761 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:05:15,761 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:05:15,761 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-06-14 15:05:15,761 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 15:05:15,762 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:05:15,762 INFO  L85        PathProgramCache]: Analyzing trace with hash -1906484884, now seen corresponding path program 1 times
[2024-06-14 15:05:15,762 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:05:15,762 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960600237]
[2024-06-14 15:05:15,762 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:05:15,763 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:05:15,814 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:05:33,989 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 15:05:33,990 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:05:33,990 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960600237]
[2024-06-14 15:05:33,990 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960600237] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:05:33,990 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:05:33,990 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-14 15:05:33,990 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759757156]
[2024-06-14 15:05:33,990 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:05:33,991 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-14 15:05:33,991 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:05:33,991 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-14 15:05:33,991 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-06-14 15:05:34,179 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 53
[2024-06-14 15:05:34,180 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 68 transitions, 351 flow. Second operand  has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 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 15:05:34,180 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:05:34,180 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 53
[2024-06-14 15:05:34,180 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:05:39,160 INFO  L124   PetriNetUnfolderBase]: 9909/14106 cut-off events.
[2024-06-14 15:05:39,160 INFO  L125   PetriNetUnfolderBase]: For 29840/29840 co-relation queries the response was YES.
[2024-06-14 15:05:39,177 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 44896 conditions, 14106 events. 9909/14106 cut-off events. For 29840/29840 co-relation queries the response was YES. Maximal size of possible extension queue 508. Compared 80024 event pairs, 5029 based on Foata normal form. 6/13902 useless extension candidates. Maximal degree in co-relation 44871. Up to 13418 conditions per place. 
[2024-06-14 15:05:39,215 INFO  L140   encePairwiseOnDemand]: 42/53 looper letters, 76 selfloop transitions, 14 changer transitions 0/97 dead transitions.
[2024-06-14 15:05:39,215 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 97 transitions, 623 flow
[2024-06-14 15:05:39,215 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-14 15:05:39,215 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-14 15:05:39,216 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 147 transitions.
[2024-06-14 15:05:39,216 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46226415094339623
[2024-06-14 15:05:39,216 INFO  L175             Difference]: Start difference. First operand has 69 places, 68 transitions, 351 flow. Second operand 6 states and 147 transitions.
[2024-06-14 15:05:39,216 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 97 transitions, 623 flow
[2024-06-14 15:05:39,227 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 97 transitions, 594 flow, removed 3 selfloop flow, removed 4 redundant places.
[2024-06-14 15:05:39,229 INFO  L231             Difference]: Finished difference. Result has 71 places, 72 transitions, 397 flow
[2024-06-14 15:05:39,229 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=397, PETRI_PLACES=71, PETRI_TRANSITIONS=72}
[2024-06-14 15:05:39,230 INFO  L281   CegarLoopForPetriNet]: 56 programPoint places, 15 predicate places.
[2024-06-14 15:05:39,230 INFO  L495      AbstractCegarLoop]: Abstraction has has 71 places, 72 transitions, 397 flow
[2024-06-14 15:05:39,230 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 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 15:05:39,230 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:05:39,230 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:05:39,230 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-06-14 15:05:39,231 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 15:05:39,231 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:05:39,231 INFO  L85        PathProgramCache]: Analyzing trace with hash 1028296337, now seen corresponding path program 1 times
[2024-06-14 15:05:39,231 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:05:39,232 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332033138]
[2024-06-14 15:05:39,232 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:05:39,232 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:05:39,275 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:05:58,218 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 15:05:58,218 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:05:58,218 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332033138]
[2024-06-14 15:05:58,218 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332033138] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:05:58,218 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:05:58,218 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-14 15:05:58,218 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323466919]
[2024-06-14 15:05:58,218 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:05:58,219 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-14 15:05:58,219 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:05:58,219 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-14 15:05:58,219 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-06-14 15:05:58,431 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 53
[2024-06-14 15:05:58,431 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 72 transitions, 397 flow. Second operand  has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 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 15:05:58,431 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:05:58,432 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 53
[2024-06-14 15:05:58,432 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:06:04,232 INFO  L124   PetriNetUnfolderBase]: 11614/16052 cut-off events.
[2024-06-14 15:06:04,232 INFO  L125   PetriNetUnfolderBase]: For 47256/47256 co-relation queries the response was YES.
[2024-06-14 15:06:04,259 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 55338 conditions, 16052 events. 11614/16052 cut-off events. For 47256/47256 co-relation queries the response was YES. Maximal size of possible extension queue 566. Compared 87280 event pairs, 6120 based on Foata normal form. 6/16056 useless extension candidates. Maximal degree in co-relation 55313. Up to 15582 conditions per place. 
[2024-06-14 15:06:04,306 INFO  L140   encePairwiseOnDemand]: 41/53 looper letters, 90 selfloop transitions, 27 changer transitions 0/123 dead transitions.
[2024-06-14 15:06:04,306 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 123 transitions, 818 flow
[2024-06-14 15:06:04,306 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 15:06:04,306 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 15:06:04,307 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 197 transitions.
[2024-06-14 15:06:04,307 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46462264150943394
[2024-06-14 15:06:04,307 INFO  L175             Difference]: Start difference. First operand has 71 places, 72 transitions, 397 flow. Second operand 8 states and 197 transitions.
[2024-06-14 15:06:04,307 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 123 transitions, 818 flow
[2024-06-14 15:06:04,318 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 123 transitions, 775 flow, removed 10 selfloop flow, removed 4 redundant places.
[2024-06-14 15:06:04,319 INFO  L231             Difference]: Finished difference. Result has 75 places, 76 transitions, 454 flow
[2024-06-14 15:06:04,320 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=354, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=454, PETRI_PLACES=75, PETRI_TRANSITIONS=76}
[2024-06-14 15:06:04,320 INFO  L281   CegarLoopForPetriNet]: 56 programPoint places, 19 predicate places.
[2024-06-14 15:06:04,320 INFO  L495      AbstractCegarLoop]: Abstraction has has 75 places, 76 transitions, 454 flow
[2024-06-14 15:06:04,320 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 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 15:06:04,321 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:06:04,321 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:06:04,321 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-06-14 15:06:04,321 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 15:06:04,321 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:06:04,321 INFO  L85        PathProgramCache]: Analyzing trace with hash 1028503727, now seen corresponding path program 2 times
[2024-06-14 15:06:04,321 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:06:04,321 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890665147]
[2024-06-14 15:06:04,321 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:06:04,321 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:06:04,360 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:06:22,063 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 15:06:22,063 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:06:22,063 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890665147]
[2024-06-14 15:06:22,063 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890665147] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:06:22,063 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:06:22,063 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-14 15:06:22,063 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371354096]
[2024-06-14 15:06:22,064 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:06:22,064 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-14 15:06:22,064 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:06:22,064 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-14 15:06:22,065 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-06-14 15:06:22,355 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 53
[2024-06-14 15:06:22,355 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 76 transitions, 454 flow. Second operand  has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 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 15:06:22,355 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:06:22,355 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 53
[2024-06-14 15:06:22,355 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:06:27,821 INFO  L124   PetriNetUnfolderBase]: 11590/16016 cut-off events.
[2024-06-14 15:06:27,822 INFO  L125   PetriNetUnfolderBase]: For 55412/55426 co-relation queries the response was YES.
[2024-06-14 15:06:27,846 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 56521 conditions, 16016 events. 11590/16016 cut-off events. For 55412/55426 co-relation queries the response was YES. Maximal size of possible extension queue 566. Compared 87063 event pairs, 6130 based on Foata normal form. 15/16028 useless extension candidates. Maximal degree in co-relation 56495. Up to 15552 conditions per place. 
[2024-06-14 15:06:27,901 INFO  L140   encePairwiseOnDemand]: 41/53 looper letters, 77 selfloop transitions, 27 changer transitions 0/110 dead transitions.
[2024-06-14 15:06:27,902 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 110 transitions, 750 flow
[2024-06-14 15:06:27,902 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 15:06:27,902 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 15:06:27,903 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 170 transitions.
[2024-06-14 15:06:27,903 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4582210242587601
[2024-06-14 15:06:27,903 INFO  L175             Difference]: Start difference. First operand has 75 places, 76 transitions, 454 flow. Second operand 7 states and 170 transitions.
[2024-06-14 15:06:27,904 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 110 transitions, 750 flow
[2024-06-14 15:06:27,922 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 110 transitions, 700 flow, removed 7 selfloop flow, removed 5 redundant places.
[2024-06-14 15:06:27,923 INFO  L231             Difference]: Finished difference. Result has 77 places, 76 transitions, 469 flow
[2024-06-14 15:06:27,924 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=404, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=469, PETRI_PLACES=77, PETRI_TRANSITIONS=76}
[2024-06-14 15:06:27,924 INFO  L281   CegarLoopForPetriNet]: 56 programPoint places, 21 predicate places.
[2024-06-14 15:06:27,924 INFO  L495      AbstractCegarLoop]: Abstraction has has 77 places, 76 transitions, 469 flow
[2024-06-14 15:06:27,925 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 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 15:06:27,925 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:06:27,925 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:06:27,925 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-06-14 15:06:27,925 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 15:06:27,926 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:06:27,926 INFO  L85        PathProgramCache]: Analyzing trace with hash 548723647, now seen corresponding path program 1 times
[2024-06-14 15:06:27,926 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:06:27,926 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494217354]
[2024-06-14 15:06:27,926 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:06:27,926 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:06:27,965 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:06:45,535 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 15:06:45,536 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:06:45,536 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494217354]
[2024-06-14 15:06:45,536 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494217354] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:06:45,536 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:06:45,536 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 15:06:45,536 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318456765]
[2024-06-14 15:06:45,537 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:06:45,537 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 15:06:45,537 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:06:45,537 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 15:06:45,538 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56
[2024-06-14 15:06:45,845 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 53
[2024-06-14 15:06:45,845 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 76 transitions, 469 flow. Second operand  has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 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 15:06:45,845 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:06:45,845 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 53
[2024-06-14 15:06:45,845 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:06:51,475 INFO  L124   PetriNetUnfolderBase]: 11852/16391 cut-off events.
[2024-06-14 15:06:51,476 INFO  L125   PetriNetUnfolderBase]: For 66164/66168 co-relation queries the response was YES.
[2024-06-14 15:06:51,502 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 59423 conditions, 16391 events. 11852/16391 cut-off events. For 66164/66168 co-relation queries the response was YES. Maximal size of possible extension queue 566. Compared 89008 event pairs, 6123 based on Foata normal form. 16/16405 useless extension candidates. Maximal degree in co-relation 59396. Up to 15829 conditions per place. 
[2024-06-14 15:06:51,559 INFO  L140   encePairwiseOnDemand]: 37/53 looper letters, 113 selfloop transitions, 35 changer transitions 0/154 dead transitions.
[2024-06-14 15:06:51,559 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 154 transitions, 1154 flow
[2024-06-14 15:06:51,561 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 15:06:51,561 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 15:06:51,562 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 221 transitions.
[2024-06-14 15:06:51,562 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46331236897274636
[2024-06-14 15:06:51,562 INFO  L175             Difference]: Start difference. First operand has 77 places, 76 transitions, 469 flow. Second operand 9 states and 221 transitions.
[2024-06-14 15:06:51,562 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 154 transitions, 1154 flow
[2024-06-14 15:06:51,590 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 154 transitions, 1027 flow, removed 4 selfloop flow, removed 7 redundant places.
[2024-06-14 15:06:51,592 INFO  L231             Difference]: Finished difference. Result has 82 places, 101 transitions, 684 flow
[2024-06-14 15:06:51,592 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=386, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=684, PETRI_PLACES=82, PETRI_TRANSITIONS=101}
[2024-06-14 15:06:51,593 INFO  L281   CegarLoopForPetriNet]: 56 programPoint places, 26 predicate places.
[2024-06-14 15:06:51,593 INFO  L495      AbstractCegarLoop]: Abstraction has has 82 places, 101 transitions, 684 flow
[2024-06-14 15:06:51,593 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 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 15:06:51,593 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:06:51,593 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:06:51,594 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-06-14 15:06:51,594 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 15:06:51,594 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:06:51,594 INFO  L85        PathProgramCache]: Analyzing trace with hash -75440577, now seen corresponding path program 2 times
[2024-06-14 15:06:51,594 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:06:51,595 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117272594]
[2024-06-14 15:06:51,595 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:06:51,595 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:06:51,643 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:07:11,305 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 15:07:11,305 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:07:11,305 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117272594]
[2024-06-14 15:07:11,305 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117272594] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:07:11,305 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:07:11,305 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 15:07:11,305 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818256243]
[2024-06-14 15:07:11,306 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:07:11,306 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 15:07:11,306 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:07:11,306 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 15:07:11,307 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2024-06-14 15:07:11,598 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 53
[2024-06-14 15:07:11,598 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 101 transitions, 684 flow. Second operand  has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 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 15:07:11,598 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:07:11,599 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 53
[2024-06-14 15:07:11,599 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:07:17,640 INFO  L124   PetriNetUnfolderBase]: 11940/16471 cut-off events.
[2024-06-14 15:07:17,640 INFO  L125   PetriNetUnfolderBase]: For 87450/87458 co-relation queries the response was YES.
[2024-06-14 15:07:17,667 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 65026 conditions, 16471 events. 11940/16471 cut-off events. For 87450/87458 co-relation queries the response was YES. Maximal size of possible extension queue 564. Compared 89106 event pairs, 5417 based on Foata normal form. 20/16489 useless extension candidates. Maximal degree in co-relation 64995. Up to 15623 conditions per place. 
[2024-06-14 15:07:17,724 INFO  L140   encePairwiseOnDemand]: 40/53 looper letters, 102 selfloop transitions, 59 changer transitions 0/167 dead transitions.
[2024-06-14 15:07:17,724 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 167 transitions, 1326 flow
[2024-06-14 15:07:17,724 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 15:07:17,724 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 15:07:17,725 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 225 transitions.
[2024-06-14 15:07:17,725 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4716981132075472
[2024-06-14 15:07:17,725 INFO  L175             Difference]: Start difference. First operand has 82 places, 101 transitions, 684 flow. Second operand 9 states and 225 transitions.
[2024-06-14 15:07:17,726 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 167 transitions, 1326 flow
[2024-06-14 15:07:17,773 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 167 transitions, 1282 flow, removed 14 selfloop flow, removed 3 redundant places.
[2024-06-14 15:07:17,776 INFO  L231             Difference]: Finished difference. Result has 88 places, 110 transitions, 874 flow
[2024-06-14 15:07:17,776 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=640, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=874, PETRI_PLACES=88, PETRI_TRANSITIONS=110}
[2024-06-14 15:07:17,777 INFO  L281   CegarLoopForPetriNet]: 56 programPoint places, 32 predicate places.
[2024-06-14 15:07:17,777 INFO  L495      AbstractCegarLoop]: Abstraction has has 88 places, 110 transitions, 874 flow
[2024-06-14 15:07:17,777 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 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 15:07:17,777 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:07:17,777 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:07:17,778 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-06-14 15:07:17,778 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 15:07:17,778 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:07:17,778 INFO  L85        PathProgramCache]: Analyzing trace with hash 1819082507, now seen corresponding path program 3 times
[2024-06-14 15:07:17,778 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:07:17,779 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77413018]
[2024-06-14 15:07:17,779 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:07:17,779 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:07:17,812 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:07:37,283 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 15:07:37,283 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:07:37,283 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77413018]
[2024-06-14 15:07:37,283 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77413018] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:07:37,283 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:07:37,283 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 15:07:37,284 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844755880]
[2024-06-14 15:07:37,284 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:07:37,284 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 15:07:37,284 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:07:37,284 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 15:07:37,284 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2024-06-14 15:07:37,595 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 53
[2024-06-14 15:07:37,595 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 110 transitions, 874 flow. Second operand  has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 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 15:07:37,595 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:07:37,595 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 53
[2024-06-14 15:07:37,595 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:07:43,511 INFO  L124   PetriNetUnfolderBase]: 11984/16558 cut-off events.
[2024-06-14 15:07:43,511 INFO  L125   PetriNetUnfolderBase]: For 111047/111066 co-relation queries the response was YES.
[2024-06-14 15:07:43,539 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 70446 conditions, 16558 events. 11984/16558 cut-off events. For 111047/111066 co-relation queries the response was YES. Maximal size of possible extension queue 564. Compared 89652 event pairs, 5421 based on Foata normal form. 22/16576 useless extension candidates. Maximal degree in co-relation 70413. Up to 15645 conditions per place. 
[2024-06-14 15:07:43,600 INFO  L140   encePairwiseOnDemand]: 40/53 looper letters, 94 selfloop transitions, 68 changer transitions 0/168 dead transitions.
[2024-06-14 15:07:43,600 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 168 transitions, 1566 flow
[2024-06-14 15:07:43,601 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 15:07:43,601 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 15:07:43,601 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 204 transitions.
[2024-06-14 15:07:43,602 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4811320754716981
[2024-06-14 15:07:43,602 INFO  L175             Difference]: Start difference. First operand has 88 places, 110 transitions, 874 flow. Second operand 8 states and 204 transitions.
[2024-06-14 15:07:43,602 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 168 transitions, 1566 flow
[2024-06-14 15:07:43,703 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 168 transitions, 1468 flow, removed 30 selfloop flow, removed 5 redundant places.
[2024-06-14 15:07:43,706 INFO  L231             Difference]: Finished difference. Result has 91 places, 118 transitions, 1037 flow
[2024-06-14 15:07:43,706 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=792, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1037, PETRI_PLACES=91, PETRI_TRANSITIONS=118}
[2024-06-14 15:07:43,707 INFO  L281   CegarLoopForPetriNet]: 56 programPoint places, 35 predicate places.
[2024-06-14 15:07:43,707 INFO  L495      AbstractCegarLoop]: Abstraction has has 91 places, 118 transitions, 1037 flow
[2024-06-14 15:07:43,707 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 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 15:07:43,708 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:07:43,708 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:07:43,708 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-06-14 15:07:43,708 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 15:07:43,708 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:07:43,709 INFO  L85        PathProgramCache]: Analyzing trace with hash 869052991, now seen corresponding path program 4 times
[2024-06-14 15:07:43,709 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:07:43,709 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870019546]
[2024-06-14 15:07:43,709 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:07:43,709 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:07:43,747 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:08:03,130 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 15:08:03,130 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:08:03,130 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870019546]
[2024-06-14 15:08:03,130 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870019546] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:08:03,131 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:08:03,131 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 15:08:03,131 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828149939]
[2024-06-14 15:08:03,131 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:08:03,131 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 15:08:03,132 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:08:03,132 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 15:08:03,132 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2024-06-14 15:08:03,404 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 53
[2024-06-14 15:08:03,405 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 118 transitions, 1037 flow. Second operand  has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 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 15:08:03,405 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:08:03,405 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 53
[2024-06-14 15:08:03,405 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:08:09,206 INFO  L124   PetriNetUnfolderBase]: 11966/16534 cut-off events.
[2024-06-14 15:08:09,206 INFO  L125   PetriNetUnfolderBase]: For 102881/102900 co-relation queries the response was YES.
[2024-06-14 15:08:09,239 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 68184 conditions, 16534 events. 11966/16534 cut-off events. For 102881/102900 co-relation queries the response was YES. Maximal size of possible extension queue 564. Compared 89534 event pairs, 5418 based on Foata normal form. 22/16552 useless extension candidates. Maximal degree in co-relation 68149. Up to 15636 conditions per place. 
[2024-06-14 15:08:09,301 INFO  L140   encePairwiseOnDemand]: 40/53 looper letters, 94 selfloop transitions, 66 changer transitions 0/166 dead transitions.
[2024-06-14 15:08:09,301 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 166 transitions, 1561 flow
[2024-06-14 15:08:09,310 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 15:08:09,311 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 15:08:09,311 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 202 transitions.
[2024-06-14 15:08:09,312 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.47641509433962265
[2024-06-14 15:08:09,312 INFO  L175             Difference]: Start difference. First operand has 91 places, 118 transitions, 1037 flow. Second operand 8 states and 202 transitions.
[2024-06-14 15:08:09,312 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 166 transitions, 1561 flow
[2024-06-14 15:08:09,398 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 166 transitions, 1445 flow, removed 28 selfloop flow, removed 4 redundant places.
[2024-06-14 15:08:09,401 INFO  L231             Difference]: Finished difference. Result has 95 places, 118 transitions, 1064 flow
[2024-06-14 15:08:09,401 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=921, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1064, PETRI_PLACES=95, PETRI_TRANSITIONS=118}
[2024-06-14 15:08:09,402 INFO  L281   CegarLoopForPetriNet]: 56 programPoint places, 39 predicate places.
[2024-06-14 15:08:09,402 INFO  L495      AbstractCegarLoop]: Abstraction has has 95 places, 118 transitions, 1064 flow
[2024-06-14 15:08:09,402 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 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 15:08:09,402 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:08:09,403 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:08:09,403 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-06-14 15:08:09,403 INFO  L420      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] ===
[2024-06-14 15:08:09,403 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:08:09,403 INFO  L85        PathProgramCache]: Analyzing trace with hash 1819091435, now seen corresponding path program 1 times
[2024-06-14 15:08:09,403 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:08:09,404 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191836034]
[2024-06-14 15:08:09,404 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:08:09,404 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:08:09,463 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:08:28,546 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 15:08:28,546 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:08:28,546 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191836034]
[2024-06-14 15:08:28,547 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191836034] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:08:28,547 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:08:28,547 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 15:08:28,547 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692792203]
[2024-06-14 15:08:28,547 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:08:28,547 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 15:08:28,547 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:08:28,548 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 15:08:28,548 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-14 15:08:28,783 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 53
[2024-06-14 15:08:28,783 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 118 transitions, 1064 flow. Second operand  has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:08:28,783 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:08:28,783 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 53
[2024-06-14 15:08:28,783 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:08:33,991 INFO  L124   PetriNetUnfolderBase]: 10259/14359 cut-off events.
[2024-06-14 15:08:33,991 INFO  L125   PetriNetUnfolderBase]: For 98853/98853 co-relation queries the response was YES.
[2024-06-14 15:08:34,023 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 60249 conditions, 14359 events. 10259/14359 cut-off events. For 98853/98853 co-relation queries the response was YES. Maximal size of possible extension queue 500. Compared 79075 event pairs, 4648 based on Foata normal form. 6/14213 useless extension candidates. Maximal degree in co-relation 60213. Up to 13863 conditions per place. 
[2024-06-14 15:08:34,076 INFO  L140   encePairwiseOnDemand]: 42/53 looper letters, 130 selfloop transitions, 17 changer transitions 0/154 dead transitions.
[2024-06-14 15:08:34,076 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 154 transitions, 1496 flow
[2024-06-14 15:08:34,077 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 15:08:34,077 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 15:08:34,077 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 170 transitions.
[2024-06-14 15:08:34,077 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4582210242587601
[2024-06-14 15:08:34,078 INFO  L175             Difference]: Start difference. First operand has 95 places, 118 transitions, 1064 flow. Second operand 7 states and 170 transitions.
[2024-06-14 15:08:34,078 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 154 transitions, 1496 flow
[2024-06-14 15:08:34,157 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 154 transitions, 1301 flow, removed 7 selfloop flow, removed 8 redundant places.
[2024-06-14 15:08:34,159 INFO  L231             Difference]: Finished difference. Result has 94 places, 121 transitions, 955 flow
[2024-06-14 15:08:34,159 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=869, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=955, PETRI_PLACES=94, PETRI_TRANSITIONS=121}
[2024-06-14 15:08:34,160 INFO  L281   CegarLoopForPetriNet]: 56 programPoint places, 38 predicate places.
[2024-06-14 15:08:34,160 INFO  L495      AbstractCegarLoop]: Abstraction has has 94 places, 121 transitions, 955 flow
[2024-06-14 15:08:34,160 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:08:34,160 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:08:34,160 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:08:34,160 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2024-06-14 15:08:34,161 INFO  L420      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] ===
[2024-06-14 15:08:34,161 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:08:34,161 INFO  L85        PathProgramCache]: Analyzing trace with hash -249742789, now seen corresponding path program 1 times
[2024-06-14 15:08:34,161 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:08:34,161 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651413807]
[2024-06-14 15:08:34,161 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:08:34,161 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:08:34,229 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:08:50,417 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 15:08:50,418 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:08:50,418 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651413807]
[2024-06-14 15:08:50,418 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651413807] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:08:50,418 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:08:50,418 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-06-14 15:08:50,419 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589157385]
[2024-06-14 15:08:50,419 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:08:50,419 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-06-14 15:08:50,419 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:08:50,420 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-06-14 15:08:50,420 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2024-06-14 15:08:50,616 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 53
[2024-06-14 15:08:50,616 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 121 transitions, 955 flow. Second operand  has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 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 15:08:50,616 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:08:50,617 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 53
[2024-06-14 15:08:50,617 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:08:55,630 INFO  L124   PetriNetUnfolderBase]: 10252/14710 cut-off events.
[2024-06-14 15:08:55,630 INFO  L125   PetriNetUnfolderBase]: For 109126/109126 co-relation queries the response was YES.
[2024-06-14 15:08:55,665 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 62551 conditions, 14710 events. 10252/14710 cut-off events. For 109126/109126 co-relation queries the response was YES. Maximal size of possible extension queue 510. Compared 83932 event pairs, 4855 based on Foata normal form. 2/14530 useless extension candidates. Maximal degree in co-relation 62514. Up to 13920 conditions per place. 
[2024-06-14 15:08:55,721 INFO  L140   encePairwiseOnDemand]: 44/53 looper letters, 122 selfloop transitions, 10 changer transitions 0/139 dead transitions.
[2024-06-14 15:08:55,721 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 139 transitions, 1301 flow
[2024-06-14 15:08:55,722 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-14 15:08:55,722 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-14 15:08:55,722 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 119 transitions.
[2024-06-14 15:08:55,723 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4490566037735849
[2024-06-14 15:08:55,723 INFO  L175             Difference]: Start difference. First operand has 94 places, 121 transitions, 955 flow. Second operand 5 states and 119 transitions.
[2024-06-14 15:08:55,723 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 139 transitions, 1301 flow
[2024-06-14 15:08:55,808 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 139 transitions, 1241 flow, removed 15 selfloop flow, removed 5 redundant places.
[2024-06-14 15:08:55,809 INFO  L231             Difference]: Finished difference. Result has 94 places, 125 transitions, 970 flow
[2024-06-14 15:08:55,810 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=895, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=970, PETRI_PLACES=94, PETRI_TRANSITIONS=125}
[2024-06-14 15:08:55,810 INFO  L281   CegarLoopForPetriNet]: 56 programPoint places, 38 predicate places.
[2024-06-14 15:08:55,810 INFO  L495      AbstractCegarLoop]: Abstraction has has 94 places, 125 transitions, 970 flow
[2024-06-14 15:08:55,811 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 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 15:08:55,811 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:08:55,811 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:08:55,811 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2024-06-14 15:08:55,811 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 15:08:55,812 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:08:55,812 INFO  L85        PathProgramCache]: Analyzing trace with hash -690210873, now seen corresponding path program 1 times
[2024-06-14 15:08:55,812 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:08:55,812 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702556596]
[2024-06-14 15:08:55,812 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:08:55,812 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:08:55,851 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:09:15,667 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 15:09:15,667 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:09:15,668 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702556596]
[2024-06-14 15:09:15,668 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702556596] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:09:15,668 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:09:15,668 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 15:09:15,668 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150714846]
[2024-06-14 15:09:15,668 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:09:15,668 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 15:09:15,668 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:09:15,669 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 15:09:15,669 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2024-06-14 15:09:15,870 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 53
[2024-06-14 15:09:15,870 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 125 transitions, 970 flow. Second operand  has 8 states, 8 states have (on average 12.625) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:09:15,871 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:09:15,871 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 53
[2024-06-14 15:09:15,871 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:09:21,814 INFO  L124   PetriNetUnfolderBase]: 12032/16729 cut-off events.
[2024-06-14 15:09:21,814 INFO  L125   PetriNetUnfolderBase]: For 150609/150617 co-relation queries the response was YES.
[2024-06-14 15:09:21,849 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 75439 conditions, 16729 events. 12032/16729 cut-off events. For 150609/150617 co-relation queries the response was YES. Maximal size of possible extension queue 567. Compared 91190 event pairs, 5354 based on Foata normal form. 20/16747 useless extension candidates. Maximal degree in co-relation 75401. Up to 15682 conditions per place. 
[2024-06-14 15:09:22,099 INFO  L140   encePairwiseOnDemand]: 40/53 looper letters, 109 selfloop transitions, 75 changer transitions 0/190 dead transitions.
[2024-06-14 15:09:22,099 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 190 transitions, 1694 flow
[2024-06-14 15:09:22,102 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 15:09:22,102 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 15:09:22,103 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 225 transitions.
[2024-06-14 15:09:22,103 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4716981132075472
[2024-06-14 15:09:22,103 INFO  L175             Difference]: Start difference. First operand has 94 places, 125 transitions, 970 flow. Second operand 9 states and 225 transitions.
[2024-06-14 15:09:22,103 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 190 transitions, 1694 flow
[2024-06-14 15:09:22,184 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 190 transitions, 1649 flow, removed 15 selfloop flow, removed 3 redundant places.
[2024-06-14 15:09:22,187 INFO  L231             Difference]: Finished difference. Result has 100 places, 133 transitions, 1198 flow
[2024-06-14 15:09:22,187 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=925, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1198, PETRI_PLACES=100, PETRI_TRANSITIONS=133}
[2024-06-14 15:09:22,188 INFO  L281   CegarLoopForPetriNet]: 56 programPoint places, 44 predicate places.
[2024-06-14 15:09:22,188 INFO  L495      AbstractCegarLoop]: Abstraction has has 100 places, 133 transitions, 1198 flow
[2024-06-14 15:09:22,188 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 12.625) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:09:22,188 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:09:22,188 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:09:22,188 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2024-06-14 15:09:22,189 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 15:09:22,189 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:09:22,189 INFO  L85        PathProgramCache]: Analyzing trace with hash 350330135, now seen corresponding path program 2 times
[2024-06-14 15:09:22,189 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:09:22,189 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401057950]
[2024-06-14 15:09:22,190 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:09:22,190 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:09:22,225 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:09:42,287 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 15:09:42,288 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:09:42,288 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401057950]
[2024-06-14 15:09:42,288 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401057950] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:09:42,288 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:09:42,288 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 15:09:42,288 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468048464]
[2024-06-14 15:09:42,288 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:09:42,289 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 15:09:42,289 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:09:42,289 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 15:09:42,290 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2024-06-14 15:09:42,583 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 53
[2024-06-14 15:09:42,583 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 133 transitions, 1198 flow. Second operand  has 8 states, 8 states have (on average 12.625) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:09:42,583 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:09:42,583 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 53
[2024-06-14 15:09:42,583 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:09:48,747 INFO  L124   PetriNetUnfolderBase]: 12058/16781 cut-off events.
[2024-06-14 15:09:48,747 INFO  L125   PetriNetUnfolderBase]: For 168039/168047 co-relation queries the response was YES.
[2024-06-14 15:09:48,781 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 77536 conditions, 16781 events. 12058/16781 cut-off events. For 168039/168047 co-relation queries the response was YES. Maximal size of possible extension queue 567. Compared 91698 event pairs, 5354 based on Foata normal form. 20/16799 useless extension candidates. Maximal degree in co-relation 77497. Up to 15705 conditions per place. 
[2024-06-14 15:09:48,847 INFO  L140   encePairwiseOnDemand]: 40/53 looper letters, 112 selfloop transitions, 76 changer transitions 0/194 dead transitions.
[2024-06-14 15:09:48,847 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 194 transitions, 1888 flow
[2024-06-14 15:09:48,848 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 15:09:48,848 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 15:09:48,849 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 225 transitions.
[2024-06-14 15:09:48,850 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4716981132075472
[2024-06-14 15:09:48,850 INFO  L175             Difference]: Start difference. First operand has 100 places, 133 transitions, 1198 flow. Second operand 9 states and 225 transitions.
[2024-06-14 15:09:48,850 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 194 transitions, 1888 flow
[2024-06-14 15:09:48,951 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 194 transitions, 1666 flow, removed 33 selfloop flow, removed 7 redundant places.
[2024-06-14 15:09:48,954 INFO  L231             Difference]: Finished difference. Result has 102 places, 137 transitions, 1205 flow
[2024-06-14 15:09:48,954 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=984, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1205, PETRI_PLACES=102, PETRI_TRANSITIONS=137}
[2024-06-14 15:09:48,955 INFO  L281   CegarLoopForPetriNet]: 56 programPoint places, 46 predicate places.
[2024-06-14 15:09:48,955 INFO  L495      AbstractCegarLoop]: Abstraction has has 102 places, 137 transitions, 1205 flow
[2024-06-14 15:09:48,955 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 12.625) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:09:48,955 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:09:48,955 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:09:48,956 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2024-06-14 15:09:48,956 INFO  L420      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] ===
[2024-06-14 15:09:48,956 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:09:48,956 INFO  L85        PathProgramCache]: Analyzing trace with hash -1135195707, now seen corresponding path program 3 times
[2024-06-14 15:09:48,957 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:09:48,957 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552598336]
[2024-06-14 15:09:48,957 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:09:48,957 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:09:49,004 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:10:08,925 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 15:10:08,926 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:10:08,926 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552598336]
[2024-06-14 15:10:08,926 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552598336] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:10:08,926 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:10:08,926 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 15:10:08,926 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331686634]
[2024-06-14 15:10:08,926 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:10:08,926 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 15:10:08,927 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:10:08,927 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 15:10:08,927 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2024-06-14 15:10:09,096 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 53
[2024-06-14 15:10:09,097 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 137 transitions, 1205 flow. Second operand  has 8 states, 8 states have (on average 12.625) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:10:09,097 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:10:09,097 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 53
[2024-06-14 15:10:09,097 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:10:15,081 INFO  L124   PetriNetUnfolderBase]: 12040/16760 cut-off events.
[2024-06-14 15:10:15,082 INFO  L125   PetriNetUnfolderBase]: For 183654/183673 co-relation queries the response was YES.
[2024-06-14 15:10:15,130 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 78375 conditions, 16760 events. 12040/16760 cut-off events. For 183654/183673 co-relation queries the response was YES. Maximal size of possible extension queue 567. Compared 91537 event pairs, 5377 based on Foata normal form. 22/16778 useless extension candidates. Maximal degree in co-relation 78335. Up to 15690 conditions per place. 
[2024-06-14 15:10:15,197 INFO  L140   encePairwiseOnDemand]: 40/53 looper letters, 102 selfloop transitions, 73 changer transitions 0/181 dead transitions.
[2024-06-14 15:10:15,197 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 181 transitions, 1691 flow
[2024-06-14 15:10:15,199 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 15:10:15,199 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 15:10:15,200 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 197 transitions.
[2024-06-14 15:10:15,200 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46462264150943394
[2024-06-14 15:10:15,200 INFO  L175             Difference]: Start difference. First operand has 102 places, 137 transitions, 1205 flow. Second operand 8 states and 197 transitions.
[2024-06-14 15:10:15,200 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 181 transitions, 1691 flow
[2024-06-14 15:10:15,337 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 181 transitions, 1533 flow, removed 24 selfloop flow, removed 6 redundant places.
[2024-06-14 15:10:15,339 INFO  L231             Difference]: Finished difference. Result has 104 places, 137 transitions, 1204 flow
[2024-06-14 15:10:15,339 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=1047, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1204, PETRI_PLACES=104, PETRI_TRANSITIONS=137}
[2024-06-14 15:10:15,339 INFO  L281   CegarLoopForPetriNet]: 56 programPoint places, 48 predicate places.
[2024-06-14 15:10:15,339 INFO  L495      AbstractCegarLoop]: Abstraction has has 104 places, 137 transitions, 1204 flow
[2024-06-14 15:10:15,340 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 12.625) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:10:15,340 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:10:15,340 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:10:15,340 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2024-06-14 15:10:15,340 INFO  L420      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] ===
[2024-06-14 15:10:15,341 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:10:15,341 INFO  L85        PathProgramCache]: Analyzing trace with hash 873828311, now seen corresponding path program 1 times
[2024-06-14 15:10:15,341 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:10:15,341 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699261967]
[2024-06-14 15:10:15,341 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:10:15,341 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:10:15,397 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:10:31,291 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:10:31,291 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:10:31,291 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699261967]
[2024-06-14 15:10:31,291 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699261967] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:10:31,291 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:10:31,291 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-14 15:10:31,291 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428743138]
[2024-06-14 15:10:31,291 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:10:31,292 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-14 15:10:31,292 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:10:31,292 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-14 15:10:31,292 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2024-06-14 15:10:31,469 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 53
[2024-06-14 15:10:31,469 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 137 transitions, 1204 flow. Second operand  has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 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 15:10:31,470 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:10:31,470 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 53
[2024-06-14 15:10:31,470 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:10:37,037 INFO  L124   PetriNetUnfolderBase]: 12043/16765 cut-off events.
[2024-06-14 15:10:37,038 INFO  L125   PetriNetUnfolderBase]: For 200063/200063 co-relation queries the response was YES.
[2024-06-14 15:10:37,085 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 79510 conditions, 16765 events. 12043/16765 cut-off events. For 200063/200063 co-relation queries the response was YES. Maximal size of possible extension queue 565. Compared 91430 event pairs, 5799 based on Foata normal form. 3/16766 useless extension candidates. Maximal degree in co-relation 79469. Up to 16260 conditions per place. 
[2024-06-14 15:10:37,160 INFO  L140   encePairwiseOnDemand]: 42/53 looper letters, 143 selfloop transitions, 22 changer transitions 0/171 dead transitions.
[2024-06-14 15:10:37,160 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 171 transitions, 1778 flow
[2024-06-14 15:10:37,161 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-14 15:10:37,161 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-14 15:10:37,161 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 140 transitions.
[2024-06-14 15:10:37,162 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44025157232704404
[2024-06-14 15:10:37,162 INFO  L175             Difference]: Start difference. First operand has 104 places, 137 transitions, 1204 flow. Second operand 6 states and 140 transitions.
[2024-06-14 15:10:37,162 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 171 transitions, 1778 flow
[2024-06-14 15:10:37,323 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 171 transitions, 1562 flow, removed 7 selfloop flow, removed 8 redundant places.
[2024-06-14 15:10:37,326 INFO  L231             Difference]: Finished difference. Result has 104 places, 151 transitions, 1196 flow
[2024-06-14 15:10:37,326 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=988, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1196, PETRI_PLACES=104, PETRI_TRANSITIONS=151}
[2024-06-14 15:10:37,326 INFO  L281   CegarLoopForPetriNet]: 56 programPoint places, 48 predicate places.
[2024-06-14 15:10:37,327 INFO  L495      AbstractCegarLoop]: Abstraction has has 104 places, 151 transitions, 1196 flow
[2024-06-14 15:10:37,327 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 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 15:10:37,327 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:10:37,327 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:10:37,327 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2024-06-14 15:10:37,327 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 15:10:37,328 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:10:37,328 INFO  L85        PathProgramCache]: Analyzing trace with hash 397746274, now seen corresponding path program 1 times
[2024-06-14 15:10:37,328 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:10:37,328 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595674360]
[2024-06-14 15:10:37,328 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:10:37,329 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:10:37,372 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:10:57,848 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 15:10:57,848 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:10:57,848 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595674360]
[2024-06-14 15:10:57,848 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595674360] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:10:57,849 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:10:57,849 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 15:10:57,849 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072145644]
[2024-06-14 15:10:57,849 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:10:57,849 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 15:10:57,850 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:10:57,850 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 15:10:57,850 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-14 15:10:58,069 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 53
[2024-06-14 15:10:58,069 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 151 transitions, 1196 flow. Second operand  has 8 states, 8 states have (on average 12.625) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:10:58,069 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:10:58,069 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 53
[2024-06-14 15:10:58,070 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:11:04,453 INFO  L124   PetriNetUnfolderBase]: 12497/17411 cut-off events.
[2024-06-14 15:11:04,453 INFO  L125   PetriNetUnfolderBase]: For 241513/241639 co-relation queries the response was YES.
[2024-06-14 15:11:04,499 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 87289 conditions, 17411 events. 12497/17411 cut-off events. For 241513/241639 co-relation queries the response was YES. Maximal size of possible extension queue 600. Compared 95842 event pairs, 4756 based on Foata normal form. 14/17377 useless extension candidates. Maximal degree in co-relation 87245. Up to 16438 conditions per place. 
[2024-06-14 15:11:04,574 INFO  L140   encePairwiseOnDemand]: 41/53 looper letters, 157 selfloop transitions, 46 changer transitions 0/212 dead transitions.
[2024-06-14 15:11:04,574 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 212 transitions, 1956 flow
[2024-06-14 15:11:04,577 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 15:11:04,577 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 15:11:04,578 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 219 transitions.
[2024-06-14 15:11:04,580 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4591194968553459
[2024-06-14 15:11:04,580 INFO  L175             Difference]: Start difference. First operand has 104 places, 151 transitions, 1196 flow. Second operand 9 states and 219 transitions.
[2024-06-14 15:11:04,580 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 212 transitions, 1956 flow
[2024-06-14 15:11:04,726 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 212 transitions, 1916 flow, removed 19 selfloop flow, removed 1 redundant places.
[2024-06-14 15:11:04,728 INFO  L231             Difference]: Finished difference. Result has 112 places, 157 transitions, 1352 flow
[2024-06-14 15:11:04,728 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=1156, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1352, PETRI_PLACES=112, PETRI_TRANSITIONS=157}
[2024-06-14 15:11:04,729 INFO  L281   CegarLoopForPetriNet]: 56 programPoint places, 56 predicate places.
[2024-06-14 15:11:04,729 INFO  L495      AbstractCegarLoop]: Abstraction has has 112 places, 157 transitions, 1352 flow
[2024-06-14 15:11:04,729 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 12.625) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:11:04,729 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:11:04,730 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:11:04,730 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2024-06-14 15:11:04,730 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 15:11:04,730 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:11:04,730 INFO  L85        PathProgramCache]: Analyzing trace with hash 400603234, now seen corresponding path program 2 times
[2024-06-14 15:11:04,730 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:11:04,731 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097323107]
[2024-06-14 15:11:04,731 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:11:04,731 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:11:04,773 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:11:24,960 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 15:11:24,961 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:11:24,961 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097323107]
[2024-06-14 15:11:24,961 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097323107] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:11:24,961 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:11:24,961 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 15:11:24,961 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654465909]
[2024-06-14 15:11:24,961 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:11:24,962 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 15:11:24,962 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:11:24,962 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 15:11:24,962 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-14 15:11:25,112 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 53
[2024-06-14 15:11:25,112 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 157 transitions, 1352 flow. Second operand  has 8 states, 8 states have (on average 12.625) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:11:25,112 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:11:25,112 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 53
[2024-06-14 15:11:25,112 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:11:31,506 INFO  L124   PetriNetUnfolderBase]: 12482/17390 cut-off events.
[2024-06-14 15:11:31,507 INFO  L125   PetriNetUnfolderBase]: For 271103/271229 co-relation queries the response was YES.
[2024-06-14 15:11:31,555 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 90333 conditions, 17390 events. 12482/17390 cut-off events. For 271103/271229 co-relation queries the response was YES. Maximal size of possible extension queue 600. Compared 95656 event pairs, 5568 based on Foata normal form. 14/17356 useless extension candidates. Maximal degree in co-relation 90286. Up to 16553 conditions per place. 
[2024-06-14 15:11:31,630 INFO  L140   encePairwiseOnDemand]: 41/53 looper letters, 156 selfloop transitions, 43 changer transitions 0/208 dead transitions.
[2024-06-14 15:11:31,630 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 208 transitions, 1910 flow
[2024-06-14 15:11:31,631 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 15:11:31,631 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 15:11:31,631 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 216 transitions.
[2024-06-14 15:11:31,631 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4528301886792453
[2024-06-14 15:11:31,631 INFO  L175             Difference]: Start difference. First operand has 112 places, 157 transitions, 1352 flow. Second operand 9 states and 216 transitions.
[2024-06-14 15:11:31,631 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 208 transitions, 1910 flow
[2024-06-14 15:11:31,842 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 208 transitions, 1796 flow, removed 35 selfloop flow, removed 5 redundant places.
[2024-06-14 15:11:31,845 INFO  L231             Difference]: Finished difference. Result has 116 places, 157 transitions, 1335 flow
[2024-06-14 15:11:31,845 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=1238, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1335, PETRI_PLACES=116, PETRI_TRANSITIONS=157}
[2024-06-14 15:11:31,845 INFO  L281   CegarLoopForPetriNet]: 56 programPoint places, 60 predicate places.
[2024-06-14 15:11:31,845 INFO  L495      AbstractCegarLoop]: Abstraction has has 116 places, 157 transitions, 1335 flow
[2024-06-14 15:11:31,845 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 12.625) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:11:31,845 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:11:31,846 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:11:31,846 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2024-06-14 15:11:31,846 INFO  L420      AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] ===
[2024-06-14 15:11:31,846 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:11:31,846 INFO  L85        PathProgramCache]: Analyzing trace with hash 78480078, now seen corresponding path program 1 times
[2024-06-14 15:11:31,846 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:11:31,847 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884179351]
[2024-06-14 15:11:31,847 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:11:31,847 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:11:31,898 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:11:52,471 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 15:11:52,471 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:11:52,472 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884179351]
[2024-06-14 15:11:52,472 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884179351] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:11:52,472 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:11:52,472 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 15:11:52,472 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835901138]
[2024-06-14 15:11:52,472 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:11:52,473 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 15:11:52,473 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:11:52,473 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 15:11:52,473 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-06-14 15:11:52,726 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 53
[2024-06-14 15:11:52,726 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 157 transitions, 1335 flow. Second operand  has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 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 15:11:52,726 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:11:52,726 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 53
[2024-06-14 15:11:52,726 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:11:59,357 INFO  L124   PetriNetUnfolderBase]: 12844/17870 cut-off events.
[2024-06-14 15:11:59,357 INFO  L125   PetriNetUnfolderBase]: For 306760/306886 co-relation queries the response was YES.
[2024-06-14 15:11:59,411 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 94100 conditions, 17870 events. 12844/17870 cut-off events. For 306760/306886 co-relation queries the response was YES. Maximal size of possible extension queue 607. Compared 98455 event pairs, 5143 based on Foata normal form. 44/17836 useless extension candidates. Maximal degree in co-relation 94051. Up to 16437 conditions per place. 
[2024-06-14 15:11:59,493 INFO  L140   encePairwiseOnDemand]: 40/53 looper letters, 136 selfloop transitions, 80 changer transitions 0/225 dead transitions.
[2024-06-14 15:11:59,493 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 225 transitions, 2021 flow
[2024-06-14 15:11:59,495 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-14 15:11:59,495 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 15:11:59,496 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 248 transitions.
[2024-06-14 15:11:59,496 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4679245283018868
[2024-06-14 15:11:59,496 INFO  L175             Difference]: Start difference. First operand has 116 places, 157 transitions, 1335 flow. Second operand 10 states and 248 transitions.
[2024-06-14 15:11:59,496 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 225 transitions, 2021 flow
[2024-06-14 15:11:59,682 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 225 transitions, 1923 flow, removed 3 selfloop flow, removed 8 redundant places.
[2024-06-14 15:11:59,684 INFO  L231             Difference]: Finished difference. Result has 118 places, 160 transitions, 1466 flow
[2024-06-14 15:11:59,685 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=1237, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1466, PETRI_PLACES=118, PETRI_TRANSITIONS=160}
[2024-06-14 15:11:59,685 INFO  L281   CegarLoopForPetriNet]: 56 programPoint places, 62 predicate places.
[2024-06-14 15:11:59,685 INFO  L495      AbstractCegarLoop]: Abstraction has has 118 places, 160 transitions, 1466 flow
[2024-06-14 15:11:59,685 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 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 15:11:59,685 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:11:59,686 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:11:59,686 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2024-06-14 15:11:59,686 INFO  L420      AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] ===
[2024-06-14 15:11:59,686 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:11:59,686 INFO  L85        PathProgramCache]: Analyzing trace with hash -2061852546, now seen corresponding path program 1 times
[2024-06-14 15:11:59,686 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:11:59,687 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978496279]
[2024-06-14 15:11:59,687 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:11:59,687 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:11:59,754 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:12:17,012 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 15:12:17,013 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:12:17,013 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978496279]
[2024-06-14 15:12:17,013 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978496279] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:12:17,013 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:12:17,013 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-14 15:12:17,013 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037060437]
[2024-06-14 15:12:17,014 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:12:17,014 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-14 15:12:17,014 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:12:17,015 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-14 15:12:17,015 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-06-14 15:12:17,228 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 53
[2024-06-14 15:12:17,229 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 160 transitions, 1466 flow. Second operand  has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 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 15:12:17,229 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:12:17,229 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 53
[2024-06-14 15:12:17,229 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:12:23,439 INFO  L124   PetriNetUnfolderBase]: 12851/17880 cut-off events.
[2024-06-14 15:12:23,440 INFO  L125   PetriNetUnfolderBase]: For 332540/332676 co-relation queries the response was YES.
[2024-06-14 15:12:23,491 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 97725 conditions, 17880 events. 12851/17880 cut-off events. For 332540/332676 co-relation queries the response was YES. Maximal size of possible extension queue 604. Compared 98523 event pairs, 5562 based on Foata normal form. 10/17812 useless extension candidates. Maximal degree in co-relation 97675. Up to 17266 conditions per place. 
[2024-06-14 15:12:23,575 INFO  L140   encePairwiseOnDemand]: 43/53 looper letters, 160 selfloop transitions, 18 changer transitions 0/187 dead transitions.
[2024-06-14 15:12:23,576 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 187 transitions, 1948 flow
[2024-06-14 15:12:23,576 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-14 15:12:23,576 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-14 15:12:23,576 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 140 transitions.
[2024-06-14 15:12:23,576 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44025157232704404
[2024-06-14 15:12:23,577 INFO  L175             Difference]: Start difference. First operand has 118 places, 160 transitions, 1466 flow. Second operand 6 states and 140 transitions.
[2024-06-14 15:12:23,577 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 187 transitions, 1948 flow
[2024-06-14 15:12:23,832 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 187 transitions, 1763 flow, removed 16 selfloop flow, removed 8 redundant places.
[2024-06-14 15:12:23,834 INFO  L231             Difference]: Finished difference. Result has 116 places, 164 transitions, 1389 flow
[2024-06-14 15:12:23,834 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=1281, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1389, PETRI_PLACES=116, PETRI_TRANSITIONS=164}
[2024-06-14 15:12:23,835 INFO  L281   CegarLoopForPetriNet]: 56 programPoint places, 60 predicate places.
[2024-06-14 15:12:23,835 INFO  L495      AbstractCegarLoop]: Abstraction has has 116 places, 164 transitions, 1389 flow
[2024-06-14 15:12:23,835 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 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 15:12:23,835 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:12:23,835 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:12:23,835 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2024-06-14 15:12:23,835 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 15:12:23,836 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:12:23,836 INFO  L85        PathProgramCache]: Analyzing trace with hash 94903532, now seen corresponding path program 2 times
[2024-06-14 15:12:23,836 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:12:23,836 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610880076]
[2024-06-14 15:12:23,836 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:12:23,836 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:12:23,881 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:12:42,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 15:12:42,526 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:12:42,526 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610880076]
[2024-06-14 15:12:42,526 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610880076] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:12:42,526 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:12:42,526 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 15:12:42,526 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295492221]
[2024-06-14 15:12:42,526 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:12:42,526 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 15:12:42,527 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:12:42,527 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 15:12:42,527 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-06-14 15:12:42,886 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 53
[2024-06-14 15:12:42,886 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 164 transitions, 1389 flow. Second operand  has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 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 15:12:42,886 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:12:42,887 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 53
[2024-06-14 15:12:42,887 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:12:49,528 INFO  L124   PetriNetUnfolderBase]: 12887/17935 cut-off events.
[2024-06-14 15:12:49,529 INFO  L125   PetriNetUnfolderBase]: For 364151/364314 co-relation queries the response was YES.
[2024-06-14 15:12:49,585 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 100776 conditions, 17935 events. 12887/17935 cut-off events. For 364151/364314 co-relation queries the response was YES. Maximal size of possible extension queue 604. Compared 98801 event pairs, 5146 based on Foata normal form. 22/17877 useless extension candidates. Maximal degree in co-relation 100725. Up to 16728 conditions per place. 
[2024-06-14 15:12:49,669 INFO  L140   encePairwiseOnDemand]: 40/53 looper letters, 127 selfloop transitions, 83 changer transitions 0/219 dead transitions.
[2024-06-14 15:12:49,669 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 219 transitions, 2029 flow
[2024-06-14 15:12:49,672 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 15:12:49,672 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 15:12:49,672 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 220 transitions.
[2024-06-14 15:12:49,672 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4612159329140461
[2024-06-14 15:12:49,673 INFO  L175             Difference]: Start difference. First operand has 116 places, 164 transitions, 1389 flow. Second operand 9 states and 220 transitions.
[2024-06-14 15:12:49,673 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 219 transitions, 2029 flow
[2024-06-14 15:12:49,906 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 219 transitions, 1953 flow, removed 23 selfloop flow, removed 4 redundant places.
[2024-06-14 15:12:49,908 INFO  L231             Difference]: Finished difference. Result has 121 places, 167 transitions, 1555 flow
[2024-06-14 15:12:49,909 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=1313, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1555, PETRI_PLACES=121, PETRI_TRANSITIONS=167}
[2024-06-14 15:12:49,909 INFO  L281   CegarLoopForPetriNet]: 56 programPoint places, 65 predicate places.
[2024-06-14 15:12:49,909 INFO  L495      AbstractCegarLoop]: Abstraction has has 121 places, 167 transitions, 1555 flow
[2024-06-14 15:12:49,909 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 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 15:12:49,910 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:12:49,910 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:12:49,910 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2024-06-14 15:12:49,910 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 15:12:49,910 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:12:49,910 INFO  L85        PathProgramCache]: Analyzing trace with hash -141271828, now seen corresponding path program 3 times
[2024-06-14 15:12:49,910 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:12:49,910 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660094888]
[2024-06-14 15:12:49,910 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:12:49,910 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:12:49,953 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:13:11,598 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 15:13:11,598 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:13:11,599 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660094888]
[2024-06-14 15:13:11,599 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660094888] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:13:11,599 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:13:11,599 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 15:13:11,599 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129005415]
[2024-06-14 15:13:11,599 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:13:11,599 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 15:13:11,600 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:13:11,600 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 15:13:11,600 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-06-14 15:13:11,899 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 53
[2024-06-14 15:13:11,899 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 167 transitions, 1555 flow. Second operand  has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 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 15:13:11,899 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:13:11,899 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 53
[2024-06-14 15:13:11,899 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:13:19,257 INFO  L124   PetriNetUnfolderBase]: 12923/17987 cut-off events.
[2024-06-14 15:13:19,257 INFO  L125   PetriNetUnfolderBase]: For 403280/403443 co-relation queries the response was YES.
[2024-06-14 15:13:19,307 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 104871 conditions, 17987 events. 12923/17987 cut-off events. For 403280/403443 co-relation queries the response was YES. Maximal size of possible extension queue 604. Compared 99049 event pairs, 5154 based on Foata normal form. 22/17929 useless extension candidates. Maximal degree in co-relation 104819. Up to 16780 conditions per place. 
[2024-06-14 15:13:19,386 INFO  L140   encePairwiseOnDemand]: 40/53 looper letters, 133 selfloop transitions, 81 changer transitions 0/223 dead transitions.
[2024-06-14 15:13:19,386 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 223 transitions, 2211 flow
[2024-06-14 15:13:19,388 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 15:13:19,389 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 15:13:19,389 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 221 transitions.
[2024-06-14 15:13:19,389 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46331236897274636
[2024-06-14 15:13:19,389 INFO  L175             Difference]: Start difference. First operand has 121 places, 167 transitions, 1555 flow. Second operand 9 states and 221 transitions.
[2024-06-14 15:13:19,389 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 223 transitions, 2211 flow
[2024-06-14 15:13:19,638 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 223 transitions, 1995 flow, removed 27 selfloop flow, removed 7 redundant places.
[2024-06-14 15:13:19,640 INFO  L231             Difference]: Finished difference. Result has 123 places, 170 transitions, 1583 flow
[2024-06-14 15:13:19,640 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=1339, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=78, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1583, PETRI_PLACES=123, PETRI_TRANSITIONS=170}
[2024-06-14 15:13:19,641 INFO  L281   CegarLoopForPetriNet]: 56 programPoint places, 67 predicate places.
[2024-06-14 15:13:19,641 INFO  L495      AbstractCegarLoop]: Abstraction has has 123 places, 170 transitions, 1583 flow
[2024-06-14 15:13:19,641 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 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 15:13:19,641 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:13:19,641 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:13:19,641 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2024-06-14 15:13:19,641 INFO  L420      AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] ===
[2024-06-14 15:13:19,641 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:13:19,641 INFO  L85        PathProgramCache]: Analyzing trace with hash -822749988, now seen corresponding path program 4 times
[2024-06-14 15:13:19,642 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:13:19,642 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566398519]
[2024-06-14 15:13:19,642 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:13:19,642 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:13:19,689 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:13:41,074 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 15:13:41,074 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:13:41,074 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566398519]
[2024-06-14 15:13:41,074 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566398519] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:13:41,074 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:13:41,075 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 15:13:41,075 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949368888]
[2024-06-14 15:13:41,075 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:13:41,075 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 15:13:41,075 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:13:41,075 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 15:13:41,075 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-06-14 15:13:41,436 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 53
[2024-06-14 15:13:41,436 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 170 transitions, 1583 flow. Second operand  has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 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 15:13:41,436 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:13:41,436 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 53
[2024-06-14 15:13:41,436 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:13:48,479 INFO  L124   PetriNetUnfolderBase]: 12908/17966 cut-off events.
[2024-06-14 15:13:48,480 INFO  L125   PetriNetUnfolderBase]: For 440044/440207 co-relation queries the response was YES.
[2024-06-14 15:13:48,531 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 107452 conditions, 17966 events. 12908/17966 cut-off events. For 440044/440207 co-relation queries the response was YES. Maximal size of possible extension queue 604. Compared 98990 event pairs, 4756 based on Foata normal form. 22/17908 useless extension candidates. Maximal degree in co-relation 107399. Up to 16401 conditions per place. 
[2024-06-14 15:13:48,617 INFO  L140   encePairwiseOnDemand]: 40/53 looper letters, 126 selfloop transitions, 94 changer transitions 0/229 dead transitions.
[2024-06-14 15:13:48,617 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 229 transitions, 2271 flow
[2024-06-14 15:13:48,620 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 15:13:48,620 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 15:13:48,620 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 224 transitions.
[2024-06-14 15:13:48,621 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.469601677148847
[2024-06-14 15:13:48,621 INFO  L175             Difference]: Start difference. First operand has 123 places, 170 transitions, 1583 flow. Second operand 9 states and 224 transitions.
[2024-06-14 15:13:48,621 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 229 transitions, 2271 flow
[2024-06-14 15:13:48,886 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 229 transitions, 2053 flow, removed 30 selfloop flow, removed 7 redundant places.
[2024-06-14 15:13:48,889 INFO  L231             Difference]: Finished difference. Result has 125 places, 173 transitions, 1641 flow
[2024-06-14 15:13:48,889 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=1365, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=91, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1641, PETRI_PLACES=125, PETRI_TRANSITIONS=173}
[2024-06-14 15:13:48,890 INFO  L281   CegarLoopForPetriNet]: 56 programPoint places, 69 predicate places.
[2024-06-14 15:13:48,890 INFO  L495      AbstractCegarLoop]: Abstraction has has 125 places, 173 transitions, 1641 flow
[2024-06-14 15:13:48,890 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 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 15:13:48,890 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:13:48,891 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:13:48,891 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2024-06-14 15:13:48,891 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 15:13:48,891 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:13:48,891 INFO  L85        PathProgramCache]: Analyzing trace with hash 1318862016, now seen corresponding path program 2 times
[2024-06-14 15:13:48,892 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:13:48,892 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548708392]
[2024-06-14 15:13:48,892 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:13:48,892 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:13:48,949 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:14:06,450 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 15:14:06,450 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:14:06,451 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548708392]
[2024-06-14 15:14:06,451 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548708392] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:14:06,451 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:14:06,451 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 15:14:06,451 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988709151]
[2024-06-14 15:14:06,451 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:14:06,451 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 15:14:06,451 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:14:06,452 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 15:14:06,452 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-14 15:14:06,684 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 53
[2024-06-14 15:14:06,685 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 173 transitions, 1641 flow. Second operand  has 8 states, 8 states have (on average 12.75) internal successors, (102), 8 states have internal predecessors, (102), 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 15:14:06,685 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:14:06,685 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 53
[2024-06-14 15:14:06,685 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:14:13,102 INFO  L124   PetriNetUnfolderBase]: 12901/17957 cut-off events.
[2024-06-14 15:14:13,102 INFO  L125   PetriNetUnfolderBase]: For 479229/479392 co-relation queries the response was YES.
[2024-06-14 15:14:13,150 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 110368 conditions, 17957 events. 12901/17957 cut-off events. For 479229/479392 co-relation queries the response was YES. Maximal size of possible extension queue 604. Compared 98971 event pairs, 5574 based on Foata normal form. 18/17895 useless extension candidates. Maximal degree in co-relation 110314. Up to 17322 conditions per place. 
[2024-06-14 15:14:13,232 INFO  L140   encePairwiseOnDemand]: 43/53 looper letters, 161 selfloop transitions, 25 changer transitions 0/195 dead transitions.
[2024-06-14 15:14:13,232 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 195 transitions, 2143 flow
[2024-06-14 15:14:13,232 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-14 15:14:13,233 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-14 15:14:13,233 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 136 transitions.
[2024-06-14 15:14:13,233 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4276729559748428
[2024-06-14 15:14:13,233 INFO  L175             Difference]: Start difference. First operand has 125 places, 173 transitions, 1641 flow. Second operand 6 states and 136 transitions.
[2024-06-14 15:14:13,233 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 195 transitions, 2143 flow
[2024-06-14 15:14:13,486 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 195 transitions, 1893 flow, removed 33 selfloop flow, removed 7 redundant places.
[2024-06-14 15:14:13,488 INFO  L231             Difference]: Finished difference. Result has 124 places, 177 transitions, 1532 flow
[2024-06-14 15:14:13,488 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=1391, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1532, PETRI_PLACES=124, PETRI_TRANSITIONS=177}
[2024-06-14 15:14:13,489 INFO  L281   CegarLoopForPetriNet]: 56 programPoint places, 68 predicate places.
[2024-06-14 15:14:13,489 INFO  L495      AbstractCegarLoop]: Abstraction has has 124 places, 177 transitions, 1532 flow
[2024-06-14 15:14:13,489 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 12.75) internal successors, (102), 8 states have internal predecessors, (102), 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 15:14:13,489 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:14:13,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 15:14:13,489 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2024-06-14 15:14:13,489 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 15:14:13,490 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:14:13,490 INFO  L85        PathProgramCache]: Analyzing trace with hash 1339216368, now seen corresponding path program 1 times
[2024-06-14 15:14:13,490 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:14:13,490 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703378660]
[2024-06-14 15:14:13,490 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:14:13,490 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:14:13,538 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:14:30,261 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 15:14:30,261 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:14:30,261 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703378660]
[2024-06-14 15:14:30,261 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703378660] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:14:30,261 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:14:30,261 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 15:14:30,261 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804074025]
[2024-06-14 15:14:30,261 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:14:30,262 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 15:14:30,262 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:14:30,262 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 15:14:30,262 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-14 15:14:30,467 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 53
[2024-06-14 15:14:30,467 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 177 transitions, 1532 flow. Second operand  has 8 states, 8 states have (on average 13.75) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:14:30,468 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:14:30,468 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 53
[2024-06-14 15:14:30,468 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:14:36,115 INFO  L124   PetriNetUnfolderBase]: 11228/16191 cut-off events.
[2024-06-14 15:14:36,115 INFO  L125   PetriNetUnfolderBase]: For 438992/439160 co-relation queries the response was YES.
[2024-06-14 15:14:36,171 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 100149 conditions, 16191 events. 11228/16191 cut-off events. For 438992/439160 co-relation queries the response was YES. Maximal size of possible extension queue 567. Compared 94259 event pairs, 4716 based on Foata normal form. 2/16082 useless extension candidates. Maximal degree in co-relation 100094. Up to 15152 conditions per place. 
[2024-06-14 15:14:36,254 INFO  L140   encePairwiseOnDemand]: 43/53 looper letters, 178 selfloop transitions, 14 changer transitions 0/202 dead transitions.
[2024-06-14 15:14:36,254 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 202 transitions, 2048 flow
[2024-06-14 15:14:36,255 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-14 15:14:36,255 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-14 15:14:36,255 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 142 transitions.
[2024-06-14 15:14:36,255 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44654088050314467
[2024-06-14 15:14:36,255 INFO  L175             Difference]: Start difference. First operand has 124 places, 177 transitions, 1532 flow. Second operand 6 states and 142 transitions.
[2024-06-14 15:14:36,255 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 202 transitions, 2048 flow
[2024-06-14 15:14:36,508 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 202 transitions, 1937 flow, removed 33 selfloop flow, removed 4 redundant places.
[2024-06-14 15:14:36,511 INFO  L231             Difference]: Finished difference. Result has 126 places, 181 transitions, 1532 flow
[2024-06-14 15:14:36,511 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=1421, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1532, PETRI_PLACES=126, PETRI_TRANSITIONS=181}
[2024-06-14 15:14:36,511 INFO  L281   CegarLoopForPetriNet]: 56 programPoint places, 70 predicate places.
[2024-06-14 15:14:36,511 INFO  L495      AbstractCegarLoop]: Abstraction has has 126 places, 181 transitions, 1532 flow
[2024-06-14 15:14:36,512 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 13.75) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:14:36,512 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:14:36,512 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:14:36,512 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26
[2024-06-14 15:14:36,512 INFO  L420      AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] ===
[2024-06-14 15:14:36,512 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:14:36,512 INFO  L85        PathProgramCache]: Analyzing trace with hash 1318867968, now seen corresponding path program 2 times
[2024-06-14 15:14:36,512 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:14:36,512 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035489692]
[2024-06-14 15:14:36,512 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:14:36,512 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:14:36,568 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat