./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix028_power.opt_pso.opt_rmo.opt.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-05-07_14-17-48.files/mutex-meet/mix028_power.opt_pso.opt_rmo.opt.yml/witness.yml --architecture 32bit


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


Checking for ERROR reachability
Using default analysis
Version b44c8288
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/mix028_power.opt_pso.opt_rmo.opt.i ./goblint.2024-05-07_14-17-48.files/mutex-meet/mix028_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
--- Real Ultimate output ---
This is Ultimate 0.2.4-wip.fs.witness-ghost-b44c828-m
[2024-05-12 11:35:36,056 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-05-12 11:35:36,121 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-05-12 11:35:36,126 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-05-12 11:35:36,126 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-05-12 11:35:36,150 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-05-12 11:35:36,151 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-05-12 11:35:36,151 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-05-12 11:35:36,152 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-05-12 11:35:36,155 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-05-12 11:35:36,155 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-05-12 11:35:36,155 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-05-12 11:35:36,156 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-05-12 11:35:36,157 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-05-12 11:35:36,157 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-05-12 11:35:36,158 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-05-12 11:35:36,158 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-05-12 11:35:36,158 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-05-12 11:35:36,158 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-05-12 11:35:36,158 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-05-12 11:35:36,159 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-05-12 11:35:36,160 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-05-12 11:35:36,160 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-05-12 11:35:36,160 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-05-12 11:35:36,160 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-05-12 11:35:36,161 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-05-12 11:35:36,161 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-05-12 11:35:36,161 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-05-12 11:35:36,162 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-05-12 11:35:36,162 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-05-12 11:35:36,163 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-05-12 11:35:36,163 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-05-12 11:35:36,163 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-05-12 11:35:36,163 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-05-12 11:35:36,163 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-05-12 11:35:36,163 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-05-12 11:35:36,164 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-05-12 11:35:36,164 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-05-12 11:35:36,164 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-05-12 11:35:36,164 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-05-12 11:35:36,164 INFO  L153        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-05-12 11:35:36,165 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-05-12 11:35:36,165 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-05-12 11:35:36,165 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
[2024-05-12 11:35:36,369 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-05-12 11:35:36,392 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-05-12 11:35:36,394 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-05-12 11:35:36,395 INFO  L270        PluginConnector]: Initializing Witness Parser...
[2024-05-12 11:35:36,396 INFO  L274        PluginConnector]: Witness Parser initialized
[2024-05-12 11:35:36,397 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-05-07_14-17-48.files/mutex-meet/mix028_power.opt_pso.opt_rmo.opt.yml/witness.yml
[2024-05-12 11:35:36,582 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-05-12 11:35:36,582 INFO  L274        PluginConnector]: CDTParser initialized
[2024-05-12 11:35:36,583 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix028_power.opt_pso.opt_rmo.opt.i
[2024-05-12 11:35:37,619 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-05-12 11:35:37,841 INFO  L384              CDTParser]: Found 1 translation units.
[2024-05-12 11:35:37,842 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix028_power.opt_pso.opt_rmo.opt.i
[2024-05-12 11:35:37,854 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a13ffae4/daea619505bb4ffe8db2952a00ecde24/FLAGd72b779a0
[2024-05-12 11:35:37,866 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a13ffae4/daea619505bb4ffe8db2952a00ecde24
[2024-05-12 11:35:37,866 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-05-12 11:35:37,867 INFO  L133        ToolchainWalker]: Walking toolchain with 5 elements.
[2024-05-12 11:35:37,868 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-05-12 11:35:37,868 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-05-12 11:35:37,871 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-05-12 11:35:37,872 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 11:35:36" (1/2) ...
[2024-05-12 11:35:37,873 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@207270ed and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 11:35:37, skipping insertion in model container
[2024-05-12 11:35:37,873 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 11:35:36" (1/2) ...
[2024-05-12 11:35:37,874 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@6ab73cd0 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 11:35:37, skipping insertion in model container
[2024-05-12 11:35:37,875 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.05 11:35:37" (2/2) ...
[2024-05-12 11:35:37,875 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@207270ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:35:37, skipping insertion in model container
[2024-05-12 11:35:37,875 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.05 11:35:37" (2/2) ...
[2024-05-12 11:35:37,876 INFO  L83    nessWitnessExtractor]: Extracting all invariants from correctness witness
[2024-05-12 11:35:37,940 INFO  L95    edCorrectnessWitness]: Found the following entries in the witness:
[2024-05-12 11:35:37,941 INFO  L97    edCorrectnessWitness]: Location invariant before [L826-L826] ((((((((((((((((((! multithreaded || x$r_buff1_thd3 == (_Bool)0) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || (0 <= __unbuffered_p2_EAX && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p2_EBX) + (long long )z >= 0LL && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )z >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )y >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 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_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )x$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )x$flush_delayed >= 0LL) && (long long )x + (long long )x$mem_tmp >= 0LL) && (long long )x + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x + (long long )x$read_delayed >= 0LL) && (long long )x + (long long )x$w_buff0 >= 0LL) && (long long )x + (long long )x$w_buff1 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )x$flush_delayed + (long long )x$mem_tmp >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$flush_delayed + (long long )y >= 0LL) && (long long )x$flush_delayed + (long long )z >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff0 >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff1 >= 0LL) && (long long )x$mem_tmp + (long long )y >= 0LL) && (long long )x$mem_tmp + (long long )z >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )y >= 0LL) && (long long )x$r_buff0_thd0 + (long long )z >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )y >= 0LL) && (long long )x$r_buff0_thd1 + (long long )z >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )y >= 0LL) && (long long )x$r_buff0_thd2 + (long long )z >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )y >= 0LL) && (long long )x$r_buff0_thd3 + (long long )z >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )y >= 0LL) && (long long )x$r_buff1_thd0 + (long long )z >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )y >= 0LL) && (long long )x$r_buff1_thd1 + (long long )z >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )y >= 0LL) && (long long )x$r_buff1_thd2 + (long long )z >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )y >= 0LL) && (long long )x$r_buff1_thd3 + (long long )z >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$read_delayed + (long long )y >= 0LL) && (long long )x$read_delayed + (long long )z >= 0LL) && (long long )x$w_buff0 + (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 + (long long )y >= 0LL) && (long long )x$w_buff0 + (long long )z >= 0LL) && (long long )x$w_buff1 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )z >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )y >= 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 )x$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )z >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z >= 0LL) && (1LL + (long long )x) - (long long )z >= 0LL) && (1LL + (long long )x$flush_delayed) - (long long )z >= 0LL) && (1LL + (long long )x$mem_tmp) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd0) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd2) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd3) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd2) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd3) - (long long )z >= 0LL) && (1LL + (long long )x$read_delayed) - (long long )z >= 0LL) && (1LL + (long long )x$w_buff0) - (long long )z >= 0LL) && (1LL + (long long )x$w_buff1) - (long long )z >= 0LL) && (1LL + (long long )y) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )x$r_buff0_thd0) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff0_thd3) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd3) - (long long )z >= 0LL) && (1LL - (long long )x$read_delayed) - (long long )z >= 0LL) && (2LL - (long long )__unbuffered_p2_EBX) - (long long )z >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$read_delayed >= 0LL) && (long long )x - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x - (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$read_delayed >= 0LL))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && 0 <= z) && __unbuffered_p2_EBX <= 1) && x$w_buff0 <= 127) && x$w_buff1 <= 127) && z <= 1) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff0_thd3 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$r_buff1_thd3 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && x$w_buff0 % 2 == 0) && x$w_buff1 % 2 == 0) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 2)) && (x$w_buff1 == 0 || x$w_buff1 == 2)) && (z == 0 || z == 1)) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || (0 <= x$mem_tmp && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || (((0 <= x$w_buff0 && x$w_buff0 <= 127) && x$w_buff0 % 2 == 0) && (x$w_buff0 == 0 || x$w_buff0 == 2)))) && (! multithreaded || (0 <= x && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || (((0 <= x$w_buff1 && x$w_buff1 <= 127) && x$w_buff1 % 2 == 0) && (x$w_buff1 == 0 || x$w_buff1 == 2)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))
[2024-05-12 11:35:37,941 INFO  L97    edCorrectnessWitness]: Location invariant before [L829-L829] ((((((((((((((((((! multithreaded || x$r_buff1_thd3 == (_Bool)0) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || (0 <= __unbuffered_p2_EAX && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p2_EBX) + (long long )z >= 0LL && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )z >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )y >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 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_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )x$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )x$flush_delayed >= 0LL) && (long long )x + (long long )x$mem_tmp >= 0LL) && (long long )x + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x + (long long )x$read_delayed >= 0LL) && (long long )x + (long long )x$w_buff0 >= 0LL) && (long long )x + (long long )x$w_buff1 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )x$flush_delayed + (long long )x$mem_tmp >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$flush_delayed + (long long )y >= 0LL) && (long long )x$flush_delayed + (long long )z >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff0 >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff1 >= 0LL) && (long long )x$mem_tmp + (long long )y >= 0LL) && (long long )x$mem_tmp + (long long )z >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )y >= 0LL) && (long long )x$r_buff0_thd0 + (long long )z >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )y >= 0LL) && (long long )x$r_buff0_thd1 + (long long )z >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )y >= 0LL) && (long long )x$r_buff0_thd2 + (long long )z >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )y >= 0LL) && (long long )x$r_buff0_thd3 + (long long )z >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )y >= 0LL) && (long long )x$r_buff1_thd0 + (long long )z >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )y >= 0LL) && (long long )x$r_buff1_thd1 + (long long )z >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )y >= 0LL) && (long long )x$r_buff1_thd2 + (long long )z >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )y >= 0LL) && (long long )x$r_buff1_thd3 + (long long )z >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$read_delayed + (long long )y >= 0LL) && (long long )x$read_delayed + (long long )z >= 0LL) && (long long )x$w_buff0 + (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 + (long long )y >= 0LL) && (long long )x$w_buff0 + (long long )z >= 0LL) && (long long )x$w_buff1 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )z >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )y >= 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 )x$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )z >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z >= 0LL) && (1LL + (long long )x) - (long long )z >= 0LL) && (1LL + (long long )x$flush_delayed) - (long long )z >= 0LL) && (1LL + (long long )x$mem_tmp) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd0) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd2) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd3) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd2) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd3) - (long long )z >= 0LL) && (1LL + (long long )x$read_delayed) - (long long )z >= 0LL) && (1LL + (long long )x$w_buff0) - (long long )z >= 0LL) && (1LL + (long long )x$w_buff1) - (long long )z >= 0LL) && (1LL + (long long )y) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )x$r_buff0_thd0) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff0_thd3) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd3) - (long long )z >= 0LL) && (1LL - (long long )x$read_delayed) - (long long )z >= 0LL) && (2LL - (long long )__unbuffered_p2_EBX) - (long long )z >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$read_delayed >= 0LL) && (long long )x - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x - (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$read_delayed >= 0LL))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && 0 <= z) && __unbuffered_p2_EBX <= 1) && x$w_buff0 <= 127) && x$w_buff1 <= 127) && z <= 1) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff0_thd3 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$r_buff1_thd3 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && x$w_buff0 % 2 == 0) && x$w_buff1 % 2 == 0) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 2)) && (x$w_buff1 == 0 || x$w_buff1 == 2)) && (z == 0 || z == 1)) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || (0 <= x$mem_tmp && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || (((0 <= x$w_buff0 && x$w_buff0 <= 127) && x$w_buff0 % 2 == 0) && (x$w_buff0 == 0 || x$w_buff0 == 2)))) && (! multithreaded || (0 <= x && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || (((0 <= x$w_buff1 && x$w_buff1 <= 127) && x$w_buff1 % 2 == 0) && (x$w_buff1 == 0 || x$w_buff1 == 2)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))
[2024-05-12 11:35:37,942 INFO  L97    edCorrectnessWitness]: Location invariant before [L828-L828] ((((((((((((((((((! multithreaded || x$r_buff1_thd3 == (_Bool)0) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || (0 <= __unbuffered_p2_EAX && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p2_EBX) + (long long )z >= 0LL && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )z >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )y >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 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_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )x$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )x$flush_delayed >= 0LL) && (long long )x + (long long )x$mem_tmp >= 0LL) && (long long )x + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x + (long long )x$read_delayed >= 0LL) && (long long )x + (long long )x$w_buff0 >= 0LL) && (long long )x + (long long )x$w_buff1 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )x$flush_delayed + (long long )x$mem_tmp >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$flush_delayed + (long long )y >= 0LL) && (long long )x$flush_delayed + (long long )z >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff0 >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff1 >= 0LL) && (long long )x$mem_tmp + (long long )y >= 0LL) && (long long )x$mem_tmp + (long long )z >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )y >= 0LL) && (long long )x$r_buff0_thd0 + (long long )z >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )y >= 0LL) && (long long )x$r_buff0_thd1 + (long long )z >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )y >= 0LL) && (long long )x$r_buff0_thd2 + (long long )z >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )y >= 0LL) && (long long )x$r_buff0_thd3 + (long long )z >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )y >= 0LL) && (long long )x$r_buff1_thd0 + (long long )z >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )y >= 0LL) && (long long )x$r_buff1_thd1 + (long long )z >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )y >= 0LL) && (long long )x$r_buff1_thd2 + (long long )z >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )y >= 0LL) && (long long )x$r_buff1_thd3 + (long long )z >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$read_delayed + (long long )y >= 0LL) && (long long )x$read_delayed + (long long )z >= 0LL) && (long long )x$w_buff0 + (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 + (long long )y >= 0LL) && (long long )x$w_buff0 + (long long )z >= 0LL) && (long long )x$w_buff1 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )z >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )y >= 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 )x$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )z >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z >= 0LL) && (1LL + (long long )x) - (long long )z >= 0LL) && (1LL + (long long )x$flush_delayed) - (long long )z >= 0LL) && (1LL + (long long )x$mem_tmp) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd0) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd2) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd3) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd2) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd3) - (long long )z >= 0LL) && (1LL + (long long )x$read_delayed) - (long long )z >= 0LL) && (1LL + (long long )x$w_buff0) - (long long )z >= 0LL) && (1LL + (long long )x$w_buff1) - (long long )z >= 0LL) && (1LL + (long long )y) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )x$r_buff0_thd0) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff0_thd3) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd3) - (long long )z >= 0LL) && (1LL - (long long )x$read_delayed) - (long long )z >= 0LL) && (2LL - (long long )__unbuffered_p2_EBX) - (long long )z >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$read_delayed >= 0LL) && (long long )x - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x - (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$read_delayed >= 0LL))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && 0 <= z) && __unbuffered_p2_EBX <= 1) && x$w_buff0 <= 127) && x$w_buff1 <= 127) && z <= 1) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff0_thd3 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$r_buff1_thd3 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && x$w_buff0 % 2 == 0) && x$w_buff1 % 2 == 0) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 2)) && (x$w_buff1 == 0 || x$w_buff1 == 2)) && (z == 0 || z == 1)) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || (0 <= x$mem_tmp && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || (((0 <= x$w_buff0 && x$w_buff0 <= 127) && x$w_buff0 % 2 == 0) && (x$w_buff0 == 0 || x$w_buff0 == 2)))) && (! multithreaded || (0 <= x && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || (((0 <= x$w_buff1 && x$w_buff1 <= 127) && x$w_buff1 % 2 == 0) && (x$w_buff1 == 0 || x$w_buff1 == 2)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))
[2024-05-12 11:35:37,942 INFO  L103   edCorrectnessWitness]: ghost_variable multithreaded = 0
[2024-05-12 11:35:37,943 INFO  L106   edCorrectnessWitness]: ghost_update [L824-L824] multithreaded = 1;
[2024-05-12 11:35:37,978 INFO  L177         MainTranslator]: Built tables and reachable declarations
[2024-05-12 11:35:38,117 WARN  L246   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix028_power.opt_pso.opt_rmo.opt.i[966,979]
[2024-05-12 11:35:38,287 INFO  L207          PostProcessor]: Analyzing one entry point: main
[2024-05-12 11:35:38,300 INFO  L202         MainTranslator]: Completed pre-run
Start Parsing Local
[2024-05-12 11:35:38,330 WARN  L246   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix028_power.opt_pso.opt_rmo.opt.i[966,979]
Start Parsing Local
Start Parsing Local
Start Parsing Local
Start Parsing Local
[2024-05-12 11:35:38,639 INFO  L207          PostProcessor]: Analyzing one entry point: main
[2024-05-12 11:35:38,676 INFO  L206         MainTranslator]: Completed translation
[2024-05-12 11:35:38,677 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:35:38 WrapperNode
[2024-05-12 11:35:38,677 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-05-12 11:35:38,679 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-05-12 11:35:38,679 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-05-12 11:35:38,679 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-05-12 11:35:38,684 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:35:38" (1/1) ...
[2024-05-12 11:35:38,727 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:35:38" (1/1) ...
[2024-05-12 11:35:38,815 INFO  L138                Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 150
[2024-05-12 11:35:38,815 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-05-12 11:35:38,816 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-05-12 11:35:38,816 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-05-12 11:35:38,816 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-05-12 11:35:38,825 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:35:38" (1/1) ...
[2024-05-12 11:35:38,825 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:35:38" (1/1) ...
[2024-05-12 11:35:38,853 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:35:38" (1/1) ...
[2024-05-12 11:35:38,899 INFO  L175           MemorySlicer]: Split 5 memory accesses to 4 slices as follows [2, 1, 1, 1]. 40 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 3 writes are split as follows [0, 1, 1, 1].
[2024-05-12 11:35:38,900 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:35:38" (1/1) ...
[2024-05-12 11:35:38,900 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:35:38" (1/1) ...
[2024-05-12 11:35:38,928 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:35:38" (1/1) ...
[2024-05-12 11:35:38,930 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:35:38" (1/1) ...
[2024-05-12 11:35:38,943 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:35:38" (1/1) ...
[2024-05-12 11:35:38,948 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:35:38" (1/1) ...
[2024-05-12 11:35:38,970 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-05-12 11:35:38,971 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-05-12 11:35:38,971 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-05-12 11:35:38,971 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-05-12 11:35:38,972 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:35:38" (1/1) ...
[2024-05-12 11:35:38,977 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-05-12 11:35:38,983 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-05-12 11:35:39,007 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-05-12 11:35:39,009 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-05-12 11:35:39,044 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#0
[2024-05-12 11:35:39,044 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#1
[2024-05-12 11:35:39,045 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#2
[2024-05-12 11:35:39,045 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#3
[2024-05-12 11:35:39,052 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2024-05-12 11:35:39,052 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-05-12 11:35:39,052 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2024-05-12 11:35:39,052 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2024-05-12 11:35:39,052 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2024-05-12 11:35:39,052 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2024-05-12 11:35:39,053 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2024-05-12 11:35:39,053 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2024-05-12 11:35:39,053 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2024-05-12 11:35:39,053 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2024-05-12 11:35:39,055 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-05-12 11:35:39,055 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#1
[2024-05-12 11:35:39,055 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#2
[2024-05-12 11:35:39,055 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#3
[2024-05-12 11:35:39,056 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2024-05-12 11:35:39,056 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-05-12 11:35:39,056 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-05-12 11:35:39,065 WARN  L214             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement
[2024-05-12 11:35:39,203 INFO  L244             CfgBuilder]: Building ICFG
[2024-05-12 11:35:39,205 INFO  L270             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-05-12 11:35:40,347 INFO  L289             CfgBuilder]: Ommited future-live optimization because the input is a concurrent program.
[2024-05-12 11:35:40,347 INFO  L293             CfgBuilder]: Performing block encoding
[2024-05-12 11:35:40,588 INFO  L315             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-05-12 11:35:40,589 INFO  L320             CfgBuilder]: Removed 0 assume(true) statements.
[2024-05-12 11:35:40,589 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.05 11:35:40 BoogieIcfgContainer
[2024-05-12 11:35:40,589 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-05-12 11:35:40,591 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-05-12 11:35:40,591 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-05-12 11:35:40,593 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-05-12 11:35:40,593 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 11:35:36" (1/4) ...
[2024-05-12 11:35:40,594 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a10f5d9 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 12.05 11:35:40, skipping insertion in model container
[2024-05-12 11:35:40,594 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.05 11:35:37" (2/4) ...
[2024-05-12 11:35:40,594 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a10f5d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.05 11:35:40, skipping insertion in model container
[2024-05-12 11:35:40,594 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:35:38" (3/4) ...
[2024-05-12 11:35:40,594 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a10f5d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.05 11:35:40, skipping insertion in model container
[2024-05-12 11:35:40,594 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.05 11:35:40" (4/4) ...
[2024-05-12 11:35:40,595 INFO  L112   eAbstractionObserver]: Analyzing ICFG mix028_power.opt_pso.opt_rmo.opt.i
[2024-05-12 11:35:40,610 INFO  L204   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-05-12 11:35:40,610 INFO  L163   ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations.
[2024-05-12 11:35:40,610 INFO  L522   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-05-12 11:35:40,713 INFO  L144    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-05-12 11:35:40,735 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 57 places, 48 transitions, 108 flow
[2024-05-12 11:35:40,795 INFO  L124   PetriNetUnfolderBase]: 1/45 cut-off events.
[2024-05-12 11:35:40,795 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-05-12 11:35:40,799 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 55 conditions, 45 events. 1/45 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 75 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. 
[2024-05-12 11:35:40,799 INFO  L82        GeneralOperation]: Start removeDead. Operand has 57 places, 48 transitions, 108 flow
[2024-05-12 11:35:40,801 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 54 places, 45 transitions, 99 flow
[2024-05-12 11:35:40,808 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-05-12 11:35:40,813 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;@17b8ee1b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-05-12 11:35:40,813 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 9 error locations.
[2024-05-12 11:35:40,819 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-05-12 11:35:40,819 INFO  L124   PetriNetUnfolderBase]: 0/6 cut-off events.
[2024-05-12 11:35:40,820 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-05-12 11:35:40,820 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:35:40,820 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1]
[2024-05-12 11:35:40,821 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:35:40,834 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:35:40,834 INFO  L85        PathProgramCache]: Analyzing trace with hash -1649094037, now seen corresponding path program 1 times
[2024-05-12 11:35:40,841 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:35:40,841 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055539221]
[2024-05-12 11:35:40,842 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:35:40,842 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:35:41,259 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:35:46,336 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 11:35:46,337 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:35:46,337 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055539221]
[2024-05-12 11:35:46,338 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055539221] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:35:46,338 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:35:46,339 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-05-12 11:35:46,340 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790266934]
[2024-05-12 11:35:46,340 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:35:46,346 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-05-12 11:35:46,350 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:35:46,370 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-05-12 11:35:46,370 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-05-12 11:35:46,474 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48
[2024-05-12 11:35:46,477 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 45 transitions, 99 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-05-12 11:35:46,477 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:35:46,477 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48
[2024-05-12 11:35:46,478 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:35:47,711 INFO  L124   PetriNetUnfolderBase]: 4271/6992 cut-off events.
[2024-05-12 11:35:47,712 INFO  L125   PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES.
[2024-05-12 11:35:47,724 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 13238 conditions, 6992 events. 4271/6992 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 320. Compared 45443 event pairs, 3544 based on Foata normal form. 211/6580 useless extension candidates. Maximal degree in co-relation 13223. Up to 6128 conditions per place. 
[2024-05-12 11:35:47,754 INFO  L140   encePairwiseOnDemand]: 39/48 looper letters, 45 selfloop transitions, 5 changer transitions 0/60 dead transitions.
[2024-05-12 11:35:47,754 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 60 transitions, 235 flow
[2024-05-12 11:35:47,755 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-05-12 11:35:47,757 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-05-12 11:35:47,763 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 94 transitions.
[2024-05-12 11:35:47,764 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.6527777777777778
[2024-05-12 11:35:47,765 INFO  L175             Difference]: Start difference. First operand has 54 places, 45 transitions, 99 flow. Second operand 3 states and 94 transitions.
[2024-05-12 11:35:47,766 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 60 transitions, 235 flow
[2024-05-12 11:35:47,768 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 60 transitions, 230 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-05-12 11:35:47,773 INFO  L231             Difference]: Finished difference. Result has 54 places, 48 transitions, 131 flow
[2024-05-12 11:35:47,774 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=131, PETRI_PLACES=54, PETRI_TRANSITIONS=48}
[2024-05-12 11:35:47,777 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 0 predicate places.
[2024-05-12 11:35:47,777 INFO  L495      AbstractCegarLoop]: Abstraction has has 54 places, 48 transitions, 131 flow
[2024-05-12 11:35:47,777 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-05-12 11:35:47,777 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:35:47,778 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:35:47,778 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-05-12 11:35:47,778 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:35:47,779 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:35:47,779 INFO  L85        PathProgramCache]: Analyzing trace with hash 63599946, now seen corresponding path program 1 times
[2024-05-12 11:35:47,779 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:35:47,780 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184220134]
[2024-05-12 11:35:47,780 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:35:47,780 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:35:47,857 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:35:51,704 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 11:35:51,704 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:35:51,705 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184220134]
[2024-05-12 11:35:51,706 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184220134] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:35:51,706 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:35:51,706 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-05-12 11:35:51,706 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177316231]
[2024-05-12 11:35:51,706 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:35:51,708 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-05-12 11:35:51,708 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:35:51,708 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-05-12 11:35:51,709 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-05-12 11:35:51,773 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48
[2024-05-12 11:35:51,773 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 48 transitions, 131 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-05-12 11:35:51,773 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:35:51,773 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48
[2024-05-12 11:35:51,773 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:35:53,140 INFO  L124   PetriNetUnfolderBase]: 5125/7563 cut-off events.
[2024-05-12 11:35:53,141 INFO  L125   PetriNetUnfolderBase]: For 978/978 co-relation queries the response was YES.
[2024-05-12 11:35:53,149 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 16645 conditions, 7563 events. 5125/7563 cut-off events. For 978/978 co-relation queries the response was YES. Maximal size of possible extension queue 333. Compared 43123 event pairs, 2822 based on Foata normal form. 3/7216 useless extension candidates. Maximal degree in co-relation 16630. Up to 7290 conditions per place. 
[2024-05-12 11:35:53,170 INFO  L140   encePairwiseOnDemand]: 39/48 looper letters, 58 selfloop transitions, 9 changer transitions 0/76 dead transitions.
[2024-05-12 11:35:53,170 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 76 transitions, 335 flow
[2024-05-12 11:35:53,171 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-05-12 11:35:53,172 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-05-12 11:35:53,173 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 118 transitions.
[2024-05-12 11:35:53,173 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.6145833333333334
[2024-05-12 11:35:53,175 INFO  L175             Difference]: Start difference. First operand has 54 places, 48 transitions, 131 flow. Second operand 4 states and 118 transitions.
[2024-05-12 11:35:53,176 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 76 transitions, 335 flow
[2024-05-12 11:35:53,177 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 76 transitions, 330 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-05-12 11:35:53,178 INFO  L231             Difference]: Finished difference. Result has 57 places, 52 transitions, 177 flow
[2024-05-12 11:35:53,183 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=177, PETRI_PLACES=57, PETRI_TRANSITIONS=52}
[2024-05-12 11:35:53,183 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 3 predicate places.
[2024-05-12 11:35:53,184 INFO  L495      AbstractCegarLoop]: Abstraction has has 57 places, 52 transitions, 177 flow
[2024-05-12 11:35:53,184 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-05-12 11:35:53,184 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:35:53,184 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:35:53,184 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-05-12 11:35:53,184 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:35:53,190 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:35:53,191 INFO  L85        PathProgramCache]: Analyzing trace with hash 1971599552, now seen corresponding path program 1 times
[2024-05-12 11:35:53,191 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:35:53,191 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725502487]
[2024-05-12 11:35:53,192 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:35:53,192 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:35:53,268 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:35:56,770 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 11:35:56,770 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:35:56,770 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725502487]
[2024-05-12 11:35:56,771 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725502487] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:35:56,771 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:35:56,771 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-05-12 11:35:56,771 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229969021]
[2024-05-12 11:35:56,771 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:35:56,771 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-05-12 11:35:56,772 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:35:56,772 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-05-12 11:35:56,773 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20
[2024-05-12 11:35:56,932 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48
[2024-05-12 11:35:56,933 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 52 transitions, 177 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-05-12 11:35:56,933 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:35:56,933 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48
[2024-05-12 11:35:56,933 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:35:58,308 INFO  L124   PetriNetUnfolderBase]: 5109/8142 cut-off events.
[2024-05-12 11:35:58,308 INFO  L125   PetriNetUnfolderBase]: For 2988/2988 co-relation queries the response was YES.
[2024-05-12 11:35:58,321 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 18794 conditions, 8142 events. 5109/8142 cut-off events. For 2988/2988 co-relation queries the response was YES. Maximal size of possible extension queue 353. Compared 51723 event pairs, 2908 based on Foata normal form. 6/7576 useless extension candidates. Maximal degree in co-relation 18777. Up to 7239 conditions per place. 
[2024-05-12 11:35:58,353 INFO  L140   encePairwiseOnDemand]: 37/48 looper letters, 70 selfloop transitions, 16 changer transitions 0/95 dead transitions.
[2024-05-12 11:35:58,353 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 95 transitions, 494 flow
[2024-05-12 11:35:58,371 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-05-12 11:35:58,372 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-05-12 11:35:58,372 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 141 transitions.
[2024-05-12 11:35:58,373 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5875
[2024-05-12 11:35:58,373 INFO  L175             Difference]: Start difference. First operand has 57 places, 52 transitions, 177 flow. Second operand 5 states and 141 transitions.
[2024-05-12 11:35:58,374 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 95 transitions, 494 flow
[2024-05-12 11:35:58,376 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 95 transitions, 458 flow, removed 6 selfloop flow, removed 2 redundant places.
[2024-05-12 11:35:58,377 INFO  L231             Difference]: Finished difference. Result has 62 places, 67 transitions, 300 flow
[2024-05-12 11:35:58,377 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=300, PETRI_PLACES=62, PETRI_TRANSITIONS=67}
[2024-05-12 11:35:58,378 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 8 predicate places.
[2024-05-12 11:35:58,378 INFO  L495      AbstractCegarLoop]: Abstraction has has 62 places, 67 transitions, 300 flow
[2024-05-12 11:35:58,378 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-05-12 11:35:58,378 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:35:58,378 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:35:58,378 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-05-12 11:35:58,379 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:35:58,379 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:35:58,379 INFO  L85        PathProgramCache]: Analyzing trace with hash 1970848208, now seen corresponding path program 1 times
[2024-05-12 11:35:58,379 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:35:58,379 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994883160]
[2024-05-12 11:35:58,379 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:35:58,380 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:35:58,398 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:35:58,531 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 11:35:58,532 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:35:58,532 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994883160]
[2024-05-12 11:35:58,532 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994883160] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:35:58,532 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:35:58,532 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-05-12 11:35:58,533 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120957944]
[2024-05-12 11:35:58,533 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:35:58,533 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-05-12 11:35:58,533 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:35:58,534 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-05-12 11:35:58,534 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-05-12 11:35:58,534 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 23 out of 48
[2024-05-12 11:35:58,534 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 67 transitions, 300 flow. Second operand  has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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-05-12 11:35:58,534 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:35:58,535 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 48
[2024-05-12 11:35:58,535 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:35:58,958 INFO  L124   PetriNetUnfolderBase]: 1235/2506 cut-off events.
[2024-05-12 11:35:58,958 INFO  L125   PetriNetUnfolderBase]: For 1200/1338 co-relation queries the response was YES.
[2024-05-12 11:35:58,965 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5476 conditions, 2506 events. 1235/2506 cut-off events. For 1200/1338 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 18465 event pairs, 483 based on Foata normal form. 24/2382 useless extension candidates. Maximal degree in co-relation 5456. Up to 1589 conditions per place. 
[2024-05-12 11:35:58,972 INFO  L140   encePairwiseOnDemand]: 45/48 looper letters, 37 selfloop transitions, 7 changer transitions 0/74 dead transitions.
[2024-05-12 11:35:58,973 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 74 transitions, 375 flow
[2024-05-12 11:35:58,973 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-05-12 11:35:58,973 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-05-12 11:35:58,974 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions.
[2024-05-12 11:35:58,974 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.7361111111111112
[2024-05-12 11:35:58,974 INFO  L175             Difference]: Start difference. First operand has 62 places, 67 transitions, 300 flow. Second operand 3 states and 106 transitions.
[2024-05-12 11:35:58,974 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 74 transitions, 375 flow
[2024-05-12 11:35:58,976 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 74 transitions, 367 flow, removed 4 selfloop flow, removed 0 redundant places.
[2024-05-12 11:35:58,977 INFO  L231             Difference]: Finished difference. Result has 63 places, 61 transitions, 263 flow
[2024-05-12 11:35:58,977 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=249, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=263, PETRI_PLACES=63, PETRI_TRANSITIONS=61}
[2024-05-12 11:35:58,978 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 9 predicate places.
[2024-05-12 11:35:58,978 INFO  L495      AbstractCegarLoop]: Abstraction has has 63 places, 61 transitions, 263 flow
[2024-05-12 11:35:58,978 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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-05-12 11:35:58,978 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:35:58,978 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:35:58,978 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-05-12 11:35:58,979 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:35:58,979 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:35:58,979 INFO  L85        PathProgramCache]: Analyzing trace with hash -865925957, now seen corresponding path program 1 times
[2024-05-12 11:35:58,979 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:35:58,979 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571715523]
[2024-05-12 11:35:58,979 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:35:58,980 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:35:59,032 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:36:03,963 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 11:36:03,964 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:36:03,964 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571715523]
[2024-05-12 11:36:03,964 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571715523] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:36:03,964 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:36:03,964 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-05-12 11:36:03,965 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186900421]
[2024-05-12 11:36:03,965 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:36:03,965 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-05-12 11:36:03,965 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:36:03,966 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-05-12 11:36:03,966 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-05-12 11:36:04,103 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48
[2024-05-12 11:36:04,104 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 61 transitions, 263 flow. Second operand  has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:36:04,104 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:36:04,104 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48
[2024-05-12 11:36:04,104 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:36:05,519 INFO  L124   PetriNetUnfolderBase]: 4332/6972 cut-off events.
[2024-05-12 11:36:05,520 INFO  L125   PetriNetUnfolderBase]: For 6110/6110 co-relation queries the response was YES.
[2024-05-12 11:36:05,529 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 17243 conditions, 6972 events. 4332/6972 cut-off events. For 6110/6110 co-relation queries the response was YES. Maximal size of possible extension queue 299. Compared 43636 event pairs, 1834 based on Foata normal form. 6/6737 useless extension candidates. Maximal degree in co-relation 17221. Up to 6106 conditions per place. 
[2024-05-12 11:36:05,545 INFO  L140   encePairwiseOnDemand]: 38/48 looper letters, 72 selfloop transitions, 16 changer transitions 1/98 dead transitions.
[2024-05-12 11:36:05,545 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 98 transitions, 539 flow
[2024-05-12 11:36:05,546 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-05-12 11:36:05,546 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-05-12 11:36:05,547 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 158 transitions.
[2024-05-12 11:36:05,547 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5486111111111112
[2024-05-12 11:36:05,547 INFO  L175             Difference]: Start difference. First operand has 63 places, 61 transitions, 263 flow. Second operand 6 states and 158 transitions.
[2024-05-12 11:36:05,547 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 98 transitions, 539 flow
[2024-05-12 11:36:05,550 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 98 transitions, 523 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-05-12 11:36:05,551 INFO  L231             Difference]: Finished difference. Result has 66 places, 62 transitions, 305 flow
[2024-05-12 11:36:05,551 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=241, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=305, PETRI_PLACES=66, PETRI_TRANSITIONS=62}
[2024-05-12 11:36:05,551 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 12 predicate places.
[2024-05-12 11:36:05,552 INFO  L495      AbstractCegarLoop]: Abstraction has has 66 places, 62 transitions, 305 flow
[2024-05-12 11:36:05,552 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:36:05,552 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:36:05,552 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:36:05,552 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-05-12 11:36:05,552 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:36:05,553 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:36:05,553 INFO  L85        PathProgramCache]: Analyzing trace with hash -95460195, now seen corresponding path program 1 times
[2024-05-12 11:36:05,553 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:36:05,553 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991700851]
[2024-05-12 11:36:05,553 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:36:05,553 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:36:05,592 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:36:12,963 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 11:36:12,963 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:36:12,963 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991700851]
[2024-05-12 11:36:12,963 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991700851] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:36:12,963 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:36:12,964 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-05-12 11:36:12,964 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879684885]
[2024-05-12 11:36:12,964 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:36:12,964 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-05-12 11:36:12,964 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:36:12,965 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-05-12 11:36:12,965 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2024-05-12 11:36:13,078 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48
[2024-05-12 11:36:13,079 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 62 transitions, 305 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-05-12 11:36:13,079 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:36:13,079 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48
[2024-05-12 11:36:13,079 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:36:14,350 INFO  L124   PetriNetUnfolderBase]: 3603/6030 cut-off events.
[2024-05-12 11:36:14,351 INFO  L125   PetriNetUnfolderBase]: For 6607/6607 co-relation queries the response was YES.
[2024-05-12 11:36:14,360 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 15531 conditions, 6030 events. 3603/6030 cut-off events. For 6607/6607 co-relation queries the response was YES. Maximal size of possible extension queue 268. Compared 38239 event pairs, 1917 based on Foata normal form. 2/5778 useless extension candidates. Maximal degree in co-relation 15508. Up to 5169 conditions per place. 
[2024-05-12 11:36:14,375 INFO  L140   encePairwiseOnDemand]: 39/48 looper letters, 69 selfloop transitions, 9 changer transitions 0/87 dead transitions.
[2024-05-12 11:36:14,376 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 87 transitions, 555 flow
[2024-05-12 11:36:14,376 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-05-12 11:36:14,376 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-05-12 11:36:14,377 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 119 transitions.
[2024-05-12 11:36:14,377 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.49583333333333335
[2024-05-12 11:36:14,377 INFO  L175             Difference]: Start difference. First operand has 66 places, 62 transitions, 305 flow. Second operand 5 states and 119 transitions.
[2024-05-12 11:36:14,377 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 87 transitions, 555 flow
[2024-05-12 11:36:14,380 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 87 transitions, 507 flow, removed 7 selfloop flow, removed 4 redundant places.
[2024-05-12 11:36:14,381 INFO  L231             Difference]: Finished difference. Result has 67 places, 69 transitions, 350 flow
[2024-05-12 11:36:14,381 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=263, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=350, PETRI_PLACES=67, PETRI_TRANSITIONS=69}
[2024-05-12 11:36:14,381 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 13 predicate places.
[2024-05-12 11:36:14,382 INFO  L495      AbstractCegarLoop]: Abstraction has has 67 places, 69 transitions, 350 flow
[2024-05-12 11:36:14,382 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-05-12 11:36:14,382 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:36:14,382 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:36:14,382 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-05-12 11:36:14,382 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:36:14,383 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:36:14,383 INFO  L85        PathProgramCache]: Analyzing trace with hash 1335702484, now seen corresponding path program 1 times
[2024-05-12 11:36:14,383 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:36:14,383 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833050427]
[2024-05-12 11:36:14,383 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:36:14,383 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:36:14,420 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:36:22,711 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 11:36:22,712 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:36:22,712 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833050427]
[2024-05-12 11:36:22,712 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833050427] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:36:22,712 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:36:22,712 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-05-12 11:36:22,713 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157285936]
[2024-05-12 11:36:22,713 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:36:22,713 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-05-12 11:36:22,713 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:36:22,714 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-05-12 11:36:22,714 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2024-05-12 11:36:22,809 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48
[2024-05-12 11:36:22,809 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 69 transitions, 350 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-05-12 11:36:22,809 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:36:22,809 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48
[2024-05-12 11:36:22,809 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:36:24,450 INFO  L124   PetriNetUnfolderBase]: 4376/7076 cut-off events.
[2024-05-12 11:36:24,450 INFO  L125   PetriNetUnfolderBase]: For 10333/10333 co-relation queries the response was YES.
[2024-05-12 11:36:24,463 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 19455 conditions, 7076 events. 4376/7076 cut-off events. For 10333/10333 co-relation queries the response was YES. Maximal size of possible extension queue 296. Compared 43848 event pairs, 2290 based on Foata normal form. 3/6861 useless extension candidates. Maximal degree in co-relation 19429. Up to 6171 conditions per place. 
[2024-05-12 11:36:24,482 INFO  L140   encePairwiseOnDemand]: 37/48 looper letters, 83 selfloop transitions, 19 changer transitions 0/110 dead transitions.
[2024-05-12 11:36:24,482 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 110 transitions, 710 flow
[2024-05-12 11:36:24,483 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-05-12 11:36:24,483 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-05-12 11:36:24,484 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 144 transitions.
[2024-05-12 11:36:24,484 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5
[2024-05-12 11:36:24,484 INFO  L175             Difference]: Start difference. First operand has 67 places, 69 transitions, 350 flow. Second operand 6 states and 144 transitions.
[2024-05-12 11:36:24,484 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 110 transitions, 710 flow
[2024-05-12 11:36:24,487 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 110 transitions, 693 flow, removed 4 selfloop flow, removed 2 redundant places.
[2024-05-12 11:36:24,488 INFO  L231             Difference]: Finished difference. Result has 73 places, 81 transitions, 470 flow
[2024-05-12 11:36:24,489 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=333, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=470, PETRI_PLACES=73, PETRI_TRANSITIONS=81}
[2024-05-12 11:36:24,489 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 19 predicate places.
[2024-05-12 11:36:24,489 INFO  L495      AbstractCegarLoop]: Abstraction has has 73 places, 81 transitions, 470 flow
[2024-05-12 11:36:24,490 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-05-12 11:36:24,490 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:36:24,490 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:36:24,490 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-05-12 11:36:24,490 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:36:24,490 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:36:24,490 INFO  L85        PathProgramCache]: Analyzing trace with hash 2136796136, now seen corresponding path program 1 times
[2024-05-12 11:36:24,491 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:36:24,491 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196510769]
[2024-05-12 11:36:24,491 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:36:24,491 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:36:24,527 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:36:32,632 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 11:36:32,633 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:36:32,633 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196510769]
[2024-05-12 11:36:32,633 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196510769] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:36:32,633 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:36:32,633 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-05-12 11:36:32,634 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392089520]
[2024-05-12 11:36:32,634 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:36:32,634 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-05-12 11:36:32,635 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:36:32,635 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-05-12 11:36:32,635 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2024-05-12 11:36:32,734 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48
[2024-05-12 11:36:32,734 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 81 transitions, 470 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-05-12 11:36:32,734 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:36:32,734 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48
[2024-05-12 11:36:32,734 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:36:34,477 INFO  L124   PetriNetUnfolderBase]: 4760/7720 cut-off events.
[2024-05-12 11:36:34,478 INFO  L125   PetriNetUnfolderBase]: For 17086/17096 co-relation queries the response was YES.
[2024-05-12 11:36:34,495 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 23410 conditions, 7720 events. 4760/7720 cut-off events. For 17086/17096 co-relation queries the response was YES. Maximal size of possible extension queue 321. Compared 48744 event pairs, 2413 based on Foata normal form. 2/7431 useless extension candidates. Maximal degree in co-relation 23380. Up to 6728 conditions per place. 
[2024-05-12 11:36:34,518 INFO  L140   encePairwiseOnDemand]: 38/48 looper letters, 91 selfloop transitions, 13 changer transitions 0/115 dead transitions.
[2024-05-12 11:36:34,519 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 115 transitions, 802 flow
[2024-05-12 11:36:34,519 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-05-12 11:36:34,519 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-05-12 11:36:34,520 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 139 transitions.
[2024-05-12 11:36:34,520 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4826388888888889
[2024-05-12 11:36:34,520 INFO  L175             Difference]: Start difference. First operand has 73 places, 81 transitions, 470 flow. Second operand 6 states and 139 transitions.
[2024-05-12 11:36:34,520 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 115 transitions, 802 flow
[2024-05-12 11:36:34,527 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 115 transitions, 788 flow, removed 6 selfloop flow, removed 1 redundant places.
[2024-05-12 11:36:34,529 INFO  L231             Difference]: Finished difference. Result has 79 places, 88 transitions, 561 flow
[2024-05-12 11:36:34,529 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=456, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=561, PETRI_PLACES=79, PETRI_TRANSITIONS=88}
[2024-05-12 11:36:34,532 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 25 predicate places.
[2024-05-12 11:36:34,532 INFO  L495      AbstractCegarLoop]: Abstraction has has 79 places, 88 transitions, 561 flow
[2024-05-12 11:36:34,532 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-05-12 11:36:34,532 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:36:34,533 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:36:34,533 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-05-12 11:36:34,533 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:36:34,533 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:36:34,533 INFO  L85        PathProgramCache]: Analyzing trace with hash -1542903620, now seen corresponding path program 2 times
[2024-05-12 11:36:34,533 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:36:34,534 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504287342]
[2024-05-12 11:36:34,534 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:36:34,534 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:36:34,583 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:36:42,416 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 11:36:42,416 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:36:42,416 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504287342]
[2024-05-12 11:36:42,416 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504287342] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:36:42,416 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:36:42,416 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-05-12 11:36:42,416 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937739055]
[2024-05-12 11:36:42,416 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:36:42,417 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-05-12 11:36:42,417 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:36:42,417 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-05-12 11:36:42,417 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2024-05-12 11:36:42,573 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48
[2024-05-12 11:36:42,573 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 88 transitions, 561 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-05-12 11:36:42,573 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:36:42,573 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48
[2024-05-12 11:36:42,573 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:36:44,307 INFO  L124   PetriNetUnfolderBase]: 4709/7586 cut-off events.
[2024-05-12 11:36:44,320 INFO  L125   PetriNetUnfolderBase]: For 21598/21610 co-relation queries the response was YES.
[2024-05-12 11:36:44,358 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 24552 conditions, 7586 events. 4709/7586 cut-off events. For 21598/21610 co-relation queries the response was YES. Maximal size of possible extension queue 315. Compared 47367 event pairs, 2276 based on Foata normal form. 2/7333 useless extension candidates. Maximal degree in co-relation 24518. Up to 6621 conditions per place. 
[2024-05-12 11:36:44,382 INFO  L140   encePairwiseOnDemand]: 38/48 looper letters, 97 selfloop transitions, 19 changer transitions 0/127 dead transitions.
[2024-05-12 11:36:44,383 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 127 transitions, 927 flow
[2024-05-12 11:36:44,383 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-05-12 11:36:44,383 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-05-12 11:36:44,385 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 163 transitions.
[2024-05-12 11:36:44,385 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4851190476190476
[2024-05-12 11:36:44,385 INFO  L175             Difference]: Start difference. First operand has 79 places, 88 transitions, 561 flow. Second operand 7 states and 163 transitions.
[2024-05-12 11:36:44,385 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 127 transitions, 927 flow
[2024-05-12 11:36:44,395 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 127 transitions, 890 flow, removed 10 selfloop flow, removed 3 redundant places.
[2024-05-12 11:36:44,397 INFO  L231             Difference]: Finished difference. Result has 83 places, 91 transitions, 606 flow
[2024-05-12 11:36:44,397 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=524, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=606, PETRI_PLACES=83, PETRI_TRANSITIONS=91}
[2024-05-12 11:36:44,398 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 29 predicate places.
[2024-05-12 11:36:44,398 INFO  L495      AbstractCegarLoop]: Abstraction has has 83 places, 91 transitions, 606 flow
[2024-05-12 11:36:44,398 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-05-12 11:36:44,398 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:36:44,398 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:36:44,398 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-05-12 11:36:44,398 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:36:44,399 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:36:44,399 INFO  L85        PathProgramCache]: Analyzing trace with hash 2142548744, now seen corresponding path program 1 times
[2024-05-12 11:36:44,399 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:36:44,399 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912588647]
[2024-05-12 11:36:44,399 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:36:44,400 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:36:44,452 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:36:52,656 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 11:36:52,657 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:36:52,657 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912588647]
[2024-05-12 11:36:52,657 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912588647] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:36:52,657 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:36:52,657 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-05-12 11:36:52,657 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708421691]
[2024-05-12 11:36:52,657 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:36:52,657 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-05-12 11:36:52,658 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:36:52,658 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-05-12 11:36:52,658 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-05-12 11:36:52,865 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48
[2024-05-12 11:36:52,866 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 91 transitions, 606 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-05-12 11:36:52,866 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:36:52,866 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48
[2024-05-12 11:36:52,866 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:36:54,714 INFO  L124   PetriNetUnfolderBase]: 4420/7183 cut-off events.
[2024-05-12 11:36:54,714 INFO  L125   PetriNetUnfolderBase]: For 25366/25366 co-relation queries the response was YES.
[2024-05-12 11:36:54,728 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 24447 conditions, 7183 events. 4420/7183 cut-off events. For 25366/25366 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 44865 event pairs, 2173 based on Foata normal form. 3/6962 useless extension candidates. Maximal degree in co-relation 24412. Up to 6213 conditions per place. 
[2024-05-12 11:36:54,746 INFO  L140   encePairwiseOnDemand]: 36/48 looper letters, 107 selfloop transitions, 39 changer transitions 0/154 dead transitions.
[2024-05-12 11:36:54,747 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 154 transitions, 1258 flow
[2024-05-12 11:36:54,747 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-05-12 11:36:54,747 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-05-12 11:36:54,748 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 166 transitions.
[2024-05-12 11:36:54,748 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.49404761904761907
[2024-05-12 11:36:54,748 INFO  L175             Difference]: Start difference. First operand has 83 places, 91 transitions, 606 flow. Second operand 7 states and 166 transitions.
[2024-05-12 11:36:54,748 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 154 transitions, 1258 flow
[2024-05-12 11:36:54,758 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 154 transitions, 1197 flow, removed 11 selfloop flow, removed 5 redundant places.
[2024-05-12 11:36:54,759 INFO  L231             Difference]: Finished difference. Result has 88 places, 120 transitions, 926 flow
[2024-05-12 11:36:54,759 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=550, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=926, PETRI_PLACES=88, PETRI_TRANSITIONS=120}
[2024-05-12 11:36:54,760 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 34 predicate places.
[2024-05-12 11:36:54,760 INFO  L495      AbstractCegarLoop]: Abstraction has has 88 places, 120 transitions, 926 flow
[2024-05-12 11:36:54,760 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-05-12 11:36:54,761 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:36:54,761 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:36:54,761 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-05-12 11:36:54,761 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:36:54,761 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:36:54,761 INFO  L85        PathProgramCache]: Analyzing trace with hash 128013384, now seen corresponding path program 1 times
[2024-05-12 11:36:54,761 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:36:54,762 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992183540]
[2024-05-12 11:36:54,762 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:36:54,762 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:36:54,799 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:37:02,954 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 11:37:02,955 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:37:02,955 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992183540]
[2024-05-12 11:37:02,955 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992183540] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:37:02,955 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:37:02,955 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-05-12 11:37:02,955 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506203926]
[2024-05-12 11:37:02,955 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:37:02,955 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-05-12 11:37:02,955 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:37:02,956 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-05-12 11:37:02,956 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-05-12 11:37:03,073 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48
[2024-05-12 11:37:03,074 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 120 transitions, 926 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-05-12 11:37:03,074 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:37:03,074 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48
[2024-05-12 11:37:03,074 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:37:05,005 INFO  L124   PetriNetUnfolderBase]: 4773/7672 cut-off events.
[2024-05-12 11:37:05,006 INFO  L125   PetriNetUnfolderBase]: For 37822/37882 co-relation queries the response was YES.
[2024-05-12 11:37:05,027 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 29031 conditions, 7672 events. 4773/7672 cut-off events. For 37822/37882 co-relation queries the response was YES. Maximal size of possible extension queue 317. Compared 47609 event pairs, 1973 based on Foata normal form. 14/7395 useless extension candidates. Maximal degree in co-relation 28992. Up to 6663 conditions per place. 
[2024-05-12 11:37:05,052 INFO  L140   encePairwiseOnDemand]: 35/48 looper letters, 119 selfloop transitions, 30 changer transitions 0/166 dead transitions.
[2024-05-12 11:37:05,052 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 166 transitions, 1395 flow
[2024-05-12 11:37:05,053 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-05-12 11:37:05,053 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-05-12 11:37:05,054 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 182 transitions.
[2024-05-12 11:37:05,054 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4739583333333333
[2024-05-12 11:37:05,054 INFO  L175             Difference]: Start difference. First operand has 88 places, 120 transitions, 926 flow. Second operand 8 states and 182 transitions.
[2024-05-12 11:37:05,054 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 166 transitions, 1395 flow
[2024-05-12 11:37:05,073 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 166 transitions, 1339 flow, removed 27 selfloop flow, removed 1 redundant places.
[2024-05-12 11:37:05,076 INFO  L231             Difference]: Finished difference. Result has 96 places, 129 transitions, 1029 flow
[2024-05-12 11:37:05,076 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=870, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1029, PETRI_PLACES=96, PETRI_TRANSITIONS=129}
[2024-05-12 11:37:05,076 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 42 predicate places.
[2024-05-12 11:37:05,077 INFO  L495      AbstractCegarLoop]: Abstraction has has 96 places, 129 transitions, 1029 flow
[2024-05-12 11:37:05,077 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-05-12 11:37:05,077 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:37:05,077 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:37:05,077 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-05-12 11:37:05,077 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:37:05,078 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:37:05,078 INFO  L85        PathProgramCache]: Analyzing trace with hash 1816172009, now seen corresponding path program 1 times
[2024-05-12 11:37:05,078 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:37:05,078 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263024952]
[2024-05-12 11:37:05,078 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:37:05,078 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:37:05,120 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:37:12,631 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 11:37:12,631 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:37:12,632 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263024952]
[2024-05-12 11:37:12,632 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263024952] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:37:12,632 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:37:12,632 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-05-12 11:37:12,632 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840719359]
[2024-05-12 11:37:12,632 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:37:12,633 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-05-12 11:37:12,633 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:37:12,633 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-05-12 11:37:12,633 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-05-12 11:37:12,729 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 48
[2024-05-12 11:37:12,730 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 129 transitions, 1029 flow. Second operand  has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 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-05-12 11:37:12,730 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:37:12,730 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 48
[2024-05-12 11:37:12,730 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:37:14,918 INFO  L124   PetriNetUnfolderBase]: 5291/8324 cut-off events.
[2024-05-12 11:37:14,919 INFO  L125   PetriNetUnfolderBase]: For 49572/49572 co-relation queries the response was YES.
[2024-05-12 11:37:14,942 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 33857 conditions, 8324 events. 5291/8324 cut-off events. For 49572/49572 co-relation queries the response was YES. Maximal size of possible extension queue 318. Compared 50257 event pairs, 2135 based on Foata normal form. 3/8067 useless extension candidates. Maximal degree in co-relation 33814. Up to 7409 conditions per place. 
[2024-05-12 11:37:14,970 INFO  L140   encePairwiseOnDemand]: 36/48 looper letters, 151 selfloop transitions, 28 changer transitions 0/186 dead transitions.
[2024-05-12 11:37:14,970 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 186 transitions, 1697 flow
[2024-05-12 11:37:14,971 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-05-12 11:37:14,971 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-05-12 11:37:14,971 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 196 transitions.
[2024-05-12 11:37:14,972 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4537037037037037
[2024-05-12 11:37:14,972 INFO  L175             Difference]: Start difference. First operand has 96 places, 129 transitions, 1029 flow. Second operand 9 states and 196 transitions.
[2024-05-12 11:37:14,972 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 186 transitions, 1697 flow
[2024-05-12 11:37:14,995 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 186 transitions, 1609 flow, removed 26 selfloop flow, removed 4 redundant places.
[2024-05-12 11:37:14,997 INFO  L231             Difference]: Finished difference. Result has 103 places, 141 transitions, 1152 flow
[2024-05-12 11:37:14,997 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=941, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1152, PETRI_PLACES=103, PETRI_TRANSITIONS=141}
[2024-05-12 11:37:14,998 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 49 predicate places.
[2024-05-12 11:37:14,998 INFO  L495      AbstractCegarLoop]: Abstraction has has 103 places, 141 transitions, 1152 flow
[2024-05-12 11:37:14,998 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 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-05-12 11:37:14,998 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:37:14,998 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:37:14,998 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-05-12 11:37:14,998 INFO  L420      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:37:14,999 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:37:14,999 INFO  L85        PathProgramCache]: Analyzing trace with hash 1816171792, now seen corresponding path program 2 times
[2024-05-12 11:37:14,999 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:37:14,999 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079982452]
[2024-05-12 11:37:14,999 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:37:14,999 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:37:15,036 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:37:22,944 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 11:37:22,944 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:37:22,945 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079982452]
[2024-05-12 11:37:22,945 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079982452] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:37:22,945 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:37:22,945 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-05-12 11:37:22,945 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387490958]
[2024-05-12 11:37:22,945 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:37:22,945 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-05-12 11:37:22,946 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:37:22,946 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-05-12 11:37:22,947 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-05-12 11:37:23,126 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48
[2024-05-12 11:37:23,128 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 141 transitions, 1152 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-05-12 11:37:23,128 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:37:23,128 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48
[2024-05-12 11:37:23,128 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:37:25,152 INFO  L124   PetriNetUnfolderBase]: 5005/7948 cut-off events.
[2024-05-12 11:37:25,152 INFO  L125   PetriNetUnfolderBase]: For 60127/60254 co-relation queries the response was YES.
[2024-05-12 11:37:25,177 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 34835 conditions, 7948 events. 5005/7948 cut-off events. For 60127/60254 co-relation queries the response was YES. Maximal size of possible extension queue 324. Compared 48781 event pairs, 1861 based on Foata normal form. 14/7652 useless extension candidates. Maximal degree in co-relation 34790. Up to 6880 conditions per place. 
[2024-05-12 11:37:25,207 INFO  L140   encePairwiseOnDemand]: 36/48 looper letters, 133 selfloop transitions, 38 changer transitions 0/191 dead transitions.
[2024-05-12 11:37:25,207 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 191 transitions, 1809 flow
[2024-05-12 11:37:25,208 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-05-12 11:37:25,208 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-05-12 11:37:25,208 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 183 transitions.
[2024-05-12 11:37:25,208 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4765625
[2024-05-12 11:37:25,209 INFO  L175             Difference]: Start difference. First operand has 103 places, 141 transitions, 1152 flow. Second operand 8 states and 183 transitions.
[2024-05-12 11:37:25,209 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 191 transitions, 1809 flow
[2024-05-12 11:37:25,245 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 191 transitions, 1722 flow, removed 31 selfloop flow, removed 5 redundant places.
[2024-05-12 11:37:25,247 INFO  L231             Difference]: Finished difference. Result has 107 places, 153 transitions, 1336 flow
[2024-05-12 11:37:25,247 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1071, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1336, PETRI_PLACES=107, PETRI_TRANSITIONS=153}
[2024-05-12 11:37:25,248 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 53 predicate places.
[2024-05-12 11:37:25,248 INFO  L495      AbstractCegarLoop]: Abstraction has has 107 places, 153 transitions, 1336 flow
[2024-05-12 11:37:25,248 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-05-12 11:37:25,248 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:37:25,249 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:37:25,249 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2024-05-12 11:37:25,249 INFO  L420      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:37:25,249 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:37:25,249 INFO  L85        PathProgramCache]: Analyzing trace with hash 1994492999, now seen corresponding path program 2 times
[2024-05-12 11:37:25,249 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:37:25,249 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080993830]
[2024-05-12 11:37:25,250 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:37:25,250 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:37:25,288 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:37:33,100 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 11:37:33,100 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:37:33,100 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080993830]
[2024-05-12 11:37:33,100 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080993830] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:37:33,101 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:37:33,101 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-05-12 11:37:33,101 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669899157]
[2024-05-12 11:37:33,101 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:37:33,101 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-05-12 11:37:33,101 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:37:33,102 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-05-12 11:37:33,102 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-05-12 11:37:33,205 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 48
[2024-05-12 11:37:33,206 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 153 transitions, 1336 flow. Second operand  has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 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-05-12 11:37:33,206 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:37:33,206 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 48
[2024-05-12 11:37:33,206 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:37:35,516 INFO  L124   PetriNetUnfolderBase]: 5460/8563 cut-off events.
[2024-05-12 11:37:35,516 INFO  L125   PetriNetUnfolderBase]: For 74267/74267 co-relation queries the response was YES.
[2024-05-12 11:37:35,540 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 39354 conditions, 8563 events. 5460/8563 cut-off events. For 74267/74267 co-relation queries the response was YES. Maximal size of possible extension queue 331. Compared 51845 event pairs, 2016 based on Foata normal form. 3/8304 useless extension candidates. Maximal degree in co-relation 39308. Up to 7419 conditions per place. 
[2024-05-12 11:37:35,572 INFO  L140   encePairwiseOnDemand]: 36/48 looper letters, 153 selfloop transitions, 58 changer transitions 0/218 dead transitions.
[2024-05-12 11:37:35,572 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 218 transitions, 2229 flow
[2024-05-12 11:37:35,576 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-05-12 11:37:35,576 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-05-12 11:37:35,577 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 191 transitions.
[2024-05-12 11:37:35,577 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4973958333333333
[2024-05-12 11:37:35,577 INFO  L175             Difference]: Start difference. First operand has 107 places, 153 transitions, 1336 flow. Second operand 8 states and 191 transitions.
[2024-05-12 11:37:35,577 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 218 transitions, 2229 flow
[2024-05-12 11:37:35,626 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 218 transitions, 2139 flow, removed 32 selfloop flow, removed 4 redundant places.
[2024-05-12 11:37:35,629 INFO  L231             Difference]: Finished difference. Result has 112 places, 165 transitions, 1575 flow
[2024-05-12 11:37:35,629 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1250, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1575, PETRI_PLACES=112, PETRI_TRANSITIONS=165}
[2024-05-12 11:37:35,629 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 58 predicate places.
[2024-05-12 11:37:35,630 INFO  L495      AbstractCegarLoop]: Abstraction has has 112 places, 165 transitions, 1575 flow
[2024-05-12 11:37:35,630 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 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-05-12 11:37:35,630 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:37:35,630 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:37:35,630 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2024-05-12 11:37:35,630 INFO  L420      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:37:35,631 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:37:35,631 INFO  L85        PathProgramCache]: Analyzing trace with hash 1994225872, now seen corresponding path program 3 times
[2024-05-12 11:37:35,631 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:37:35,631 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123923030]
[2024-05-12 11:37:35,631 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:37:35,631 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:37:35,666 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:37:44,158 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 11:37:44,159 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:37:44,159 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123923030]
[2024-05-12 11:37:44,159 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123923030] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:37:44,159 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:37:44,159 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-05-12 11:37:44,159 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341582820]
[2024-05-12 11:37:44,159 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:37:44,160 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-05-12 11:37:44,161 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:37:44,161 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-05-12 11:37:44,161 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-05-12 11:37:44,306 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48
[2024-05-12 11:37:44,307 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 165 transitions, 1575 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-05-12 11:37:44,307 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:37:44,307 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48
[2024-05-12 11:37:44,307 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:37:46,452 INFO  L124   PetriNetUnfolderBase]: 5031/8101 cut-off events.
[2024-05-12 11:37:46,453 INFO  L125   PetriNetUnfolderBase]: For 78806/78886 co-relation queries the response was YES.
[2024-05-12 11:37:46,481 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 38853 conditions, 8101 events. 5031/8101 cut-off events. For 78806/78886 co-relation queries the response was YES. Maximal size of possible extension queue 327. Compared 50819 event pairs, 1756 based on Foata normal form. 6/7813 useless extension candidates. Maximal degree in co-relation 38804. Up to 6831 conditions per place. 
[2024-05-12 11:37:46,511 INFO  L140   encePairwiseOnDemand]: 36/48 looper letters, 150 selfloop transitions, 53 changer transitions 0/226 dead transitions.
[2024-05-12 11:37:46,512 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 226 transitions, 2409 flow
[2024-05-12 11:37:46,512 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-05-12 11:37:46,513 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-05-12 11:37:46,513 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 192 transitions.
[2024-05-12 11:37:46,513 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5
[2024-05-12 11:37:46,513 INFO  L175             Difference]: Start difference. First operand has 112 places, 165 transitions, 1575 flow. Second operand 8 states and 192 transitions.
[2024-05-12 11:37:46,514 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 226 transitions, 2409 flow
[2024-05-12 11:37:46,570 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 226 transitions, 2350 flow, removed 20 selfloop flow, removed 3 redundant places.
[2024-05-12 11:37:46,573 INFO  L231             Difference]: Finished difference. Result has 119 places, 181 transitions, 1926 flow
[2024-05-12 11:37:46,574 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1516, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1926, PETRI_PLACES=119, PETRI_TRANSITIONS=181}
[2024-05-12 11:37:46,574 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 65 predicate places.
[2024-05-12 11:37:46,574 INFO  L495      AbstractCegarLoop]: Abstraction has has 119 places, 181 transitions, 1926 flow
[2024-05-12 11:37:46,574 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-05-12 11:37:46,574 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:37:46,575 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:37:46,575 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2024-05-12 11:37:46,575 INFO  L420      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:37:46,575 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:37:46,575 INFO  L85        PathProgramCache]: Analyzing trace with hash 1994226089, now seen corresponding path program 3 times
[2024-05-12 11:37:46,575 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:37:46,575 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099098353]
[2024-05-12 11:37:46,576 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:37:46,576 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:37:46,617 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:37:53,763 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 11:37:53,764 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:37:53,764 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099098353]
[2024-05-12 11:37:53,764 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099098353] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:37:53,764 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:37:53,764 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-05-12 11:37:53,764 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979301742]
[2024-05-12 11:37:53,764 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:37:53,765 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-05-12 11:37:53,765 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:37:53,765 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-05-12 11:37:53,765 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-05-12 11:37:53,894 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 48
[2024-05-12 11:37:53,894 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 181 transitions, 1926 flow. Second operand  has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 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-05-12 11:37:53,894 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:37:53,894 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 48
[2024-05-12 11:37:53,894 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:37:56,092 INFO  L124   PetriNetUnfolderBase]: 5444/8560 cut-off events.
[2024-05-12 11:37:56,093 INFO  L125   PetriNetUnfolderBase]: For 96615/96637 co-relation queries the response was YES.
[2024-05-12 11:37:56,125 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 43187 conditions, 8560 events. 5444/8560 cut-off events. For 96615/96637 co-relation queries the response was YES. Maximal size of possible extension queue 332. Compared 52018 event pairs, 2026 based on Foata normal form. 21/8313 useless extension candidates. Maximal degree in co-relation 43134. Up to 7401 conditions per place. 
[2024-05-12 11:37:56,159 INFO  L140   encePairwiseOnDemand]: 36/48 looper letters, 167 selfloop transitions, 51 changer transitions 0/225 dead transitions.
[2024-05-12 11:37:56,160 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 225 transitions, 2645 flow
[2024-05-12 11:37:56,160 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-05-12 11:37:56,160 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-05-12 11:37:56,161 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 166 transitions.
[2024-05-12 11:37:56,162 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.49404761904761907
[2024-05-12 11:37:56,163 INFO  L175             Difference]: Start difference. First operand has 119 places, 181 transitions, 1926 flow. Second operand 7 states and 166 transitions.
[2024-05-12 11:37:56,163 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 225 transitions, 2645 flow
[2024-05-12 11:37:56,246 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 225 transitions, 2469 flow, removed 76 selfloop flow, removed 3 redundant places.
[2024-05-12 11:37:56,248 INFO  L231             Difference]: Finished difference. Result has 123 places, 181 transitions, 1873 flow
[2024-05-12 11:37:56,249 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1760, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1873, PETRI_PLACES=123, PETRI_TRANSITIONS=181}
[2024-05-12 11:37:56,249 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 69 predicate places.
[2024-05-12 11:37:56,249 INFO  L495      AbstractCegarLoop]: Abstraction has has 123 places, 181 transitions, 1873 flow
[2024-05-12 11:37:56,250 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 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-05-12 11:37:56,250 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:37:56,250 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:37:56,250 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2024-05-12 11:37:56,250 INFO  L420      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:37:56,250 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:37:56,250 INFO  L85        PathProgramCache]: Analyzing trace with hash 1994502919, now seen corresponding path program 1 times
[2024-05-12 11:37:56,251 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:37:56,251 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445307555]
[2024-05-12 11:37:56,251 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:37:56,251 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:37:56,324 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:38:05,727 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 11:38:05,727 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:38:05,727 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445307555]
[2024-05-12 11:38:05,728 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445307555] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:38:05,728 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:38:05,728 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-05-12 11:38:05,728 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061355328]
[2024-05-12 11:38:05,728 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:38:05,729 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-05-12 11:38:05,729 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:38:05,729 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-05-12 11:38:05,729 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-05-12 11:38:05,886 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48
[2024-05-12 11:38:05,886 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 181 transitions, 1873 flow. Second operand  has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:38:05,886 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:38:05,887 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48
[2024-05-12 11:38:05,887 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:38:08,012 INFO  L124   PetriNetUnfolderBase]: 4769/7697 cut-off events.
[2024-05-12 11:38:08,013 INFO  L125   PetriNetUnfolderBase]: For 87650/87650 co-relation queries the response was YES.
[2024-05-12 11:38:08,048 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 39155 conditions, 7697 events. 4769/7697 cut-off events. For 87650/87650 co-relation queries the response was YES. Maximal size of possible extension queue 320. Compared 47918 event pairs, 1692 based on Foata normal form. 6/7470 useless extension candidates. Maximal degree in co-relation 39100. Up to 6619 conditions per place. 
[2024-05-12 11:38:08,081 INFO  L140   encePairwiseOnDemand]: 35/48 looper letters, 191 selfloop transitions, 42 changer transitions 0/241 dead transitions.
[2024-05-12 11:38:08,081 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 241 transitions, 2702 flow
[2024-05-12 11:38:08,090 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-05-12 11:38:08,090 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-05-12 11:38:08,092 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 192 transitions.
[2024-05-12 11:38:08,092 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5
[2024-05-12 11:38:08,092 INFO  L175             Difference]: Start difference. First operand has 123 places, 181 transitions, 1873 flow. Second operand 8 states and 192 transitions.
[2024-05-12 11:38:08,092 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 241 transitions, 2702 flow
[2024-05-12 11:38:08,165 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 241 transitions, 2563 flow, removed 18 selfloop flow, removed 5 redundant places.
[2024-05-12 11:38:08,168 INFO  L231             Difference]: Finished difference. Result has 127 places, 194 transitions, 2006 flow
[2024-05-12 11:38:08,168 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1734, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2006, PETRI_PLACES=127, PETRI_TRANSITIONS=194}
[2024-05-12 11:38:08,169 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 73 predicate places.
[2024-05-12 11:38:08,169 INFO  L495      AbstractCegarLoop]: Abstraction has has 127 places, 194 transitions, 2006 flow
[2024-05-12 11:38:08,169 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:38:08,169 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:38:08,169 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:38:08,169 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2024-05-12 11:38:08,169 INFO  L420      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:38:08,170 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:38:08,170 INFO  L85        PathProgramCache]: Analyzing trace with hash 1292748308, now seen corresponding path program 1 times
[2024-05-12 11:38:08,170 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:38:08,170 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810463080]
[2024-05-12 11:38:08,170 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:38:08,170 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:38:08,210 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:38:20,259 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 11:38:20,259 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:38:20,259 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810463080]
[2024-05-12 11:38:20,259 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810463080] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:38:20,259 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:38:20,259 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-05-12 11:38:20,259 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881415947]
[2024-05-12 11:38:20,259 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:38:20,260 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-05-12 11:38:20,260 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:38:20,260 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-05-12 11:38:20,260 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2024-05-12 11:38:20,335 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48
[2024-05-12 11:38:20,335 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 194 transitions, 2006 flow. Second operand  has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 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-05-12 11:38:20,335 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:38:20,335 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48
[2024-05-12 11:38:20,335 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:38:22,455 INFO  L124   PetriNetUnfolderBase]: 4766/7689 cut-off events.
[2024-05-12 11:38:22,455 INFO  L125   PetriNetUnfolderBase]: For 95777/95777 co-relation queries the response was YES.
[2024-05-12 11:38:22,480 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 40349 conditions, 7689 events. 4766/7689 cut-off events. For 95777/95777 co-relation queries the response was YES. Maximal size of possible extension queue 321. Compared 47780 event pairs, 1781 based on Foata normal form. 1/7456 useless extension candidates. Maximal degree in co-relation 40292. Up to 6782 conditions per place. 
[2024-05-12 11:38:22,510 INFO  L140   encePairwiseOnDemand]: 41/48 looper letters, 183 selfloop transitions, 20 changer transitions 0/211 dead transitions.
[2024-05-12 11:38:22,510 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 211 transitions, 2484 flow
[2024-05-12 11:38:22,511 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-05-12 11:38:22,511 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-05-12 11:38:22,511 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 113 transitions.
[2024-05-12 11:38:22,512 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4708333333333333
[2024-05-12 11:38:22,512 INFO  L175             Difference]: Start difference. First operand has 127 places, 194 transitions, 2006 flow. Second operand 5 states and 113 transitions.
[2024-05-12 11:38:22,512 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 211 transitions, 2484 flow
[2024-05-12 11:38:22,585 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 211 transitions, 2326 flow, removed 60 selfloop flow, removed 4 redundant places.
[2024-05-12 11:38:22,588 INFO  L231             Difference]: Finished difference. Result has 128 places, 197 transitions, 1948 flow
[2024-05-12 11:38:22,588 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1848, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1948, PETRI_PLACES=128, PETRI_TRANSITIONS=197}
[2024-05-12 11:38:22,588 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 74 predicate places.
[2024-05-12 11:38:22,589 INFO  L495      AbstractCegarLoop]: Abstraction has has 128 places, 197 transitions, 1948 flow
[2024-05-12 11:38:22,589 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 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-05-12 11:38:22,589 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:38:22,589 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:38:22,589 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2024-05-12 11:38:22,589 INFO  L420      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:38:22,590 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:38:22,590 INFO  L85        PathProgramCache]: Analyzing trace with hash 1463382155, now seen corresponding path program 1 times
[2024-05-12 11:38:22,590 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:38:22,590 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197747526]
[2024-05-12 11:38:22,590 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:38:22,590 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:38:22,650 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:38:30,279 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 11:38:30,280 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:38:30,280 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197747526]
[2024-05-12 11:38:30,280 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197747526] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:38:30,280 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:38:30,280 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-05-12 11:38:30,280 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130540068]
[2024-05-12 11:38:30,280 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:38:30,281 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-05-12 11:38:30,281 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:38:30,281 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-05-12 11:38:30,281 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72
[2024-05-12 11:38:30,453 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48
[2024-05-12 11:38:30,453 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 197 transitions, 1948 flow. Second operand  has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:38:30,453 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:38:30,453 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48
[2024-05-12 11:38:30,453 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:38:32,817 INFO  L124   PetriNetUnfolderBase]: 5160/8199 cut-off events.
[2024-05-12 11:38:32,817 INFO  L125   PetriNetUnfolderBase]: For 111711/111850 co-relation queries the response was YES.
[2024-05-12 11:38:32,847 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 43958 conditions, 8199 events. 5160/8199 cut-off events. For 111711/111850 co-relation queries the response was YES. Maximal size of possible extension queue 342. Compared 50703 event pairs, 1916 based on Foata normal form. 21/7918 useless extension candidates. Maximal degree in co-relation 43899. Up to 7098 conditions per place. 
[2024-05-12 11:38:32,878 INFO  L140   encePairwiseOnDemand]: 37/48 looper letters, 179 selfloop transitions, 31 changer transitions 0/237 dead transitions.
[2024-05-12 11:38:32,878 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 237 transitions, 2536 flow
[2024-05-12 11:38:32,879 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-05-12 11:38:32,879 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-05-12 11:38:32,879 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 167 transitions.
[2024-05-12 11:38:32,880 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.49702380952380953
[2024-05-12 11:38:32,880 INFO  L175             Difference]: Start difference. First operand has 128 places, 197 transitions, 1948 flow. Second operand 7 states and 167 transitions.
[2024-05-12 11:38:32,880 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 237 transitions, 2536 flow
[2024-05-12 11:38:32,981 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 237 transitions, 2416 flow, removed 46 selfloop flow, removed 3 redundant places.
[2024-05-12 11:38:32,984 INFO  L231             Difference]: Finished difference. Result has 132 places, 200 transitions, 1970 flow
[2024-05-12 11:38:32,984 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1852, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1970, PETRI_PLACES=132, PETRI_TRANSITIONS=200}
[2024-05-12 11:38:32,984 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 78 predicate places.
[2024-05-12 11:38:32,984 INFO  L495      AbstractCegarLoop]: Abstraction has has 132 places, 200 transitions, 1970 flow
[2024-05-12 11:38:32,985 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:38:32,985 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:38:32,985 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:38:32,986 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2024-05-12 11:38:32,986 INFO  L420      AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:38:33,000 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:38:33,000 INFO  L85        PathProgramCache]: Analyzing trace with hash 463004037, now seen corresponding path program 1 times
[2024-05-12 11:38:33,000 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:38:33,001 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429449796]
[2024-05-12 11:38:33,001 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:38:33,001 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:38:33,053 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:38:41,537 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 11:38:41,537 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:38:41,538 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429449796]
[2024-05-12 11:38:41,538 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429449796] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:38:41,538 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:38:41,538 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-05-12 11:38:41,538 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701915860]
[2024-05-12 11:38:41,538 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:38:41,539 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-05-12 11:38:41,540 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:38:41,540 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-05-12 11:38:41,540 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-05-12 11:38:41,678 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 48
[2024-05-12 11:38:41,679 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 200 transitions, 1970 flow. Second operand  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 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-05-12 11:38:41,679 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:38:41,679 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 48
[2024-05-12 11:38:41,679 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:38:44,331 INFO  L124   PetriNetUnfolderBase]: 5644/8826 cut-off events.
[2024-05-12 11:38:44,331 INFO  L125   PetriNetUnfolderBase]: For 121218/121218 co-relation queries the response was YES.
[2024-05-12 11:38:44,362 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 47367 conditions, 8826 events. 5644/8826 cut-off events. For 121218/121218 co-relation queries the response was YES. Maximal size of possible extension queue 338. Compared 53298 event pairs, 2038 based on Foata normal form. 6/8566 useless extension candidates. Maximal degree in co-relation 47307. Up to 7740 conditions per place. 
[2024-05-12 11:38:44,396 INFO  L140   encePairwiseOnDemand]: 33/48 looper letters, 217 selfloop transitions, 56 changer transitions 0/280 dead transitions.
[2024-05-12 11:38:44,396 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 280 transitions, 3086 flow
[2024-05-12 11:38:44,397 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-05-12 11:38:44,397 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-05-12 11:38:44,398 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 233 transitions.
[2024-05-12 11:38:44,398 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.48541666666666666
[2024-05-12 11:38:44,398 INFO  L175             Difference]: Start difference. First operand has 132 places, 200 transitions, 1970 flow. Second operand 10 states and 233 transitions.
[2024-05-12 11:38:44,398 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 280 transitions, 3086 flow
[2024-05-12 11:38:44,483 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 280 transitions, 3018 flow, removed 8 selfloop flow, removed 5 redundant places.
[2024-05-12 11:38:44,487 INFO  L231             Difference]: Finished difference. Result has 140 places, 220 transitions, 2384 flow
[2024-05-12 11:38:44,487 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1902, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2384, PETRI_PLACES=140, PETRI_TRANSITIONS=220}
[2024-05-12 11:38:44,488 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 86 predicate places.
[2024-05-12 11:38:44,488 INFO  L495      AbstractCegarLoop]: Abstraction has has 140 places, 220 transitions, 2384 flow
[2024-05-12 11:38:44,488 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 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-05-12 11:38:44,488 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:38:44,488 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:38:44,489 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2024-05-12 11:38:44,489 INFO  L420      AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:38:44,489 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:38:44,489 INFO  L85        PathProgramCache]: Analyzing trace with hash -322803259, now seen corresponding path program 2 times
[2024-05-12 11:38:44,489 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:38:44,489 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191343113]
[2024-05-12 11:38:44,489 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:38:44,490 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:38:44,528 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:38:52,045 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 11:38:52,045 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:38:52,045 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191343113]
[2024-05-12 11:38:52,046 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191343113] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:38:52,046 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:38:52,046 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-05-12 11:38:52,046 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574366942]
[2024-05-12 11:38:52,046 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:38:52,046 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-05-12 11:38:52,047 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:38:52,047 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-05-12 11:38:52,047 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-05-12 11:38:52,174 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 48
[2024-05-12 11:38:52,175 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 220 transitions, 2384 flow. Second operand  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 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-05-12 11:38:52,175 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:38:52,175 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 48
[2024-05-12 11:38:52,175 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:38:55,054 INFO  L124   PetriNetUnfolderBase]: 6144/9492 cut-off events.
[2024-05-12 11:38:55,055 INFO  L125   PetriNetUnfolderBase]: For 162882/162882 co-relation queries the response was YES.
[2024-05-12 11:38:55,098 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 56291 conditions, 9492 events. 6144/9492 cut-off events. For 162882/162882 co-relation queries the response was YES. Maximal size of possible extension queue 359. Compared 56990 event pairs, 1868 based on Foata normal form. 6/9237 useless extension candidates. Maximal degree in co-relation 56227. Up to 7771 conditions per place. 
[2024-05-12 11:38:55,140 INFO  L140   encePairwiseOnDemand]: 33/48 looper letters, 221 selfloop transitions, 69 changer transitions 0/297 dead transitions.
[2024-05-12 11:38:55,140 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 297 transitions, 3762 flow
[2024-05-12 11:38:55,141 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-05-12 11:38:55,141 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-05-12 11:38:55,142 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 211 transitions.
[2024-05-12 11:38:55,142 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.48842592592592593
[2024-05-12 11:38:55,142 INFO  L175             Difference]: Start difference. First operand has 140 places, 220 transitions, 2384 flow. Second operand 9 states and 211 transitions.
[2024-05-12 11:38:55,142 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 297 transitions, 3762 flow
[2024-05-12 11:38:55,331 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 297 transitions, 3567 flow, removed 85 selfloop flow, removed 4 redundant places.
[2024-05-12 11:38:55,337 INFO  L231             Difference]: Finished difference. Result has 147 places, 240 transitions, 2716 flow
[2024-05-12 11:38:55,337 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=2211, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2716, PETRI_PLACES=147, PETRI_TRANSITIONS=240}
[2024-05-12 11:38:55,338 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 93 predicate places.
[2024-05-12 11:38:55,338 INFO  L495      AbstractCegarLoop]: Abstraction has has 147 places, 240 transitions, 2716 flow
[2024-05-12 11:38:55,338 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 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-05-12 11:38:55,338 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:38:55,338 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:38:55,338 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2024-05-12 11:38:55,339 INFO  L420      AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:38:55,339 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:38:55,339 INFO  L85        PathProgramCache]: Analyzing trace with hash -322796501, now seen corresponding path program 1 times
[2024-05-12 11:38:55,339 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:38:55,339 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393657105]
[2024-05-12 11:38:55,339 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:38:55,340 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:38:55,397 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:39:03,111 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 11:39:03,111 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:39:03,111 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393657105]
[2024-05-12 11:39:03,111 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393657105] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:39:03,111 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:39:03,112 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-05-12 11:39:03,112 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257436126]
[2024-05-12 11:39:03,112 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:39:03,112 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-05-12 11:39:03,112 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:39:03,112 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-05-12 11:39:03,112 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-05-12 11:39:03,283 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 48
[2024-05-12 11:39:03,283 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 240 transitions, 2716 flow. Second operand  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 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-05-12 11:39:03,283 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:39:03,283 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 48
[2024-05-12 11:39:03,283 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:39:06,106 INFO  L124   PetriNetUnfolderBase]: 6169/9514 cut-off events.
[2024-05-12 11:39:06,107 INFO  L125   PetriNetUnfolderBase]: For 181610/181610 co-relation queries the response was YES.
[2024-05-12 11:39:06,147 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 59066 conditions, 9514 events. 6169/9514 cut-off events. For 181610/181610 co-relation queries the response was YES. Maximal size of possible extension queue 361. Compared 57059 event pairs, 2032 based on Foata normal form. 3/9260 useless extension candidates. Maximal degree in co-relation 58999. Up to 8578 conditions per place. 
[2024-05-12 11:39:06,187 INFO  L140   encePairwiseOnDemand]: 34/48 looper letters, 248 selfloop transitions, 40 changer transitions 0/295 dead transitions.
[2024-05-12 11:39:06,188 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 295 transitions, 3704 flow
[2024-05-12 11:39:06,188 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-05-12 11:39:06,188 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-05-12 11:39:06,189 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 186 transitions.
[2024-05-12 11:39:06,189 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.484375
[2024-05-12 11:39:06,189 INFO  L175             Difference]: Start difference. First operand has 147 places, 240 transitions, 2716 flow. Second operand 8 states and 186 transitions.
[2024-05-12 11:39:06,189 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 295 transitions, 3704 flow
[2024-05-12 11:39:06,392 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 295 transitions, 3527 flow, removed 67 selfloop flow, removed 4 redundant places.
[2024-05-12 11:39:06,396 INFO  L231             Difference]: Finished difference. Result has 151 places, 248 transitions, 2801 flow
[2024-05-12 11:39:06,396 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=2545, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2801, PETRI_PLACES=151, PETRI_TRANSITIONS=248}
[2024-05-12 11:39:06,396 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 97 predicate places.
[2024-05-12 11:39:06,396 INFO  L495      AbstractCegarLoop]: Abstraction has has 151 places, 248 transitions, 2801 flow
[2024-05-12 11:39:06,397 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 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-05-12 11:39:06,397 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:39:06,397 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:39:06,397 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2024-05-12 11:39:06,397 INFO  L420      AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:39:06,397 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:39:06,398 INFO  L85        PathProgramCache]: Analyzing trace with hash -322796749, now seen corresponding path program 3 times
[2024-05-12 11:39:06,398 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:39:06,398 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773402792]
[2024-05-12 11:39:06,398 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:39:06,398 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:39:06,448 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:39:13,166 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 11:39:13,167 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:39:13,167 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773402792]
[2024-05-12 11:39:13,167 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773402792] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:39:13,167 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:39:13,167 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-05-12 11:39:13,167 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119914396]
[2024-05-12 11:39:13,167 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:39:13,168 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-05-12 11:39:13,169 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:39:13,169 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-05-12 11:39:13,169 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-05-12 11:39:13,294 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 48
[2024-05-12 11:39:13,294 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 248 transitions, 2801 flow. Second operand  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 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-05-12 11:39:13,294 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:39:13,294 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 48
[2024-05-12 11:39:13,294 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:39:16,425 INFO  L124   PetriNetUnfolderBase]: 7275/11075 cut-off events.
[2024-05-12 11:39:16,425 INFO  L125   PetriNetUnfolderBase]: For 217620/217620 co-relation queries the response was YES.
[2024-05-12 11:39:16,474 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 70954 conditions, 11075 events. 7275/11075 cut-off events. For 217620/217620 co-relation queries the response was YES. Maximal size of possible extension queue 423. Compared 66293 event pairs, 2924 based on Foata normal form. 12/10828 useless extension candidates. Maximal degree in co-relation 70885. Up to 9261 conditions per place. 
[2024-05-12 11:39:16,521 INFO  L140   encePairwiseOnDemand]: 32/48 looper letters, 301 selfloop transitions, 91 changer transitions 0/399 dead transitions.
[2024-05-12 11:39:16,522 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 399 transitions, 5424 flow
[2024-05-12 11:39:16,523 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-05-12 11:39:16,523 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-05-12 11:39:16,523 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 220 transitions.
[2024-05-12 11:39:16,523 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4583333333333333
[2024-05-12 11:39:16,524 INFO  L175             Difference]: Start difference. First operand has 151 places, 248 transitions, 2801 flow. Second operand 10 states and 220 transitions.
[2024-05-12 11:39:16,524 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 399 transitions, 5424 flow
[2024-05-12 11:39:16,775 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 399 transitions, 5123 flow, removed 95 selfloop flow, removed 6 redundant places.
[2024-05-12 11:39:16,780 INFO  L231             Difference]: Finished difference. Result has 159 places, 323 transitions, 4090 flow
[2024-05-12 11:39:16,780 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=2618, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4090, PETRI_PLACES=159, PETRI_TRANSITIONS=323}
[2024-05-12 11:39:16,781 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 105 predicate places.
[2024-05-12 11:39:16,781 INFO  L495      AbstractCegarLoop]: Abstraction has has 159 places, 323 transitions, 4090 flow
[2024-05-12 11:39:16,781 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 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-05-12 11:39:16,781 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:39:16,781 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:39:16,781 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2024-05-12 11:39:16,782 INFO  L420      AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:39:16,782 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:39:16,782 INFO  L85        PathProgramCache]: Analyzing trace with hash 1603749503, now seen corresponding path program 4 times
[2024-05-12 11:39:16,782 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:39:16,782 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234504735]
[2024-05-12 11:39:16,782 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:39:16,782 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:39:16,826 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:39:24,501 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 11:39:24,501 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:39:24,501 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234504735]
[2024-05-12 11:39:24,501 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234504735] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:39:24,501 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:39:24,501 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-05-12 11:39:24,502 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090794857]
[2024-05-12 11:39:24,502 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:39:24,502 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-05-12 11:39:24,502 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:39:24,502 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-05-12 11:39:24,503 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-05-12 11:39:24,676 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 48
[2024-05-12 11:39:24,677 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 323 transitions, 4090 flow. Second operand  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 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-05-12 11:39:24,677 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:39:24,677 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 48
[2024-05-12 11:39:24,677 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:39:28,592 INFO  L124   PetriNetUnfolderBase]: 8848/13182 cut-off events.
[2024-05-12 11:39:28,592 INFO  L125   PetriNetUnfolderBase]: For 275716/275732 co-relation queries the response was YES.
[2024-05-12 11:39:28,649 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 90606 conditions, 13182 events. 8848/13182 cut-off events. For 275716/275732 co-relation queries the response was YES. Maximal size of possible extension queue 529. Compared 78183 event pairs, 2824 based on Foata normal form. 28/12952 useless extension candidates. Maximal degree in co-relation 90532. Up to 10533 conditions per place. 
[2024-05-12 11:39:28,712 INFO  L140   encePairwiseOnDemand]: 30/48 looper letters, 357 selfloop transitions, 170 changer transitions 0/534 dead transitions.
[2024-05-12 11:39:28,712 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 534 transitions, 8009 flow
[2024-05-12 11:39:28,713 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-05-12 11:39:28,713 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-05-12 11:39:28,713 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 242 transitions.
[2024-05-12 11:39:28,714 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5041666666666667
[2024-05-12 11:39:28,714 INFO  L175             Difference]: Start difference. First operand has 159 places, 323 transitions, 4090 flow. Second operand 10 states and 242 transitions.
[2024-05-12 11:39:28,714 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 534 transitions, 8009 flow
[2024-05-12 11:39:29,148 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 534 transitions, 7814 flow, removed 92 selfloop flow, removed 2 redundant places.
[2024-05-12 11:39:29,154 INFO  L231             Difference]: Finished difference. Result has 171 places, 447 transitions, 6767 flow
[2024-05-12 11:39:29,154 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=3987, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=323, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6767, PETRI_PLACES=171, PETRI_TRANSITIONS=447}
[2024-05-12 11:39:29,155 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 117 predicate places.
[2024-05-12 11:39:29,155 INFO  L495      AbstractCegarLoop]: Abstraction has has 171 places, 447 transitions, 6767 flow
[2024-05-12 11:39:29,155 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 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-05-12 11:39:29,155 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:39:29,155 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:39:29,156 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2024-05-12 11:39:29,156 INFO  L420      AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:39:29,156 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:39:29,156 INFO  L85        PathProgramCache]: Analyzing trace with hash 1691467631, now seen corresponding path program 5 times
[2024-05-12 11:39:29,156 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:39:29,156 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915046173]
[2024-05-12 11:39:29,156 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:39:29,157 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:39:29,193 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:39:36,777 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 11:39:36,777 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:39:36,777 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915046173]
[2024-05-12 11:39:36,777 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915046173] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:39:36,777 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:39:36,778 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-05-12 11:39:36,778 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041023344]
[2024-05-12 11:39:36,778 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:39:36,778 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-05-12 11:39:36,778 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:39:36,779 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-05-12 11:39:36,779 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-05-12 11:39:36,931 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 48
[2024-05-12 11:39:36,932 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 447 transitions, 6767 flow. Second operand  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 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-05-12 11:39:36,932 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:39:36,932 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 48
[2024-05-12 11:39:36,932 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:39:41,191 INFO  L124   PetriNetUnfolderBase]: 9232/13611 cut-off events.
[2024-05-12 11:39:41,192 INFO  L125   PetriNetUnfolderBase]: For 308194/308234 co-relation queries the response was YES.
[2024-05-12 11:39:41,281 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 99202 conditions, 13611 events. 9232/13611 cut-off events. For 308194/308234 co-relation queries the response was YES. Maximal size of possible extension queue 552. Compared 79434 event pairs, 2132 based on Foata normal form. 40/13418 useless extension candidates. Maximal degree in co-relation 99121. Up to 8824 conditions per place. 
[2024-05-12 11:39:41,352 INFO  L140   encePairwiseOnDemand]: 33/48 looper letters, 281 selfloop transitions, 260 changer transitions 0/548 dead transitions.
[2024-05-12 11:39:41,352 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 548 transitions, 9146 flow
[2024-05-12 11:39:41,353 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-05-12 11:39:41,353 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-05-12 11:39:41,353 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 229 transitions.
[2024-05-12 11:39:41,354 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5300925925925926
[2024-05-12 11:39:41,354 INFO  L175             Difference]: Start difference. First operand has 171 places, 447 transitions, 6767 flow. Second operand 9 states and 229 transitions.
[2024-05-12 11:39:41,354 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 548 transitions, 9146 flow
[2024-05-12 11:39:42,163 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 548 transitions, 9041 flow, removed 47 selfloop flow, removed 2 redundant places.
[2024-05-12 11:39:42,171 INFO  L231             Difference]: Finished difference. Result has 181 places, 474 transitions, 7908 flow
[2024-05-12 11:39:42,171 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=6662, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=447, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=237, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=7908, PETRI_PLACES=181, PETRI_TRANSITIONS=474}
[2024-05-12 11:39:42,172 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 127 predicate places.
[2024-05-12 11:39:42,172 INFO  L495      AbstractCegarLoop]: Abstraction has has 181 places, 474 transitions, 7908 flow
[2024-05-12 11:39:42,172 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 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-05-12 11:39:42,172 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:39:42,172 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:39:42,172 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2024-05-12 11:39:42,172 INFO  L420      AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:39:42,173 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:39:42,173 INFO  L85        PathProgramCache]: Analyzing trace with hash -966622213, now seen corresponding path program 2 times
[2024-05-12 11:39:42,173 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:39:42,173 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968335997]
[2024-05-12 11:39:42,173 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:39:42,173 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:39:42,213 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:39:52,080 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 11:39:52,080 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:39:52,081 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968335997]
[2024-05-12 11:39:52,081 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968335997] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:39:52,081 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:39:52,081 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-05-12 11:39:52,081 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413676198]
[2024-05-12 11:39:52,081 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:39:52,081 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-05-12 11:39:52,082 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:39:52,082 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-05-12 11:39:52,082 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-05-12 11:39:52,213 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 48
[2024-05-12 11:39:52,214 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 474 transitions, 7908 flow. Second operand  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 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-05-12 11:39:52,214 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:39:52,214 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 48
[2024-05-12 11:39:52,214 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:39:56,581 INFO  L124   PetriNetUnfolderBase]: 9236/13666 cut-off events.
[2024-05-12 11:39:56,582 INFO  L125   PetriNetUnfolderBase]: For 354193/354209 co-relation queries the response was YES.
[2024-05-12 11:39:56,679 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 106706 conditions, 13666 events. 9236/13666 cut-off events. For 354193/354209 co-relation queries the response was YES. Maximal size of possible extension queue 553. Compared 80563 event pairs, 2781 based on Foata normal form. 19/13448 useless extension candidates. Maximal degree in co-relation 106620. Up to 12358 conditions per place. 
[2024-05-12 11:39:56,753 INFO  L140   encePairwiseOnDemand]: 34/48 looper letters, 453 selfloop transitions, 89 changer transitions 0/549 dead transitions.
[2024-05-12 11:39:56,753 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 549 transitions, 9862 flow
[2024-05-12 11:39:56,754 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-05-12 11:39:56,754 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-05-12 11:39:56,754 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 212 transitions.
[2024-05-12 11:39:56,754 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.49074074074074076
[2024-05-12 11:39:56,754 INFO  L175             Difference]: Start difference. First operand has 181 places, 474 transitions, 7908 flow. Second operand 9 states and 212 transitions.
[2024-05-12 11:39:56,754 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 549 transitions, 9862 flow
[2024-05-12 11:39:57,540 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 549 transitions, 9615 flow, removed 111 selfloop flow, removed 2 redundant places.
[2024-05-12 11:39:57,548 INFO  L231             Difference]: Finished difference. Result has 188 places, 483 transitions, 8116 flow
[2024-05-12 11:39:57,548 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=7703, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=474, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=385, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8116, PETRI_PLACES=188, PETRI_TRANSITIONS=483}
[2024-05-12 11:39:57,549 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 134 predicate places.
[2024-05-12 11:39:57,549 INFO  L495      AbstractCegarLoop]: Abstraction has has 188 places, 483 transitions, 8116 flow
[2024-05-12 11:39:57,549 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 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-05-12 11:39:57,549 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:39:57,549 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:39:57,550 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2024-05-12 11:39:57,550 INFO  L420      AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:39:57,564 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:39:57,564 INFO  L85        PathProgramCache]: Analyzing trace with hash -966628971, now seen corresponding path program 6 times
[2024-05-12 11:39:57,564 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:39:57,564 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078724402]
[2024-05-12 11:39:57,565 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:39:57,565 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:39:57,635 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:40:06,239 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 11:40:06,239 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:40:06,239 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078724402]
[2024-05-12 11:40:06,239 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078724402] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:40:06,239 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:40:06,239 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-05-12 11:40:06,239 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767715360]
[2024-05-12 11:40:06,239 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:40:06,240 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-05-12 11:40:06,240 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:40:06,240 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-05-12 11:40:06,240 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-05-12 11:40:06,309 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 48
[2024-05-12 11:40:06,310 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 483 transitions, 8116 flow. Second operand  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 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-05-12 11:40:06,310 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:40:06,310 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 48
[2024-05-12 11:40:06,310 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:40:11,142 INFO  L124   PetriNetUnfolderBase]: 9312/13714 cut-off events.
[2024-05-12 11:40:11,142 INFO  L125   PetriNetUnfolderBase]: For 356647/356651 co-relation queries the response was YES.
[2024-05-12 11:40:11,218 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 107578 conditions, 13714 events. 9312/13714 cut-off events. For 356647/356651 co-relation queries the response was YES. Maximal size of possible extension queue 556. Compared 79967 event pairs, 2098 based on Foata normal form. 10/13493 useless extension candidates. Maximal degree in co-relation 107490. Up to 8897 conditions per place. 
[2024-05-12 11:40:11,289 INFO  L140   encePairwiseOnDemand]: 33/48 looper letters, 292 selfloop transitions, 268 changer transitions 0/567 dead transitions.
[2024-05-12 11:40:11,289 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 567 transitions, 10333 flow
[2024-05-12 11:40:11,290 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-05-12 11:40:11,290 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-05-12 11:40:11,290 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 226 transitions.
[2024-05-12 11:40:11,290 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5231481481481481
[2024-05-12 11:40:11,290 INFO  L175             Difference]: Start difference. First operand has 188 places, 483 transitions, 8116 flow. Second operand 9 states and 226 transitions.
[2024-05-12 11:40:11,291 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 567 transitions, 10333 flow
[2024-05-12 11:40:12,016 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 567 transitions, 9990 flow, removed 81 selfloop flow, removed 7 redundant places.
[2024-05-12 11:40:12,025 INFO  L231             Difference]: Finished difference. Result has 192 places, 497 transitions, 8660 flow
[2024-05-12 11:40:12,025 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=7786, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=483, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=254, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8660, PETRI_PLACES=192, PETRI_TRANSITIONS=497}
[2024-05-12 11:40:12,025 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 138 predicate places.
[2024-05-12 11:40:12,026 INFO  L495      AbstractCegarLoop]: Abstraction has has 192 places, 497 transitions, 8660 flow
[2024-05-12 11:40:12,026 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 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-05-12 11:40:12,026 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:40:12,026 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:40:12,026 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26
[2024-05-12 11:40:12,026 INFO  L420      AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:40:12,027 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:40:12,027 INFO  L85        PathProgramCache]: Analyzing trace with hash 1699741841, now seen corresponding path program 7 times
[2024-05-12 11:40:12,027 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:40:12,027 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822409710]
[2024-05-12 11:40:12,027 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:40:12,027 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:40:12,064 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:40:20,319 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 11:40:20,319 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:40:20,319 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822409710]
[2024-05-12 11:40:20,319 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822409710] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:40:20,319 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:40:20,320 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-05-12 11:40:20,320 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162778935]
[2024-05-12 11:40:20,320 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:40:20,320 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-05-12 11:40:20,320 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:40:20,321 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-05-12 11:40:20,321 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-05-12 11:40:20,450 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 48
[2024-05-12 11:40:20,450 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 497 transitions, 8660 flow. Second operand  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 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-05-12 11:40:20,451 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:40:20,451 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 48
[2024-05-12 11:40:20,451 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:40:25,021 INFO  L124   PetriNetUnfolderBase]: 9480/13952 cut-off events.
[2024-05-12 11:40:25,021 INFO  L125   PetriNetUnfolderBase]: For 397012/397052 co-relation queries the response was YES.
[2024-05-12 11:40:25,116 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 113813 conditions, 13952 events. 9480/13952 cut-off events. For 397012/397052 co-relation queries the response was YES. Maximal size of possible extension queue 574. Compared 81822 event pairs, 1872 based on Foata normal form. 40/13757 useless extension candidates. Maximal degree in co-relation 113722. Up to 9041 conditions per place. 
[2024-05-12 11:40:25,191 INFO  L140   encePairwiseOnDemand]: 33/48 looper letters, 233 selfloop transitions, 342 changer transitions 0/582 dead transitions.
[2024-05-12 11:40:25,191 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 582 transitions, 10991 flow
[2024-05-12 11:40:25,192 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-05-12 11:40:25,192 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-05-12 11:40:25,193 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 228 transitions.
[2024-05-12 11:40:25,193 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5277777777777778
[2024-05-12 11:40:25,193 INFO  L175             Difference]: Start difference. First operand has 192 places, 497 transitions, 8660 flow. Second operand 9 states and 228 transitions.
[2024-05-12 11:40:25,193 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 582 transitions, 10991 flow
[2024-05-12 11:40:26,130 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 582 transitions, 10356 flow, removed 74 selfloop flow, removed 5 redundant places.
[2024-05-12 11:40:26,139 INFO  L231             Difference]: Finished difference. Result has 198 places, 516 transitions, 9434 flow
[2024-05-12 11:40:26,139 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=8071, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=497, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=324, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=9434, PETRI_PLACES=198, PETRI_TRANSITIONS=516}
[2024-05-12 11:40:26,140 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 144 predicate places.
[2024-05-12 11:40:26,140 INFO  L495      AbstractCegarLoop]: Abstraction has has 198 places, 516 transitions, 9434 flow
[2024-05-12 11:40:26,140 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 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-05-12 11:40:26,140 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:40:26,140 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:40:26,140 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27
[2024-05-12 11:40:26,141 INFO  L420      AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:40:26,141 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:40:26,141 INFO  L85        PathProgramCache]: Analyzing trace with hash -958051333, now seen corresponding path program 3 times
[2024-05-12 11:40:26,141 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:40:26,141 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951807847]
[2024-05-12 11:40:26,141 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:40:26,141 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:40:26,182 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:40:35,380 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 11:40:35,380 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:40:35,380 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951807847]
[2024-05-12 11:40:35,380 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951807847] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:40:35,380 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:40:35,381 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-05-12 11:40:35,381 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367652934]
[2024-05-12 11:40:35,381 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:40:35,381 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-05-12 11:40:35,387 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:40:35,387 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-05-12 11:40:35,387 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-05-12 11:40:35,534 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 48
[2024-05-12 11:40:35,534 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 516 transitions, 9434 flow. Second operand  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 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-05-12 11:40:35,534 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:40:35,534 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 48
[2024-05-12 11:40:35,534 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:40:40,870 INFO  L124   PetriNetUnfolderBase]: 9544/14078 cut-off events.
[2024-05-12 11:40:40,871 INFO  L125   PetriNetUnfolderBase]: For 421873/421889 co-relation queries the response was YES.
[2024-05-12 11:40:40,977 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 117118 conditions, 14078 events. 9544/14078 cut-off events. For 421873/421889 co-relation queries the response was YES. Maximal size of possible extension queue 578. Compared 83013 event pairs, 2756 based on Foata normal form. 19/13862 useless extension candidates. Maximal degree in co-relation 117024. Up to 12603 conditions per place. 
[2024-05-12 11:40:41,068 INFO  L140   encePairwiseOnDemand]: 34/48 looper letters, 444 selfloop transitions, 151 changer transitions 0/602 dead transitions.
[2024-05-12 11:40:41,069 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 602 transitions, 11921 flow
[2024-05-12 11:40:41,069 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-05-12 11:40:41,069 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-05-12 11:40:41,070 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 214 transitions.
[2024-05-12 11:40:41,070 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.49537037037037035
[2024-05-12 11:40:41,070 INFO  L175             Difference]: Start difference. First operand has 198 places, 516 transitions, 9434 flow. Second operand 9 states and 214 transitions.
[2024-05-12 11:40:41,070 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 602 transitions, 11921 flow
[2024-05-12 11:40:42,180 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 602 transitions, 11639 flow, removed 95 selfloop flow, removed 3 redundant places.
[2024-05-12 11:40:42,219 INFO  L231             Difference]: Finished difference. Result has 205 places, 534 transitions, 10072 flow
[2024-05-12 11:40:42,219 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=9212, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=516, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=141, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=374, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=10072, PETRI_PLACES=205, PETRI_TRANSITIONS=534}
[2024-05-12 11:40:42,221 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 151 predicate places.
[2024-05-12 11:40:42,222 INFO  L495      AbstractCegarLoop]: Abstraction has has 205 places, 534 transitions, 10072 flow
[2024-05-12 11:40:42,222 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 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-05-12 11:40:42,222 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:40:42,222 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:40:42,222 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28
[2024-05-12 11:40:42,222 INFO  L420      AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:40:42,223 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:40:42,223 INFO  L85        PathProgramCache]: Analyzing trace with hash 1699742089, now seen corresponding path program 4 times
[2024-05-12 11:40:42,223 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:40:42,223 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387541155]
[2024-05-12 11:40:42,223 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:40:42,223 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:40:42,270 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:40:51,553 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 11:40:51,553 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:40:51,553 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387541155]
[2024-05-12 11:40:51,554 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387541155] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:40:51,554 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:40:51,554 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-05-12 11:40:51,554 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101926314]
[2024-05-12 11:40:51,554 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:40:51,554 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-05-12 11:40:51,555 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:40:51,555 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-05-12 11:40:51,555 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-05-12 11:40:51,672 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 48
[2024-05-12 11:40:51,672 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 534 transitions, 10072 flow. Second operand  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 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-05-12 11:40:51,672 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:40:51,672 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 48
[2024-05-12 11:40:51,673 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:40:56,464 INFO  L124   PetriNetUnfolderBase]: 9532/14072 cut-off events.
[2024-05-12 11:40:56,464 INFO  L125   PetriNetUnfolderBase]: For 418948/418964 co-relation queries the response was YES.
[2024-05-12 11:40:56,560 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 117643 conditions, 14072 events. 9532/14072 cut-off events. For 418948/418964 co-relation queries the response was YES. Maximal size of possible extension queue 577. Compared 83073 event pairs, 2758 based on Foata normal form. 19/13852 useless extension candidates. Maximal degree in co-relation 117546. Up to 12758 conditions per place. 
[2024-05-12 11:40:56,637 INFO  L140   encePairwiseOnDemand]: 34/48 looper letters, 486 selfloop transitions, 107 changer transitions 0/600 dead transitions.
[2024-05-12 11:40:56,638 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 600 transitions, 11921 flow
[2024-05-12 11:40:56,638 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-05-12 11:40:56,638 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-05-12 11:40:56,639 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 211 transitions.
[2024-05-12 11:40:56,639 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.48842592592592593
[2024-05-12 11:40:56,639 INFO  L175             Difference]: Start difference. First operand has 205 places, 534 transitions, 10072 flow. Second operand 9 states and 211 transitions.
[2024-05-12 11:40:56,639 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 600 transitions, 11921 flow
[2024-05-12 11:40:57,774 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 600 transitions, 11471 flow, removed 158 selfloop flow, removed 5 redundant places.
[2024-05-12 11:40:57,782 INFO  L231             Difference]: Finished difference. Result has 209 places, 534 transitions, 9852 flow
[2024-05-12 11:40:57,783 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=9624, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=534, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=107, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=427, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=9852, PETRI_PLACES=209, PETRI_TRANSITIONS=534}
[2024-05-12 11:40:57,783 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 155 predicate places.
[2024-05-12 11:40:57,783 INFO  L495      AbstractCegarLoop]: Abstraction has has 209 places, 534 transitions, 9852 flow
[2024-05-12 11:40:57,784 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 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-05-12 11:40:57,784 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:40:57,784 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:40:57,784 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29
[2024-05-12 11:40:57,784 INFO  L420      AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:40:57,784 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:40:57,785 INFO  L85        PathProgramCache]: Analyzing trace with hash 1420493783, now seen corresponding path program 1 times
[2024-05-12 11:40:57,785 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:40:57,785 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282167822]
[2024-05-12 11:40:57,785 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:40:57,785 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:40:57,990 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:41:11,295 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 11:41:11,296 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:41:11,296 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282167822]
[2024-05-12 11:41:11,296 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282167822] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:41:11,296 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:41:11,296 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-05-12 11:41:11,296 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733418525]
[2024-05-12 11:41:11,296 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:41:11,296 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-05-12 11:41:11,296 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:41:11,297 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-05-12 11:41:11,297 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56
[2024-05-12 11:41:11,386 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48
[2024-05-12 11:41:11,386 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 534 transitions, 9852 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-05-12 11:41:11,386 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:41:11,386 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48
[2024-05-12 11:41:11,386 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:41:15,663 INFO  L124   PetriNetUnfolderBase]: 8794/13272 cut-off events.
[2024-05-12 11:41:15,663 INFO  L125   PetriNetUnfolderBase]: For 386174/386174 co-relation queries the response was YES.
[2024-05-12 11:41:15,747 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 110978 conditions, 13272 events. 8794/13272 cut-off events. For 386174/386174 co-relation queries the response was YES. Maximal size of possible extension queue 567. Compared 80166 event pairs, 3036 based on Foata normal form. 2/13033 useless extension candidates. Maximal degree in co-relation 110879. Up to 12213 conditions per place. 
[2024-05-12 11:41:15,818 INFO  L140   encePairwiseOnDemand]: 40/48 looper letters, 525 selfloop transitions, 24 changer transitions 0/557 dead transitions.
[2024-05-12 11:41:15,818 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 557 transitions, 11066 flow
[2024-05-12 11:41:15,818 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-05-12 11:41:15,819 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-05-12 11:41:15,819 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 134 transitions.
[2024-05-12 11:41:15,819 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4652777777777778
[2024-05-12 11:41:15,819 INFO  L175             Difference]: Start difference. First operand has 209 places, 534 transitions, 9852 flow. Second operand 6 states and 134 transitions.
[2024-05-12 11:41:15,819 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 557 transitions, 11066 flow
[2024-05-12 11:41:16,703 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 557 transitions, 10751 flow, removed 30 selfloop flow, removed 8 redundant places.
[2024-05-12 11:41:16,711 INFO  L231             Difference]: Finished difference. Result has 207 places, 537 transitions, 9637 flow
[2024-05-12 11:41:16,712 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=9537, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=534, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=510, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=9637, PETRI_PLACES=207, PETRI_TRANSITIONS=537}
[2024-05-12 11:41:16,712 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 153 predicate places.
[2024-05-12 11:41:16,712 INFO  L495      AbstractCegarLoop]: Abstraction has has 207 places, 537 transitions, 9637 flow
[2024-05-12 11:41:16,712 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-05-12 11:41:16,712 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:41:16,713 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:41:16,713 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30
[2024-05-12 11:41:16,713 INFO  L420      AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:41:16,713 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:41:16,713 INFO  L85        PathProgramCache]: Analyzing trace with hash 1589467461, now seen corresponding path program 1 times
[2024-05-12 11:41:16,713 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:41:16,713 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553679439]
[2024-05-12 11:41:16,714 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:41:16,714 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:41:16,755 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat