./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix033_tso.oepc.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --validate ./goblint.2024-05-21_14-57-05.files/mutex-meet/mix033_tso.oepc.yml/witness.yml --architecture 32bit


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


Checking for ERROR reachability
Using default analysis
Version bcb38a6f
Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix033_tso.oepc.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/mix033_tso.oepc.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false
--- Real Ultimate output ---
This is Ultimate 0.2.4-tmp.fs.goblint-validation-bcb38a6-m
[2024-06-03 21:46:46,522 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-06-03 21:46:46,590 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-06-03 21:46:46,605 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-06-03 21:46:46,606 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-06-03 21:46:46,625 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-06-03 21:46:46,627 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-06-03 21:46:46,627 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-06-03 21:46:46,628 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-06-03 21:46:46,631 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-06-03 21:46:46,631 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-06-03 21:46:46,632 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-06-03 21:46:46,632 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-06-03 21:46:46,633 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-06-03 21:46:46,633 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-06-03 21:46:46,633 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-06-03 21:46:46,634 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-06-03 21:46:46,634 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-06-03 21:46:46,634 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-06-03 21:46:46,634 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-06-03 21:46:46,635 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-06-03 21:46:46,636 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-06-03 21:46:46,636 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-06-03 21:46:46,636 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-06-03 21:46:46,636 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-06-03 21:46:46,636 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-06-03 21:46:46,637 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-06-03 21:46:46,637 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-06-03 21:46:46,637 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-06-03 21:46:46,637 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-06-03 21:46:46,638 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-06-03 21:46:46,638 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-06-03 21:46:46,639 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-06-03 21:46:46,639 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-06-03 21:46:46,639 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-06-03 21:46:46,639 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-06-03 21:46:46,639 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-06-03 21:46:46,639 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-06-03 21:46:46,640 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-06-03 21:46:46,640 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-06-03 21:46:46,640 INFO  L153        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-06-03 21:46:46,640 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-06-03 21:46:46,640 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-06-03 21:46:46,641 INFO  L153        SettingsManager]:  * Looper check in Petri net analysis=SEMANTIC
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false
[2024-06-03 21:46:46,843 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-06-03 21:46:46,861 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-06-03 21:46:46,862 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-06-03 21:46:46,863 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-06-03 21:46:46,865 INFO  L274        PluginConnector]: CDTParser initialized
[2024-06-03 21:46:46,866 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix033_tso.oepc.i
[2024-06-03 21:46:47,939 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-06-03 21:46:48,123 INFO  L384              CDTParser]: Found 1 translation units.
[2024-06-03 21:46:48,124 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix033_tso.oepc.i
[2024-06-03 21:46:48,144 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec85740ab/f910fddea5064e85b53afb297e2ecedb/FLAGc7dfa7533
[2024-06-03 21:46:48,157 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec85740ab/f910fddea5064e85b53afb297e2ecedb
[2024-06-03 21:46:48,159 INFO  L270        PluginConnector]: Initializing Witness Parser...
[2024-06-03 21:46:48,159 INFO  L274        PluginConnector]: Witness Parser initialized
[2024-06-03 21:46:48,160 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-05-21_14-57-05.files/mutex-meet/mix033_tso.oepc.yml/witness.yml
[2024-06-03 21:46:48,382 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-06-03 21:46:48,384 INFO  L133        ToolchainWalker]: Walking toolchain with 5 elements.
[2024-06-03 21:46:48,386 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-06-03 21:46:48,386 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-06-03 21:46:48,390 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-06-03 21:46:48,391 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.06 09:46:48" (1/2) ...
[2024-06-03 21:46:48,392 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5acb57cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 09:46:48, skipping insertion in model container
[2024-06-03 21:46:48,393 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.06 09:46:48" (1/2) ...
[2024-06-03 21:46:48,394 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@6e7b24f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 09:46:48, skipping insertion in model container
[2024-06-03 21:46:48,395 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 09:46:48" (2/2) ...
[2024-06-03 21:46:48,395 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5acb57cd and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 09:46:48, skipping insertion in model container
[2024-06-03 21:46:48,395 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 09:46:48" (2/2) ...
[2024-06-03 21:46:48,395 INFO  L83    nessWitnessExtractor]: Extracting all invariants from correctness witness
[2024-06-03 21:46:48,481 INFO  L95    edCorrectnessWitness]: Found the following entries in the witness:
[2024-06-03 21:46:48,482 INFO  L97    edCorrectnessWitness]: Location invariant before [L845-L845] ((((((((((((((((((((((! multithreaded || x$r_buff0_thd3 == (_Bool)0) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || ((0 <= b && b <= 1) && (b == 0 || b == 1)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p2_EBX) + (long long )b >= 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 )a >= 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 )z >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )b) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )b) + (long long )x >= 0LL) && (1LL - (long long )b) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )b) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )b) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )b) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )b) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )b) + (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )b) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )b) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )b) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )b) + (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )b) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )b) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )b) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )b) + (long long )y >= 0LL) && (1LL - (long long )b) + (long long )z >= 0LL) && (1LL - (long long )b) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )b) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EBX >= 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 )a >= 0LL) && (long long )__unbuffered_cnt + (long long )b >= 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_p1_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b >= 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 )a >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b >= 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 )a + (long long )b >= 0LL) && (long long )a + (long long )main$tmp_guard1 >= 0LL) && (long long )a + (long long )x >= 0LL) && (long long )a + (long long )x$flush_delayed >= 0LL) && (long long )a + (long long )x$mem_tmp >= 0LL) && (long long )a + (long long )x$r_buff0_thd0 >= 0LL) && (long long )a + (long long )x$r_buff0_thd1 >= 0LL) && (long long )a + (long long )x$r_buff0_thd2 >= 0LL) && (long long )a + (long long )x$r_buff0_thd3 >= 0LL) && (long long )a + (long long )x$r_buff1_thd0 >= 0LL) && (long long )a + (long long )x$r_buff1_thd1 >= 0LL) && (long long )a + (long long )x$r_buff1_thd2 >= 0LL) && (long long )a + (long long )x$r_buff1_thd3 >= 0LL) && (long long )a + (long long )x$read_delayed >= 0LL) && (long long )a + (long long )x$w_buff0 >= 0LL) && (long long )a + (long long )x$w_buff1 >= 0LL) && (long long )a + (long long )y >= 0LL) && (long long )a + (long long )z >= 0LL) && (long long )a + (long long )weak$$choice0 >= 0LL) && (long long )a + (long long )weak$$choice2 >= 0LL) && (long long )b + (long long )main$tmp_guard1 >= 0LL) && (long long )b + (long long )x >= 0LL) && (long long )b + (long long )x$flush_delayed >= 0LL) && (long long )b + (long long )x$mem_tmp >= 0LL) && (long long )b + (long long )x$r_buff0_thd0 >= 0LL) && (long long )b + (long long )x$r_buff0_thd1 >= 0LL) && (long long )b + (long long )x$r_buff0_thd2 >= 0LL) && (long long )b + (long long )x$r_buff0_thd3 >= 0LL) && (long long )b + (long long )x$r_buff1_thd0 >= 0LL) && (long long )b + (long long )x$r_buff1_thd1 >= 0LL) && (long long )b + (long long )x$r_buff1_thd2 >= 0LL) && (long long )b + (long long )x$r_buff1_thd3 >= 0LL) && (long long )b + (long long )x$read_delayed >= 0LL) && (long long )b + (long long )x$w_buff0 >= 0LL) && (long long )b + (long long )x$w_buff1 >= 0LL) && (long long )b + (long long )y >= 0LL) && (long long )b + (long long )z >= 0LL) && (long long )b + (long long )weak$$choice0 >= 0LL) && (long long )b + (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 )b >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )b >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )b >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )b >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )b >= 0LL) && (1LL + (long long )a) - (long long )b >= 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 )b) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )b) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )b) - (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )b) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )b) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )b) - (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )b) - (long long )x$read_delayed >= 0LL) && (2LL - (long long )__unbuffered_p2_EBX) - (long long )b >= 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_p1_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX - (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 )a - (long long )x$r_buff0_thd0 >= 0LL) && (long long )a - (long long )x$r_buff0_thd1 >= 0LL) && (long long )a - (long long )x$r_buff0_thd3 >= 0LL) && (long long )a - (long long )x$r_buff1_thd0 >= 0LL) && (long long )a - (long long )x$r_buff1_thd1 >= 0LL) && (long long )a - (long long )x$r_buff1_thd3 >= 0LL) && (long long )a - (long long )x$read_delayed >= 0LL) && (long long )b - (long long )x$r_buff0_thd0 >= 0LL) && (long long )b - (long long )x$r_buff0_thd1 >= 0LL) && (long long )b - (long long )x$r_buff0_thd3 >= 0LL) && (long long )b - (long long )x$r_buff1_thd0 >= 0LL) && (long long )b - (long long )x$r_buff1_thd1 >= 0LL) && (long long )b - (long long )x$r_buff1_thd3 >= 0LL) && (long long )b - (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 || (((((((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= a) && 0 <= b) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && 0 <= z) && __unbuffered_p1_EAX <= 1) && __unbuffered_p1_EBX <= 1) && __unbuffered_p2_EAX <= 1) && __unbuffered_p2_EBX <= 1) && a <= 1) && b <= 1) && x$w_buff0 <= 127) && x$w_buff1 <= 127) && y <= 1) && 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_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (a == 0 || a == 1)) && (b == 0 || b == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 2)) && (x$w_buff1 == 0 || x$w_buff1 == 2)) && (y == 0 || y == 1)) && (z == 0 || z == 1)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || (((0 <= x$w_buff1 && x$w_buff1 <= 127) && x$w_buff1 % 2 == 0) && (x$w_buff1 == 0 || x$w_buff1 == 2)))) && (! multithreaded || ((0 <= a && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || (0 <= x$mem_tmp && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || (0 <= x && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || (((0 <= x$w_buff0 && x$w_buff0 <= 127) && x$w_buff0 % 2 == 0) && (x$w_buff0 == 0 || x$w_buff0 == 2)))) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)
[2024-06-03 21:46:48,483 INFO  L97    edCorrectnessWitness]: Location invariant before [L846-L846] ((((((((((((((((((((((! multithreaded || x$r_buff0_thd3 == (_Bool)0) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || ((0 <= b && b <= 1) && (b == 0 || b == 1)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p2_EBX) + (long long )b >= 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 )a >= 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 )z >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )b) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )b) + (long long )x >= 0LL) && (1LL - (long long )b) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )b) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )b) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )b) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )b) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )b) + (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )b) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )b) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )b) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )b) + (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )b) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )b) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )b) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )b) + (long long )y >= 0LL) && (1LL - (long long )b) + (long long )z >= 0LL) && (1LL - (long long )b) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )b) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EBX >= 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 )a >= 0LL) && (long long )__unbuffered_cnt + (long long )b >= 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_p1_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b >= 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 )a >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b >= 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 )a + (long long )b >= 0LL) && (long long )a + (long long )main$tmp_guard1 >= 0LL) && (long long )a + (long long )x >= 0LL) && (long long )a + (long long )x$flush_delayed >= 0LL) && (long long )a + (long long )x$mem_tmp >= 0LL) && (long long )a + (long long )x$r_buff0_thd0 >= 0LL) && (long long )a + (long long )x$r_buff0_thd1 >= 0LL) && (long long )a + (long long )x$r_buff0_thd2 >= 0LL) && (long long )a + (long long )x$r_buff0_thd3 >= 0LL) && (long long )a + (long long )x$r_buff1_thd0 >= 0LL) && (long long )a + (long long )x$r_buff1_thd1 >= 0LL) && (long long )a + (long long )x$r_buff1_thd2 >= 0LL) && (long long )a + (long long )x$r_buff1_thd3 >= 0LL) && (long long )a + (long long )x$read_delayed >= 0LL) && (long long )a + (long long )x$w_buff0 >= 0LL) && (long long )a + (long long )x$w_buff1 >= 0LL) && (long long )a + (long long )y >= 0LL) && (long long )a + (long long )z >= 0LL) && (long long )a + (long long )weak$$choice0 >= 0LL) && (long long )a + (long long )weak$$choice2 >= 0LL) && (long long )b + (long long )main$tmp_guard1 >= 0LL) && (long long )b + (long long )x >= 0LL) && (long long )b + (long long )x$flush_delayed >= 0LL) && (long long )b + (long long )x$mem_tmp >= 0LL) && (long long )b + (long long )x$r_buff0_thd0 >= 0LL) && (long long )b + (long long )x$r_buff0_thd1 >= 0LL) && (long long )b + (long long )x$r_buff0_thd2 >= 0LL) && (long long )b + (long long )x$r_buff0_thd3 >= 0LL) && (long long )b + (long long )x$r_buff1_thd0 >= 0LL) && (long long )b + (long long )x$r_buff1_thd1 >= 0LL) && (long long )b + (long long )x$r_buff1_thd2 >= 0LL) && (long long )b + (long long )x$r_buff1_thd3 >= 0LL) && (long long )b + (long long )x$read_delayed >= 0LL) && (long long )b + (long long )x$w_buff0 >= 0LL) && (long long )b + (long long )x$w_buff1 >= 0LL) && (long long )b + (long long )y >= 0LL) && (long long )b + (long long )z >= 0LL) && (long long )b + (long long )weak$$choice0 >= 0LL) && (long long )b + (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 )b >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )b >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )b >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )b >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )b >= 0LL) && (1LL + (long long )a) - (long long )b >= 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 )b) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )b) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )b) - (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )b) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )b) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )b) - (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )b) - (long long )x$read_delayed >= 0LL) && (2LL - (long long )__unbuffered_p2_EBX) - (long long )b >= 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_p1_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX - (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 )a - (long long )x$r_buff0_thd0 >= 0LL) && (long long )a - (long long )x$r_buff0_thd1 >= 0LL) && (long long )a - (long long )x$r_buff0_thd3 >= 0LL) && (long long )a - (long long )x$r_buff1_thd0 >= 0LL) && (long long )a - (long long )x$r_buff1_thd1 >= 0LL) && (long long )a - (long long )x$r_buff1_thd3 >= 0LL) && (long long )a - (long long )x$read_delayed >= 0LL) && (long long )b - (long long )x$r_buff0_thd0 >= 0LL) && (long long )b - (long long )x$r_buff0_thd1 >= 0LL) && (long long )b - (long long )x$r_buff0_thd3 >= 0LL) && (long long )b - (long long )x$r_buff1_thd0 >= 0LL) && (long long )b - (long long )x$r_buff1_thd1 >= 0LL) && (long long )b - (long long )x$r_buff1_thd3 >= 0LL) && (long long )b - (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 || (((((((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= a) && 0 <= b) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && 0 <= z) && __unbuffered_p1_EAX <= 1) && __unbuffered_p1_EBX <= 1) && __unbuffered_p2_EAX <= 1) && __unbuffered_p2_EBX <= 1) && a <= 1) && b <= 1) && x$w_buff0 <= 127) && x$w_buff1 <= 127) && y <= 1) && 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_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (a == 0 || a == 1)) && (b == 0 || b == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 2)) && (x$w_buff1 == 0 || x$w_buff1 == 2)) && (y == 0 || y == 1)) && (z == 0 || z == 1)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || (((0 <= x$w_buff1 && x$w_buff1 <= 127) && x$w_buff1 % 2 == 0) && (x$w_buff1 == 0 || x$w_buff1 == 2)))) && (! multithreaded || ((0 <= a && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || (0 <= x$mem_tmp && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || (0 <= x && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || (((0 <= x$w_buff0 && x$w_buff0 <= 127) && x$w_buff0 % 2 == 0) && (x$w_buff0 == 0 || x$w_buff0 == 2)))) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)
[2024-06-03 21:46:48,484 INFO  L97    edCorrectnessWitness]: Location invariant before [L843-L843] ((((((((((((((((((((((! multithreaded || x$r_buff0_thd3 == (_Bool)0) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || ((0 <= b && b <= 1) && (b == 0 || b == 1)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p2_EBX) + (long long )b >= 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 )a >= 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 )z >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )b) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )b) + (long long )x >= 0LL) && (1LL - (long long )b) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )b) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )b) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )b) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )b) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )b) + (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )b) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )b) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )b) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )b) + (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )b) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )b) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )b) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )b) + (long long )y >= 0LL) && (1LL - (long long )b) + (long long )z >= 0LL) && (1LL - (long long )b) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )b) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EBX >= 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 )a >= 0LL) && (long long )__unbuffered_cnt + (long long )b >= 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_p1_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b >= 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 )a >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b >= 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 )a + (long long )b >= 0LL) && (long long )a + (long long )main$tmp_guard1 >= 0LL) && (long long )a + (long long )x >= 0LL) && (long long )a + (long long )x$flush_delayed >= 0LL) && (long long )a + (long long )x$mem_tmp >= 0LL) && (long long )a + (long long )x$r_buff0_thd0 >= 0LL) && (long long )a + (long long )x$r_buff0_thd1 >= 0LL) && (long long )a + (long long )x$r_buff0_thd2 >= 0LL) && (long long )a + (long long )x$r_buff0_thd3 >= 0LL) && (long long )a + (long long )x$r_buff1_thd0 >= 0LL) && (long long )a + (long long )x$r_buff1_thd1 >= 0LL) && (long long )a + (long long )x$r_buff1_thd2 >= 0LL) && (long long )a + (long long )x$r_buff1_thd3 >= 0LL) && (long long )a + (long long )x$read_delayed >= 0LL) && (long long )a + (long long )x$w_buff0 >= 0LL) && (long long )a + (long long )x$w_buff1 >= 0LL) && (long long )a + (long long )y >= 0LL) && (long long )a + (long long )z >= 0LL) && (long long )a + (long long )weak$$choice0 >= 0LL) && (long long )a + (long long )weak$$choice2 >= 0LL) && (long long )b + (long long )main$tmp_guard1 >= 0LL) && (long long )b + (long long )x >= 0LL) && (long long )b + (long long )x$flush_delayed >= 0LL) && (long long )b + (long long )x$mem_tmp >= 0LL) && (long long )b + (long long )x$r_buff0_thd0 >= 0LL) && (long long )b + (long long )x$r_buff0_thd1 >= 0LL) && (long long )b + (long long )x$r_buff0_thd2 >= 0LL) && (long long )b + (long long )x$r_buff0_thd3 >= 0LL) && (long long )b + (long long )x$r_buff1_thd0 >= 0LL) && (long long )b + (long long )x$r_buff1_thd1 >= 0LL) && (long long )b + (long long )x$r_buff1_thd2 >= 0LL) && (long long )b + (long long )x$r_buff1_thd3 >= 0LL) && (long long )b + (long long )x$read_delayed >= 0LL) && (long long )b + (long long )x$w_buff0 >= 0LL) && (long long )b + (long long )x$w_buff1 >= 0LL) && (long long )b + (long long )y >= 0LL) && (long long )b + (long long )z >= 0LL) && (long long )b + (long long )weak$$choice0 >= 0LL) && (long long )b + (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 )b >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )b >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )b >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )b >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )b >= 0LL) && (1LL + (long long )a) - (long long )b >= 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 )b) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )b) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )b) - (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )b) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )b) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )b) - (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )b) - (long long )x$read_delayed >= 0LL) && (2LL - (long long )__unbuffered_p2_EBX) - (long long )b >= 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_p1_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX - (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 )a - (long long )x$r_buff0_thd0 >= 0LL) && (long long )a - (long long )x$r_buff0_thd1 >= 0LL) && (long long )a - (long long )x$r_buff0_thd3 >= 0LL) && (long long )a - (long long )x$r_buff1_thd0 >= 0LL) && (long long )a - (long long )x$r_buff1_thd1 >= 0LL) && (long long )a - (long long )x$r_buff1_thd3 >= 0LL) && (long long )a - (long long )x$read_delayed >= 0LL) && (long long )b - (long long )x$r_buff0_thd0 >= 0LL) && (long long )b - (long long )x$r_buff0_thd1 >= 0LL) && (long long )b - (long long )x$r_buff0_thd3 >= 0LL) && (long long )b - (long long )x$r_buff1_thd0 >= 0LL) && (long long )b - (long long )x$r_buff1_thd1 >= 0LL) && (long long )b - (long long )x$r_buff1_thd3 >= 0LL) && (long long )b - (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 || (((((((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= a) && 0 <= b) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && 0 <= z) && __unbuffered_p1_EAX <= 1) && __unbuffered_p1_EBX <= 1) && __unbuffered_p2_EAX <= 1) && __unbuffered_p2_EBX <= 1) && a <= 1) && b <= 1) && x$w_buff0 <= 127) && x$w_buff1 <= 127) && y <= 1) && 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_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (a == 0 || a == 1)) && (b == 0 || b == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 2)) && (x$w_buff1 == 0 || x$w_buff1 == 2)) && (y == 0 || y == 1)) && (z == 0 || z == 1)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || (((0 <= x$w_buff1 && x$w_buff1 <= 127) && x$w_buff1 % 2 == 0) && (x$w_buff1 == 0 || x$w_buff1 == 2)))) && (! multithreaded || ((0 <= a && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || (0 <= x$mem_tmp && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || (0 <= x && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || (((0 <= x$w_buff0 && x$w_buff0 <= 127) && x$w_buff0 % 2 == 0) && (x$w_buff0 == 0 || x$w_buff0 == 2)))) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)
[2024-06-03 21:46:48,484 INFO  L103   edCorrectnessWitness]: ghost_variable multithreaded = 0
[2024-06-03 21:46:48,485 INFO  L106   edCorrectnessWitness]: ghost_update [L841-L841] multithreaded = 1;
[2024-06-03 21:46:48,532 INFO  L177         MainTranslator]: Built tables and reachable declarations
[2024-06-03 21:46:48,855 INFO  L207          PostProcessor]: Analyzing one entry point: main
[2024-06-03 21:46:48,863 INFO  L202         MainTranslator]: Completed pre-run
Start Parsing Local
Start Parsing Local
Start Parsing Local
Start Parsing Local
Start Parsing Local
[2024-06-03 21:46:49,132 INFO  L207          PostProcessor]: Analyzing one entry point: main
[2024-06-03 21:46:49,165 INFO  L206         MainTranslator]: Completed translation
[2024-06-03 21:46:49,166 INFO  L201        PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 09:46:49 WrapperNode
[2024-06-03 21:46:49,166 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-06-03 21:46:49,167 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-06-03 21:46:49,167 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-06-03 21:46:49,167 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-06-03 21:46:49,173 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 09:46:49" (1/1) ...
[2024-06-03 21:46:49,211 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 09:46:49" (1/1) ...
[2024-06-03 21:46:49,354 INFO  L138                Inliner]: procedures = 175, calls = 51, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 154
[2024-06-03 21:46:49,354 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-06-03 21:46:49,355 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-06-03 21:46:49,356 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-06-03 21:46:49,356 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-06-03 21:46:49,365 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 09:46:49" (1/1) ...
[2024-06-03 21:46:49,366 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 09:46:49" (1/1) ...
[2024-06-03 21:46:49,404 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 09:46:49" (1/1) ...
[2024-06-03 21:46:49,466 INFO  L175           MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2024-06-03 21:46:49,467 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 09:46:49" (1/1) ...
[2024-06-03 21:46:49,467 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 09:46:49" (1/1) ...
[2024-06-03 21:46:49,517 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 09:46:49" (1/1) ...
[2024-06-03 21:46:49,520 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 09:46:49" (1/1) ...
[2024-06-03 21:46:49,544 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 09:46:49" (1/1) ...
[2024-06-03 21:46:49,551 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 09:46:49" (1/1) ...
[2024-06-03 21:46:49,593 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-06-03 21:46:49,595 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-06-03 21:46:49,595 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-06-03 21:46:49,595 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-06-03 21:46:49,595 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 09:46:49" (1/1) ...
[2024-06-03 21:46:49,600 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-06-03 21:46:49,611 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-06-03 21:46:49,634 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-06-03 21:46:49,651 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-06-03 21:46:49,669 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2024-06-03 21:46:49,669 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-06-03 21:46:49,669 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2024-06-03 21:46:49,669 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2024-06-03 21:46:49,670 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2024-06-03 21:46:49,670 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2024-06-03 21:46:49,670 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2024-06-03 21:46:49,670 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2024-06-03 21:46:49,670 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-06-03 21:46:49,671 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2024-06-03 21:46:49,671 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-06-03 21:46:49,671 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-06-03 21:46:49,673 WARN  L214             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement
[2024-06-03 21:46:49,858 INFO  L244             CfgBuilder]: Building ICFG
[2024-06-03 21:46:49,860 INFO  L270             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-06-03 21:46:51,272 INFO  L289             CfgBuilder]: Ommited future-live optimization because the input is a concurrent program.
[2024-06-03 21:46:51,274 INFO  L293             CfgBuilder]: Performing block encoding
[2024-06-03 21:46:51,634 INFO  L315             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-06-03 21:46:51,634 INFO  L320             CfgBuilder]: Removed 0 assume(true) statements.
[2024-06-03 21:46:51,635 INFO  L201        PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.06 09:46:51 BoogieIcfgContainer
[2024-06-03 21:46:51,635 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-06-03 21:46:51,637 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-06-03 21:46:51,637 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-06-03 21:46:51,640 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-06-03 21:46:51,640 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.06 09:46:48" (1/4) ...
[2024-06-03 21:46:51,641 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@371dacf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.06 09:46:51, skipping insertion in model container
[2024-06-03 21:46:51,641 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 09:46:48" (2/4) ...
[2024-06-03 21:46:51,641 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@371dacf1 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 03.06 09:46:51, skipping insertion in model container
[2024-06-03 21:46:51,641 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 09:46:49" (3/4) ...
[2024-06-03 21:46:51,641 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@371dacf1 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 03.06 09:46:51, skipping insertion in model container
[2024-06-03 21:46:51,641 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.06 09:46:51" (4/4) ...
[2024-06-03 21:46:51,642 INFO  L112   eAbstractionObserver]: Analyzing ICFG mix033_tso.oepc.i
[2024-06-03 21:46:51,657 INFO  L204   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-06-03 21:46:51,658 INFO  L163   ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations.
[2024-06-03 21:46:51,658 INFO  L522   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-06-03 21:46:51,790 INFO  L144    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-06-03 21:46:51,822 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 55 places, 45 transitions, 102 flow
[2024-06-03 21:46:51,903 INFO  L124   PetriNetUnfolderBase]: 0/42 cut-off events.
[2024-06-03 21:46:51,904 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-06-03 21:46:51,937 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 52 conditions, 42 events. 0/42 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 76 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. 
[2024-06-03 21:46:51,937 INFO  L82        GeneralOperation]: Start removeDead. Operand has 55 places, 45 transitions, 102 flow
[2024-06-03 21:46:51,940 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 46 places, 36 transitions, 81 flow
[2024-06-03 21:46:51,960 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-06-03 21:46:51,965 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;@38f7ae55, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-06-03 21:46:51,966 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2024-06-03 21:46:51,975 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-06-03 21:46:51,975 INFO  L124   PetriNetUnfolderBase]: 0/6 cut-off events.
[2024-06-03 21:46:51,975 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-06-03 21:46:51,976 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:46:51,992 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1]
[2024-06-03 21:46:51,993 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:46:51,997 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:46:51,997 INFO  L85        PathProgramCache]: Analyzing trace with hash -925057465, now seen corresponding path program 1 times
[2024-06-03 21:46:52,017 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:46:52,017 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451413660]
[2024-06-03 21:46:52,018 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:46:52,018 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:46:52,449 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:47:00,326 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:47:00,327 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:47:00,327 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451413660]
[2024-06-03 21:47:00,328 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451413660] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:47:00,328 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:47:00,328 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-06-03 21:47:00,330 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410373858]
[2024-06-03 21:47:00,330 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:47:00,337 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-06-03 21:47:00,341 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:47:00,363 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-06-03 21:47:00,364 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-06-03 21:47:00,467 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 45
[2024-06-03 21:47:00,469 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 81 flow. Second operand  has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:47:00,469 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:47:00,469 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 45
[2024-06-03 21:47:00,470 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:47:01,866 INFO  L124   PetriNetUnfolderBase]: 1659/2634 cut-off events.
[2024-06-03 21:47:01,866 INFO  L125   PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES.
[2024-06-03 21:47:01,875 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5200 conditions, 2634 events. 1659/2634 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 13619 event pairs, 1184 based on Foata normal form. 1/2527 useless extension candidates. Maximal degree in co-relation 5185. Up to 2465 conditions per place. 
[2024-06-03 21:47:01,890 INFO  L140   encePairwiseOnDemand]: 38/45 looper letters, 35 selfloop transitions, 4 changer transitions 0/46 dead transitions.
[2024-06-03 21:47:01,890 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 46 transitions, 185 flow
[2024-06-03 21:47:01,891 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-06-03 21:47:01,894 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-06-03 21:47:01,900 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions.
[2024-06-03 21:47:01,901 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5777777777777777
[2024-06-03 21:47:01,903 INFO  L175             Difference]: Start difference. First operand has 46 places, 36 transitions, 81 flow. Second operand 3 states and 78 transitions.
[2024-06-03 21:47:01,903 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 46 transitions, 185 flow
[2024-06-03 21:47:01,906 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 46 transitions, 180 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-06-03 21:47:01,910 INFO  L231             Difference]: Finished difference. Result has 46 places, 39 transitions, 108 flow
[2024-06-03 21:47:01,912 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=108, PETRI_PLACES=46, PETRI_TRANSITIONS=39}
[2024-06-03 21:47:01,914 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 0 predicate places.
[2024-06-03 21:47:01,915 INFO  L495      AbstractCegarLoop]: Abstraction has has 46 places, 39 transitions, 108 flow
[2024-06-03 21:47:01,915 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:47:01,915 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:47:01,915 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:47:01,915 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-06-03 21:47:01,916 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:47:01,917 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:47:01,917 INFO  L85        PathProgramCache]: Analyzing trace with hash 78054054, now seen corresponding path program 1 times
[2024-06-03 21:47:01,917 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:47:01,917 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826492430]
[2024-06-03 21:47:01,917 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:47:01,918 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:47:02,030 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:47:08,232 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:47:08,233 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:47:08,233 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826492430]
[2024-06-03 21:47:08,233 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826492430] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:47:08,233 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:47:08,233 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-06-03 21:47:08,234 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48994894]
[2024-06-03 21:47:08,234 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:47:08,235 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-06-03 21:47:08,236 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:47:08,237 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-06-03 21:47:08,237 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-06-03 21:47:08,324 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45
[2024-06-03 21:47:08,324 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 39 transitions, 108 flow. Second operand  has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:47:08,324 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:47:08,325 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45
[2024-06-03 21:47:08,325 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:47:09,739 INFO  L124   PetriNetUnfolderBase]: 1905/2937 cut-off events.
[2024-06-03 21:47:09,739 INFO  L125   PetriNetUnfolderBase]: For 545/545 co-relation queries the response was YES.
[2024-06-03 21:47:09,743 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6560 conditions, 2937 events. 1905/2937 cut-off events. For 545/545 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 14793 event pairs, 1212 based on Foata normal form. 3/2890 useless extension candidates. Maximal degree in co-relation 6545. Up to 2801 conditions per place. 
[2024-06-03 21:47:09,752 INFO  L140   encePairwiseOnDemand]: 37/45 looper letters, 43 selfloop transitions, 7 changer transitions 0/56 dead transitions.
[2024-06-03 21:47:09,752 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 56 transitions, 254 flow
[2024-06-03 21:47:09,753 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-06-03 21:47:09,753 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-06-03 21:47:09,754 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 97 transitions.
[2024-06-03 21:47:09,754 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5388888888888889
[2024-06-03 21:47:09,754 INFO  L175             Difference]: Start difference. First operand has 46 places, 39 transitions, 108 flow. Second operand 4 states and 97 transitions.
[2024-06-03 21:47:09,754 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 56 transitions, 254 flow
[2024-06-03 21:47:09,755 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 56 transitions, 250 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-06-03 21:47:09,757 INFO  L231             Difference]: Finished difference. Result has 49 places, 42 transitions, 144 flow
[2024-06-03 21:47:09,757 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=144, PETRI_PLACES=49, PETRI_TRANSITIONS=42}
[2024-06-03 21:47:09,758 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 3 predicate places.
[2024-06-03 21:47:09,758 INFO  L495      AbstractCegarLoop]: Abstraction has has 49 places, 42 transitions, 144 flow
[2024-06-03 21:47:09,768 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:47:09,768 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:47:09,769 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:47:09,769 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-06-03 21:47:09,769 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:47:09,769 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:47:09,769 INFO  L85        PathProgramCache]: Analyzing trace with hash -1875290072, now seen corresponding path program 1 times
[2024-06-03 21:47:09,770 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:47:09,770 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145979755]
[2024-06-03 21:47:09,770 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:47:09,770 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:47:09,813 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:47:15,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-06-03 21:47:15,502 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:47:15,502 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145979755]
[2024-06-03 21:47:15,502 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145979755] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:47:15,502 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:47:15,502 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-06-03 21:47:15,502 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536337317]
[2024-06-03 21:47:15,502 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:47:15,503 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-06-03 21:47:15,503 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:47:15,504 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-06-03 21:47:15,504 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20
[2024-06-03 21:47:15,650 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45
[2024-06-03 21:47:15,651 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 42 transitions, 144 flow. Second operand  has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:47:15,651 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:47:15,651 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45
[2024-06-03 21:47:15,651 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:47:17,064 INFO  L124   PetriNetUnfolderBase]: 1893/2923 cut-off events.
[2024-06-03 21:47:17,065 INFO  L125   PetriNetUnfolderBase]: For 1534/1534 co-relation queries the response was YES.
[2024-06-03 21:47:17,069 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7205 conditions, 2923 events. 1893/2923 cut-off events. For 1534/1534 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 14768 event pairs, 878 based on Foata normal form. 6/2881 useless extension candidates. Maximal degree in co-relation 7188. Up to 2753 conditions per place. 
[2024-06-03 21:47:17,081 INFO  L140   encePairwiseOnDemand]: 36/45 looper letters, 51 selfloop transitions, 10 changer transitions 0/67 dead transitions.
[2024-06-03 21:47:17,081 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 67 transitions, 336 flow
[2024-06-03 21:47:17,082 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-03 21:47:17,082 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-03 21:47:17,083 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 119 transitions.
[2024-06-03 21:47:17,084 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5288888888888889
[2024-06-03 21:47:17,084 INFO  L175             Difference]: Start difference. First operand has 49 places, 42 transitions, 144 flow. Second operand 5 states and 119 transitions.
[2024-06-03 21:47:17,084 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 67 transitions, 336 flow
[2024-06-03 21:47:17,085 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 67 transitions, 322 flow, removed 2 selfloop flow, removed 2 redundant places.
[2024-06-03 21:47:17,086 INFO  L231             Difference]: Finished difference. Result has 52 places, 45 transitions, 180 flow
[2024-06-03 21:47:17,087 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=180, PETRI_PLACES=52, PETRI_TRANSITIONS=45}
[2024-06-03 21:47:17,087 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 6 predicate places.
[2024-06-03 21:47:17,087 INFO  L495      AbstractCegarLoop]: Abstraction has has 52 places, 45 transitions, 180 flow
[2024-06-03 21:47:17,088 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:47:17,088 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:47:17,088 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:47:17,088 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-06-03 21:47:17,088 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:47:17,089 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:47:17,089 INFO  L85        PathProgramCache]: Analyzing trace with hash 1732555751, now seen corresponding path program 1 times
[2024-06-03 21:47:17,089 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:47:17,089 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846856868]
[2024-06-03 21:47:17,089 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:47:17,089 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:47:17,153 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:47:23,565 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:47:23,566 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:47:23,569 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846856868]
[2024-06-03 21:47:23,569 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846856868] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:47:23,570 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:47:23,570 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-03 21:47:23,570 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625150107]
[2024-06-03 21:47:23,570 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:47:23,570 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-03 21:47:23,571 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:47:23,572 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-03 21:47:23,572 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-06-03 21:47:23,761 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45
[2024-06-03 21:47:23,762 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 45 transitions, 180 flow. Second operand  has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:47:23,762 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:47:23,762 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45
[2024-06-03 21:47:23,762 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:47:25,231 INFO  L124   PetriNetUnfolderBase]: 1884/2904 cut-off events.
[2024-06-03 21:47:25,231 INFO  L125   PetriNetUnfolderBase]: For 2854/2854 co-relation queries the response was YES.
[2024-06-03 21:47:25,235 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7824 conditions, 2904 events. 1884/2904 cut-off events. For 2854/2854 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 14600 event pairs, 690 based on Foata normal form. 6/2860 useless extension candidates. Maximal degree in co-relation 7806. Up to 2708 conditions per place. 
[2024-06-03 21:47:25,248 INFO  L140   encePairwiseOnDemand]: 36/45 looper letters, 55 selfloop transitions, 12 changer transitions 0/73 dead transitions.
[2024-06-03 21:47:25,248 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 73 transitions, 390 flow
[2024-06-03 21:47:25,248 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-03 21:47:25,249 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-03 21:47:25,251 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 136 transitions.
[2024-06-03 21:47:25,251 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5037037037037037
[2024-06-03 21:47:25,251 INFO  L175             Difference]: Start difference. First operand has 52 places, 45 transitions, 180 flow. Second operand 6 states and 136 transitions.
[2024-06-03 21:47:25,252 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 73 transitions, 390 flow
[2024-06-03 21:47:25,255 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 73 transitions, 366 flow, removed 4 selfloop flow, removed 3 redundant places.
[2024-06-03 21:47:25,256 INFO  L231             Difference]: Finished difference. Result has 54 places, 46 transitions, 199 flow
[2024-06-03 21:47:25,256 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=199, PETRI_PLACES=54, PETRI_TRANSITIONS=46}
[2024-06-03 21:47:25,257 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 8 predicate places.
[2024-06-03 21:47:25,257 INFO  L495      AbstractCegarLoop]: Abstraction has has 54 places, 46 transitions, 199 flow
[2024-06-03 21:47:25,258 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:47:25,258 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:47:25,258 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:47:25,258 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-06-03 21:47:25,258 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:47:25,259 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:47:25,259 INFO  L85        PathProgramCache]: Analyzing trace with hash 725652736, now seen corresponding path program 1 times
[2024-06-03 21:47:25,259 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:47:25,259 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677860298]
[2024-06-03 21:47:25,259 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:47:25,259 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:47:25,316 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:47:38,076 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:47:38,077 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:47:38,077 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677860298]
[2024-06-03 21:47:38,077 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677860298] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:47:38,078 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:47:38,078 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-06-03 21:47:38,079 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127139274]
[2024-06-03 21:47:38,079 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:47:38,080 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-06-03 21:47:38,080 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:47:38,080 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-06-03 21:47:38,080 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2024-06-03 21:47:38,232 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45
[2024-06-03 21:47:38,233 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 46 transitions, 199 flow. Second operand  has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:47:38,233 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:47:38,233 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45
[2024-06-03 21:47:38,233 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:47:39,484 INFO  L124   PetriNetUnfolderBase]: 1627/2585 cut-off events.
[2024-06-03 21:47:39,485 INFO  L125   PetriNetUnfolderBase]: For 3895/3895 co-relation queries the response was YES.
[2024-06-03 21:47:39,488 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7337 conditions, 2585 events. 1627/2585 cut-off events. For 3895/3895 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 13336 event pairs, 814 based on Foata normal form. 2/2519 useless extension candidates. Maximal degree in co-relation 7318. Up to 2407 conditions per place. 
[2024-06-03 21:47:39,496 INFO  L140   encePairwiseOnDemand]: 37/45 looper letters, 45 selfloop transitions, 8 changer transitions 0/60 dead transitions.
[2024-06-03 21:47:39,497 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 60 transitions, 349 flow
[2024-06-03 21:47:39,497 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-03 21:47:39,497 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-03 21:47:39,498 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 102 transitions.
[2024-06-03 21:47:39,498 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4533333333333333
[2024-06-03 21:47:39,498 INFO  L175             Difference]: Start difference. First operand has 54 places, 46 transitions, 199 flow. Second operand 5 states and 102 transitions.
[2024-06-03 21:47:39,498 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 60 transitions, 349 flow
[2024-06-03 21:47:39,500 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 60 transitions, 316 flow, removed 6 selfloop flow, removed 4 redundant places.
[2024-06-03 21:47:39,501 INFO  L231             Difference]: Finished difference. Result has 55 places, 49 transitions, 212 flow
[2024-06-03 21:47:39,501 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=212, PETRI_PLACES=55, PETRI_TRANSITIONS=49}
[2024-06-03 21:47:39,501 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 9 predicate places.
[2024-06-03 21:47:39,502 INFO  L495      AbstractCegarLoop]: Abstraction has has 55 places, 49 transitions, 212 flow
[2024-06-03 21:47:39,502 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:47:39,502 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:47:39,502 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:47:39,502 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-06-03 21:47:39,502 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:47:39,503 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:47:39,503 INFO  L85        PathProgramCache]: Analyzing trace with hash 1020399532, now seen corresponding path program 1 times
[2024-06-03 21:47:39,503 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:47:39,503 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946506849]
[2024-06-03 21:47:39,503 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:47:39,503 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:47:39,572 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:47:52,351 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:47:52,351 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:47:52,351 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946506849]
[2024-06-03 21:47:52,351 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946506849] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:47:52,351 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:47:52,351 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-03 21:47:52,352 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314827113]
[2024-06-03 21:47:52,352 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:47:52,352 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-03 21:47:52,352 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:47:52,352 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-03 21:47:52,353 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2024-06-03 21:47:52,513 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45
[2024-06-03 21:47:52,514 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 49 transitions, 212 flow. Second operand  has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:47:52,514 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:47:52,514 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45
[2024-06-03 21:47:52,514 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:47:53,941 INFO  L124   PetriNetUnfolderBase]: 1918/3085 cut-off events.
[2024-06-03 21:47:53,942 INFO  L125   PetriNetUnfolderBase]: For 6144/6144 co-relation queries the response was YES.
[2024-06-03 21:47:53,945 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 9148 conditions, 3085 events. 1918/3085 cut-off events. For 6144/6144 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 16244 event pairs, 972 based on Foata normal form. 2/3059 useless extension candidates. Maximal degree in co-relation 9127. Up to 2819 conditions per place. 
[2024-06-03 21:47:53,954 INFO  L140   encePairwiseOnDemand]: 36/45 looper letters, 50 selfloop transitions, 11 changer transitions 0/67 dead transitions.
[2024-06-03 21:47:53,954 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 67 transitions, 392 flow
[2024-06-03 21:47:53,955 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-03 21:47:53,955 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-03 21:47:53,955 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 115 transitions.
[2024-06-03 21:47:53,955 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42592592592592593
[2024-06-03 21:47:53,955 INFO  L175             Difference]: Start difference. First operand has 55 places, 49 transitions, 212 flow. Second operand 6 states and 115 transitions.
[2024-06-03 21:47:53,956 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 67 transitions, 392 flow
[2024-06-03 21:47:53,958 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 67 transitions, 370 flow, removed 5 selfloop flow, removed 3 redundant places.
[2024-06-03 21:47:53,958 INFO  L231             Difference]: Finished difference. Result has 58 places, 52 transitions, 246 flow
[2024-06-03 21:47:53,959 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=246, PETRI_PLACES=58, PETRI_TRANSITIONS=52}
[2024-06-03 21:47:53,959 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 12 predicate places.
[2024-06-03 21:47:53,959 INFO  L495      AbstractCegarLoop]: Abstraction has has 58 places, 52 transitions, 246 flow
[2024-06-03 21:47:53,960 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:47:53,960 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:47:53,960 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:47:53,960 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-06-03 21:47:53,960 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:47:53,960 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:47:53,961 INFO  L85        PathProgramCache]: Analyzing trace with hash -1171997997, now seen corresponding path program 1 times
[2024-06-03 21:47:53,961 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:47:53,961 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270293214]
[2024-06-03 21:47:53,961 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:47:53,961 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:47:54,004 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:48:05,700 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:48:05,700 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:48:05,700 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270293214]
[2024-06-03 21:48:05,700 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270293214] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:48:05,700 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:48:05,701 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-03 21:48:05,701 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297437637]
[2024-06-03 21:48:05,701 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:48:05,701 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-03 21:48:05,701 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:48:05,701 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-03 21:48:05,701 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2024-06-03 21:48:05,859 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45
[2024-06-03 21:48:05,859 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 52 transitions, 246 flow. Second operand  has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:48:05,859 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:48:05,859 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45
[2024-06-03 21:48:05,859 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:48:07,462 INFO  L124   PetriNetUnfolderBase]: 2094/3286 cut-off events.
[2024-06-03 21:48:07,462 INFO  L125   PetriNetUnfolderBase]: For 9664/9664 co-relation queries the response was YES.
[2024-06-03 21:48:07,467 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 10630 conditions, 3286 events. 2094/3286 cut-off events. For 9664/9664 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 16962 event pairs, 1034 based on Foata normal form. 2/3277 useless extension candidates. Maximal degree in co-relation 10608. Up to 3060 conditions per place. 
[2024-06-03 21:48:07,484 INFO  L140   encePairwiseOnDemand]: 36/45 looper letters, 55 selfloop transitions, 11 changer transitions 0/73 dead transitions.
[2024-06-03 21:48:07,484 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 73 transitions, 446 flow
[2024-06-03 21:48:07,485 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-03 21:48:07,485 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-03 21:48:07,485 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 118 transitions.
[2024-06-03 21:48:07,485 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43703703703703706
[2024-06-03 21:48:07,485 INFO  L175             Difference]: Start difference. First operand has 58 places, 52 transitions, 246 flow. Second operand 6 states and 118 transitions.
[2024-06-03 21:48:07,485 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 73 transitions, 446 flow
[2024-06-03 21:48:07,488 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 73 transitions, 414 flow, removed 7 selfloop flow, removed 4 redundant places.
[2024-06-03 21:48:07,489 INFO  L231             Difference]: Finished difference. Result has 60 places, 55 transitions, 272 flow
[2024-06-03 21:48:07,489 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=272, PETRI_PLACES=60, PETRI_TRANSITIONS=55}
[2024-06-03 21:48:07,489 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 14 predicate places.
[2024-06-03 21:48:07,489 INFO  L495      AbstractCegarLoop]: Abstraction has has 60 places, 55 transitions, 272 flow
[2024-06-03 21:48:07,490 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:48:07,490 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:48:07,490 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:48:07,490 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-06-03 21:48:07,490 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:48:07,490 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:48:07,491 INFO  L85        PathProgramCache]: Analyzing trace with hash 1567607711, now seen corresponding path program 2 times
[2024-06-03 21:48:07,491 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:48:07,491 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556254508]
[2024-06-03 21:48:07,491 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:48:07,491 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:48:07,541 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:48:19,734 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:48:19,735 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:48:19,735 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556254508]
[2024-06-03 21:48:19,735 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556254508] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:48:19,735 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:48:19,736 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-03 21:48:19,736 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836070717]
[2024-06-03 21:48:19,736 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:48:19,736 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-03 21:48:19,736 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:48:19,737 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-03 21:48:19,737 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2024-06-03 21:48:19,894 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45
[2024-06-03 21:48:19,895 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 55 transitions, 272 flow. Second operand  has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:48:19,895 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:48:19,895 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45
[2024-06-03 21:48:19,895 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:48:21,424 INFO  L124   PetriNetUnfolderBase]: 2089/3281 cut-off events.
[2024-06-03 21:48:21,424 INFO  L125   PetriNetUnfolderBase]: For 12638/12650 co-relation queries the response was YES.
[2024-06-03 21:48:21,429 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 11318 conditions, 3281 events. 2089/3281 cut-off events. For 12638/12650 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 16951 event pairs, 1041 based on Foata normal form. 10/3278 useless extension candidates. Maximal degree in co-relation 11295. Up to 3035 conditions per place. 
[2024-06-03 21:48:21,439 INFO  L140   encePairwiseOnDemand]: 36/45 looper letters, 50 selfloop transitions, 16 changer transitions 0/73 dead transitions.
[2024-06-03 21:48:21,440 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 73 transitions, 470 flow
[2024-06-03 21:48:21,442 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-03 21:48:21,442 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-03 21:48:21,443 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 117 transitions.
[2024-06-03 21:48:21,443 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43333333333333335
[2024-06-03 21:48:21,443 INFO  L175             Difference]: Start difference. First operand has 60 places, 55 transitions, 272 flow. Second operand 6 states and 117 transitions.
[2024-06-03 21:48:21,443 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 73 transitions, 470 flow
[2024-06-03 21:48:21,446 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 73 transitions, 436 flow, removed 8 selfloop flow, removed 4 redundant places.
[2024-06-03 21:48:21,447 INFO  L231             Difference]: Finished difference. Result has 62 places, 58 transitions, 312 flow
[2024-06-03 21:48:21,447 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=312, PETRI_PLACES=62, PETRI_TRANSITIONS=58}
[2024-06-03 21:48:21,448 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 16 predicate places.
[2024-06-03 21:48:21,448 INFO  L495      AbstractCegarLoop]: Abstraction has has 62 places, 58 transitions, 312 flow
[2024-06-03 21:48:21,448 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:48:21,448 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:48:21,448 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:48:21,448 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-06-03 21:48:21,449 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:48:21,449 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:48:21,449 INFO  L85        PathProgramCache]: Analyzing trace with hash 1567615647, now seen corresponding path program 1 times
[2024-06-03 21:48:21,449 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:48:21,449 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245954461]
[2024-06-03 21:48:21,449 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:48:21,450 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:48:21,496 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:48:33,814 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:48:33,814 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:48:33,814 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245954461]
[2024-06-03 21:48:33,814 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245954461] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:48:33,814 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:48:33,814 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-03 21:48:33,814 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251747387]
[2024-06-03 21:48:33,814 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:48:33,815 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-03 21:48:33,815 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:48:33,815 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-03 21:48:33,815 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-03 21:48:34,076 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45
[2024-06-03 21:48:34,076 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 58 transitions, 312 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-06-03 21:48:34,076 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:48:34,076 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45
[2024-06-03 21:48:34,077 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:48:35,485 INFO  L124   PetriNetUnfolderBase]: 1919/3114 cut-off events.
[2024-06-03 21:48:35,486 INFO  L125   PetriNetUnfolderBase]: For 13547/13547 co-relation queries the response was YES.
[2024-06-03 21:48:35,490 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 11097 conditions, 3114 events. 1919/3114 cut-off events. For 13547/13547 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 16525 event pairs, 936 based on Foata normal form. 2/3104 useless extension candidates. Maximal degree in co-relation 11073. Up to 2812 conditions per place. 
[2024-06-03 21:48:35,499 INFO  L140   encePairwiseOnDemand]: 35/45 looper letters, 60 selfloop transitions, 14 changer transitions 0/80 dead transitions.
[2024-06-03 21:48:35,499 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 80 transitions, 536 flow
[2024-06-03 21:48:35,500 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-03 21:48:35,500 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-03 21:48:35,500 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 132 transitions.
[2024-06-03 21:48:35,500 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41904761904761906
[2024-06-03 21:48:35,500 INFO  L175             Difference]: Start difference. First operand has 62 places, 58 transitions, 312 flow. Second operand 7 states and 132 transitions.
[2024-06-03 21:48:35,501 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 80 transitions, 536 flow
[2024-06-03 21:48:35,504 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 80 transitions, 486 flow, removed 11 selfloop flow, removed 4 redundant places.
[2024-06-03 21:48:35,505 INFO  L231             Difference]: Finished difference. Result has 65 places, 61 transitions, 332 flow
[2024-06-03 21:48:35,505 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=332, PETRI_PLACES=65, PETRI_TRANSITIONS=61}
[2024-06-03 21:48:35,506 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 19 predicate places.
[2024-06-03 21:48:35,506 INFO  L495      AbstractCegarLoop]: Abstraction has has 65 places, 61 transitions, 332 flow
[2024-06-03 21:48:35,506 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-06-03 21:48:35,506 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:48:35,506 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:48:35,506 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-06-03 21:48:35,506 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:48:35,507 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:48:35,507 INFO  L85        PathProgramCache]: Analyzing trace with hash 1173948305, now seen corresponding path program 1 times
[2024-06-03 21:48:35,507 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:48:35,507 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889274431]
[2024-06-03 21:48:35,507 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:48:35,507 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:48:35,552 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:48:47,634 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:48:47,635 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:48:47,635 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889274431]
[2024-06-03 21:48:47,635 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889274431] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:48:47,635 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:48:47,635 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-03 21:48:47,635 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763611635]
[2024-06-03 21:48:47,635 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:48:47,636 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-03 21:48:47,636 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:48:47,636 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-03 21:48:47,636 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-03 21:48:47,838 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45
[2024-06-03 21:48:47,839 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 61 transitions, 332 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-06-03 21:48:47,839 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:48:47,839 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45
[2024-06-03 21:48:47,839 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:48:49,521 INFO  L124   PetriNetUnfolderBase]: 2106/3320 cut-off events.
[2024-06-03 21:48:49,521 INFO  L125   PetriNetUnfolderBase]: For 19477/19477 co-relation queries the response was YES.
[2024-06-03 21:48:49,525 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 12827 conditions, 3320 events. 2106/3320 cut-off events. For 19477/19477 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 17192 event pairs, 829 based on Foata normal form. 4/3311 useless extension candidates. Maximal degree in co-relation 12802. Up to 3039 conditions per place. 
[2024-06-03 21:48:49,535 INFO  L140   encePairwiseOnDemand]: 34/45 looper letters, 69 selfloop transitions, 17 changer transitions 0/93 dead transitions.
[2024-06-03 21:48:49,536 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 93 transitions, 612 flow
[2024-06-03 21:48:49,536 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-03 21:48:49,536 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-03 21:48:49,537 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 140 transitions.
[2024-06-03 21:48:49,537 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4444444444444444
[2024-06-03 21:48:49,537 INFO  L175             Difference]: Start difference. First operand has 65 places, 61 transitions, 332 flow. Second operand 7 states and 140 transitions.
[2024-06-03 21:48:49,537 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 93 transitions, 612 flow
[2024-06-03 21:48:49,542 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 93 transitions, 566 flow, removed 11 selfloop flow, removed 5 redundant places.
[2024-06-03 21:48:49,543 INFO  L231             Difference]: Finished difference. Result has 68 places, 67 transitions, 382 flow
[2024-06-03 21:48:49,543 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=382, PETRI_PLACES=68, PETRI_TRANSITIONS=67}
[2024-06-03 21:48:49,545 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 22 predicate places.
[2024-06-03 21:48:49,547 INFO  L495      AbstractCegarLoop]: Abstraction has has 68 places, 67 transitions, 382 flow
[2024-06-03 21:48:49,547 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-06-03 21:48:49,547 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:48:49,547 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:48:49,547 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-06-03 21:48:49,548 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:48:49,548 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:48:49,548 INFO  L85        PathProgramCache]: Analyzing trace with hash 1174068275, now seen corresponding path program 2 times
[2024-06-03 21:48:49,548 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:48:49,548 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532337100]
[2024-06-03 21:48:49,548 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:48:49,549 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:48:49,594 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:49:03,029 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:49:03,029 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:49:03,029 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532337100]
[2024-06-03 21:49:03,029 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532337100] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:49:03,029 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:49:03,029 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-03 21:49:03,029 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727200298]
[2024-06-03 21:49:03,029 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:49:03,029 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-03 21:49:03,030 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:49:03,030 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-03 21:49:03,030 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-03 21:49:03,314 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45
[2024-06-03 21:49:03,315 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 67 transitions, 382 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-06-03 21:49:03,315 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:49:03,315 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45
[2024-06-03 21:49:03,315 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:49:05,032 INFO  L124   PetriNetUnfolderBase]: 2156/3378 cut-off events.
[2024-06-03 21:49:05,032 INFO  L125   PetriNetUnfolderBase]: For 24735/24735 co-relation queries the response was YES.
[2024-06-03 21:49:05,037 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 14118 conditions, 3378 events. 2156/3378 cut-off events. For 24735/24735 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 17434 event pairs, 823 based on Foata normal form. 4/3357 useless extension candidates. Maximal degree in co-relation 14091. Up to 3066 conditions per place. 
[2024-06-03 21:49:05,047 INFO  L140   encePairwiseOnDemand]: 35/45 looper letters, 68 selfloop transitions, 24 changer transitions 0/99 dead transitions.
[2024-06-03 21:49:05,047 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 99 transitions, 750 flow
[2024-06-03 21:49:05,047 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-03 21:49:05,048 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-03 21:49:05,048 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 142 transitions.
[2024-06-03 21:49:05,048 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4507936507936508
[2024-06-03 21:49:05,048 INFO  L175             Difference]: Start difference. First operand has 68 places, 67 transitions, 382 flow. Second operand 7 states and 142 transitions.
[2024-06-03 21:49:05,048 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 99 transitions, 750 flow
[2024-06-03 21:49:05,053 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 99 transitions, 706 flow, removed 13 selfloop flow, removed 3 redundant places.
[2024-06-03 21:49:05,054 INFO  L231             Difference]: Finished difference. Result has 72 places, 73 transitions, 476 flow
[2024-06-03 21:49:05,054 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=476, PETRI_PLACES=72, PETRI_TRANSITIONS=73}
[2024-06-03 21:49:05,054 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 26 predicate places.
[2024-06-03 21:49:05,055 INFO  L495      AbstractCegarLoop]: Abstraction has has 72 places, 73 transitions, 476 flow
[2024-06-03 21:49:05,055 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-06-03 21:49:05,055 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:49:05,055 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:49:05,055 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-06-03 21:49:05,055 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:49:05,055 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:49:05,055 INFO  L85        PathProgramCache]: Analyzing trace with hash -1972198343, now seen corresponding path program 1 times
[2024-06-03 21:49:05,055 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:49:05,055 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866650336]
[2024-06-03 21:49:05,055 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:49:05,055 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:49:05,096 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:49:17,311 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:49:17,312 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:49:17,312 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866650336]
[2024-06-03 21:49:17,312 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866650336] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:49:17,312 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:49:17,312 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-03 21:49:17,312 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173845399]
[2024-06-03 21:49:17,312 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:49:17,313 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-03 21:49:17,313 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:49:17,313 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-03 21:49:17,313 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-03 21:49:17,493 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 45
[2024-06-03 21:49:17,493 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 73 transitions, 476 flow. Second operand  has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:49:17,493 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:49:17,493 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 45
[2024-06-03 21:49:17,493 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:49:19,201 INFO  L124   PetriNetUnfolderBase]: 2287/3519 cut-off events.
[2024-06-03 21:49:19,201 INFO  L125   PetriNetUnfolderBase]: For 29387/29387 co-relation queries the response was YES.
[2024-06-03 21:49:19,207 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 15301 conditions, 3519 events. 2287/3519 cut-off events. For 29387/29387 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 17675 event pairs, 875 based on Foata normal form. 2/3507 useless extension candidates. Maximal degree in co-relation 15273. Up to 3332 conditions per place. 
[2024-06-03 21:49:19,217 INFO  L140   encePairwiseOnDemand]: 35/45 looper letters, 79 selfloop transitions, 14 changer transitions 0/98 dead transitions.
[2024-06-03 21:49:19,217 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 98 transitions, 754 flow
[2024-06-03 21:49:19,217 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-03 21:49:19,217 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-03 21:49:19,218 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 129 transitions.
[2024-06-03 21:49:19,218 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4095238095238095
[2024-06-03 21:49:19,218 INFO  L175             Difference]: Start difference. First operand has 72 places, 73 transitions, 476 flow. Second operand 7 states and 129 transitions.
[2024-06-03 21:49:19,218 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 98 transitions, 754 flow
[2024-06-03 21:49:19,227 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 98 transitions, 708 flow, removed 16 selfloop flow, removed 3 redundant places.
[2024-06-03 21:49:19,229 INFO  L231             Difference]: Finished difference. Result has 76 places, 76 transitions, 508 flow
[2024-06-03 21:49:19,229 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=430, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=508, PETRI_PLACES=76, PETRI_TRANSITIONS=76}
[2024-06-03 21:49:19,229 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 30 predicate places.
[2024-06-03 21:49:19,230 INFO  L495      AbstractCegarLoop]: Abstraction has has 76 places, 76 transitions, 508 flow
[2024-06-03 21:49:19,230 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:49:19,230 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:49:19,230 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:49:19,230 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-06-03 21:49:19,230 INFO  L420      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:49:19,231 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:49:19,231 INFO  L85        PathProgramCache]: Analyzing trace with hash 1351437131, now seen corresponding path program 2 times
[2024-06-03 21:49:19,231 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:49:19,231 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078253620]
[2024-06-03 21:49:19,231 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:49:19,231 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:49:19,276 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:49:32,083 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:49:32,084 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:49:32,084 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078253620]
[2024-06-03 21:49:32,084 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078253620] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:49:32,084 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:49:32,084 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-03 21:49:32,084 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756414095]
[2024-06-03 21:49:32,084 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:49:32,084 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-03 21:49:32,084 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:49:32,085 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-03 21:49:32,085 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-03 21:49:32,240 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 45
[2024-06-03 21:49:32,241 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 76 transitions, 508 flow. Second operand  has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:49:32,241 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:49:32,241 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 45
[2024-06-03 21:49:32,241 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:49:33,938 INFO  L124   PetriNetUnfolderBase]: 2298/3537 cut-off events.
[2024-06-03 21:49:33,938 INFO  L125   PetriNetUnfolderBase]: For 34050/34065 co-relation queries the response was YES.
[2024-06-03 21:49:33,944 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 16079 conditions, 3537 events. 2298/3537 cut-off events. For 34050/34065 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 17786 event pairs, 882 based on Foata normal form. 12/3530 useless extension candidates. Maximal degree in co-relation 16049. Up to 3301 conditions per place. 
[2024-06-03 21:49:33,953 INFO  L140   encePairwiseOnDemand]: 35/45 looper letters, 71 selfloop transitions, 27 changer transitions 0/103 dead transitions.
[2024-06-03 21:49:33,953 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 103 transitions, 888 flow
[2024-06-03 21:49:33,954 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-03 21:49:33,954 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-03 21:49:33,954 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 131 transitions.
[2024-06-03 21:49:33,954 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4158730158730159
[2024-06-03 21:49:33,954 INFO  L175             Difference]: Start difference. First operand has 76 places, 76 transitions, 508 flow. Second operand 7 states and 131 transitions.
[2024-06-03 21:49:33,954 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 103 transitions, 888 flow
[2024-06-03 21:49:33,962 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 103 transitions, 834 flow, removed 15 selfloop flow, removed 5 redundant places.
[2024-06-03 21:49:33,963 INFO  L231             Difference]: Finished difference. Result has 78 places, 82 transitions, 606 flow
[2024-06-03 21:49:33,964 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=454, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=606, PETRI_PLACES=78, PETRI_TRANSITIONS=82}
[2024-06-03 21:49:33,964 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 32 predicate places.
[2024-06-03 21:49:33,964 INFO  L495      AbstractCegarLoop]: Abstraction has has 78 places, 82 transitions, 606 flow
[2024-06-03 21:49:33,964 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:49:33,964 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:49:33,964 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:49:33,965 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2024-06-03 21:49:33,965 INFO  L420      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:49:33,965 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:49:33,965 INFO  L85        PathProgramCache]: Analyzing trace with hash 1351199981, now seen corresponding path program 3 times
[2024-06-03 21:49:33,965 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:49:33,965 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207602037]
[2024-06-03 21:49:33,965 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:49:33,966 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:49:34,007 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:49:46,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-06-03 21:49:46,554 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:49:46,554 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207602037]
[2024-06-03 21:49:46,554 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207602037] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:49:46,554 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:49:46,554 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-03 21:49:46,554 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847472281]
[2024-06-03 21:49:46,554 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:49:46,554 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-03 21:49:46,555 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:49:46,555 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-03 21:49:46,555 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-03 21:49:46,689 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 45
[2024-06-03 21:49:46,690 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 82 transitions, 606 flow. Second operand  has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:49:46,690 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:49:46,690 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 45
[2024-06-03 21:49:46,690 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:49:48,357 INFO  L124   PetriNetUnfolderBase]: 2293/3530 cut-off events.
[2024-06-03 21:49:48,358 INFO  L125   PetriNetUnfolderBase]: For 39409/39424 co-relation queries the response was YES.
[2024-06-03 21:49:48,363 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 16739 conditions, 3530 events. 2293/3530 cut-off events. For 39409/39424 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 17745 event pairs, 882 based on Foata normal form. 12/3523 useless extension candidates. Maximal degree in co-relation 16708. Up to 3296 conditions per place. 
[2024-06-03 21:49:48,374 INFO  L140   encePairwiseOnDemand]: 35/45 looper letters, 70 selfloop transitions, 26 changer transitions 0/101 dead transitions.
[2024-06-03 21:49:48,374 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 101 transitions, 846 flow
[2024-06-03 21:49:48,375 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-03 21:49:48,375 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-03 21:49:48,375 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 130 transitions.
[2024-06-03 21:49:48,375 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4126984126984127
[2024-06-03 21:49:48,375 INFO  L175             Difference]: Start difference. First operand has 78 places, 82 transitions, 606 flow. Second operand 7 states and 130 transitions.
[2024-06-03 21:49:48,375 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 101 transitions, 846 flow
[2024-06-03 21:49:48,389 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 101 transitions, 766 flow, removed 31 selfloop flow, removed 3 redundant places.
[2024-06-03 21:49:48,390 INFO  L231             Difference]: Finished difference. Result has 82 places, 82 transitions, 586 flow
[2024-06-03 21:49:48,390 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=526, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=586, PETRI_PLACES=82, PETRI_TRANSITIONS=82}
[2024-06-03 21:49:48,391 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 36 predicate places.
[2024-06-03 21:49:48,391 INFO  L495      AbstractCegarLoop]: Abstraction has has 82 places, 82 transitions, 586 flow
[2024-06-03 21:49:48,391 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:49:48,391 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:49:48,391 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:49:48,392 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2024-06-03 21:49:48,392 INFO  L420      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:49:48,392 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:49:48,392 INFO  L85        PathProgramCache]: Analyzing trace with hash -368333203, now seen corresponding path program 3 times
[2024-06-03 21:49:48,392 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:49:48,392 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500390777]
[2024-06-03 21:49:48,392 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:49:48,393 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:49:48,435 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:50:01,125 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:50:01,125 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:50:01,125 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500390777]
[2024-06-03 21:50:01,125 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500390777] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:50:01,125 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:50:01,125 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-03 21:50:01,126 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057625641]
[2024-06-03 21:50:01,126 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:50:01,126 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-03 21:50:01,126 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:50:01,126 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-03 21:50:01,126 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-03 21:50:01,262 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45
[2024-06-03 21:50:01,263 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 82 transitions, 586 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-06-03 21:50:01,263 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:50:01,263 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45
[2024-06-03 21:50:01,263 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:50:03,066 INFO  L124   PetriNetUnfolderBase]: 2156/3397 cut-off events.
[2024-06-03 21:50:03,066 INFO  L125   PetriNetUnfolderBase]: For 42732/42741 co-relation queries the response was YES.
[2024-06-03 21:50:03,072 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 16319 conditions, 3397 events. 2156/3397 cut-off events. For 42732/42741 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 17551 event pairs, 818 based on Foata normal form. 8/3385 useless extension candidates. Maximal degree in co-relation 16286. Up to 3026 conditions per place. 
[2024-06-03 21:50:03,082 INFO  L140   encePairwiseOnDemand]: 35/45 looper letters, 67 selfloop transitions, 31 changer transitions 0/108 dead transitions.
[2024-06-03 21:50:03,083 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 108 transitions, 946 flow
[2024-06-03 21:50:03,083 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-03 21:50:03,083 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-03 21:50:03,083 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 141 transitions.
[2024-06-03 21:50:03,084 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44761904761904764
[2024-06-03 21:50:03,084 INFO  L175             Difference]: Start difference. First operand has 82 places, 82 transitions, 586 flow. Second operand 7 states and 141 transitions.
[2024-06-03 21:50:03,084 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 108 transitions, 946 flow
[2024-06-03 21:50:03,098 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 108 transitions, 876 flow, removed 5 selfloop flow, removed 6 redundant places.
[2024-06-03 21:50:03,099 INFO  L231             Difference]: Finished difference. Result has 83 places, 85 transitions, 640 flow
[2024-06-03 21:50:03,099 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=516, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=640, PETRI_PLACES=83, PETRI_TRANSITIONS=85}
[2024-06-03 21:50:03,100 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 37 predicate places.
[2024-06-03 21:50:03,100 INFO  L495      AbstractCegarLoop]: Abstraction has has 83 places, 85 transitions, 640 flow
[2024-06-03 21:50:03,100 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-06-03 21:50:03,100 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:50:03,100 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:50:03,100 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2024-06-03 21:50:03,100 INFO  L420      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:50:03,101 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:50:03,101 INFO  L85        PathProgramCache]: Analyzing trace with hash 681108354, now seen corresponding path program 1 times
[2024-06-03 21:50:03,101 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:50:03,101 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515943216]
[2024-06-03 21:50:03,101 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:50:03,101 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:50:03,139 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:50:22,665 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:50:22,666 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:50:22,666 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515943216]
[2024-06-03 21:50:22,666 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515943216] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:50:22,666 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:50:22,666 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-03 21:50:22,666 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970223060]
[2024-06-03 21:50:22,666 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:50:22,667 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-03 21:50:22,667 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:50:22,667 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-03 21:50:22,667 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2024-06-03 21:50:22,798 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45
[2024-06-03 21:50:22,798 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 85 transitions, 640 flow. Second operand  has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:50:22,798 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:50:22,798 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45
[2024-06-03 21:50:22,798 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:50:24,396 INFO  L124   PetriNetUnfolderBase]: 2166/3521 cut-off events.
[2024-06-03 21:50:24,396 INFO  L125   PetriNetUnfolderBase]: For 46814/46814 co-relation queries the response was YES.
[2024-06-03 21:50:24,402 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 17136 conditions, 3521 events. 2166/3521 cut-off events. For 46814/46814 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 18800 event pairs, 834 based on Foata normal form. 1/3507 useless extension candidates. Maximal degree in co-relation 17102. Up to 3173 conditions per place. 
[2024-06-03 21:50:24,410 INFO  L140   encePairwiseOnDemand]: 38/45 looper letters, 78 selfloop transitions, 8 changer transitions 0/96 dead transitions.
[2024-06-03 21:50:24,410 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 96 transitions, 854 flow
[2024-06-03 21:50:24,411 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-03 21:50:24,411 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-03 21:50:24,411 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 94 transitions.
[2024-06-03 21:50:24,411 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4177777777777778
[2024-06-03 21:50:24,411 INFO  L175             Difference]: Start difference. First operand has 83 places, 85 transitions, 640 flow. Second operand 5 states and 94 transitions.
[2024-06-03 21:50:24,411 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 96 transitions, 854 flow
[2024-06-03 21:50:24,426 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 96 transitions, 754 flow, removed 21 selfloop flow, removed 5 redundant places.
[2024-06-03 21:50:24,427 INFO  L231             Difference]: Finished difference. Result has 83 places, 88 transitions, 590 flow
[2024-06-03 21:50:24,427 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=540, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=590, PETRI_PLACES=83, PETRI_TRANSITIONS=88}
[2024-06-03 21:50:24,427 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 37 predicate places.
[2024-06-03 21:50:24,427 INFO  L495      AbstractCegarLoop]: Abstraction has has 83 places, 88 transitions, 590 flow
[2024-06-03 21:50:24,437 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:50:24,438 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:50:24,438 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:50:24,438 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2024-06-03 21:50:24,439 INFO  L420      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:50:24,440 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:50:24,440 INFO  L85        PathProgramCache]: Analyzing trace with hash 1267123976, now seen corresponding path program 1 times
[2024-06-03 21:50:24,440 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:50:24,440 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497565576]
[2024-06-03 21:50:24,440 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:50:24,440 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:50:24,495 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:50:37,257 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:50:37,258 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:50:37,258 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497565576]
[2024-06-03 21:50:37,258 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497565576] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:50:37,258 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:50:37,258 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 21:50:37,258 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881636720]
[2024-06-03 21:50:37,258 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:50:37,258 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 21:50:37,259 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:50:37,259 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 21:50:37,259 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72
[2024-06-03 21:50:37,477 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45
[2024-06-03 21:50:37,477 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 88 transitions, 590 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-06-03 21:50:37,477 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:50:37,477 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45
[2024-06-03 21:50:37,477 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:50:39,231 INFO  L124   PetriNetUnfolderBase]: 2150/3380 cut-off events.
[2024-06-03 21:50:39,232 INFO  L125   PetriNetUnfolderBase]: For 50849/50849 co-relation queries the response was YES.
[2024-06-03 21:50:39,238 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 17356 conditions, 3380 events. 2150/3380 cut-off events. For 50849/50849 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 17413 event pairs, 801 based on Foata normal form. 2/3380 useless extension candidates. Maximal degree in co-relation 17321. Up to 3082 conditions per place. 
[2024-06-03 21:50:39,247 INFO  L140   encePairwiseOnDemand]: 35/45 looper letters, 85 selfloop transitions, 19 changer transitions 0/114 dead transitions.
[2024-06-03 21:50:39,247 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 114 transitions, 866 flow
[2024-06-03 21:50:39,248 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-03 21:50:39,248 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-03 21:50:39,248 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 140 transitions.
[2024-06-03 21:50:39,248 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4444444444444444
[2024-06-03 21:50:39,249 INFO  L175             Difference]: Start difference. First operand has 83 places, 88 transitions, 590 flow. Second operand 7 states and 140 transitions.
[2024-06-03 21:50:39,249 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 114 transitions, 866 flow
[2024-06-03 21:50:39,264 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 114 transitions, 816 flow, removed 19 selfloop flow, removed 3 redundant places.
[2024-06-03 21:50:39,265 INFO  L231             Difference]: Finished difference. Result has 87 places, 88 transitions, 590 flow
[2024-06-03 21:50:39,265 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=540, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=590, PETRI_PLACES=87, PETRI_TRANSITIONS=88}
[2024-06-03 21:50:39,265 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 41 predicate places.
[2024-06-03 21:50:39,266 INFO  L495      AbstractCegarLoop]: Abstraction has has 87 places, 88 transitions, 590 flow
[2024-06-03 21:50:39,266 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-06-03 21:50:39,266 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:50:39,266 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:50:39,266 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2024-06-03 21:50:39,266 INFO  L420      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:50:39,267 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:50:39,267 INFO  L85        PathProgramCache]: Analyzing trace with hash -1012330129, now seen corresponding path program 1 times
[2024-06-03 21:50:39,267 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:50:39,267 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293178556]
[2024-06-03 21:50:39,267 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:50:39,267 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:50:39,318 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:50:52,624 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:50:52,625 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:50:52,625 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293178556]
[2024-06-03 21:50:52,625 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293178556] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:50:52,625 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:50:52,625 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 21:50:52,625 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7005372]
[2024-06-03 21:50:52,625 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:50:52,625 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 21:50:52,625 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:50:52,626 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 21:50:52,626 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-03 21:50:52,826 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 45
[2024-06-03 21:50:52,826 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 88 transitions, 590 flow. Second operand  has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:50:52,826 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:50:52,826 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 45
[2024-06-03 21:50:52,826 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:50:54,543 INFO  L124   PetriNetUnfolderBase]: 2297/3536 cut-off events.
[2024-06-03 21:50:54,543 INFO  L125   PetriNetUnfolderBase]: For 56533/56533 co-relation queries the response was YES.
[2024-06-03 21:50:54,550 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 18507 conditions, 3536 events. 2297/3536 cut-off events. For 56533/56533 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 17680 event pairs, 845 based on Foata normal form. 4/3538 useless extension candidates. Maximal degree in co-relation 18471. Up to 3295 conditions per place. 
[2024-06-03 21:50:54,561 INFO  L140   encePairwiseOnDemand]: 33/45 looper letters, 97 selfloop transitions, 20 changer transitions 0/122 dead transitions.
[2024-06-03 21:50:54,561 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 122 transitions, 954 flow
[2024-06-03 21:50:54,561 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 21:50:54,561 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 21:50:54,562 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 151 transitions.
[2024-06-03 21:50:54,562 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41944444444444445
[2024-06-03 21:50:54,562 INFO  L175             Difference]: Start difference. First operand has 87 places, 88 transitions, 590 flow. Second operand 8 states and 151 transitions.
[2024-06-03 21:50:54,562 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 122 transitions, 954 flow
[2024-06-03 21:50:54,578 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 122 transitions, 908 flow, removed 2 selfloop flow, removed 6 redundant places.
[2024-06-03 21:50:54,580 INFO  L231             Difference]: Finished difference. Result has 89 places, 91 transitions, 646 flow
[2024-06-03 21:50:54,580 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=544, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=646, PETRI_PLACES=89, PETRI_TRANSITIONS=91}
[2024-06-03 21:50:54,580 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 43 predicate places.
[2024-06-03 21:50:54,580 INFO  L495      AbstractCegarLoop]: Abstraction has has 89 places, 91 transitions, 646 flow
[2024-06-03 21:50:54,581 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:50:54,581 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:50:54,581 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:50:54,581 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2024-06-03 21:50:54,581 INFO  L420      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:50:54,581 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:50:54,581 INFO  L85        PathProgramCache]: Analyzing trace with hash -1008605262, now seen corresponding path program 1 times
[2024-06-03 21:50:54,581 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:50:54,581 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294302355]
[2024-06-03 21:50:54,581 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:50:54,581 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:50:54,630 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:51:07,060 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:51:07,061 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:51:07,061 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294302355]
[2024-06-03 21:51:07,061 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294302355] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:51:07,061 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:51:07,061 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 21:51:07,062 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902803728]
[2024-06-03 21:51:07,062 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:51:07,062 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 21:51:07,062 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:51:07,062 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 21:51:07,063 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-03 21:51:07,299 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 45
[2024-06-03 21:51:07,299 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 91 transitions, 646 flow. Second operand  has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:51:07,299 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:51:07,299 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 45
[2024-06-03 21:51:07,300 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:51:09,016 INFO  L124   PetriNetUnfolderBase]: 2308/3546 cut-off events.
[2024-06-03 21:51:09,016 INFO  L125   PetriNetUnfolderBase]: For 63804/63804 co-relation queries the response was YES.
[2024-06-03 21:51:09,022 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 19311 conditions, 3546 events. 2308/3546 cut-off events. For 63804/63804 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 17661 event pairs, 838 based on Foata normal form. 2/3546 useless extension candidates. Maximal degree in co-relation 19274. Up to 3355 conditions per place. 
[2024-06-03 21:51:09,031 INFO  L140   encePairwiseOnDemand]: 34/45 looper letters, 98 selfloop transitions, 17 changer transitions 0/120 dead transitions.
[2024-06-03 21:51:09,032 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 120 transitions, 990 flow
[2024-06-03 21:51:09,032 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 21:51:09,032 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 21:51:09,033 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 145 transitions.
[2024-06-03 21:51:09,033 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4027777777777778
[2024-06-03 21:51:09,033 INFO  L175             Difference]: Start difference. First operand has 89 places, 91 transitions, 646 flow. Second operand 8 states and 145 transitions.
[2024-06-03 21:51:09,033 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 120 transitions, 990 flow
[2024-06-03 21:51:09,049 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 120 transitions, 912 flow, removed 21 selfloop flow, removed 6 redundant places.
[2024-06-03 21:51:09,051 INFO  L231             Difference]: Finished difference. Result has 91 places, 94 transitions, 664 flow
[2024-06-03 21:51:09,051 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=568, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=664, PETRI_PLACES=91, PETRI_TRANSITIONS=94}
[2024-06-03 21:51:09,052 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 45 predicate places.
[2024-06-03 21:51:09,052 INFO  L495      AbstractCegarLoop]: Abstraction has has 91 places, 94 transitions, 664 flow
[2024-06-03 21:51:09,052 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:51:09,052 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:51:09,052 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:51:09,052 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2024-06-03 21:51:09,052 INFO  L420      AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:51:09,053 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:51:09,053 INFO  L85        PathProgramCache]: Analyzing trace with hash -1008611059, now seen corresponding path program 2 times
[2024-06-03 21:51:09,053 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:51:09,053 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847363956]
[2024-06-03 21:51:09,053 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:51:09,053 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:51:09,099 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:51:21,577 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:51:21,577 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:51:21,578 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847363956]
[2024-06-03 21:51:21,578 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847363956] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:51:21,578 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:51:21,578 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 21:51:21,578 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380293442]
[2024-06-03 21:51:21,578 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:51:21,578 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 21:51:21,578 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:51:21,579 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 21:51:21,579 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-03 21:51:21,840 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 45
[2024-06-03 21:51:21,840 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 94 transitions, 664 flow. Second operand  has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:51:21,840 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:51:21,840 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 45
[2024-06-03 21:51:21,840 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:51:23,676 INFO  L124   PetriNetUnfolderBase]: 2378/3642 cut-off events.
[2024-06-03 21:51:23,677 INFO  L125   PetriNetUnfolderBase]: For 74116/74116 co-relation queries the response was YES.
[2024-06-03 21:51:23,683 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 20646 conditions, 3642 events. 2378/3642 cut-off events. For 74116/74116 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 18082 event pairs, 827 based on Foata normal form. 4/3644 useless extension candidates. Maximal degree in co-relation 20608. Up to 3309 conditions per place. 
[2024-06-03 21:51:23,695 INFO  L140   encePairwiseOnDemand]: 34/45 looper letters, 95 selfloop transitions, 36 changer transitions 0/136 dead transitions.
[2024-06-03 21:51:23,695 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 136 transitions, 1328 flow
[2024-06-03 21:51:23,695 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 21:51:23,695 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 21:51:23,696 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 157 transitions.
[2024-06-03 21:51:23,696 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4361111111111111
[2024-06-03 21:51:23,696 INFO  L175             Difference]: Start difference. First operand has 91 places, 94 transitions, 664 flow. Second operand 8 states and 157 transitions.
[2024-06-03 21:51:23,696 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 136 transitions, 1328 flow
[2024-06-03 21:51:23,724 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 136 transitions, 1256 flow, removed 21 selfloop flow, removed 6 redundant places.
[2024-06-03 21:51:23,726 INFO  L231             Difference]: Finished difference. Result has 93 places, 103 transitions, 846 flow
[2024-06-03 21:51:23,727 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=592, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=846, PETRI_PLACES=93, PETRI_TRANSITIONS=103}
[2024-06-03 21:51:23,727 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 47 predicate places.
[2024-06-03 21:51:23,727 INFO  L495      AbstractCegarLoop]: Abstraction has has 93 places, 103 transitions, 846 flow
[2024-06-03 21:51:23,727 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:51:23,727 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:51:23,728 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:51:23,728 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2024-06-03 21:51:23,728 INFO  L420      AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:51:23,729 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:51:23,729 INFO  L85        PathProgramCache]: Analyzing trace with hash 1267277581, now seen corresponding path program 3 times
[2024-06-03 21:51:23,729 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:51:23,729 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496325606]
[2024-06-03 21:51:23,729 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:51:23,729 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:51:23,803 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:51:36,391 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:51:36,391 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:51:36,391 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496325606]
[2024-06-03 21:51:36,391 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496325606] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:51:36,392 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:51:36,392 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 21:51:36,392 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451565882]
[2024-06-03 21:51:36,392 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:51:36,392 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 21:51:36,392 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:51:36,392 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 21:51:36,393 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-03 21:51:36,605 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 45
[2024-06-03 21:51:36,605 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 103 transitions, 846 flow. Second operand  has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:51:36,605 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:51:36,605 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 45
[2024-06-03 21:51:36,606 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:51:38,424 INFO  L124   PetriNetUnfolderBase]: 2368/3628 cut-off events.
[2024-06-03 21:51:38,424 INFO  L125   PetriNetUnfolderBase]: For 81918/81918 co-relation queries the response was YES.
[2024-06-03 21:51:38,431 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 21250 conditions, 3628 events. 2368/3628 cut-off events. For 81918/81918 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 18074 event pairs, 820 based on Foata normal form. 4/3630 useless extension candidates. Maximal degree in co-relation 21211. Up to 3301 conditions per place. 
[2024-06-03 21:51:38,443 INFO  L140   encePairwiseOnDemand]: 34/45 looper letters, 91 selfloop transitions, 38 changer transitions 0/134 dead transitions.
[2024-06-03 21:51:38,443 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 134 transitions, 1264 flow
[2024-06-03 21:51:38,445 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 21:51:38,445 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 21:51:38,446 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 154 transitions.
[2024-06-03 21:51:38,446 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42777777777777776
[2024-06-03 21:51:38,446 INFO  L175             Difference]: Start difference. First operand has 93 places, 103 transitions, 846 flow. Second operand 8 states and 154 transitions.
[2024-06-03 21:51:38,446 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 134 transitions, 1264 flow
[2024-06-03 21:51:38,477 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 134 transitions, 1154 flow, removed 48 selfloop flow, removed 3 redundant places.
[2024-06-03 21:51:38,478 INFO  L231             Difference]: Finished difference. Result has 98 places, 103 transitions, 820 flow
[2024-06-03 21:51:38,478 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=736, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=820, PETRI_PLACES=98, PETRI_TRANSITIONS=103}
[2024-06-03 21:51:38,479 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 52 predicate places.
[2024-06-03 21:51:38,479 INFO  L495      AbstractCegarLoop]: Abstraction has has 98 places, 103 transitions, 820 flow
[2024-06-03 21:51:38,479 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:51:38,479 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:51:38,479 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:51:38,480 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2024-06-03 21:51:38,480 INFO  L420      AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:51:38,480 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:51:38,480 INFO  L85        PathProgramCache]: Analyzing trace with hash -1054853762, now seen corresponding path program 2 times
[2024-06-03 21:51:38,480 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:51:38,480 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864934680]
[2024-06-03 21:51:38,480 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:51:38,481 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:51:38,522 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:51:52,802 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:51:52,803 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:51:52,803 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864934680]
[2024-06-03 21:51:52,803 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864934680] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:51:52,803 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:51:52,803 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 21:51:52,803 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653937350]
[2024-06-03 21:51:52,803 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:51:52,804 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 21:51:52,804 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:51:52,804 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 21:51:52,804 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-06-03 21:51:52,992 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 45
[2024-06-03 21:51:52,992 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 103 transitions, 820 flow. Second operand  has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:51:52,992 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:51:52,992 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 45
[2024-06-03 21:51:52,992 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:51:54,677 INFO  L124   PetriNetUnfolderBase]: 2379/3661 cut-off events.
[2024-06-03 21:51:54,677 INFO  L125   PetriNetUnfolderBase]: For 86602/86617 co-relation queries the response was YES.
[2024-06-03 21:51:54,685 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 21637 conditions, 3661 events. 2379/3661 cut-off events. For 86602/86617 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 18390 event pairs, 831 based on Foata normal form. 12/3669 useless extension candidates. Maximal degree in co-relation 21596. Up to 3379 conditions per place. 
[2024-06-03 21:51:54,697 INFO  L140   encePairwiseOnDemand]: 34/45 looper letters, 91 selfloop transitions, 38 changer transitions 0/134 dead transitions.
[2024-06-03 21:51:54,697 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 134 transitions, 1334 flow
[2024-06-03 21:51:54,697 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 21:51:54,697 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 21:51:54,698 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 148 transitions.
[2024-06-03 21:51:54,698 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4111111111111111
[2024-06-03 21:51:54,698 INFO  L175             Difference]: Start difference. First operand has 98 places, 103 transitions, 820 flow. Second operand 8 states and 148 transitions.
[2024-06-03 21:51:54,698 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 134 transitions, 1334 flow
[2024-06-03 21:51:54,732 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 134 transitions, 1262 flow, removed 4 selfloop flow, removed 6 redundant places.
[2024-06-03 21:51:54,733 INFO  L231             Difference]: Finished difference. Result has 100 places, 109 transitions, 950 flow
[2024-06-03 21:51:54,733 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=748, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=950, PETRI_PLACES=100, PETRI_TRANSITIONS=109}
[2024-06-03 21:51:54,734 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 54 predicate places.
[2024-06-03 21:51:54,734 INFO  L495      AbstractCegarLoop]: Abstraction has has 100 places, 109 transitions, 950 flow
[2024-06-03 21:51:54,734 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:51:54,734 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:51:54,734 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:51:54,734 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2024-06-03 21:51:54,734 INFO  L420      AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:51:54,735 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:51:54,735 INFO  L85        PathProgramCache]: Analyzing trace with hash 1473931238, now seen corresponding path program 3 times
[2024-06-03 21:51:54,735 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:51:54,735 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115099980]
[2024-06-03 21:51:54,735 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:51:54,735 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:51:54,775 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:52:09,310 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:52:09,310 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:52:09,310 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115099980]
[2024-06-03 21:52:09,311 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115099980] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:52:09,311 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:52:09,311 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 21:52:09,311 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232553385]
[2024-06-03 21:52:09,311 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:52:09,311 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 21:52:09,311 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:52:09,311 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 21:52:09,312 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-06-03 21:52:09,510 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 45
[2024-06-03 21:52:09,510 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 109 transitions, 950 flow. Second operand  has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:52:09,510 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:52:09,510 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 45
[2024-06-03 21:52:09,510 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:52:11,273 INFO  L124   PetriNetUnfolderBase]: 2390/3682 cut-off events.
[2024-06-03 21:52:11,273 INFO  L125   PetriNetUnfolderBase]: For 95274/95289 co-relation queries the response was YES.
[2024-06-03 21:52:11,281 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 22421 conditions, 3682 events. 2390/3682 cut-off events. For 95274/95289 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 18555 event pairs, 831 based on Foata normal form. 12/3690 useless extension candidates. Maximal degree in co-relation 22379. Up to 3391 conditions per place. 
[2024-06-03 21:52:11,294 INFO  L140   encePairwiseOnDemand]: 34/45 looper letters, 93 selfloop transitions, 39 changer transitions 0/137 dead transitions.
[2024-06-03 21:52:11,294 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 137 transitions, 1424 flow
[2024-06-03 21:52:11,294 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 21:52:11,294 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 21:52:11,295 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 149 transitions.
[2024-06-03 21:52:11,295 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41388888888888886
[2024-06-03 21:52:11,295 INFO  L175             Difference]: Start difference. First operand has 100 places, 109 transitions, 950 flow. Second operand 8 states and 149 transitions.
[2024-06-03 21:52:11,295 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 137 transitions, 1424 flow
[2024-06-03 21:52:11,333 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 137 transitions, 1326 flow, removed 33 selfloop flow, removed 4 redundant places.
[2024-06-03 21:52:11,335 INFO  L231             Difference]: Finished difference. Result has 104 places, 112 transitions, 1000 flow
[2024-06-03 21:52:11,335 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=860, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1000, PETRI_PLACES=104, PETRI_TRANSITIONS=112}
[2024-06-03 21:52:11,335 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 58 predicate places.
[2024-06-03 21:52:11,335 INFO  L495      AbstractCegarLoop]: Abstraction has has 104 places, 112 transitions, 1000 flow
[2024-06-03 21:52:11,336 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:52:11,336 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:52:11,336 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:52:11,336 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2024-06-03 21:52:11,336 INFO  L420      AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:52:11,336 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:52:11,336 INFO  L85        PathProgramCache]: Analyzing trace with hash 1710921159, now seen corresponding path program 4 times
[2024-06-03 21:52:11,336 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:52:11,336 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942792607]
[2024-06-03 21:52:11,336 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:52:11,337 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:52:11,380 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:52:24,165 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:52:24,166 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:52:24,166 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942792607]
[2024-06-03 21:52:24,166 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942792607] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:52:24,166 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:52:24,166 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 21:52:24,166 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809851]
[2024-06-03 21:52:24,166 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:52:24,166 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 21:52:24,166 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:52:24,167 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 21:52:24,167 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-06-03 21:52:24,394 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 45
[2024-06-03 21:52:24,395 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 112 transitions, 1000 flow. Second operand  has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:52:24,395 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:52:24,395 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 45
[2024-06-03 21:52:24,395 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:52:26,148 INFO  L124   PetriNetUnfolderBase]: 2412/3720 cut-off events.
[2024-06-03 21:52:26,148 INFO  L125   PetriNetUnfolderBase]: For 102759/102768 co-relation queries the response was YES.
[2024-06-03 21:52:26,156 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 23002 conditions, 3720 events. 2412/3720 cut-off events. For 102759/102768 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 18703 event pairs, 826 based on Foata normal form. 8/3721 useless extension candidates. Maximal degree in co-relation 22958. Up to 3250 conditions per place. 
[2024-06-03 21:52:26,167 INFO  L140   encePairwiseOnDemand]: 34/45 looper letters, 84 selfloop transitions, 57 changer transitions 0/146 dead transitions.
[2024-06-03 21:52:26,168 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 146 transitions, 1574 flow
[2024-06-03 21:52:26,168 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 21:52:26,168 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 21:52:26,168 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 154 transitions.
[2024-06-03 21:52:26,169 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42777777777777776
[2024-06-03 21:52:26,169 INFO  L175             Difference]: Start difference. First operand has 104 places, 112 transitions, 1000 flow. Second operand 8 states and 154 transitions.
[2024-06-03 21:52:26,169 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 146 transitions, 1574 flow
[2024-06-03 21:52:26,215 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 146 transitions, 1476 flow, removed 21 selfloop flow, removed 5 redundant places.
[2024-06-03 21:52:26,217 INFO  L231             Difference]: Finished difference. Result has 107 places, 118 transitions, 1158 flow
[2024-06-03 21:52:26,217 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=902, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1158, PETRI_PLACES=107, PETRI_TRANSITIONS=118}
[2024-06-03 21:52:26,217 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 61 predicate places.
[2024-06-03 21:52:26,217 INFO  L495      AbstractCegarLoop]: Abstraction has has 107 places, 118 transitions, 1158 flow
[2024-06-03 21:52:26,217 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:52:26,217 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:52:26,217 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:52:26,218 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2024-06-03 21:52:26,218 INFO  L420      AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:52:26,218 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:52:26,218 INFO  L85        PathProgramCache]: Analyzing trace with hash 1466579588, now seen corresponding path program 4 times
[2024-06-03 21:52:26,218 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:52:26,218 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277159010]
[2024-06-03 21:52:26,218 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:52:26,218 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:52:26,259 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:52:40,480 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:52:40,480 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:52:40,480 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277159010]
[2024-06-03 21:52:40,480 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277159010] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:52:40,480 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:52:40,481 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 21:52:40,481 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059140235]
[2024-06-03 21:52:40,481 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:52:40,481 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 21:52:40,481 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:52:40,481 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 21:52:40,481 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-06-03 21:52:40,703 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 45
[2024-06-03 21:52:40,704 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 118 transitions, 1158 flow. Second operand  has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:52:40,704 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:52:40,704 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 45
[2024-06-03 21:52:40,704 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:52:42,438 INFO  L124   PetriNetUnfolderBase]: 2407/3711 cut-off events.
[2024-06-03 21:52:42,439 INFO  L125   PetriNetUnfolderBase]: For 111242/111257 co-relation queries the response was YES.
[2024-06-03 21:52:42,448 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 23681 conditions, 3711 events. 2407/3711 cut-off events. For 111242/111257 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 18629 event pairs, 825 based on Foata normal form. 12/3719 useless extension candidates. Maximal degree in co-relation 23636. Up to 3418 conditions per place. 
[2024-06-03 21:52:42,460 INFO  L140   encePairwiseOnDemand]: 34/45 looper letters, 98 selfloop transitions, 38 changer transitions 0/141 dead transitions.
[2024-06-03 21:52:42,461 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 141 transitions, 1488 flow
[2024-06-03 21:52:42,461 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 21:52:42,461 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 21:52:42,461 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 148 transitions.
[2024-06-03 21:52:42,462 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4111111111111111
[2024-06-03 21:52:42,462 INFO  L175             Difference]: Start difference. First operand has 107 places, 118 transitions, 1158 flow. Second operand 8 states and 148 transitions.
[2024-06-03 21:52:42,462 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 141 transitions, 1488 flow
[2024-06-03 21:52:42,523 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 141 transitions, 1350 flow, removed 50 selfloop flow, removed 4 redundant places.
[2024-06-03 21:52:42,524 INFO  L231             Difference]: Finished difference. Result has 111 places, 118 transitions, 1104 flow
[2024-06-03 21:52:42,525 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=1020, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1104, PETRI_PLACES=111, PETRI_TRANSITIONS=118}
[2024-06-03 21:52:42,525 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 65 predicate places.
[2024-06-03 21:52:42,525 INFO  L495      AbstractCegarLoop]: Abstraction has has 111 places, 118 transitions, 1104 flow
[2024-06-03 21:52:42,525 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:52:42,525 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:52:42,525 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:52:42,526 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2024-06-03 21:52:42,526 INFO  L420      AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:52:42,526 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:52:42,526 INFO  L85        PathProgramCache]: Analyzing trace with hash 1466579371, now seen corresponding path program 5 times
[2024-06-03 21:52:42,526 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:52:42,526 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651356590]
[2024-06-03 21:52:42,526 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:52:42,527 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:52:42,569 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:52:56,734 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:52:56,734 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:52:56,734 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651356590]
[2024-06-03 21:52:56,735 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651356590] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:52:56,735 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:52:56,735 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 21:52:56,735 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911995916]
[2024-06-03 21:52:56,735 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:52:56,735 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 21:52:56,735 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:52:56,736 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 21:52:56,736 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-06-03 21:52:56,972 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 45
[2024-06-03 21:52:56,973 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 118 transitions, 1104 flow. Second operand  has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:52:56,973 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:52:56,973 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 45
[2024-06-03 21:52:56,973 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:52:58,718 INFO  L124   PetriNetUnfolderBase]: 2429/3745 cut-off events.
[2024-06-03 21:52:58,719 INFO  L125   PetriNetUnfolderBase]: For 115963/115972 co-relation queries the response was YES.
[2024-06-03 21:52:58,727 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 23794 conditions, 3745 events. 2429/3745 cut-off events. For 115963/115972 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 18852 event pairs, 834 based on Foata normal form. 8/3746 useless extension candidates. Maximal degree in co-relation 23747. Up to 3262 conditions per place. 
[2024-06-03 21:52:58,739 INFO  L140   encePairwiseOnDemand]: 34/45 looper letters, 91 selfloop transitions, 56 changer transitions 0/152 dead transitions.
[2024-06-03 21:52:58,739 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 152 transitions, 1742 flow
[2024-06-03 21:52:58,740 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 21:52:58,740 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 21:52:58,740 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 159 transitions.
[2024-06-03 21:52:58,740 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44166666666666665
[2024-06-03 21:52:58,740 INFO  L175             Difference]: Start difference. First operand has 111 places, 118 transitions, 1104 flow. Second operand 8 states and 159 transitions.
[2024-06-03 21:52:58,740 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 152 transitions, 1742 flow
[2024-06-03 21:52:58,783 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 152 transitions, 1626 flow, removed 5 selfloop flow, removed 8 redundant places.
[2024-06-03 21:52:58,785 INFO  L231             Difference]: Finished difference. Result has 111 places, 121 transitions, 1174 flow
[2024-06-03 21:52:58,785 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=988, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1174, PETRI_PLACES=111, PETRI_TRANSITIONS=121}
[2024-06-03 21:52:58,786 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 65 predicate places.
[2024-06-03 21:52:58,786 INFO  L495      AbstractCegarLoop]: Abstraction has has 111 places, 121 transitions, 1174 flow
[2024-06-03 21:52:58,786 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:52:58,786 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:52:58,786 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:52:58,786 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2024-06-03 21:52:58,786 INFO  L420      AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:52:58,786 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:52:58,786 INFO  L85        PathProgramCache]: Analyzing trace with hash -1062478119, now seen corresponding path program 6 times
[2024-06-03 21:52:58,786 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:52:58,787 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691993971]
[2024-06-03 21:52:58,787 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:52:58,787 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:52:58,828 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:53:13,043 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:53:13,043 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:53:13,043 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691993971]
[2024-06-03 21:53:13,043 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691993971] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:53:13,043 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:53:13,043 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 21:53:13,043 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669521242]
[2024-06-03 21:53:13,043 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:53:13,044 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 21:53:13,044 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:53:13,044 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 21:53:13,044 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-06-03 21:53:13,280 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 45
[2024-06-03 21:53:13,281 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 121 transitions, 1174 flow. Second operand  has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:53:13,281 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:53:13,281 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 45
[2024-06-03 21:53:13,281 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:53:15,027 INFO  L124   PetriNetUnfolderBase]: 2419/3731 cut-off events.
[2024-06-03 21:53:15,027 INFO  L125   PetriNetUnfolderBase]: For 122361/122370 co-relation queries the response was YES.
[2024-06-03 21:53:15,036 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 23994 conditions, 3731 events. 2419/3731 cut-off events. For 122361/122370 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 18782 event pairs, 834 based on Foata normal form. 8/3732 useless extension candidates. Maximal degree in co-relation 23946. Up to 3254 conditions per place. 
[2024-06-03 21:53:15,049 INFO  L140   encePairwiseOnDemand]: 34/45 looper letters, 87 selfloop transitions, 57 changer transitions 0/149 dead transitions.
[2024-06-03 21:53:15,049 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 149 transitions, 1638 flow
[2024-06-03 21:53:15,049 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 21:53:15,049 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 21:53:15,050 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 155 transitions.
[2024-06-03 21:53:15,050 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4305555555555556
[2024-06-03 21:53:15,050 INFO  L175             Difference]: Start difference. First operand has 111 places, 121 transitions, 1174 flow. Second operand 8 states and 155 transitions.
[2024-06-03 21:53:15,050 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 149 transitions, 1638 flow
[2024-06-03 21:53:15,114 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 149 transitions, 1376 flow, removed 51 selfloop flow, removed 7 redundant places.
[2024-06-03 21:53:15,115 INFO  L231             Difference]: Finished difference. Result has 112 places, 121 transitions, 1034 flow
[2024-06-03 21:53:15,115 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=912, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1034, PETRI_PLACES=112, PETRI_TRANSITIONS=121}
[2024-06-03 21:53:15,116 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 66 predicate places.
[2024-06-03 21:53:15,116 INFO  L495      AbstractCegarLoop]: Abstraction has has 112 places, 121 transitions, 1034 flow
[2024-06-03 21:53:15,116 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:53:15,116 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:53:15,116 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:53:15,116 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26
[2024-06-03 21:53:15,116 INFO  L420      AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:53:15,117 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:53:15,117 INFO  L85        PathProgramCache]: Analyzing trace with hash -1054843842, now seen corresponding path program 1 times
[2024-06-03 21:53:15,117 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:53:15,117 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537107899]
[2024-06-03 21:53:15,117 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:53:15,117 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:53:15,172 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:53:29,867 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:53:29,867 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:53:29,867 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537107899]
[2024-06-03 21:53:29,867 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537107899] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:53:29,867 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:53:29,867 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 21:53:29,868 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195694970]
[2024-06-03 21:53:29,868 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:53:29,868 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 21:53:29,868 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:53:29,868 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 21:53:29,868 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2024-06-03 21:53:30,098 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 45
[2024-06-03 21:53:30,099 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 121 transitions, 1034 flow. Second operand  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:53:30,099 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:53:30,099 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 45
[2024-06-03 21:53:30,099 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:53:31,924 INFO  L124   PetriNetUnfolderBase]: 2436/3856 cut-off events.
[2024-06-03 21:53:31,924 INFO  L125   PetriNetUnfolderBase]: For 124807/124807 co-relation queries the response was YES.
[2024-06-03 21:53:31,932 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 23775 conditions, 3856 events. 2436/3856 cut-off events. For 124807/124807 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 19917 event pairs, 813 based on Foata normal form. 2/3838 useless extension candidates. Maximal degree in co-relation 23727. Up to 3546 conditions per place. 
[2024-06-03 21:53:31,944 INFO  L140   encePairwiseOnDemand]: 33/45 looper letters, 129 selfloop transitions, 20 changer transitions 0/154 dead transitions.
[2024-06-03 21:53:31,944 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 154 transitions, 1465 flow
[2024-06-03 21:53:31,945 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 21:53:31,945 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 21:53:31,945 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 158 transitions.
[2024-06-03 21:53:31,945 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.39012345679012345
[2024-06-03 21:53:31,945 INFO  L175             Difference]: Start difference. First operand has 112 places, 121 transitions, 1034 flow. Second operand 9 states and 158 transitions.
[2024-06-03 21:53:31,945 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 154 transitions, 1465 flow
[2024-06-03 21:53:31,999 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 154 transitions, 1341 flow, removed 3 selfloop flow, removed 7 redundant places.
[2024-06-03 21:53:32,001 INFO  L231             Difference]: Finished difference. Result has 115 places, 127 transitions, 1035 flow
[2024-06-03 21:53:32,001 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=910, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1035, PETRI_PLACES=115, PETRI_TRANSITIONS=127}
[2024-06-03 21:53:32,002 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 69 predicate places.
[2024-06-03 21:53:32,002 INFO  L495      AbstractCegarLoop]: Abstraction has has 115 places, 127 transitions, 1035 flow
[2024-06-03 21:53:32,002 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:53:32,002 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:53:32,002 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:53:32,003 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27
[2024-06-03 21:53:32,003 INFO  L420      AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:53:32,003 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:53:32,003 INFO  L85        PathProgramCache]: Analyzing trace with hash -402481432, now seen corresponding path program 1 times
[2024-06-03 21:53:32,003 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:53:32,003 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545952741]
[2024-06-03 21:53:32,003 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:53:32,003 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:53:32,041 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:53:52,642 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:53:52,642 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:53:52,642 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545952741]
[2024-06-03 21:53:52,642 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545952741] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:53:52,643 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:53:52,643 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-03 21:53:52,643 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603667488]
[2024-06-03 21:53:52,643 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:53:52,643 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-03 21:53:52,643 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:53:52,644 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-03 21:53:52,644 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56
[2024-06-03 21:53:52,851 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 45
[2024-06-03 21:53:52,852 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 127 transitions, 1035 flow. Second operand  has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:53:52,852 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:53:52,852 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 45
[2024-06-03 21:53:52,852 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:53:54,723 INFO  L124   PetriNetUnfolderBase]: 2630/4084 cut-off events.
[2024-06-03 21:53:54,723 INFO  L125   PetriNetUnfolderBase]: For 153075/153075 co-relation queries the response was YES.
[2024-06-03 21:53:54,732 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 26498 conditions, 4084 events. 2630/4084 cut-off events. For 153075/153075 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 20828 event pairs, 920 based on Foata normal form. 1/4083 useless extension candidates. Maximal degree in co-relation 26448. Up to 3815 conditions per place. 
[2024-06-03 21:53:54,746 INFO  L140   encePairwiseOnDemand]: 37/45 looper letters, 112 selfloop transitions, 11 changer transitions 0/139 dead transitions.
[2024-06-03 21:53:54,746 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 139 transitions, 1331 flow
[2024-06-03 21:53:54,746 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-03 21:53:54,746 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-03 21:53:54,746 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 103 transitions.
[2024-06-03 21:53:54,747 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3814814814814815
[2024-06-03 21:53:54,747 INFO  L175             Difference]: Start difference. First operand has 115 places, 127 transitions, 1035 flow. Second operand 6 states and 103 transitions.
[2024-06-03 21:53:54,747 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 139 transitions, 1331 flow
[2024-06-03 21:53:54,824 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 139 transitions, 1251 flow, removed 23 selfloop flow, removed 6 redundant places.
[2024-06-03 21:53:54,826 INFO  L231             Difference]: Finished difference. Result has 115 places, 130 transitions, 1017 flow
[2024-06-03 21:53:54,826 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=955, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1017, PETRI_PLACES=115, PETRI_TRANSITIONS=130}
[2024-06-03 21:53:54,827 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 69 predicate places.
[2024-06-03 21:53:54,827 INFO  L495      AbstractCegarLoop]: Abstraction has has 115 places, 130 transitions, 1017 flow
[2024-06-03 21:53:54,827 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:53:54,827 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:53:54,827 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:53:54,827 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28
[2024-06-03 21:53:54,828 INFO  L420      AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:53:54,828 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:53:54,828 INFO  L85        PathProgramCache]: Analyzing trace with hash -1320323620, now seen corresponding path program 1 times
[2024-06-03 21:53:54,828 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:53:54,828 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349703560]
[2024-06-03 21:53:54,828 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:53:54,828 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:53:54,881 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:54:08,912 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:54:08,912 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:54:08,912 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349703560]
[2024-06-03 21:54:08,912 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349703560] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:54:08,912 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:54:08,912 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 21:54:08,912 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064948528]
[2024-06-03 21:54:08,912 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:54:08,912 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 21:54:08,913 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:54:08,913 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 21:54:08,913 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90
[2024-06-03 21:54:09,157 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45
[2024-06-03 21:54:09,157 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 130 transitions, 1017 flow. Second operand  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:54:09,157 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:54:09,157 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45
[2024-06-03 21:54:09,157 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:54:11,331 INFO  L124   PetriNetUnfolderBase]: 2627/4078 cut-off events.
[2024-06-03 21:54:11,331 INFO  L125   PetriNetUnfolderBase]: For 182922/182932 co-relation queries the response was YES.
[2024-06-03 21:54:11,341 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 28463 conditions, 4078 events. 2627/4078 cut-off events. For 182922/182932 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 21319 event pairs, 703 based on Foata normal form. 4/4074 useless extension candidates. Maximal degree in co-relation 28412. Up to 3676 conditions per place. 
[2024-06-03 21:54:11,356 INFO  L140   encePairwiseOnDemand]: 35/45 looper letters, 127 selfloop transitions, 17 changer transitions 0/163 dead transitions.
[2024-06-03 21:54:11,356 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 163 transitions, 1437 flow
[2024-06-03 21:54:11,357 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 21:54:11,357 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 21:54:11,357 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 156 transitions.
[2024-06-03 21:54:11,357 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43333333333333335
[2024-06-03 21:54:11,357 INFO  L175             Difference]: Start difference. First operand has 115 places, 130 transitions, 1017 flow. Second operand 8 states and 156 transitions.
[2024-06-03 21:54:11,358 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 163 transitions, 1437 flow
[2024-06-03 21:54:11,426 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 163 transitions, 1397 flow, removed 11 selfloop flow, removed 4 redundant places.
[2024-06-03 21:54:11,428 INFO  L231             Difference]: Finished difference. Result has 119 places, 132 transitions, 1076 flow
[2024-06-03 21:54:11,428 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=977, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1076, PETRI_PLACES=119, PETRI_TRANSITIONS=132}
[2024-06-03 21:54:11,429 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 73 predicate places.
[2024-06-03 21:54:11,429 INFO  L495      AbstractCegarLoop]: Abstraction has has 119 places, 132 transitions, 1076 flow
[2024-06-03 21:54:11,429 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:54:11,429 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:54:11,429 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:54:11,429 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29
[2024-06-03 21:54:11,429 INFO  L420      AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:54:11,430 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:54:11,430 INFO  L85        PathProgramCache]: Analyzing trace with hash -1320263170, now seen corresponding path program 2 times
[2024-06-03 21:54:11,430 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:54:11,430 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843402968]
[2024-06-03 21:54:11,430 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:54:11,430 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:54:11,478 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:54:24,475 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:54:24,475 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:54:24,475 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843402968]
[2024-06-03 21:54:24,475 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843402968] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:54:24,475 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:54:24,475 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 21:54:24,476 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497984901]
[2024-06-03 21:54:24,476 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:54:24,476 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 21:54:24,476 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:54:24,476 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 21:54:24,476 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90
[2024-06-03 21:54:24,800 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45
[2024-06-03 21:54:24,800 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 132 transitions, 1076 flow. Second operand  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:54:24,800 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:54:24,800 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45
[2024-06-03 21:54:24,800 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:54:26,947 INFO  L124   PetriNetUnfolderBase]: 2639/4100 cut-off events.
[2024-06-03 21:54:26,947 INFO  L125   PetriNetUnfolderBase]: For 196367/196377 co-relation queries the response was YES.
[2024-06-03 21:54:26,958 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 29287 conditions, 4100 events. 2639/4100 cut-off events. For 196367/196377 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 21473 event pairs, 858 based on Foata normal form. 4/4096 useless extension candidates. Maximal degree in co-relation 29235. Up to 3706 conditions per place. 
[2024-06-03 21:54:26,973 INFO  L140   encePairwiseOnDemand]: 35/45 looper letters, 125 selfloop transitions, 21 changer transitions 0/165 dead transitions.
[2024-06-03 21:54:26,973 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 165 transitions, 1506 flow
[2024-06-03 21:54:26,975 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 21:54:26,976 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 21:54:26,976 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 157 transitions.
[2024-06-03 21:54:26,976 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4361111111111111
[2024-06-03 21:54:26,976 INFO  L175             Difference]: Start difference. First operand has 119 places, 132 transitions, 1076 flow. Second operand 8 states and 157 transitions.
[2024-06-03 21:54:26,976 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 165 transitions, 1506 flow
[2024-06-03 21:54:27,044 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 165 transitions, 1425 flow, removed 25 selfloop flow, removed 6 redundant places.
[2024-06-03 21:54:27,045 INFO  L231             Difference]: Finished difference. Result has 121 places, 134 transitions, 1107 flow
[2024-06-03 21:54:27,045 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=995, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1107, PETRI_PLACES=121, PETRI_TRANSITIONS=134}
[2024-06-03 21:54:27,046 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 75 predicate places.
[2024-06-03 21:54:27,046 INFO  L495      AbstractCegarLoop]: Abstraction has has 121 places, 134 transitions, 1107 flow
[2024-06-03 21:54:27,046 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:54:27,046 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:54:27,046 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:54:27,046 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30
[2024-06-03 21:54:27,046 INFO  L420      AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:54:27,047 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:54:27,047 INFO  L85        PathProgramCache]: Analyzing trace with hash -1317581856, now seen corresponding path program 1 times
[2024-06-03 21:54:27,047 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:54:27,047 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035592900]
[2024-06-03 21:54:27,047 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:54:27,047 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:54:27,098 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:54:40,803 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:54:40,803 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:54:40,803 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035592900]
[2024-06-03 21:54:40,803 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035592900] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:54:40,803 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:54:40,803 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 21:54:40,803 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649346877]
[2024-06-03 21:54:40,803 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:54:40,803 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 21:54:40,804 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:54:40,804 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 21:54:40,804 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90
[2024-06-03 21:54:41,048 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 45
[2024-06-03 21:54:41,049 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 134 transitions, 1107 flow. Second operand  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:54:41,049 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:54:41,049 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 45
[2024-06-03 21:54:41,049 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:54:43,207 INFO  L124   PetriNetUnfolderBase]: 2784/4241 cut-off events.
[2024-06-03 21:54:43,207 INFO  L125   PetriNetUnfolderBase]: For 209600/209610 co-relation queries the response was YES.
[2024-06-03 21:54:43,218 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 30560 conditions, 4241 events. 2784/4241 cut-off events. For 209600/209610 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 21630 event pairs, 891 based on Foata normal form. 2/4235 useless extension candidates. Maximal degree in co-relation 30507. Up to 3942 conditions per place. 
[2024-06-03 21:54:43,234 INFO  L140   encePairwiseOnDemand]: 34/45 looper letters, 133 selfloop transitions, 25 changer transitions 0/165 dead transitions.
[2024-06-03 21:54:43,234 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 165 transitions, 1505 flow
[2024-06-03 21:54:43,237 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 21:54:43,237 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 21:54:43,237 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 151 transitions.
[2024-06-03 21:54:43,237 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41944444444444445
[2024-06-03 21:54:43,237 INFO  L175             Difference]: Start difference. First operand has 121 places, 134 transitions, 1107 flow. Second operand 8 states and 151 transitions.
[2024-06-03 21:54:43,237 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 165 transitions, 1505 flow
[2024-06-03 21:54:43,293 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 165 transitions, 1381 flow, removed 43 selfloop flow, removed 6 redundant places.
[2024-06-03 21:54:43,295 INFO  L231             Difference]: Finished difference. Result has 123 places, 134 transitions, 1045 flow
[2024-06-03 21:54:43,295 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=983, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1045, PETRI_PLACES=123, PETRI_TRANSITIONS=134}
[2024-06-03 21:54:43,296 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 77 predicate places.
[2024-06-03 21:54:43,296 INFO  L495      AbstractCegarLoop]: Abstraction has has 123 places, 134 transitions, 1045 flow
[2024-06-03 21:54:43,296 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:54:43,296 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:54:43,296 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:54:43,296 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31
[2024-06-03 21:54:43,296 INFO  L420      AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:54:43,296 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:54:43,296 INFO  L85        PathProgramCache]: Analyzing trace with hash -1317461700, now seen corresponding path program 1 times
[2024-06-03 21:54:43,297 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:54:43,297 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066204071]
[2024-06-03 21:54:43,297 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:54:43,297 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:54:43,364 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:54:53,787 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:54:53,788 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:54:53,788 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066204071]
[2024-06-03 21:54:53,788 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066204071] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:54:53,788 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:54:53,788 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-03 21:54:53,788 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164736829]
[2024-06-03 21:54:53,788 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:54:53,788 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-03 21:54:53,788 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:54:53,789 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-03 21:54:53,789 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56
[2024-06-03 21:54:53,905 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45
[2024-06-03 21:54:53,905 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 134 transitions, 1045 flow. Second operand  has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:54:53,905 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:54:53,905 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45
[2024-06-03 21:54:53,905 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:54:56,041 INFO  L124   PetriNetUnfolderBase]: 2806/4283 cut-off events.
[2024-06-03 21:54:56,041 INFO  L125   PetriNetUnfolderBase]: For 222153/222163 co-relation queries the response was YES.
[2024-06-03 21:54:56,053 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 31046 conditions, 4283 events. 2806/4283 cut-off events. For 222153/222163 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 21886 event pairs, 870 based on Foata normal form. 4/4279 useless extension candidates. Maximal degree in co-relation 30992. Up to 3969 conditions per place. 
[2024-06-03 21:54:56,071 INFO  L140   encePairwiseOnDemand]: 33/45 looper letters, 144 selfloop transitions, 22 changer transitions 0/173 dead transitions.
[2024-06-03 21:54:56,071 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 173 transitions, 1539 flow
[2024-06-03 21:54:56,073 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 21:54:56,073 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 21:54:56,074 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 167 transitions.
[2024-06-03 21:54:56,074 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4638888888888889
[2024-06-03 21:54:56,074 INFO  L175             Difference]: Start difference. First operand has 123 places, 134 transitions, 1045 flow. Second operand 8 states and 167 transitions.
[2024-06-03 21:54:56,074 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 173 transitions, 1539 flow
[2024-06-03 21:54:56,138 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 173 transitions, 1455 flow, removed 4 selfloop flow, removed 8 redundant places.
[2024-06-03 21:54:56,140 INFO  L231             Difference]: Finished difference. Result has 123 places, 137 transitions, 1085 flow
[2024-06-03 21:54:56,141 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=961, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1085, PETRI_PLACES=123, PETRI_TRANSITIONS=137}
[2024-06-03 21:54:56,141 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 77 predicate places.
[2024-06-03 21:54:56,141 INFO  L495      AbstractCegarLoop]: Abstraction has has 123 places, 137 transitions, 1085 flow
[2024-06-03 21:54:56,141 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:54:56,141 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:54:56,141 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:54:56,141 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32
[2024-06-03 21:54:56,141 INFO  L420      AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:54:56,141 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:54:56,142 INFO  L85        PathProgramCache]: Analyzing trace with hash -1201997550, now seen corresponding path program 2 times
[2024-06-03 21:54:56,142 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:54:56,142 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639331994]
[2024-06-03 21:54:56,142 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:54:56,142 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:54:56,192 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:55:09,657 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:55:09,657 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:55:09,658 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639331994]
[2024-06-03 21:55:09,658 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639331994] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:55:09,658 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:55:09,658 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 21:55:09,658 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796767277]
[2024-06-03 21:55:09,658 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:55:09,658 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 21:55:09,658 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:55:09,659 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 21:55:09,659 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90
[2024-06-03 21:55:09,897 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 45
[2024-06-03 21:55:09,897 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 137 transitions, 1085 flow. Second operand  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:55:09,897 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:55:09,897 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 45
[2024-06-03 21:55:09,897 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:55:12,106 INFO  L124   PetriNetUnfolderBase]: 2994/4576 cut-off events.
[2024-06-03 21:55:12,107 INFO  L125   PetriNetUnfolderBase]: For 252809/252819 co-relation queries the response was YES.
[2024-06-03 21:55:12,119 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 34627 conditions, 4576 events. 2994/4576 cut-off events. For 252809/252819 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 23699 event pairs, 792 based on Foata normal form. 14/4586 useless extension candidates. Maximal degree in co-relation 34573. Up to 3959 conditions per place. 
[2024-06-03 21:55:12,137 INFO  L140   encePairwiseOnDemand]: 32/45 looper letters, 131 selfloop transitions, 49 changer transitions 0/187 dead transitions.
[2024-06-03 21:55:12,138 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 187 transitions, 2041 flow
[2024-06-03 21:55:12,140 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 21:55:12,140 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 21:55:12,140 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 177 transitions.
[2024-06-03 21:55:12,140 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43703703703703706
[2024-06-03 21:55:12,141 INFO  L175             Difference]: Start difference. First operand has 123 places, 137 transitions, 1085 flow. Second operand 9 states and 177 transitions.
[2024-06-03 21:55:12,141 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 187 transitions, 2041 flow
[2024-06-03 21:55:12,214 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 187 transitions, 1941 flow, removed 30 selfloop flow, removed 6 redundant places.
[2024-06-03 21:55:12,216 INFO  L231             Difference]: Finished difference. Result has 128 places, 148 transitions, 1365 flow
[2024-06-03 21:55:12,217 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=985, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1365, PETRI_PLACES=128, PETRI_TRANSITIONS=148}
[2024-06-03 21:55:12,217 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 82 predicate places.
[2024-06-03 21:55:12,217 INFO  L495      AbstractCegarLoop]: Abstraction has has 128 places, 148 transitions, 1365 flow
[2024-06-03 21:55:12,217 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:55:12,217 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:55:12,217 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:55:12,217 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33
[2024-06-03 21:55:12,217 INFO  L420      AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:55:12,218 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:55:12,218 INFO  L85        PathProgramCache]: Analyzing trace with hash -1201991040, now seen corresponding path program 3 times
[2024-06-03 21:55:12,218 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:55:12,218 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671958247]
[2024-06-03 21:55:12,218 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:55:12,218 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:55:12,265 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:55:25,249 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:55:25,249 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:55:25,249 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671958247]
[2024-06-03 21:55:25,249 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671958247] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:55:25,249 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:55:25,249 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 21:55:25,249 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082582215]
[2024-06-03 21:55:25,249 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:55:25,249 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 21:55:25,250 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:55:25,250 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 21:55:25,250 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90
[2024-06-03 21:55:25,513 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 45
[2024-06-03 21:55:25,513 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 148 transitions, 1365 flow. Second operand  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:55:25,513 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:55:25,513 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 45
[2024-06-03 21:55:25,513 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:55:27,917 INFO  L124   PetriNetUnfolderBase]: 2980/4558 cut-off events.
[2024-06-03 21:55:27,917 INFO  L125   PetriNetUnfolderBase]: For 270782/270802 co-relation queries the response was YES.
[2024-06-03 21:55:27,930 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 35947 conditions, 4558 events. 2980/4558 cut-off events. For 270782/270802 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 23586 event pairs, 788 based on Foata normal form. 28/4582 useless extension candidates. Maximal degree in co-relation 35889. Up to 3955 conditions per place. 
[2024-06-03 21:55:27,947 INFO  L140   encePairwiseOnDemand]: 32/45 looper letters, 127 selfloop transitions, 51 changer transitions 0/185 dead transitions.
[2024-06-03 21:55:27,947 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 185 transitions, 1963 flow
[2024-06-03 21:55:27,949 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 21:55:27,949 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 21:55:27,950 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 174 transitions.
[2024-06-03 21:55:27,950 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42962962962962964
[2024-06-03 21:55:27,950 INFO  L175             Difference]: Start difference. First operand has 128 places, 148 transitions, 1365 flow. Second operand 9 states and 174 transitions.
[2024-06-03 21:55:27,950 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 185 transitions, 1963 flow
[2024-06-03 21:55:28,029 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 185 transitions, 1801 flow, removed 67 selfloop flow, removed 4 redundant places.
[2024-06-03 21:55:28,031 INFO  L231             Difference]: Finished difference. Result has 133 places, 148 transitions, 1315 flow
[2024-06-03 21:55:28,031 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=1203, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1315, PETRI_PLACES=133, PETRI_TRANSITIONS=148}
[2024-06-03 21:55:28,031 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 87 predicate places.
[2024-06-03 21:55:28,032 INFO  L495      AbstractCegarLoop]: Abstraction has has 133 places, 148 transitions, 1315 flow
[2024-06-03 21:55:28,032 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:55:28,032 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:55:28,032 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:55:28,032 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34
[2024-06-03 21:55:28,032 INFO  L420      AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:55:28,033 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:55:28,033 INFO  L85        PathProgramCache]: Analyzing trace with hash -1296753230, now seen corresponding path program 3 times
[2024-06-03 21:55:28,033 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:55:28,033 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877085630]
[2024-06-03 21:55:28,033 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:55:28,033 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:55:28,091 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:55:41,433 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:55:41,433 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:55:41,433 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877085630]
[2024-06-03 21:55:41,433 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877085630] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:55:41,433 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:55:41,433 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 21:55:41,433 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325587760]
[2024-06-03 21:55:41,434 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:55:41,434 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 21:55:41,434 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:55:41,434 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 21:55:41,434 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-03 21:55:41,631 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45
[2024-06-03 21:55:41,632 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 148 transitions, 1315 flow. Second operand  has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:55:41,632 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:55:41,632 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45
[2024-06-03 21:55:41,632 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:55:43,911 INFO  L124   PetriNetUnfolderBase]: 2833/4411 cut-off events.
[2024-06-03 21:55:43,911 INFO  L125   PetriNetUnfolderBase]: For 280764/280789 co-relation queries the response was YES.
[2024-06-03 21:55:43,923 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 35409 conditions, 4411 events. 2833/4411 cut-off events. For 280764/280789 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 23478 event pairs, 781 based on Foata normal form. 9/4409 useless extension candidates. Maximal degree in co-relation 35349. Up to 3974 conditions per place. 
[2024-06-03 21:55:43,940 INFO  L140   encePairwiseOnDemand]: 35/45 looper letters, 134 selfloop transitions, 26 changer transitions 0/179 dead transitions.
[2024-06-03 21:55:43,940 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 179 transitions, 1777 flow
[2024-06-03 21:55:43,942 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 21:55:43,942 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 21:55:43,943 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 157 transitions.
[2024-06-03 21:55:43,943 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4361111111111111
[2024-06-03 21:55:43,943 INFO  L175             Difference]: Start difference. First operand has 133 places, 148 transitions, 1315 flow. Second operand 8 states and 157 transitions.
[2024-06-03 21:55:43,943 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 179 transitions, 1777 flow
[2024-06-03 21:55:44,027 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 179 transitions, 1675 flow, removed 6 selfloop flow, removed 7 redundant places.
[2024-06-03 21:55:44,029 INFO  L231             Difference]: Finished difference. Result has 134 places, 150 transitions, 1342 flow
[2024-06-03 21:55:44,029 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=1213, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1342, PETRI_PLACES=134, PETRI_TRANSITIONS=150}
[2024-06-03 21:55:44,029 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 88 predicate places.
[2024-06-03 21:55:44,029 INFO  L495      AbstractCegarLoop]: Abstraction has has 134 places, 150 transitions, 1342 flow
[2024-06-03 21:55:44,030 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:55:44,030 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:55:44,030 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:55:44,030 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35
[2024-06-03 21:55:44,030 INFO  L420      AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:55:44,030 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:55:44,030 INFO  L85        PathProgramCache]: Analyzing trace with hash 630727594, now seen corresponding path program 4 times
[2024-06-03 21:55:44,030 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:55:44,030 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041653894]
[2024-06-03 21:55:44,030 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:55:44,030 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:55:44,070 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:55:57,321 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:55:57,321 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:55:57,321 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041653894]
[2024-06-03 21:55:57,321 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041653894] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:55:57,321 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:55:57,321 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 21:55:57,322 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623939168]
[2024-06-03 21:55:57,322 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:55:57,322 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 21:55:57,322 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:55:57,322 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 21:55:57,322 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90
[2024-06-03 21:55:57,537 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 45
[2024-06-03 21:55:57,538 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 150 transitions, 1342 flow. Second operand  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:55:57,538 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:55:57,538 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 45
[2024-06-03 21:55:57,538 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:55:59,916 INFO  L124   PetriNetUnfolderBase]: 3005/4599 cut-off events.
[2024-06-03 21:55:59,916 INFO  L125   PetriNetUnfolderBase]: For 294436/294456 co-relation queries the response was YES.
[2024-06-03 21:55:59,931 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 36824 conditions, 4599 events. 3005/4599 cut-off events. For 294436/294456 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 23853 event pairs, 819 based on Foata normal form. 24/4618 useless extension candidates. Maximal degree in co-relation 36763. Up to 3991 conditions per place. 
[2024-06-03 21:55:59,955 INFO  L140   encePairwiseOnDemand]: 32/45 looper letters, 133 selfloop transitions, 50 changer transitions 0/190 dead transitions.
[2024-06-03 21:55:59,955 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 190 transitions, 2032 flow
[2024-06-03 21:55:59,958 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 21:55:59,958 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 21:55:59,958 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 176 transitions.
[2024-06-03 21:55:59,958 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4345679012345679
[2024-06-03 21:55:59,958 INFO  L175             Difference]: Start difference. First operand has 134 places, 150 transitions, 1342 flow. Second operand 9 states and 176 transitions.
[2024-06-03 21:55:59,958 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 190 transitions, 2032 flow
[2024-06-03 21:56:00,083 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 190 transitions, 1921 flow, removed 31 selfloop flow, removed 6 redundant places.
[2024-06-03 21:56:00,085 INFO  L231             Difference]: Finished difference. Result has 137 places, 153 transitions, 1415 flow
[2024-06-03 21:56:00,085 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=1231, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1415, PETRI_PLACES=137, PETRI_TRANSITIONS=153}
[2024-06-03 21:56:00,085 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 91 predicate places.
[2024-06-03 21:56:00,085 INFO  L495      AbstractCegarLoop]: Abstraction has has 137 places, 153 transitions, 1415 flow
[2024-06-03 21:56:00,086 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:56:00,086 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:56:00,086 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:56:00,086 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36
[2024-06-03 21:56:00,086 INFO  L420      AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:56:00,086 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:56:00,087 INFO  L85        PathProgramCache]: Analyzing trace with hash 394630559, now seen corresponding path program 1 times
[2024-06-03 21:56:00,087 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:56:00,087 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706049649]
[2024-06-03 21:56:00,087 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:56:00,087 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:56:00,125 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:56:21,112 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:56:21,113 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:56:21,113 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706049649]
[2024-06-03 21:56:21,113 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706049649] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:56:21,113 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:56:21,113 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-03 21:56:21,113 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220555360]
[2024-06-03 21:56:21,113 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:56:21,113 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-03 21:56:21,113 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:56:21,113 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-03 21:56:21,114 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56
[2024-06-03 21:56:21,239 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 45
[2024-06-03 21:56:21,239 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 153 transitions, 1415 flow. Second operand  has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:56:21,239 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:56:21,239 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 45
[2024-06-03 21:56:21,239 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:56:23,507 INFO  L124   PetriNetUnfolderBase]: 3068/4677 cut-off events.
[2024-06-03 21:56:23,507 INFO  L125   PetriNetUnfolderBase]: For 308701/308706 co-relation queries the response was YES.
[2024-06-03 21:56:23,522 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 37549 conditions, 4677 events. 3068/4677 cut-off events. For 308701/308706 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 23798 event pairs, 890 based on Foata normal form. 1/4669 useless extension candidates. Maximal degree in co-relation 37487. Up to 4382 conditions per place. 
[2024-06-03 21:56:23,540 INFO  L140   encePairwiseOnDemand]: 37/45 looper letters, 142 selfloop transitions, 16 changer transitions 0/175 dead transitions.
[2024-06-03 21:56:23,540 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 175 transitions, 1917 flow
[2024-06-03 21:56:23,541 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-03 21:56:23,541 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-03 21:56:23,541 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 112 transitions.
[2024-06-03 21:56:23,541 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4148148148148148
[2024-06-03 21:56:23,542 INFO  L175             Difference]: Start difference. First operand has 137 places, 153 transitions, 1415 flow. Second operand 6 states and 112 transitions.
[2024-06-03 21:56:23,542 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 175 transitions, 1917 flow
[2024-06-03 21:56:23,658 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 175 transitions, 1787 flow, removed 30 selfloop flow, removed 6 redundant places.
[2024-06-03 21:56:23,660 INFO  L231             Difference]: Finished difference. Result has 137 places, 159 transitions, 1401 flow
[2024-06-03 21:56:23,660 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=1285, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1401, PETRI_PLACES=137, PETRI_TRANSITIONS=159}
[2024-06-03 21:56:23,661 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 91 predicate places.
[2024-06-03 21:56:23,661 INFO  L495      AbstractCegarLoop]: Abstraction has has 137 places, 159 transitions, 1401 flow
[2024-06-03 21:56:23,661 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:56:23,661 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:56:23,661 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:56:23,661 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37
[2024-06-03 21:56:23,661 INFO  L420      AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:56:23,662 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:56:23,662 INFO  L85        PathProgramCache]: Analyzing trace with hash 1659272756, now seen corresponding path program 5 times
[2024-06-03 21:56:23,662 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:56:23,662 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547225017]
[2024-06-03 21:56:23,662 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:56:23,662 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:56:23,703 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:56:37,165 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:56:37,165 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:56:37,165 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547225017]
[2024-06-03 21:56:37,165 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547225017] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:56:37,165 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:56:37,165 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 21:56:37,165 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710358791]
[2024-06-03 21:56:37,165 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:56:37,166 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 21:56:37,166 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:56:37,166 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 21:56:37,166 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90
[2024-06-03 21:56:37,427 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 45
[2024-06-03 21:56:37,428 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 159 transitions, 1401 flow. Second operand  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:56:37,428 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:56:37,428 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 45
[2024-06-03 21:56:37,428 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:56:39,789 INFO  L124   PetriNetUnfolderBase]: 3142/4774 cut-off events.
[2024-06-03 21:56:39,789 INFO  L125   PetriNetUnfolderBase]: For 333467/333496 co-relation queries the response was YES.
[2024-06-03 21:56:39,805 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 39315 conditions, 4774 events. 3142/4774 cut-off events. For 333467/333496 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 24653 event pairs, 782 based on Foata normal form. 21/4782 useless extension candidates. Maximal degree in co-relation 39252. Up to 3778 conditions per place. 
[2024-06-03 21:56:39,824 INFO  L140   encePairwiseOnDemand]: 32/45 looper letters, 108 selfloop transitions, 93 changer transitions 0/208 dead transitions.
[2024-06-03 21:56:39,824 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 208 transitions, 2485 flow
[2024-06-03 21:56:39,827 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 21:56:39,827 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 21:56:39,827 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 180 transitions.
[2024-06-03 21:56:39,827 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4444444444444444
[2024-06-03 21:56:39,827 INFO  L175             Difference]: Start difference. First operand has 137 places, 159 transitions, 1401 flow. Second operand 9 states and 180 transitions.
[2024-06-03 21:56:39,827 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 208 transitions, 2485 flow
[2024-06-03 21:56:39,956 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 208 transitions, 2445 flow, removed 16 selfloop flow, removed 2 redundant places.
[2024-06-03 21:56:39,958 INFO  L231             Difference]: Finished difference. Result has 145 places, 170 transitions, 1835 flow
[2024-06-03 21:56:39,958 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=1361, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=85, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1835, PETRI_PLACES=145, PETRI_TRANSITIONS=170}
[2024-06-03 21:56:39,959 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 99 predicate places.
[2024-06-03 21:56:39,959 INFO  L495      AbstractCegarLoop]: Abstraction has has 145 places, 170 transitions, 1835 flow
[2024-06-03 21:56:39,959 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:56:39,959 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:56:39,959 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:56:39,959 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38
[2024-06-03 21:56:39,959 INFO  L420      AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:56:39,959 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:56:39,959 INFO  L85        PathProgramCache]: Analyzing trace with hash 1650998546, now seen corresponding path program 6 times
[2024-06-03 21:56:39,960 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:56:39,960 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327984267]
[2024-06-03 21:56:39,960 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:56:39,960 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:56:40,002 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:56:53,703 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:56:53,703 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:56:53,703 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327984267]
[2024-06-03 21:56:53,703 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327984267] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:56:53,703 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:56:53,703 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 21:56:53,703 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120186815]
[2024-06-03 21:56:53,703 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:56:53,703 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 21:56:53,708 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:56:53,708 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 21:56:53,708 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90
[2024-06-03 21:56:53,951 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 45
[2024-06-03 21:56:53,951 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 170 transitions, 1835 flow. Second operand  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:56:53,951 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:56:53,951 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 45
[2024-06-03 21:56:53,951 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:56:56,439 INFO  L124   PetriNetUnfolderBase]: 3272/4983 cut-off events.
[2024-06-03 21:56:56,439 INFO  L125   PetriNetUnfolderBase]: For 365551/365580 co-relation queries the response was YES.
[2024-06-03 21:56:56,455 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 43204 conditions, 4983 events. 3272/4983 cut-off events. For 365551/365580 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 26048 event pairs, 788 based on Foata normal form. 17/4987 useless extension candidates. Maximal degree in co-relation 43138. Up to 3864 conditions per place. 
[2024-06-03 21:56:56,475 INFO  L140   encePairwiseOnDemand]: 32/45 looper letters, 121 selfloop transitions, 91 changer transitions 0/219 dead transitions.
[2024-06-03 21:56:56,475 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 219 transitions, 3067 flow
[2024-06-03 21:56:56,477 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 21:56:56,477 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 21:56:56,478 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 184 transitions.
[2024-06-03 21:56:56,478 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.454320987654321
[2024-06-03 21:56:56,478 INFO  L175             Difference]: Start difference. First operand has 145 places, 170 transitions, 1835 flow. Second operand 9 states and 184 transitions.
[2024-06-03 21:56:56,478 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 219 transitions, 3067 flow
[2024-06-03 21:56:56,633 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 219 transitions, 2863 flow, removed 67 selfloop flow, removed 4 redundant places.
[2024-06-03 21:56:56,636 INFO  L231             Difference]: Finished difference. Result has 151 places, 178 transitions, 2036 flow
[2024-06-03 21:56:56,636 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=1647, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2036, PETRI_PLACES=151, PETRI_TRANSITIONS=178}
[2024-06-03 21:56:56,636 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 105 predicate places.
[2024-06-03 21:56:56,637 INFO  L495      AbstractCegarLoop]: Abstraction has has 151 places, 178 transitions, 2036 flow
[2024-06-03 21:56:56,637 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:56:56,637 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:56:56,637 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:56:56,637 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39
[2024-06-03 21:56:56,637 INFO  L420      AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:56:56,637 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:56:56,638 INFO  L85        PathProgramCache]: Analyzing trace with hash 1422912946, now seen corresponding path program 4 times
[2024-06-03 21:56:56,638 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:56:56,638 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980619880]
[2024-06-03 21:56:56,638 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:56:56,638 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:56:56,699 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:57:10,342 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:57:10,342 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:57:10,342 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980619880]
[2024-06-03 21:57:10,342 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980619880] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:57:10,342 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:57:10,342 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 21:57:10,342 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859688710]
[2024-06-03 21:57:10,342 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:57:10,343 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 21:57:10,343 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:57:10,343 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 21:57:10,343 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-03 21:57:10,556 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45
[2024-06-03 21:57:10,557 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 178 transitions, 2036 flow. Second operand  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:57:10,557 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:57:10,557 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45
[2024-06-03 21:57:10,557 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:57:13,014 INFO  L124   PetriNetUnfolderBase]: 3071/4758 cut-off events.
[2024-06-03 21:57:13,014 INFO  L125   PetriNetUnfolderBase]: For 373816/373855 co-relation queries the response was YES.
[2024-06-03 21:57:13,031 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 42122 conditions, 4758 events. 3071/4758 cut-off events. For 373816/373855 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 25517 event pairs, 802 based on Foata normal form. 13/4742 useless extension candidates. Maximal degree in co-relation 42053. Up to 4266 conditions per place. 
[2024-06-03 21:57:13,050 INFO  L140   encePairwiseOnDemand]: 35/45 looper letters, 154 selfloop transitions, 33 changer transitions 0/206 dead transitions.
[2024-06-03 21:57:13,051 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 206 transitions, 2548 flow
[2024-06-03 21:57:13,054 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 21:57:13,055 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 21:57:13,055 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 156 transitions.
[2024-06-03 21:57:13,055 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43333333333333335
[2024-06-03 21:57:13,055 INFO  L175             Difference]: Start difference. First operand has 151 places, 178 transitions, 2036 flow. Second operand 8 states and 156 transitions.
[2024-06-03 21:57:13,055 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 206 transitions, 2548 flow
[2024-06-03 21:57:13,226 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 206 transitions, 2336 flow, removed 46 selfloop flow, removed 5 redundant places.
[2024-06-03 21:57:13,228 INFO  L231             Difference]: Finished difference. Result has 154 places, 180 transitions, 1971 flow
[2024-06-03 21:57:13,228 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=1824, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1971, PETRI_PLACES=154, PETRI_TRANSITIONS=180}
[2024-06-03 21:57:13,229 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 108 predicate places.
[2024-06-03 21:57:13,229 INFO  L495      AbstractCegarLoop]: Abstraction has has 154 places, 180 transitions, 1971 flow
[2024-06-03 21:57:13,229 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:57:13,229 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:57:13,229 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:57:13,229 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40
[2024-06-03 21:57:13,229 INFO  L420      AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:57:13,229 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:57:13,229 INFO  L85        PathProgramCache]: Analyzing trace with hash -1780851508, now seen corresponding path program 7 times
[2024-06-03 21:57:13,229 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:57:13,229 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575236542]
[2024-06-03 21:57:13,229 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:57:13,229 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:57:13,269 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:57:28,327 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:57:28,328 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:57:28,328 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575236542]
[2024-06-03 21:57:28,328 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575236542] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:57:28,328 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:57:28,328 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 21:57:28,328 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312548064]
[2024-06-03 21:57:28,328 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:57:28,329 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 21:57:28,329 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:57:28,329 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 21:57:28,329 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90
[2024-06-03 21:57:28,573 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 45
[2024-06-03 21:57:28,574 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 180 transitions, 1971 flow. Second operand  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:57:28,574 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:57:28,574 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 45
[2024-06-03 21:57:28,574 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:57:31,139 INFO  L124   PetriNetUnfolderBase]: 3318/5059 cut-off events.
[2024-06-03 21:57:31,139 INFO  L125   PetriNetUnfolderBase]: For 393459/393488 co-relation queries the response was YES.
[2024-06-03 21:57:31,156 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 43769 conditions, 5059 events. 3318/5059 cut-off events. For 393459/393488 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 26582 event pairs, 811 based on Foata normal form. 13/5059 useless extension candidates. Maximal degree in co-relation 43699. Up to 3888 conditions per place. 
[2024-06-03 21:57:31,178 INFO  L140   encePairwiseOnDemand]: 32/45 looper letters, 120 selfloop transitions, 102 changer transitions 0/229 dead transitions.
[2024-06-03 21:57:31,178 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 229 transitions, 3276 flow
[2024-06-03 21:57:31,180 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 21:57:31,180 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 21:57:31,181 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 184 transitions.
[2024-06-03 21:57:31,181 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.454320987654321
[2024-06-03 21:57:31,181 INFO  L175             Difference]: Start difference. First operand has 154 places, 180 transitions, 1971 flow. Second operand 9 states and 184 transitions.
[2024-06-03 21:57:31,181 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 229 transitions, 3276 flow
[2024-06-03 21:57:31,318 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 229 transitions, 3147 flow, removed 33 selfloop flow, removed 6 redundant places.
[2024-06-03 21:57:31,321 INFO  L231             Difference]: Finished difference. Result has 159 places, 190 transitions, 2390 flow
[2024-06-03 21:57:31,321 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=1842, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=92, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2390, PETRI_PLACES=159, PETRI_TRANSITIONS=190}
[2024-06-03 21:57:31,322 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 113 predicate places.
[2024-06-03 21:57:31,322 INFO  L495      AbstractCegarLoop]: Abstraction has has 159 places, 190 transitions, 2390 flow
[2024-06-03 21:57:31,322 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:57:31,322 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:57:31,322 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:57:31,322 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41
[2024-06-03 21:57:31,322 INFO  L420      AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:57:31,323 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:57:31,323 INFO  L85        PathProgramCache]: Analyzing trace with hash -1780678528, now seen corresponding path program 8 times
[2024-06-03 21:57:31,323 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:57:31,323 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801464531]
[2024-06-03 21:57:31,323 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:57:31,323 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:57:31,363 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:57:46,177 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:57:46,177 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:57:46,178 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801464531]
[2024-06-03 21:57:46,179 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801464531] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:57:46,179 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:57:46,179 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 21:57:46,180 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324472826]
[2024-06-03 21:57:46,180 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:57:46,180 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 21:57:46,180 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:57:46,180 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 21:57:46,180 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90
[2024-06-03 21:57:46,368 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 45
[2024-06-03 21:57:46,368 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 190 transitions, 2390 flow. Second operand  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:57:46,368 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:57:46,368 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 45
[2024-06-03 21:57:46,369 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:57:49,086 INFO  L124   PetriNetUnfolderBase]: 3340/5091 cut-off events.
[2024-06-03 21:57:49,087 INFO  L125   PetriNetUnfolderBase]: For 418892/418921 co-relation queries the response was YES.
[2024-06-03 21:57:49,105 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 45902 conditions, 5091 events. 3340/5091 cut-off events. For 418892/418921 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 26865 event pairs, 820 based on Foata normal form. 13/5091 useless extension candidates. Maximal degree in co-relation 45829. Up to 3897 conditions per place. 
[2024-06-03 21:57:49,127 INFO  L140   encePairwiseOnDemand]: 32/45 looper letters, 131 selfloop transitions, 97 changer transitions 0/235 dead transitions.
[2024-06-03 21:57:49,127 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 235 transitions, 3742 flow
[2024-06-03 21:57:49,130 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 21:57:49,130 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 21:57:49,130 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 188 transitions.
[2024-06-03 21:57:49,130 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4641975308641975
[2024-06-03 21:57:49,130 INFO  L175             Difference]: Start difference. First operand has 159 places, 190 transitions, 2390 flow. Second operand 9 states and 188 transitions.
[2024-06-03 21:57:49,130 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 235 transitions, 3742 flow
[2024-06-03 21:57:49,326 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 235 transitions, 3449 flow, removed 59 selfloop flow, removed 6 redundant places.
[2024-06-03 21:57:49,328 INFO  L231             Difference]: Finished difference. Result has 162 places, 194 transitions, 2421 flow
[2024-06-03 21:57:49,329 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=2115, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=94, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2421, PETRI_PLACES=162, PETRI_TRANSITIONS=194}
[2024-06-03 21:57:49,329 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 116 predicate places.
[2024-06-03 21:57:49,329 INFO  L495      AbstractCegarLoop]: Abstraction has has 162 places, 194 transitions, 2421 flow
[2024-06-03 21:57:49,329 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:57:49,330 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:57:49,330 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:57:49,330 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42
[2024-06-03 21:57:49,330 INFO  L420      AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:57:49,330 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:57:49,330 INFO  L85        PathProgramCache]: Analyzing trace with hash -1552777378, now seen corresponding path program 9 times
[2024-06-03 21:57:49,330 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:57:49,330 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137841085]
[2024-06-03 21:57:49,330 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:57:49,330 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:57:49,370 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:58:04,165 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:58:04,165 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:58:04,165 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137841085]
[2024-06-03 21:58:04,165 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137841085] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:58:04,165 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:58:04,165 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 21:58:04,165 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166791785]
[2024-06-03 21:58:04,165 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:58:04,165 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 21:58:04,166 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:58:04,166 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 21:58:04,166 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90
[2024-06-03 21:58:04,427 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 45
[2024-06-03 21:58:04,427 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 194 transitions, 2421 flow. Second operand  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:58:04,427 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:58:04,427 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 45
[2024-06-03 21:58:04,427 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:58:06,946 INFO  L124   PetriNetUnfolderBase]: 3330/5077 cut-off events.
[2024-06-03 21:58:06,946 INFO  L125   PetriNetUnfolderBase]: For 430203/430232 co-relation queries the response was YES.
[2024-06-03 21:58:06,962 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 45345 conditions, 5077 events. 3330/5077 cut-off events. For 430203/430232 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 26790 event pairs, 783 based on Foata normal form. 13/5077 useless extension candidates. Maximal degree in co-relation 45272. Up to 3893 conditions per place. 
[2024-06-03 21:58:06,983 INFO  L140   encePairwiseOnDemand]: 32/45 looper letters, 120 selfloop transitions, 104 changer transitions 0/231 dead transitions.
[2024-06-03 21:58:06,983 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 231 transitions, 3321 flow
[2024-06-03 21:58:06,985 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 21:58:06,985 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 21:58:06,985 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 181 transitions.
[2024-06-03 21:58:06,986 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4469135802469136
[2024-06-03 21:58:06,986 INFO  L175             Difference]: Start difference. First operand has 162 places, 194 transitions, 2421 flow. Second operand 9 states and 181 transitions.
[2024-06-03 21:58:06,986 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 231 transitions, 3321 flow
[2024-06-03 21:58:07,146 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 231 transitions, 3056 flow, removed 33 selfloop flow, removed 6 redundant places.
[2024-06-03 21:58:07,149 INFO  L231             Difference]: Finished difference. Result has 165 places, 194 transitions, 2372 flow
[2024-06-03 21:58:07,149 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=2156, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=104, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2372, PETRI_PLACES=165, PETRI_TRANSITIONS=194}
[2024-06-03 21:58:07,150 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 119 predicate places.
[2024-06-03 21:58:07,150 INFO  L495      AbstractCegarLoop]: Abstraction has has 165 places, 194 transitions, 2372 flow
[2024-06-03 21:58:07,150 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:58:07,150 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:58:07,151 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:58:07,151 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43
[2024-06-03 21:58:07,151 INFO  L420      AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:58:07,151 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:58:07,151 INFO  L85        PathProgramCache]: Analyzing trace with hash -1780672018, now seen corresponding path program 10 times
[2024-06-03 21:58:07,151 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:58:07,151 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543515096]
[2024-06-03 21:58:07,151 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:58:07,152 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:58:07,192 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:58:21,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-06-03 21:58:21,111 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:58:21,112 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543515096]
[2024-06-03 21:58:21,112 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543515096] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:58:21,112 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:58:21,112 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 21:58:21,112 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178049833]
[2024-06-03 21:58:21,112 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:58:21,112 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 21:58:21,112 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:58:21,112 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 21:58:21,112 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90
[2024-06-03 21:58:21,342 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 45
[2024-06-03 21:58:21,342 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 194 transitions, 2372 flow. Second operand  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:58:21,342 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:58:21,342 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 45
[2024-06-03 21:58:21,342 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:58:23,905 INFO  L124   PetriNetUnfolderBase]: 3316/5059 cut-off events.
[2024-06-03 21:58:23,905 INFO  L125   PetriNetUnfolderBase]: For 442526/442555 co-relation queries the response was YES.
[2024-06-03 21:58:23,923 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 45141 conditions, 5059 events. 3316/5059 cut-off events. For 442526/442555 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 26613 event pairs, 814 based on Foata normal form. 17/5063 useless extension candidates. Maximal degree in co-relation 45068. Up to 3889 conditions per place. 
[2024-06-03 21:58:23,946 INFO  L140   encePairwiseOnDemand]: 32/45 looper letters, 129 selfloop transitions, 97 changer transitions 0/233 dead transitions.
[2024-06-03 21:58:23,946 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 233 transitions, 3458 flow
[2024-06-03 21:58:23,948 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 21:58:23,948 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 21:58:23,948 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 185 transitions.
[2024-06-03 21:58:23,949 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4567901234567901
[2024-06-03 21:58:23,949 INFO  L175             Difference]: Start difference. First operand has 165 places, 194 transitions, 2372 flow. Second operand 9 states and 185 transitions.
[2024-06-03 21:58:23,949 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 233 transitions, 3458 flow
[2024-06-03 21:58:24,165 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 233 transitions, 3084 flow, removed 64 selfloop flow, removed 8 redundant places.
[2024-06-03 21:58:24,168 INFO  L231             Difference]: Finished difference. Result has 166 places, 194 transitions, 2202 flow
[2024-06-03 21:58:24,168 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=1998, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=97, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2202, PETRI_PLACES=166, PETRI_TRANSITIONS=194}
[2024-06-03 21:58:24,168 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 120 predicate places.
[2024-06-03 21:58:24,168 INFO  L495      AbstractCegarLoop]: Abstraction has has 166 places, 194 transitions, 2202 flow
[2024-06-03 21:58:24,168 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:58:24,169 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:58:24,169 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:58:24,169 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44
[2024-06-03 21:58:24,169 INFO  L420      AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:58:24,169 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:58:24,169 INFO  L85        PathProgramCache]: Analyzing trace with hash 407963039, now seen corresponding path program 2 times
[2024-06-03 21:58:24,169 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:58:24,169 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374320307]
[2024-06-03 21:58:24,170 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:58:24,170 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:58:24,207 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:58:44,583 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:58:44,583 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:58:44,583 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374320307]
[2024-06-03 21:58:44,583 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374320307] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:58:44,583 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:58:44,583 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-03 21:58:44,584 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372670095]
[2024-06-03 21:58:44,584 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:58:44,584 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-03 21:58:44,584 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:58:44,584 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-03 21:58:44,584 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56
[2024-06-03 21:58:44,727 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 45
[2024-06-03 21:58:44,727 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 194 transitions, 2202 flow. Second operand  has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:58:44,727 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:58:44,727 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 45
[2024-06-03 21:58:44,727 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:58:47,066 INFO  L124   PetriNetUnfolderBase]: 3412/5176 cut-off events.
[2024-06-03 21:58:47,066 INFO  L125   PetriNetUnfolderBase]: For 450478/450511 co-relation queries the response was YES.
[2024-06-03 21:58:47,084 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 44698 conditions, 5176 events. 3412/5176 cut-off events. For 450478/450511 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 26849 event pairs, 949 based on Foata normal form. 13/5160 useless extension candidates. Maximal degree in co-relation 44624. Up to 4892 conditions per place. 
[2024-06-03 21:58:47,102 INFO  L140   encePairwiseOnDemand]: 37/45 looper letters, 170 selfloop transitions, 16 changer transitions 0/203 dead transitions.
[2024-06-03 21:58:47,102 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 203 transitions, 2596 flow
[2024-06-03 21:58:47,103 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-03 21:58:47,103 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-03 21:58:47,103 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 105 transitions.
[2024-06-03 21:58:47,103 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3888888888888889
[2024-06-03 21:58:47,103 INFO  L175             Difference]: Start difference. First operand has 166 places, 194 transitions, 2202 flow. Second operand 6 states and 105 transitions.
[2024-06-03 21:58:47,103 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 203 transitions, 2596 flow
[2024-06-03 21:58:47,265 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 203 transitions, 2337 flow, removed 12 selfloop flow, removed 8 redundant places.
[2024-06-03 21:58:47,267 INFO  L231             Difference]: Finished difference. Result has 164 places, 194 transitions, 1981 flow
[2024-06-03 21:58:47,267 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=1943, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1981, PETRI_PLACES=164, PETRI_TRANSITIONS=194}
[2024-06-03 21:58:47,267 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 118 predicate places.
[2024-06-03 21:58:47,267 INFO  L495      AbstractCegarLoop]: Abstraction has has 164 places, 194 transitions, 1981 flow
[2024-06-03 21:58:47,267 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:58:47,267 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:58:47,268 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:58:47,268 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45
[2024-06-03 21:58:47,268 INFO  L420      AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:58:47,268 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:58:47,268 INFO  L85        PathProgramCache]: Analyzing trace with hash -1809123083, now seen corresponding path program 1 times
[2024-06-03 21:58:47,268 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:58:47,268 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461027997]
[2024-06-03 21:58:47,268 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:58:47,268 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:58:47,315 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:59:03,657 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:59:03,657 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:59:03,657 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461027997]
[2024-06-03 21:59:03,657 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461027997] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:59:03,657 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:59:03,657 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-03 21:59:03,657 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969020191]
[2024-06-03 21:59:03,657 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:59:03,657 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-03 21:59:03,657 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:59:03,658 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-03 21:59:03,658 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-03 21:59:03,827 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45
[2024-06-03 21:59:03,827 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 194 transitions, 1981 flow. Second operand  has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:59:03,827 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:59:03,828 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45
[2024-06-03 21:59:03,828 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:59:06,009 INFO  L124   PetriNetUnfolderBase]: 3093/4822 cut-off events.
[2024-06-03 21:59:06,009 INFO  L125   PetriNetUnfolderBase]: For 405706/405721 co-relation queries the response was YES.
[2024-06-03 21:59:06,025 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 40125 conditions, 4822 events. 3093/4822 cut-off events. For 405706/405721 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 25793 event pairs, 822 based on Foata normal form. 1/4790 useless extension candidates. Maximal degree in co-relation 40050. Up to 4436 conditions per place. 
[2024-06-03 21:59:06,043 INFO  L140   encePairwiseOnDemand]: 37/45 looper letters, 179 selfloop transitions, 16 changer transitions 0/213 dead transitions.
[2024-06-03 21:59:06,044 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 213 transitions, 2583 flow
[2024-06-03 21:59:06,044 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-03 21:59:06,044 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-03 21:59:06,044 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 114 transitions.
[2024-06-03 21:59:06,044 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4222222222222222
[2024-06-03 21:59:06,044 INFO  L175             Difference]: Start difference. First operand has 164 places, 194 transitions, 1981 flow. Second operand 6 states and 114 transitions.
[2024-06-03 21:59:06,044 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 213 transitions, 2583 flow
[2024-06-03 21:59:06,250 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 213 transitions, 2539 flow, removed 4 selfloop flow, removed 5 redundant places.
[2024-06-03 21:59:06,253 INFO  L231             Difference]: Finished difference. Result has 165 places, 200 transitions, 2069 flow
[2024-06-03 21:59:06,253 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=1937, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2069, PETRI_PLACES=165, PETRI_TRANSITIONS=200}
[2024-06-03 21:59:06,253 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 119 predicate places.
[2024-06-03 21:59:06,254 INFO  L495      AbstractCegarLoop]: Abstraction has has 165 places, 200 transitions, 2069 flow
[2024-06-03 21:59:06,254 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:59:06,254 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:59:06,254 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:59:06,254 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46
[2024-06-03 21:59:06,254 INFO  L420      AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:59:06,254 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:59:06,254 INFO  L85        PathProgramCache]: Analyzing trace with hash 1753032641, now seen corresponding path program 2 times
[2024-06-03 21:59:06,254 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:59:06,254 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416298566]
[2024-06-03 21:59:06,254 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:59:06,254 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:59:06,306 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:59:23,276 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:59:23,276 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:59:23,276 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416298566]
[2024-06-03 21:59:23,276 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416298566] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:59:23,277 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:59:23,277 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-03 21:59:23,277 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516654954]
[2024-06-03 21:59:23,277 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:59:23,277 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-03 21:59:23,277 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:59:23,277 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-03 21:59:23,277 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-03 21:59:23,385 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45
[2024-06-03 21:59:23,386 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 200 transitions, 2069 flow. Second operand  has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:59:23,386 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:59:23,386 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45
[2024-06-03 21:59:23,386 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:59:25,546 INFO  L124   PetriNetUnfolderBase]: 3090/4818 cut-off events.
[2024-06-03 21:59:25,546 INFO  L125   PetriNetUnfolderBase]: For 420854/420869 co-relation queries the response was YES.
[2024-06-03 21:59:25,563 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 40741 conditions, 4818 events. 3090/4818 cut-off events. For 420854/420869 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 25805 event pairs, 821 based on Foata normal form. 1/4786 useless extension candidates. Maximal degree in co-relation 40665. Up to 4445 conditions per place. 
[2024-06-03 21:59:25,581 INFO  L140   encePairwiseOnDemand]: 37/45 looper letters, 180 selfloop transitions, 11 changer transitions 0/209 dead transitions.
[2024-06-03 21:59:25,581 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 209 transitions, 2473 flow
[2024-06-03 21:59:25,582 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-03 21:59:25,582 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-03 21:59:25,582 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 108 transitions.
[2024-06-03 21:59:25,582 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4
[2024-06-03 21:59:25,582 INFO  L175             Difference]: Start difference. First operand has 165 places, 200 transitions, 2069 flow. Second operand 6 states and 108 transitions.
[2024-06-03 21:59:25,582 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 209 transitions, 2473 flow
[2024-06-03 21:59:25,801 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 209 transitions, 2393 flow, removed 36 selfloop flow, removed 2 redundant places.
[2024-06-03 21:59:25,803 INFO  L231             Difference]: Finished difference. Result has 169 places, 200 transitions, 2017 flow
[2024-06-03 21:59:25,804 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=1989, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2017, PETRI_PLACES=169, PETRI_TRANSITIONS=200}
[2024-06-03 21:59:25,804 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 123 predicate places.
[2024-06-03 21:59:25,804 INFO  L495      AbstractCegarLoop]: Abstraction has has 169 places, 200 transitions, 2017 flow
[2024-06-03 21:59:25,804 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:59:25,804 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:59:25,804 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:59:25,804 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47
[2024-06-03 21:59:25,804 INFO  L420      AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:59:25,804 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:59:25,805 INFO  L85        PathProgramCache]: Analyzing trace with hash 1659580586, now seen corresponding path program 1 times
[2024-06-03 21:59:25,805 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:59:25,805 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287867223]
[2024-06-03 21:59:25,805 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:59:25,805 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:59:25,848 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:59:40,331 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:59:40,331 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:59:40,331 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287867223]
[2024-06-03 21:59:40,331 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287867223] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:59:40,331 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:59:40,331 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-03 21:59:40,331 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82017353]
[2024-06-03 21:59:40,331 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:59:40,331 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-03 21:59:40,331 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:59:40,332 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-03 21:59:40,332 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110
[2024-06-03 21:59:40,544 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 45
[2024-06-03 21:59:40,545 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 200 transitions, 2017 flow. Second operand  has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:59:40,545 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:59:40,545 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 45
[2024-06-03 21:59:40,545 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:59:43,066 INFO  L124   PetriNetUnfolderBase]: 3258/4995 cut-off events.
[2024-06-03 21:59:43,066 INFO  L125   PetriNetUnfolderBase]: For 433511/433511 co-relation queries the response was YES.
[2024-06-03 21:59:43,085 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 41683 conditions, 4995 events. 3258/4995 cut-off events. For 433511/433511 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 25942 event pairs, 861 based on Foata normal form. 4/4987 useless extension candidates. Maximal degree in co-relation 41605. Up to 4681 conditions per place. 
[2024-06-03 21:59:43,105 INFO  L140   encePairwiseOnDemand]: 33/45 looper letters, 206 selfloop transitions, 22 changer transitions 0/234 dead transitions.
[2024-06-03 21:59:43,105 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 234 transitions, 2623 flow
[2024-06-03 21:59:43,107 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-03 21:59:43,107 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-03 21:59:43,107 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 174 transitions.
[2024-06-03 21:59:43,108 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.38666666666666666
[2024-06-03 21:59:43,108 INFO  L175             Difference]: Start difference. First operand has 169 places, 200 transitions, 2017 flow. Second operand 10 states and 174 transitions.
[2024-06-03 21:59:43,108 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 234 transitions, 2623 flow
[2024-06-03 21:59:43,378 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 234 transitions, 2593 flow, removed 2 selfloop flow, removed 5 redundant places.
[2024-06-03 21:59:43,381 INFO  L231             Difference]: Finished difference. Result has 174 places, 202 transitions, 2112 flow
[2024-06-03 21:59:43,381 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=1987, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2112, PETRI_PLACES=174, PETRI_TRANSITIONS=202}
[2024-06-03 21:59:43,381 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 128 predicate places.
[2024-06-03 21:59:43,382 INFO  L495      AbstractCegarLoop]: Abstraction has has 174 places, 202 transitions, 2112 flow
[2024-06-03 21:59:43,382 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:59:43,382 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:59:43,382 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:59:43,382 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48
[2024-06-03 21:59:43,382 INFO  L420      AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:59:43,382 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:59:43,382 INFO  L85        PathProgramCache]: Analyzing trace with hash 1710143521, now seen corresponding path program 1 times
[2024-06-03 21:59:43,383 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:59:43,383 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191512828]
[2024-06-03 21:59:43,383 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:59:43,383 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:59:43,420 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:00:05,096 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:00:05,096 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:00:05,096 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191512828]
[2024-06-03 22:00:05,096 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191512828] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:00:05,096 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:00:05,096 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 22:00:05,097 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190939297]
[2024-06-03 22:00:05,097 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:00:05,097 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 22:00:05,097 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:00:05,097 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 22:00:05,097 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72
[2024-06-03 22:00:05,234 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 45
[2024-06-03 22:00:05,234 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 202 transitions, 2112 flow. Second operand  has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:00:05,234 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:00:05,234 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 45
[2024-06-03 22:00:05,234 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:00:07,589 INFO  L124   PetriNetUnfolderBase]: 3278/5006 cut-off events.
[2024-06-03 22:00:07,590 INFO  L125   PetriNetUnfolderBase]: For 448178/448193 co-relation queries the response was YES.
[2024-06-03 22:00:07,609 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 42498 conditions, 5006 events. 3278/5006 cut-off events. For 448178/448193 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 25887 event pairs, 879 based on Foata normal form. 2/4985 useless extension candidates. Maximal degree in co-relation 42419. Up to 4760 conditions per place. 
[2024-06-03 22:00:07,628 INFO  L140   encePairwiseOnDemand]: 36/45 looper letters, 186 selfloop transitions, 14 changer transitions 0/216 dead transitions.
[2024-06-03 22:00:07,628 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 216 transitions, 2576 flow
[2024-06-03 22:00:07,628 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-03 22:00:07,628 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-03 22:00:07,628 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 117 transitions.
[2024-06-03 22:00:07,629 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.37142857142857144
[2024-06-03 22:00:07,629 INFO  L175             Difference]: Start difference. First operand has 174 places, 202 transitions, 2112 flow. Second operand 7 states and 117 transitions.
[2024-06-03 22:00:07,629 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 216 transitions, 2576 flow
[2024-06-03 22:00:07,922 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 216 transitions, 2469 flow, removed 33 selfloop flow, removed 8 redundant places.
[2024-06-03 22:00:07,924 INFO  L231             Difference]: Finished difference. Result has 173 places, 205 transitions, 2083 flow
[2024-06-03 22:00:07,925 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=2005, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2083, PETRI_PLACES=173, PETRI_TRANSITIONS=205}
[2024-06-03 22:00:07,925 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 127 predicate places.
[2024-06-03 22:00:07,925 INFO  L495      AbstractCegarLoop]: Abstraction has has 173 places, 205 transitions, 2083 flow
[2024-06-03 22:00:07,925 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:00:07,925 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:00:07,926 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:00:07,926 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49
[2024-06-03 22:00:07,926 INFO  L420      AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:00:07,926 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:00:07,926 INFO  L85        PathProgramCache]: Analyzing trace with hash -912268004, now seen corresponding path program 1 times
[2024-06-03 22:00:07,926 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:00:07,926 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978069282]
[2024-06-03 22:00:07,926 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:00:07,927 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:00:07,971 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:00:22,828 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:00:22,829 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:00:22,829 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978069282]
[2024-06-03 22:00:22,829 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978069282] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:00:22,829 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:00:22,829 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-03 22:00:22,829 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025969314]
[2024-06-03 22:00:22,829 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:00:22,829 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-03 22:00:22,829 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:00:22,830 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-03 22:00:22,830 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110
[2024-06-03 22:00:22,992 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 45
[2024-06-03 22:00:22,992 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 205 transitions, 2083 flow. Second operand  has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:00:22,992 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:00:22,993 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 45
[2024-06-03 22:00:22,993 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:00:25,694 INFO  L124   PetriNetUnfolderBase]: 3305/5040 cut-off events.
[2024-06-03 22:00:25,694 INFO  L125   PetriNetUnfolderBase]: For 522833/522853 co-relation queries the response was YES.
[2024-06-03 22:00:25,713 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 46637 conditions, 5040 events. 3305/5040 cut-off events. For 522833/522853 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 26392 event pairs, 686 based on Foata normal form. 9/5043 useless extension candidates. Maximal degree in co-relation 46557. Up to 4681 conditions per place. 
[2024-06-03 22:00:25,734 INFO  L140   encePairwiseOnDemand]: 34/45 looper letters, 217 selfloop transitions, 19 changer transitions 0/243 dead transitions.
[2024-06-03 22:00:25,734 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 243 transitions, 2711 flow
[2024-06-03 22:00:25,736 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 22:00:25,736 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 22:00:25,736 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 165 transitions.
[2024-06-03 22:00:25,736 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4074074074074074
[2024-06-03 22:00:25,737 INFO  L175             Difference]: Start difference. First operand has 173 places, 205 transitions, 2083 flow. Second operand 9 states and 165 transitions.
[2024-06-03 22:00:25,737 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 243 transitions, 2711 flow
[2024-06-03 22:00:26,017 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 243 transitions, 2655 flow, removed 16 selfloop flow, removed 5 redundant places.
[2024-06-03 22:00:26,020 INFO  L231             Difference]: Finished difference. Result has 177 places, 207 transitions, 2142 flow
[2024-06-03 22:00:26,020 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=2027, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2142, PETRI_PLACES=177, PETRI_TRANSITIONS=207}
[2024-06-03 22:00:26,021 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 131 predicate places.
[2024-06-03 22:00:26,021 INFO  L495      AbstractCegarLoop]: Abstraction has has 177 places, 207 transitions, 2142 flow
[2024-06-03 22:00:26,021 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:00:26,021 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:00:26,022 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:00:26,022 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50
[2024-06-03 22:00:26,022 INFO  L420      AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:00:26,022 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:00:26,022 INFO  L85        PathProgramCache]: Analyzing trace with hash -910394054, now seen corresponding path program 2 times
[2024-06-03 22:00:26,022 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:00:26,022 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812368265]
[2024-06-03 22:00:26,022 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:00:26,023 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:00:26,074 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:00:40,036 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:00:40,036 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:00:40,036 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812368265]
[2024-06-03 22:00:40,036 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812368265] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:00:40,036 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:00:40,036 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-03 22:00:40,036 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189936747]
[2024-06-03 22:00:40,036 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:00:40,037 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-03 22:00:40,037 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:00:40,037 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-03 22:00:40,037 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110
[2024-06-03 22:00:40,438 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 45
[2024-06-03 22:00:40,439 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 207 transitions, 2142 flow. Second operand  has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:00:40,439 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:00:40,439 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 45
[2024-06-03 22:00:40,439 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:00:43,101 INFO  L124   PetriNetUnfolderBase]: 3343/5110 cut-off events.
[2024-06-03 22:00:43,101 INFO  L125   PetriNetUnfolderBase]: For 548364/548384 co-relation queries the response was YES.
[2024-06-03 22:00:43,122 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 47926 conditions, 5110 events. 3343/5110 cut-off events. For 548364/548384 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 26972 event pairs, 843 based on Foata normal form. 9/5117 useless extension candidates. Maximal degree in co-relation 47845. Up to 4681 conditions per place. 
[2024-06-03 22:00:43,146 INFO  L140   encePairwiseOnDemand]: 34/45 looper letters, 213 selfloop transitions, 29 changer transitions 0/249 dead transitions.
[2024-06-03 22:00:43,146 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 249 transitions, 3052 flow
[2024-06-03 22:00:43,148 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 22:00:43,148 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 22:00:43,148 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 170 transitions.
[2024-06-03 22:00:43,149 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41975308641975306
[2024-06-03 22:00:43,149 INFO  L175             Difference]: Start difference. First operand has 177 places, 207 transitions, 2142 flow. Second operand 9 states and 170 transitions.
[2024-06-03 22:00:43,149 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 249 transitions, 3052 flow
[2024-06-03 22:00:43,530 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 249 transitions, 2955 flow, removed 31 selfloop flow, removed 7 redundant places.
[2024-06-03 22:00:43,532 INFO  L231             Difference]: Finished difference. Result has 179 places, 211 transitions, 2254 flow
[2024-06-03 22:00:43,533 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=2045, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2254, PETRI_PLACES=179, PETRI_TRANSITIONS=211}
[2024-06-03 22:00:43,533 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 133 predicate places.
[2024-06-03 22:00:43,533 INFO  L495      AbstractCegarLoop]: Abstraction has has 179 places, 211 transitions, 2254 flow
[2024-06-03 22:00:43,533 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:00:43,533 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:00:43,533 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:00:43,533 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51
[2024-06-03 22:00:43,534 INFO  L420      AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:00:43,534 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:00:43,534 INFO  L85        PathProgramCache]: Analyzing trace with hash 2021519606, now seen corresponding path program 3 times
[2024-06-03 22:00:43,534 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:00:43,534 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249227311]
[2024-06-03 22:00:43,534 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:00:43,534 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:00:43,586 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
Killed by 15