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


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


Checking for ERROR reachability
Using default analysis
Version 76401ed0
Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix038.opt.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/mix038.opt.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false
--- Real Ultimate output ---
This is Ultimate 0.2.4-tmp.fs.goblint-validation-76401ed-m
[2024-06-20 19:07:01,085 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-06-20 19:07:01,165 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-06-20 19:07:01,170 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-06-20 19:07:01,170 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-06-20 19:07:01,197 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-06-20 19:07:01,198 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-06-20 19:07:01,198 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-06-20 19:07:01,199 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-06-20 19:07:01,202 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-06-20 19:07:01,202 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-06-20 19:07:01,202 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-06-20 19:07:01,202 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-06-20 19:07:01,202 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-06-20 19:07:01,203 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-06-20 19:07:01,203 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-06-20 19:07:01,209 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-06-20 19:07:01,210 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-06-20 19:07:01,210 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-06-20 19:07:01,210 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-06-20 19:07:01,210 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-06-20 19:07:01,211 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-06-20 19:07:01,211 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-06-20 19:07:01,211 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-06-20 19:07:01,211 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-06-20 19:07:01,211 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-06-20 19:07:01,212 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-06-20 19:07:01,212 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-06-20 19:07:01,212 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-06-20 19:07:01,212 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-06-20 19:07:01,213 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-06-20 19:07:01,213 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-06-20 19:07:01,213 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-06-20 19:07:01,213 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-06-20 19:07:01,213 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-06-20 19:07:01,213 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-06-20 19:07:01,214 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-06-20 19:07:01,214 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-06-20 19:07:01,214 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-06-20 19:07:01,214 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-06-20 19:07:01,214 INFO  L153        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-06-20 19:07:01,215 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-06-20 19:07:01,215 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-06-20 19:07:01,215 INFO  L153        SettingsManager]:  * Looper check in Petri net analysis=SEMANTIC
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false
[2024-06-20 19:07:01,377 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-06-20 19:07:01,393 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-06-20 19:07:01,395 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-06-20 19:07:01,396 INFO  L270        PluginConnector]: Initializing Witness Parser...
[2024-06-20 19:07:01,397 INFO  L274        PluginConnector]: Witness Parser initialized
[2024-06-20 19:07:01,398 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/mix038.opt.yml/witness.yml
[2024-06-20 19:07:01,558 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-06-20 19:07:01,559 INFO  L274        PluginConnector]: CDTParser initialized
[2024-06-20 19:07:01,560 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix038.opt.i
[2024-06-20 19:07:02,683 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-06-20 19:07:02,894 INFO  L384              CDTParser]: Found 1 translation units.
[2024-06-20 19:07:02,895 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix038.opt.i
[2024-06-20 19:07:02,905 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f37b0f13f/2ee2081840b14306b254fdd61b0198b6/FLAG724b6e1fb
[2024-06-20 19:07:02,917 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f37b0f13f/2ee2081840b14306b254fdd61b0198b6
[2024-06-20 19:07:02,917 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-06-20 19:07:02,918 INFO  L133        ToolchainWalker]: Walking toolchain with 5 elements.
[2024-06-20 19:07:02,919 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-06-20 19:07:02,919 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-06-20 19:07:02,923 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-06-20 19:07:02,923 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.06 07:07:01" (1/2) ...
[2024-06-20 19:07:02,924 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65a9b5c0 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:07:02, skipping insertion in model container
[2024-06-20 19:07:02,924 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.06 07:07:01" (1/2) ...
[2024-06-20 19:07:02,925 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@71d68d57 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:07:02, skipping insertion in model container
[2024-06-20 19:07:02,925 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.06 07:07:02" (2/2) ...
[2024-06-20 19:07:02,925 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65a9b5c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:07:02, skipping insertion in model container
[2024-06-20 19:07:02,925 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.06 07:07:02" (2/2) ...
[2024-06-20 19:07:02,925 INFO  L83    nessWitnessExtractor]: Extracting all invariants from correctness witness
[2024-06-20 19:07:03,002 INFO  L95    edCorrectnessWitness]: Found the following entries in the witness:
[2024-06-20 19:07:03,003 INFO  L97    edCorrectnessWitness]: Location invariant before [L838-L838] ((((((((((((((((((((! multithreaded || y$r_buff0_thd1 == (_Bool)0) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 1) && (y$mem_tmp == 0 || y$mem_tmp == 1)))) && (! multithreaded || y$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p2_EBX) + (long long )a >= 0LL && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )z >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_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 )y >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$w_buff1 >= 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 )a) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a) + (long long )x >= 0LL) && (1LL - (long long )a) + (long long )y >= 0LL) && (1LL - (long long )a) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )a) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff0_thd3 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff1_thd3 >= 0LL) && (1LL - (long long )a) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )a) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )a) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )a) + (long long )z >= 0LL) && (1LL - (long long )a) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 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 )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_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 )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff1 >= 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_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$w_buff1 >= 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 )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$w_buff1 >= 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 )main$tmp_guard1 >= 0LL) && (long long )a + (long long )x >= 0LL) && (long long )a + (long long )y >= 0LL) && (long long )a + (long long )y$flush_delayed >= 0LL) && (long long )a + (long long )y$mem_tmp >= 0LL) && (long long )a + (long long )y$r_buff0_thd0 >= 0LL) && (long long )a + (long long )y$r_buff0_thd1 >= 0LL) && (long long )a + (long long )y$r_buff0_thd2 >= 0LL) && (long long )a + (long long )y$r_buff0_thd3 >= 0LL) && (long long )a + (long long )y$r_buff1_thd0 >= 0LL) && (long long )a + (long long )y$r_buff1_thd1 >= 0LL) && (long long )a + (long long )y$r_buff1_thd2 >= 0LL) && (long long )a + (long long )y$r_buff1_thd3 >= 0LL) && (long long )a + (long long )y$read_delayed >= 0LL) && (long long )a + (long long )y$w_buff0 >= 0LL) && (long long )a + (long long )y$w_buff1 >= 0LL) && (long long )a + (long long )z >= 0LL) && (long long )a + (long long )weak$$choice0 >= 0LL) && (long long )a + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )y$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )y$flush_delayed >= 0LL) && (long long )x + (long long )y$mem_tmp >= 0LL) && (long long )x + (long long )y$r_buff0_thd0 >= 0LL) && (long long )x + (long long )y$r_buff0_thd1 >= 0LL) && (long long )x + (long long )y$r_buff0_thd2 >= 0LL) && (long long )x + (long long )y$r_buff0_thd3 >= 0LL) && (long long )x + (long long )y$r_buff1_thd0 >= 0LL) && (long long )x + (long long )y$r_buff1_thd1 >= 0LL) && (long long )x + (long long )y$r_buff1_thd2 >= 0LL) && (long long )x + (long long )y$r_buff1_thd3 >= 0LL) && (long long )x + (long long )y$read_delayed >= 0LL) && (long long )x + (long long )y$w_buff0 >= 0LL) && (long long )x + (long long )y$w_buff1 >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )y + (long long )y$flush_delayed >= 0LL) && (long long )y + (long long )y$mem_tmp >= 0LL) && (long long )y + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y + (long long )y$read_delayed >= 0LL) && (long long )y + (long long )y$w_buff0 >= 0LL) && (long long )y + (long long )y$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y$flush_delayed + (long long )y$mem_tmp >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$flush_delayed + (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$flush_delayed + (long long )z >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$mem_tmp + (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff1 >= 0LL) && (long long )y$mem_tmp + (long long )z >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )z >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )z >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )z >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )z >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )z >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )z >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )z >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd3 + (long long )z >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$read_delayed + (long long )z >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )z >= 0LL) && (long long )y$w_buff1 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )a >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )a) - (long long )y$read_delayed >= 0LL) && (2LL - (long long )__unbuffered_p2_EBX) - (long long )a >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$read_delayed >= 0LL) && (long long )a - (long long )y$r_buff0_thd0 >= 0LL) && (long long )a - (long long )y$r_buff0_thd1 >= 0LL) && (long long )a - (long long )y$r_buff0_thd2 >= 0LL) && (long long )a - (long long )y$r_buff1_thd0 >= 0LL) && (long long )a - (long long )y$r_buff1_thd1 >= 0LL) && (long long )a - (long long )y$r_buff1_thd2 >= 0LL) && (long long )a - (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$read_delayed >= 0LL) && (long long )x - (long long )y$r_buff0_thd0 >= 0LL) && (long long )x - (long long )y$r_buff0_thd1 >= 0LL) && (long long )x - (long long )y$r_buff0_thd2 >= 0LL) && (long long )x - (long long )y$r_buff1_thd0 >= 0LL) && (long long )x - (long long )y$r_buff1_thd1 >= 0LL) && (long long )x - (long long )y$r_buff1_thd2 >= 0LL) && (long long )x - (long long )y$read_delayed >= 0LL) && (long long )y - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y - (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd3 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= a) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && 0 <= z) && __unbuffered_p1_EAX <= 1) && __unbuffered_p2_EAX <= 1) && __unbuffered_p2_EBX <= 1) && a <= 1) && y <= 1) && y$mem_tmp <= 1) && y$w_buff0 <= 1) && y$w_buff1 <= 1) && z <= 1) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd1 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd1 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (a == 0 || a == 1)) && (y == 0 || y == 1)) && (y$mem_tmp == 0 || y$mem_tmp == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 1)) && (y$w_buff1 == 0 || y$w_buff1 == 1)) && (z == 0 || z == 1)) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= y$w_buff1 && y$w_buff1 <= 1) && (y$w_buff1 == 0 || y$w_buff1 == 1)))) && (! multithreaded || ((0 <= a && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= y$w_buff0 && y$w_buff0 <= 1) && (y$w_buff0 == 0 || y$w_buff0 == 1)))
[2024-06-20 19:07:03,004 INFO  L97    edCorrectnessWitness]: Location invariant before [L839-L839] ((((((((((((((((((((! multithreaded || y$r_buff0_thd1 == (_Bool)0) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 1) && (y$mem_tmp == 0 || y$mem_tmp == 1)))) && (! multithreaded || y$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p2_EBX) + (long long )a >= 0LL && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )z >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_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 )y >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$w_buff1 >= 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 )a) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a) + (long long )x >= 0LL) && (1LL - (long long )a) + (long long )y >= 0LL) && (1LL - (long long )a) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )a) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff0_thd3 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff1_thd3 >= 0LL) && (1LL - (long long )a) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )a) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )a) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )a) + (long long )z >= 0LL) && (1LL - (long long )a) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 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 )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_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 )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff1 >= 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_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$w_buff1 >= 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 )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$w_buff1 >= 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 )main$tmp_guard1 >= 0LL) && (long long )a + (long long )x >= 0LL) && (long long )a + (long long )y >= 0LL) && (long long )a + (long long )y$flush_delayed >= 0LL) && (long long )a + (long long )y$mem_tmp >= 0LL) && (long long )a + (long long )y$r_buff0_thd0 >= 0LL) && (long long )a + (long long )y$r_buff0_thd1 >= 0LL) && (long long )a + (long long )y$r_buff0_thd2 >= 0LL) && (long long )a + (long long )y$r_buff0_thd3 >= 0LL) && (long long )a + (long long )y$r_buff1_thd0 >= 0LL) && (long long )a + (long long )y$r_buff1_thd1 >= 0LL) && (long long )a + (long long )y$r_buff1_thd2 >= 0LL) && (long long )a + (long long )y$r_buff1_thd3 >= 0LL) && (long long )a + (long long )y$read_delayed >= 0LL) && (long long )a + (long long )y$w_buff0 >= 0LL) && (long long )a + (long long )y$w_buff1 >= 0LL) && (long long )a + (long long )z >= 0LL) && (long long )a + (long long )weak$$choice0 >= 0LL) && (long long )a + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )y$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )y$flush_delayed >= 0LL) && (long long )x + (long long )y$mem_tmp >= 0LL) && (long long )x + (long long )y$r_buff0_thd0 >= 0LL) && (long long )x + (long long )y$r_buff0_thd1 >= 0LL) && (long long )x + (long long )y$r_buff0_thd2 >= 0LL) && (long long )x + (long long )y$r_buff0_thd3 >= 0LL) && (long long )x + (long long )y$r_buff1_thd0 >= 0LL) && (long long )x + (long long )y$r_buff1_thd1 >= 0LL) && (long long )x + (long long )y$r_buff1_thd2 >= 0LL) && (long long )x + (long long )y$r_buff1_thd3 >= 0LL) && (long long )x + (long long )y$read_delayed >= 0LL) && (long long )x + (long long )y$w_buff0 >= 0LL) && (long long )x + (long long )y$w_buff1 >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )y + (long long )y$flush_delayed >= 0LL) && (long long )y + (long long )y$mem_tmp >= 0LL) && (long long )y + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y + (long long )y$read_delayed >= 0LL) && (long long )y + (long long )y$w_buff0 >= 0LL) && (long long )y + (long long )y$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y$flush_delayed + (long long )y$mem_tmp >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$flush_delayed + (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$flush_delayed + (long long )z >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$mem_tmp + (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff1 >= 0LL) && (long long )y$mem_tmp + (long long )z >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )z >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )z >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )z >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )z >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )z >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )z >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )z >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd3 + (long long )z >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$read_delayed + (long long )z >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )z >= 0LL) && (long long )y$w_buff1 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )a >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )a) - (long long )y$read_delayed >= 0LL) && (2LL - (long long )__unbuffered_p2_EBX) - (long long )a >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$read_delayed >= 0LL) && (long long )a - (long long )y$r_buff0_thd0 >= 0LL) && (long long )a - (long long )y$r_buff0_thd1 >= 0LL) && (long long )a - (long long )y$r_buff0_thd2 >= 0LL) && (long long )a - (long long )y$r_buff1_thd0 >= 0LL) && (long long )a - (long long )y$r_buff1_thd1 >= 0LL) && (long long )a - (long long )y$r_buff1_thd2 >= 0LL) && (long long )a - (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$read_delayed >= 0LL) && (long long )x - (long long )y$r_buff0_thd0 >= 0LL) && (long long )x - (long long )y$r_buff0_thd1 >= 0LL) && (long long )x - (long long )y$r_buff0_thd2 >= 0LL) && (long long )x - (long long )y$r_buff1_thd0 >= 0LL) && (long long )x - (long long )y$r_buff1_thd1 >= 0LL) && (long long )x - (long long )y$r_buff1_thd2 >= 0LL) && (long long )x - (long long )y$read_delayed >= 0LL) && (long long )y - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y - (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd3 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= a) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && 0 <= z) && __unbuffered_p1_EAX <= 1) && __unbuffered_p2_EAX <= 1) && __unbuffered_p2_EBX <= 1) && a <= 1) && y <= 1) && y$mem_tmp <= 1) && y$w_buff0 <= 1) && y$w_buff1 <= 1) && z <= 1) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd1 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd1 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (a == 0 || a == 1)) && (y == 0 || y == 1)) && (y$mem_tmp == 0 || y$mem_tmp == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 1)) && (y$w_buff1 == 0 || y$w_buff1 == 1)) && (z == 0 || z == 1)) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= y$w_buff1 && y$w_buff1 <= 1) && (y$w_buff1 == 0 || y$w_buff1 == 1)))) && (! multithreaded || ((0 <= a && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= y$w_buff0 && y$w_buff0 <= 1) && (y$w_buff0 == 0 || y$w_buff0 == 1)))
[2024-06-20 19:07:03,005 INFO  L97    edCorrectnessWitness]: Location invariant before [L836-L836] ((((((((((((((((((((! multithreaded || y$r_buff0_thd1 == (_Bool)0) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 1) && (y$mem_tmp == 0 || y$mem_tmp == 1)))) && (! multithreaded || y$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p2_EBX) + (long long )a >= 0LL && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )z >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_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 )y >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$w_buff1 >= 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 )a) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a) + (long long )x >= 0LL) && (1LL - (long long )a) + (long long )y >= 0LL) && (1LL - (long long )a) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )a) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff0_thd3 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff1_thd3 >= 0LL) && (1LL - (long long )a) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )a) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )a) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )a) + (long long )z >= 0LL) && (1LL - (long long )a) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 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 )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_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 )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff1 >= 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_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$w_buff1 >= 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 )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$w_buff1 >= 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 )main$tmp_guard1 >= 0LL) && (long long )a + (long long )x >= 0LL) && (long long )a + (long long )y >= 0LL) && (long long )a + (long long )y$flush_delayed >= 0LL) && (long long )a + (long long )y$mem_tmp >= 0LL) && (long long )a + (long long )y$r_buff0_thd0 >= 0LL) && (long long )a + (long long )y$r_buff0_thd1 >= 0LL) && (long long )a + (long long )y$r_buff0_thd2 >= 0LL) && (long long )a + (long long )y$r_buff0_thd3 >= 0LL) && (long long )a + (long long )y$r_buff1_thd0 >= 0LL) && (long long )a + (long long )y$r_buff1_thd1 >= 0LL) && (long long )a + (long long )y$r_buff1_thd2 >= 0LL) && (long long )a + (long long )y$r_buff1_thd3 >= 0LL) && (long long )a + (long long )y$read_delayed >= 0LL) && (long long )a + (long long )y$w_buff0 >= 0LL) && (long long )a + (long long )y$w_buff1 >= 0LL) && (long long )a + (long long )z >= 0LL) && (long long )a + (long long )weak$$choice0 >= 0LL) && (long long )a + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )y$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )y$flush_delayed >= 0LL) && (long long )x + (long long )y$mem_tmp >= 0LL) && (long long )x + (long long )y$r_buff0_thd0 >= 0LL) && (long long )x + (long long )y$r_buff0_thd1 >= 0LL) && (long long )x + (long long )y$r_buff0_thd2 >= 0LL) && (long long )x + (long long )y$r_buff0_thd3 >= 0LL) && (long long )x + (long long )y$r_buff1_thd0 >= 0LL) && (long long )x + (long long )y$r_buff1_thd1 >= 0LL) && (long long )x + (long long )y$r_buff1_thd2 >= 0LL) && (long long )x + (long long )y$r_buff1_thd3 >= 0LL) && (long long )x + (long long )y$read_delayed >= 0LL) && (long long )x + (long long )y$w_buff0 >= 0LL) && (long long )x + (long long )y$w_buff1 >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )y + (long long )y$flush_delayed >= 0LL) && (long long )y + (long long )y$mem_tmp >= 0LL) && (long long )y + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y + (long long )y$read_delayed >= 0LL) && (long long )y + (long long )y$w_buff0 >= 0LL) && (long long )y + (long long )y$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y$flush_delayed + (long long )y$mem_tmp >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$flush_delayed + (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$flush_delayed + (long long )z >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$mem_tmp + (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff1 >= 0LL) && (long long )y$mem_tmp + (long long )z >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )z >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )z >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )z >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )z >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )z >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )z >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )z >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd3 + (long long )z >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$read_delayed + (long long )z >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )z >= 0LL) && (long long )y$w_buff1 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )a >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )a) - (long long )y$read_delayed >= 0LL) && (2LL - (long long )__unbuffered_p2_EBX) - (long long )a >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$read_delayed >= 0LL) && (long long )a - (long long )y$r_buff0_thd0 >= 0LL) && (long long )a - (long long )y$r_buff0_thd1 >= 0LL) && (long long )a - (long long )y$r_buff0_thd2 >= 0LL) && (long long )a - (long long )y$r_buff1_thd0 >= 0LL) && (long long )a - (long long )y$r_buff1_thd1 >= 0LL) && (long long )a - (long long )y$r_buff1_thd2 >= 0LL) && (long long )a - (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$read_delayed >= 0LL) && (long long )x - (long long )y$r_buff0_thd0 >= 0LL) && (long long )x - (long long )y$r_buff0_thd1 >= 0LL) && (long long )x - (long long )y$r_buff0_thd2 >= 0LL) && (long long )x - (long long )y$r_buff1_thd0 >= 0LL) && (long long )x - (long long )y$r_buff1_thd1 >= 0LL) && (long long )x - (long long )y$r_buff1_thd2 >= 0LL) && (long long )x - (long long )y$read_delayed >= 0LL) && (long long )y - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y - (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd3 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= a) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && 0 <= z) && __unbuffered_p1_EAX <= 1) && __unbuffered_p2_EAX <= 1) && __unbuffered_p2_EBX <= 1) && a <= 1) && y <= 1) && y$mem_tmp <= 1) && y$w_buff0 <= 1) && y$w_buff1 <= 1) && z <= 1) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd1 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd1 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (a == 0 || a == 1)) && (y == 0 || y == 1)) && (y$mem_tmp == 0 || y$mem_tmp == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 1)) && (y$w_buff1 == 0 || y$w_buff1 == 1)) && (z == 0 || z == 1)) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= y$w_buff1 && y$w_buff1 <= 1) && (y$w_buff1 == 0 || y$w_buff1 == 1)))) && (! multithreaded || ((0 <= a && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= y$w_buff0 && y$w_buff0 <= 1) && (y$w_buff0 == 0 || y$w_buff0 == 1)))
[2024-06-20 19:07:03,005 INFO  L103   edCorrectnessWitness]: ghost_variable multithreaded = 0
[2024-06-20 19:07:03,005 INFO  L106   edCorrectnessWitness]: ghost_update [L834-L834] multithreaded = 1;
[2024-06-20 19:07:03,042 INFO  L177         MainTranslator]: Built tables and reachable declarations
[2024-06-20 19:07:03,373 INFO  L207          PostProcessor]: Analyzing one entry point: main
[2024-06-20 19:07:03,381 INFO  L202         MainTranslator]: Completed pre-run
Start Parsing Local
Start Parsing Local
Start Parsing Local
Start Parsing Local
Start Parsing Local
[2024-06-20 19:07:03,714 INFO  L207          PostProcessor]: Analyzing one entry point: main
[2024-06-20 19:07:03,749 INFO  L206         MainTranslator]: Completed translation
[2024-06-20 19:07:03,750 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:07:03 WrapperNode
[2024-06-20 19:07:03,750 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-06-20 19:07:03,751 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-06-20 19:07:03,752 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-06-20 19:07:03,752 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-06-20 19:07:03,758 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:07:03" (1/1) ...
[2024-06-20 19:07:03,793 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:07:03" (1/1) ...
[2024-06-20 19:07:03,912 INFO  L138                Inliner]: procedures = 175, calls = 47, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 133
[2024-06-20 19:07:03,912 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-06-20 19:07:03,913 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-06-20 19:07:03,913 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-06-20 19:07:03,914 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-06-20 19:07:03,922 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:07:03" (1/1) ...
[2024-06-20 19:07:03,922 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:07:03" (1/1) ...
[2024-06-20 19:07:03,961 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:07:03" (1/1) ...
[2024-06-20 19:07:03,997 INFO  L175           MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2024-06-20 19:07:03,998 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:07:03" (1/1) ...
[2024-06-20 19:07:03,998 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:07:03" (1/1) ...
[2024-06-20 19:07:04,028 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:07:03" (1/1) ...
[2024-06-20 19:07:04,030 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:07:03" (1/1) ...
[2024-06-20 19:07:04,042 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:07:03" (1/1) ...
[2024-06-20 19:07:04,047 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:07:03" (1/1) ...
[2024-06-20 19:07:04,067 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-06-20 19:07:04,068 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-06-20 19:07:04,068 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-06-20 19:07:04,068 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-06-20 19:07:04,069 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:07:03" (1/1) ...
[2024-06-20 19:07:04,073 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-06-20 19:07:04,080 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-06-20 19:07:04,106 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-06-20 19:07:04,129 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-06-20 19:07:04,137 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2024-06-20 19:07:04,137 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-06-20 19:07:04,137 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2024-06-20 19:07:04,138 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2024-06-20 19:07:04,138 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2024-06-20 19:07:04,138 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2024-06-20 19:07:04,138 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2024-06-20 19:07:04,138 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2024-06-20 19:07:04,138 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-06-20 19:07:04,139 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2024-06-20 19:07:04,139 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-06-20 19:07:04,139 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-06-20 19:07:04,140 WARN  L214             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement
[2024-06-20 19:07:04,283 INFO  L244             CfgBuilder]: Building ICFG
[2024-06-20 19:07:04,285 INFO  L270             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-06-20 19:07:05,587 INFO  L289             CfgBuilder]: Ommited future-live optimization because the input is a concurrent program.
[2024-06-20 19:07:05,587 INFO  L293             CfgBuilder]: Performing block encoding
[2024-06-20 19:07:05,853 INFO  L315             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-06-20 19:07:05,854 INFO  L320             CfgBuilder]: Removed 0 assume(true) statements.
[2024-06-20 19:07:05,854 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.06 07:07:05 BoogieIcfgContainer
[2024-06-20 19:07:05,855 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-06-20 19:07:05,857 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-06-20 19:07:05,857 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-06-20 19:07:05,860 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-06-20 19:07:05,860 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.06 07:07:01" (1/4) ...
[2024-06-20 19:07:05,861 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1476491a and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 20.06 07:07:05, skipping insertion in model container
[2024-06-20 19:07:05,861 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.06 07:07:02" (2/4) ...
[2024-06-20 19:07:05,861 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1476491a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.06 07:07:05, skipping insertion in model container
[2024-06-20 19:07:05,861 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:07:03" (3/4) ...
[2024-06-20 19:07:05,862 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1476491a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.06 07:07:05, skipping insertion in model container
[2024-06-20 19:07:05,862 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.06 07:07:05" (4/4) ...
[2024-06-20 19:07:05,863 INFO  L112   eAbstractionObserver]: Analyzing ICFG mix038.opt.i
[2024-06-20 19:07:05,877 INFO  L204   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-06-20 19:07:05,877 INFO  L163   ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations.
[2024-06-20 19:07:05,877 INFO  L522   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-06-20 19:07:05,987 INFO  L144    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-06-20 19:07:06,016 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 52 places, 42 transitions, 96 flow
[2024-06-20 19:07:06,064 INFO  L124   PetriNetUnfolderBase]: 0/39 cut-off events.
[2024-06-20 19:07:06,065 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-06-20 19:07:06,067 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 49 conditions, 39 events. 0/39 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 58 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. 
[2024-06-20 19:07:06,067 INFO  L82        GeneralOperation]: Start removeDead. Operand has 52 places, 42 transitions, 96 flow
[2024-06-20 19:07:06,069 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 43 places, 33 transitions, 75 flow
[2024-06-20 19:07:06,076 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-06-20 19:07:06,081 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;@3b0058a1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-06-20 19:07:06,081 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2024-06-20 19:07:06,105 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-06-20 19:07:06,106 INFO  L124   PetriNetUnfolderBase]: 0/5 cut-off events.
[2024-06-20 19:07:06,106 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-06-20 19:07:06,106 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:07:06,107 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1]
[2024-06-20 19:07:06,107 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-20 19:07:06,111 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:07:06,111 INFO  L85        PathProgramCache]: Analyzing trace with hash 359771266, now seen corresponding path program 1 times
[2024-06-20 19:07:06,117 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:07:06,118 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590438815]
[2024-06-20 19:07:06,118 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:07:06,118 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:07:06,384 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:07:12,406 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:07:12,407 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:07:12,407 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590438815]
[2024-06-20 19:07:12,408 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590438815] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:07:12,408 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:07:12,408 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-06-20 19:07:12,409 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647456242]
[2024-06-20 19:07:12,410 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:07:12,416 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-06-20 19:07:12,420 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:07:12,442 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-06-20 19:07:12,443 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-06-20 19:07:12,520 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 14 out of 42
[2024-06-20 19:07:12,522 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 75 flow. Second operand  has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:07:12,522 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:07:12,522 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 42
[2024-06-20 19:07:12,523 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:07:13,367 INFO  L124   PetriNetUnfolderBase]: 1116/1816 cut-off events.
[2024-06-20 19:07:13,367 INFO  L125   PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES.
[2024-06-20 19:07:13,374 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 3567 conditions, 1816 events. 1116/1816 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 9229 event pairs, 765 based on Foata normal form. 1/1752 useless extension candidates. Maximal degree in co-relation 3555. Up to 1676 conditions per place. 
[2024-06-20 19:07:13,385 INFO  L140   encePairwiseOnDemand]: 35/42 looper letters, 31 selfloop transitions, 4 changer transitions 0/43 dead transitions.
[2024-06-20 19:07:13,385 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 43 transitions, 171 flow
[2024-06-20 19:07:13,386 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-06-20 19:07:13,388 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-06-20 19:07:13,394 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 80 transitions.
[2024-06-20 19:07:13,395 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.6349206349206349
[2024-06-20 19:07:13,397 INFO  L175             Difference]: Start difference. First operand has 43 places, 33 transitions, 75 flow. Second operand 3 states and 80 transitions.
[2024-06-20 19:07:13,398 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 43 transitions, 171 flow
[2024-06-20 19:07:13,400 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 43 transitions, 166 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-06-20 19:07:13,402 INFO  L231             Difference]: Finished difference. Result has 43 places, 36 transitions, 102 flow
[2024-06-20 19:07:13,404 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=43, PETRI_TRANSITIONS=36}
[2024-06-20 19:07:13,407 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 0 predicate places.
[2024-06-20 19:07:13,407 INFO  L495      AbstractCegarLoop]: Abstraction has has 43 places, 36 transitions, 102 flow
[2024-06-20 19:07:13,407 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:07:13,407 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:07:13,408 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:07:13,408 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-06-20 19:07:13,408 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-20 19:07:13,408 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:07:13,409 INFO  L85        PathProgramCache]: Analyzing trace with hash 2142835425, now seen corresponding path program 1 times
[2024-06-20 19:07:13,409 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:07:13,409 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319802505]
[2024-06-20 19:07:13,409 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:07:13,409 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:07:13,450 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:07:17,831 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:07:17,831 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:07:17,832 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319802505]
[2024-06-20 19:07:17,832 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319802505] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:07:17,832 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:07:17,832 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-06-20 19:07:17,833 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882396644]
[2024-06-20 19:07:17,833 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:07:17,834 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-06-20 19:07:17,835 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:07:17,835 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-06-20 19:07:17,835 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-06-20 19:07:17,953 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 42
[2024-06-20 19:07:17,953 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 36 transitions, 102 flow. Second operand  has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:07:17,953 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:07:17,953 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 42
[2024-06-20 19:07:17,953 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:07:18,741 INFO  L124   PetriNetUnfolderBase]: 1280/2007 cut-off events.
[2024-06-20 19:07:18,742 INFO  L125   PetriNetUnfolderBase]: For 383/383 co-relation queries the response was YES.
[2024-06-20 19:07:18,744 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4528 conditions, 2007 events. 1280/2007 cut-off events. For 383/383 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 9937 event pairs, 750 based on Foata normal form. 3/1978 useless extension candidates. Maximal degree in co-relation 4516. Up to 1897 conditions per place. 
[2024-06-20 19:07:18,751 INFO  L140   encePairwiseOnDemand]: 34/42 looper letters, 39 selfloop transitions, 7 changer transitions 0/53 dead transitions.
[2024-06-20 19:07:18,751 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 53 transitions, 240 flow
[2024-06-20 19:07:18,752 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-06-20 19:07:18,752 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-06-20 19:07:18,753 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 101 transitions.
[2024-06-20 19:07:18,753 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.6011904761904762
[2024-06-20 19:07:18,753 INFO  L175             Difference]: Start difference. First operand has 43 places, 36 transitions, 102 flow. Second operand 4 states and 101 transitions.
[2024-06-20 19:07:18,753 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 53 transitions, 240 flow
[2024-06-20 19:07:18,754 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 53 transitions, 236 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-06-20 19:07:18,755 INFO  L231             Difference]: Finished difference. Result has 46 places, 39 transitions, 138 flow
[2024-06-20 19:07:18,755 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=138, PETRI_PLACES=46, PETRI_TRANSITIONS=39}
[2024-06-20 19:07:18,756 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 3 predicate places.
[2024-06-20 19:07:18,756 INFO  L495      AbstractCegarLoop]: Abstraction has has 46 places, 39 transitions, 138 flow
[2024-06-20 19:07:18,756 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:07:18,756 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:07:18,756 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:07:18,757 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-06-20 19:07:18,757 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-20 19:07:18,757 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:07:18,757 INFO  L85        PathProgramCache]: Analyzing trace with hash 2003389811, now seen corresponding path program 1 times
[2024-06-20 19:07:18,758 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:07:18,758 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311145225]
[2024-06-20 19:07:18,758 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:07:18,758 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:07:18,798 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:07:22,857 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:07:22,857 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:07:22,858 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311145225]
[2024-06-20 19:07:22,858 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311145225] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:07:22,858 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:07:22,858 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-06-20 19:07:22,858 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142208547]
[2024-06-20 19:07:22,859 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:07:22,859 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-06-20 19:07:22,859 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:07:22,860 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-06-20 19:07:22,860 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20
[2024-06-20 19:07:22,990 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 42
[2024-06-20 19:07:22,991 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 39 transitions, 138 flow. Second operand  has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:07:22,991 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:07:22,991 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 42
[2024-06-20 19:07:22,991 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:07:23,804 INFO  L124   PetriNetUnfolderBase]: 1302/2076 cut-off events.
[2024-06-20 19:07:23,804 INFO  L125   PetriNetUnfolderBase]: For 1126/1126 co-relation queries the response was YES.
[2024-06-20 19:07:23,808 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5163 conditions, 2076 events. 1302/2076 cut-off events. For 1126/1126 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 10481 event pairs, 470 based on Foata normal form. 7/2070 useless extension candidates. Maximal degree in co-relation 5149. Up to 1800 conditions per place. 
[2024-06-20 19:07:23,815 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 55 selfloop transitions, 16 changer transitions 0/78 dead transitions.
[2024-06-20 19:07:23,815 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 78 transitions, 406 flow
[2024-06-20 19:07:23,817 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-20 19:07:23,817 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-20 19:07:23,820 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 135 transitions.
[2024-06-20 19:07:23,822 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.6428571428571429
[2024-06-20 19:07:23,822 INFO  L175             Difference]: Start difference. First operand has 46 places, 39 transitions, 138 flow. Second operand 5 states and 135 transitions.
[2024-06-20 19:07:23,822 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 78 transitions, 406 flow
[2024-06-20 19:07:23,824 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 78 transitions, 392 flow, removed 2 selfloop flow, removed 2 redundant places.
[2024-06-20 19:07:23,825 INFO  L231             Difference]: Finished difference. Result has 51 places, 50 transitions, 237 flow
[2024-06-20 19:07:23,826 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=237, PETRI_PLACES=51, PETRI_TRANSITIONS=50}
[2024-06-20 19:07:23,827 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 8 predicate places.
[2024-06-20 19:07:23,827 INFO  L495      AbstractCegarLoop]: Abstraction has has 51 places, 50 transitions, 237 flow
[2024-06-20 19:07:23,827 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:07:23,827 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:07:23,827 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:07:23,827 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-06-20 19:07:23,828 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-20 19:07:23,828 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:07:23,828 INFO  L85        PathProgramCache]: Analyzing trace with hash 1967601872, now seen corresponding path program 1 times
[2024-06-20 19:07:23,828 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:07:23,829 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859463073]
[2024-06-20 19:07:23,829 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:07:23,829 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:07:23,874 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:07:28,557 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:07:28,557 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:07:28,557 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859463073]
[2024-06-20 19:07:28,558 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859463073] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:07:28,558 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:07:28,558 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-06-20 19:07:28,558 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069278462]
[2024-06-20 19:07:28,558 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:07:28,558 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-06-20 19:07:28,559 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:07:28,559 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-06-20 19:07:28,559 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2024-06-20 19:07:28,687 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 42
[2024-06-20 19:07:28,687 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 50 transitions, 237 flow. Second operand  has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:07:28,687 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:07:28,687 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 42
[2024-06-20 19:07:28,687 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:07:29,631 INFO  L124   PetriNetUnfolderBase]: 1384/2220 cut-off events.
[2024-06-20 19:07:29,632 INFO  L125   PetriNetUnfolderBase]: For 2892/2892 co-relation queries the response was YES.
[2024-06-20 19:07:29,635 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6579 conditions, 2220 events. 1384/2220 cut-off events. For 2892/2892 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 11470 event pairs, 321 based on Foata normal form. 26/2231 useless extension candidates. Maximal degree in co-relation 6562. Up to 1764 conditions per place. 
[2024-06-20 19:07:29,643 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 63 selfloop transitions, 18 changer transitions 0/88 dead transitions.
[2024-06-20 19:07:29,644 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 88 transitions, 523 flow
[2024-06-20 19:07:29,644 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-20 19:07:29,644 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-20 19:07:29,645 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 158 transitions.
[2024-06-20 19:07:29,645 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.626984126984127
[2024-06-20 19:07:29,645 INFO  L175             Difference]: Start difference. First operand has 51 places, 50 transitions, 237 flow. Second operand 6 states and 158 transitions.
[2024-06-20 19:07:29,645 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 88 transitions, 523 flow
[2024-06-20 19:07:29,647 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 88 transitions, 515 flow, removed 4 selfloop flow, removed 0 redundant places.
[2024-06-20 19:07:29,649 INFO  L231             Difference]: Finished difference. Result has 56 places, 51 transitions, 285 flow
[2024-06-20 19:07:29,649 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=221, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=285, PETRI_PLACES=56, PETRI_TRANSITIONS=51}
[2024-06-20 19:07:29,649 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 13 predicate places.
[2024-06-20 19:07:29,650 INFO  L495      AbstractCegarLoop]: Abstraction has has 56 places, 51 transitions, 285 flow
[2024-06-20 19:07:29,650 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:07:29,650 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:07:29,650 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:07:29,650 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-06-20 19:07:29,650 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-20 19:07:29,651 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:07:29,651 INFO  L85        PathProgramCache]: Analyzing trace with hash 529676278, now seen corresponding path program 1 times
[2024-06-20 19:07:29,651 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:07:29,651 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520494815]
[2024-06-20 19:07:29,651 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:07:29,651 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:07:29,695 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:07:40,166 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:07:40,166 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:07:40,167 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520494815]
[2024-06-20 19:07:40,167 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520494815] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:07:40,167 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:07:40,167 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-06-20 19:07:40,167 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694970967]
[2024-06-20 19:07:40,168 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:07:40,168 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-06-20 19:07:40,168 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:07:40,168 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-06-20 19:07:40,169 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2024-06-20 19:07:40,301 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 42
[2024-06-20 19:07:40,301 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 51 transitions, 285 flow. Second operand  has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:07:40,301 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:07:40,301 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 42
[2024-06-20 19:07:40,301 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:07:41,165 INFO  L124   PetriNetUnfolderBase]: 1204/2027 cut-off events.
[2024-06-20 19:07:41,166 INFO  L125   PetriNetUnfolderBase]: For 3655/3655 co-relation queries the response was YES.
[2024-06-20 19:07:41,171 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6360 conditions, 2027 events. 1204/2027 cut-off events. For 3655/3655 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 10900 event pairs, 447 based on Foata normal form. 4/2022 useless extension candidates. Maximal degree in co-relation 6339. Up to 1814 conditions per place. 
[2024-06-20 19:07:41,177 INFO  L140   encePairwiseOnDemand]: 34/42 looper letters, 48 selfloop transitions, 8 changer transitions 0/63 dead transitions.
[2024-06-20 19:07:41,177 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 63 transitions, 427 flow
[2024-06-20 19:07:41,178 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-20 19:07:41,178 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-20 19:07:41,178 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 105 transitions.
[2024-06-20 19:07:41,179 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5
[2024-06-20 19:07:41,179 INFO  L175             Difference]: Start difference. First operand has 56 places, 51 transitions, 285 flow. Second operand 5 states and 105 transitions.
[2024-06-20 19:07:41,179 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 63 transitions, 427 flow
[2024-06-20 19:07:41,181 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 63 transitions, 383 flow, removed 6 selfloop flow, removed 4 redundant places.
[2024-06-20 19:07:41,182 INFO  L231             Difference]: Finished difference. Result has 57 places, 51 transitions, 265 flow
[2024-06-20 19:07:41,182 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=241, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=265, PETRI_PLACES=57, PETRI_TRANSITIONS=51}
[2024-06-20 19:07:41,183 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 14 predicate places.
[2024-06-20 19:07:41,183 INFO  L495      AbstractCegarLoop]: Abstraction has has 57 places, 51 transitions, 265 flow
[2024-06-20 19:07:41,183 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:07:41,183 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:07:41,183 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:07:41,184 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-06-20 19:07:41,184 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-20 19:07:41,184 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:07:41,184 INFO  L85        PathProgramCache]: Analyzing trace with hash 1948773619, now seen corresponding path program 1 times
[2024-06-20 19:07:41,184 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:07:41,185 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398515621]
[2024-06-20 19:07:41,185 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:07:41,185 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:07:41,212 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:07:52,953 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:07:52,954 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:07:52,954 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398515621]
[2024-06-20 19:07:52,954 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398515621] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:07:52,954 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:07:52,954 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-20 19:07:52,954 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871411364]
[2024-06-20 19:07:52,954 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:07:52,955 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-20 19:07:52,955 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:07:52,955 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-20 19:07:52,955 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-06-20 19:07:53,116 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42
[2024-06-20 19:07:53,117 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 51 transitions, 265 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-20 19:07:53,117 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:07:53,117 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42
[2024-06-20 19:07:53,117 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:07:54,221 INFO  L124   PetriNetUnfolderBase]: 1386/2222 cut-off events.
[2024-06-20 19:07:54,222 INFO  L125   PetriNetUnfolderBase]: For 4705/4705 co-relation queries the response was YES.
[2024-06-20 19:07:54,225 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7077 conditions, 2222 events. 1386/2222 cut-off events. For 4705/4705 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 11415 event pairs, 451 based on Foata normal form. 8/2217 useless extension candidates. Maximal degree in co-relation 7054. Up to 1943 conditions per place. 
[2024-06-20 19:07:54,233 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 61 selfloop transitions, 21 changer transitions 0/88 dead transitions.
[2024-06-20 19:07:54,233 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 88 transitions, 555 flow
[2024-06-20 19:07:54,234 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:07:54,234 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:07:54,234 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 168 transitions.
[2024-06-20 19:07:54,235 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5
[2024-06-20 19:07:54,235 INFO  L175             Difference]: Start difference. First operand has 57 places, 51 transitions, 265 flow. Second operand 8 states and 168 transitions.
[2024-06-20 19:07:54,235 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 88 transitions, 555 flow
[2024-06-20 19:07:54,237 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 88 transitions, 533 flow, removed 2 selfloop flow, removed 4 redundant places.
[2024-06-20 19:07:54,238 INFO  L231             Difference]: Finished difference. Result has 61 places, 54 transitions, 319 flow
[2024-06-20 19:07:54,238 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=243, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=319, PETRI_PLACES=61, PETRI_TRANSITIONS=54}
[2024-06-20 19:07:54,239 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 18 predicate places.
[2024-06-20 19:07:54,239 INFO  L495      AbstractCegarLoop]: Abstraction has has 61 places, 54 transitions, 319 flow
[2024-06-20 19:07:54,239 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-20 19:07:54,240 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:07:54,240 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:07:54,240 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-06-20 19:07:54,240 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-20 19:07:54,240 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:07:54,240 INFO  L85        PathProgramCache]: Analyzing trace with hash 1954487539, now seen corresponding path program 2 times
[2024-06-20 19:07:54,241 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:07:54,241 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480011129]
[2024-06-20 19:07:54,241 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:07:54,241 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:07:54,266 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:08:05,863 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:08:05,863 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:08:05,864 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480011129]
[2024-06-20 19:08:05,864 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480011129] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:08:05,864 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:08:05,864 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-20 19:08:05,864 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564877829]
[2024-06-20 19:08:05,864 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:08:05,865 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-20 19:08:05,865 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:08:05,865 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-20 19:08:05,865 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-06-20 19:08:05,981 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42
[2024-06-20 19:08:05,982 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 54 transitions, 319 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-20 19:08:05,982 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:08:05,982 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42
[2024-06-20 19:08:05,982 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:08:06,966 INFO  L124   PetriNetUnfolderBase]: 1354/2160 cut-off events.
[2024-06-20 19:08:06,966 INFO  L125   PetriNetUnfolderBase]: For 5780/5790 co-relation queries the response was YES.
[2024-06-20 19:08:06,969 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7174 conditions, 2160 events. 1354/2160 cut-off events. For 5780/5790 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 10933 event pairs, 454 based on Foata normal form. 12/2158 useless extension candidates. Maximal degree in co-relation 7151. Up to 1895 conditions per place. 
[2024-06-20 19:08:06,976 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 52 selfloop transitions, 21 changer transitions 0/79 dead transitions.
[2024-06-20 19:08:06,976 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 79 transitions, 527 flow
[2024-06-20 19:08:06,977 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 19:08:06,977 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 19:08:06,977 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 146 transitions.
[2024-06-20 19:08:06,978 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4965986394557823
[2024-06-20 19:08:06,978 INFO  L175             Difference]: Start difference. First operand has 61 places, 54 transitions, 319 flow. Second operand 7 states and 146 transitions.
[2024-06-20 19:08:06,978 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 79 transitions, 527 flow
[2024-06-20 19:08:06,982 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 79 transitions, 492 flow, removed 4 selfloop flow, removed 5 redundant places.
[2024-06-20 19:08:06,983 INFO  L231             Difference]: Finished difference. Result has 63 places, 54 transitions, 334 flow
[2024-06-20 19:08:06,983 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=334, PETRI_PLACES=63, PETRI_TRANSITIONS=54}
[2024-06-20 19:08:06,983 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 20 predicate places.
[2024-06-20 19:08:06,983 INFO  L495      AbstractCegarLoop]: Abstraction has has 63 places, 54 transitions, 334 flow
[2024-06-20 19:08:06,984 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-20 19:08:06,984 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:08:06,984 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:08:06,984 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-06-20 19:08:06,984 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-20 19:08:06,985 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:08:06,985 INFO  L85        PathProgramCache]: Analyzing trace with hash -400245517, now seen corresponding path program 1 times
[2024-06-20 19:08:06,985 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:08:06,985 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172843006]
[2024-06-20 19:08:06,985 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:08:06,985 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:08:07,054 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:08:17,607 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:08:17,608 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:08:17,608 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172843006]
[2024-06-20 19:08:17,608 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172843006] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:08:17,608 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:08:17,608 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:08:17,608 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306982272]
[2024-06-20 19:08:17,608 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:08:17,609 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:08:17,609 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:08:17,609 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:08:17,609 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:08:17,801 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 42
[2024-06-20 19:08:17,801 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 54 transitions, 334 flow. Second operand  has 8 states, 8 states have (on average 13.375) internal successors, (107), 8 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:08:17,801 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:08:17,802 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 42
[2024-06-20 19:08:17,802 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:08:18,691 INFO  L124   PetriNetUnfolderBase]: 1176/1967 cut-off events.
[2024-06-20 19:08:18,691 INFO  L125   PetriNetUnfolderBase]: For 5989/5989 co-relation queries the response was YES.
[2024-06-20 19:08:18,695 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6563 conditions, 1967 events. 1176/1967 cut-off events. For 5989/5989 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 10341 event pairs, 406 based on Foata normal form. 4/1956 useless extension candidates. Maximal degree in co-relation 6539. Up to 1742 conditions per place. 
[2024-06-20 19:08:18,705 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 59 selfloop transitions, 13 changer transitions 0/79 dead transitions.
[2024-06-20 19:08:18,706 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 79 transitions, 565 flow
[2024-06-20 19:08:18,707 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 19:08:18,707 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 19:08:18,708 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 142 transitions.
[2024-06-20 19:08:18,708 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.48299319727891155
[2024-06-20 19:08:18,708 INFO  L175             Difference]: Start difference. First operand has 63 places, 54 transitions, 334 flow. Second operand 7 states and 142 transitions.
[2024-06-20 19:08:18,713 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 79 transitions, 565 flow
[2024-06-20 19:08:18,719 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 79 transitions, 495 flow, removed 3 selfloop flow, removed 7 redundant places.
[2024-06-20 19:08:18,722 INFO  L231             Difference]: Finished difference. Result has 64 places, 59 transitions, 344 flow
[2024-06-20 19:08:18,723 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=269, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=344, PETRI_PLACES=64, PETRI_TRANSITIONS=59}
[2024-06-20 19:08:18,725 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 21 predicate places.
[2024-06-20 19:08:18,725 INFO  L495      AbstractCegarLoop]: Abstraction has has 64 places, 59 transitions, 344 flow
[2024-06-20 19:08:18,725 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 13.375) internal successors, (107), 8 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:08:18,725 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:08:18,725 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:08:18,726 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-06-20 19:08:18,726 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:08:18,726 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:08:18,726 INFO  L85        PathProgramCache]: Analyzing trace with hash 275117078, now seen corresponding path program 1 times
[2024-06-20 19:08:18,726 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:08:18,726 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750614558]
[2024-06-20 19:08:18,726 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:08:18,727 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:08:18,776 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:08:30,221 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:08:30,221 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:08:30,222 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750614558]
[2024-06-20 19:08:30,222 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750614558] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:08:30,222 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:08:30,222 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-06-20 19:08:30,222 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479782896]
[2024-06-20 19:08:30,222 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:08:30,223 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-06-20 19:08:30,223 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:08:30,223 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-06-20 19:08:30,223 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2024-06-20 19:08:30,347 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 42
[2024-06-20 19:08:30,347 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 59 transitions, 344 flow. Second operand  has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 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-20 19:08:30,348 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:08:30,348 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 42
[2024-06-20 19:08:30,348 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:08:31,035 INFO  L124   PetriNetUnfolderBase]: 1173/1953 cut-off events.
[2024-06-20 19:08:31,035 INFO  L125   PetriNetUnfolderBase]: For 6951/6951 co-relation queries the response was YES.
[2024-06-20 19:08:31,039 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6793 conditions, 1953 events. 1173/1953 cut-off events. For 6951/6951 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 10202 event pairs, 420 based on Foata normal form. 1/1939 useless extension candidates. Maximal degree in co-relation 6767. Up to 1771 conditions per place. 
[2024-06-20 19:08:31,044 INFO  L140   encePairwiseOnDemand]: 35/42 looper letters, 55 selfloop transitions, 8 changer transitions 0/70 dead transitions.
[2024-06-20 19:08:31,044 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 70 transitions, 510 flow
[2024-06-20 19:08:31,045 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-20 19:08:31,045 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-20 19:08:31,045 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 100 transitions.
[2024-06-20 19:08:31,045 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.47619047619047616
[2024-06-20 19:08:31,045 INFO  L175             Difference]: Start difference. First operand has 64 places, 59 transitions, 344 flow. Second operand 5 states and 100 transitions.
[2024-06-20 19:08:31,045 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 70 transitions, 510 flow
[2024-06-20 19:08:31,050 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 70 transitions, 477 flow, removed 6 selfloop flow, removed 4 redundant places.
[2024-06-20 19:08:31,051 INFO  L231             Difference]: Finished difference. Result has 65 places, 62 transitions, 359 flow
[2024-06-20 19:08:31,051 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=311, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=359, PETRI_PLACES=65, PETRI_TRANSITIONS=62}
[2024-06-20 19:08:31,051 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 22 predicate places.
[2024-06-20 19:08:31,051 INFO  L495      AbstractCegarLoop]: Abstraction has has 65 places, 62 transitions, 359 flow
[2024-06-20 19:08:31,052 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 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-20 19:08:31,052 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:08:31,052 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:08:31,052 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-06-20 19:08:31,052 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:08:31,052 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:08:31,053 INFO  L85        PathProgramCache]: Analyzing trace with hash -61304236, now seen corresponding path program 1 times
[2024-06-20 19:08:31,053 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:08:31,053 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57915575]
[2024-06-20 19:08:31,053 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:08:31,053 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:08:31,093 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:08:42,609 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:08:42,610 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:08:42,610 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57915575]
[2024-06-20 19:08:42,610 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57915575] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:08:42,610 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:08:42,610 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-20 19:08:42,610 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183031814]
[2024-06-20 19:08:42,610 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:08:42,611 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-20 19:08:42,611 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:08:42,612 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-20 19:08:42,612 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2024-06-20 19:08:42,747 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42
[2024-06-20 19:08:42,748 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 62 transitions, 359 flow. Second operand  has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:08:42,748 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:08:42,748 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42
[2024-06-20 19:08:42,748 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:08:43,495 INFO  L124   PetriNetUnfolderBase]: 1340/2149 cut-off events.
[2024-06-20 19:08:43,495 INFO  L125   PetriNetUnfolderBase]: For 9911/9911 co-relation queries the response was YES.
[2024-06-20 19:08:43,501 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7948 conditions, 2149 events. 1340/2149 cut-off events. For 9911/9911 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 10963 event pairs, 492 based on Foata normal form. 1/2148 useless extension candidates. Maximal degree in co-relation 7921. Up to 2009 conditions per place. 
[2024-06-20 19:08:43,508 INFO  L140   encePairwiseOnDemand]: 34/42 looper letters, 57 selfloop transitions, 11 changer transitions 0/74 dead transitions.
[2024-06-20 19:08:43,508 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 74 transitions, 541 flow
[2024-06-20 19:08:43,509 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-20 19:08:43,509 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-20 19:08:43,510 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 111 transitions.
[2024-06-20 19:08:43,510 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44047619047619047
[2024-06-20 19:08:43,510 INFO  L175             Difference]: Start difference. First operand has 65 places, 62 transitions, 359 flow. Second operand 6 states and 111 transitions.
[2024-06-20 19:08:43,510 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 74 transitions, 541 flow
[2024-06-20 19:08:43,518 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 74 transitions, 515 flow, removed 7 selfloop flow, removed 3 redundant places.
[2024-06-20 19:08:43,519 INFO  L231             Difference]: Finished difference. Result has 68 places, 65 transitions, 391 flow
[2024-06-20 19:08:43,520 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=333, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=391, PETRI_PLACES=68, PETRI_TRANSITIONS=65}
[2024-06-20 19:08:43,520 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 25 predicate places.
[2024-06-20 19:08:43,520 INFO  L495      AbstractCegarLoop]: Abstraction has has 68 places, 65 transitions, 391 flow
[2024-06-20 19:08:43,521 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:08:43,521 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:08:43,521 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:08:43,521 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-06-20 19:08:43,521 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-20 19:08:43,521 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:08:43,521 INFO  L85        PathProgramCache]: Analyzing trace with hash -213503600, now seen corresponding path program 1 times
[2024-06-20 19:08:43,521 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:08:43,522 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788440963]
[2024-06-20 19:08:43,522 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:08:43,522 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:08:43,551 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:08:56,602 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:08:56,604 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:08:56,604 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788440963]
[2024-06-20 19:08:56,604 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788440963] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:08:56,604 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:08:56,604 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:08:56,604 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183853480]
[2024-06-20 19:08:56,604 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:08:56,604 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:08:56,604 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:08:56,605 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:08:56,605 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:08:56,777 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42
[2024-06-20 19:08:56,778 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 65 transitions, 391 flow. Second operand  has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:08:56,778 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:08:56,778 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42
[2024-06-20 19:08:56,778 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:08:58,061 INFO  L124   PetriNetUnfolderBase]: 1543/2451 cut-off events.
[2024-06-20 19:08:58,061 INFO  L125   PetriNetUnfolderBase]: For 16059/16059 co-relation queries the response was YES.
[2024-06-20 19:08:58,067 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 9796 conditions, 2451 events. 1543/2451 cut-off events. For 16059/16059 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 12672 event pairs, 349 based on Foata normal form. 16/2461 useless extension candidates. Maximal degree in co-relation 9768. Up to 1728 conditions per place. 
[2024-06-20 19:08:58,074 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 81 selfloop transitions, 25 changer transitions 0/113 dead transitions.
[2024-06-20 19:08:58,075 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 113 transitions, 789 flow
[2024-06-20 19:08:58,077 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:08:58,077 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:08:58,077 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 191 transitions.
[2024-06-20 19:08:58,078 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5052910052910053
[2024-06-20 19:08:58,078 INFO  L175             Difference]: Start difference. First operand has 68 places, 65 transitions, 391 flow. Second operand 9 states and 191 transitions.
[2024-06-20 19:08:58,078 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 113 transitions, 789 flow
[2024-06-20 19:08:58,085 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 113 transitions, 753 flow, removed 9 selfloop flow, removed 4 redundant places.
[2024-06-20 19:08:58,086 INFO  L231             Difference]: Finished difference. Result has 73 places, 67 transitions, 437 flow
[2024-06-20 19:08:58,086 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=355, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=437, PETRI_PLACES=73, PETRI_TRANSITIONS=67}
[2024-06-20 19:08:58,087 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 30 predicate places.
[2024-06-20 19:08:58,087 INFO  L495      AbstractCegarLoop]: Abstraction has has 73 places, 67 transitions, 437 flow
[2024-06-20 19:08:58,087 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:08:58,087 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:08:58,088 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:08:58,088 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-06-20 19:08:58,088 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-20 19:08:58,088 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:08:58,088 INFO  L85        PathProgramCache]: Analyzing trace with hash 724329608, now seen corresponding path program 2 times
[2024-06-20 19:08:58,088 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:08:58,089 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306329282]
[2024-06-20 19:08:58,089 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:08:58,089 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:08:58,114 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:09:11,162 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:09:11,162 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:09:11,162 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306329282]
[2024-06-20 19:09:11,162 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306329282] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:09:11,162 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:09:11,162 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:09:11,162 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387541722]
[2024-06-20 19:09:11,162 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:09:11,163 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:09:11,163 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:09:11,163 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:09:11,163 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:09:11,317 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42
[2024-06-20 19:09:11,318 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 67 transitions, 437 flow. Second operand  has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:09:11,318 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:09:11,318 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42
[2024-06-20 19:09:11,319 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:09:12,622 INFO  L124   PetriNetUnfolderBase]: 1581/2534 cut-off events.
[2024-06-20 19:09:12,622 INFO  L125   PetriNetUnfolderBase]: For 19023/19023 co-relation queries the response was YES.
[2024-06-20 19:09:12,628 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 10399 conditions, 2534 events. 1581/2534 cut-off events. For 19023/19023 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 13338 event pairs, 502 based on Foata normal form. 24/2556 useless extension candidates. Maximal degree in co-relation 10370. Up to 2107 conditions per place. 
[2024-06-20 19:09:12,637 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 77 selfloop transitions, 25 changer transitions 0/109 dead transitions.
[2024-06-20 19:09:12,637 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 109 transitions, 769 flow
[2024-06-20 19:09:12,639 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:09:12,640 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:09:12,640 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 188 transitions.
[2024-06-20 19:09:12,641 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4973544973544973
[2024-06-20 19:09:12,641 INFO  L175             Difference]: Start difference. First operand has 73 places, 67 transitions, 437 flow. Second operand 9 states and 188 transitions.
[2024-06-20 19:09:12,641 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 109 transitions, 769 flow
[2024-06-20 19:09:12,652 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 109 transitions, 733 flow, removed 4 selfloop flow, removed 5 redundant places.
[2024-06-20 19:09:12,655 INFO  L231             Difference]: Finished difference. Result has 77 places, 69 transitions, 483 flow
[2024-06-20 19:09:12,655 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=401, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=483, PETRI_PLACES=77, PETRI_TRANSITIONS=69}
[2024-06-20 19:09:12,656 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 34 predicate places.
[2024-06-20 19:09:12,656 INFO  L495      AbstractCegarLoop]: Abstraction has has 77 places, 69 transitions, 483 flow
[2024-06-20 19:09:12,656 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:09:12,656 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:09:12,656 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:09:12,656 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-06-20 19:09:12,657 INFO  L420      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:09:12,657 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:09:12,657 INFO  L85        PathProgramCache]: Analyzing trace with hash -1911872075, now seen corresponding path program 1 times
[2024-06-20 19:09:12,657 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:09:12,657 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558338423]
[2024-06-20 19:09:12,657 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:09:12,657 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:09:12,700 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:09:24,683 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:09:24,683 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:09:24,683 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558338423]
[2024-06-20 19:09:24,683 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558338423] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:09:24,684 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:09:24,684 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-20 19:09:24,684 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187037207]
[2024-06-20 19:09:24,684 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:09:24,684 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-20 19:09:24,684 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:09:24,684 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-20 19:09:24,685 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-06-20 19:09:24,841 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42
[2024-06-20 19:09:24,842 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 69 transitions, 483 flow. Second operand  has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:09:24,842 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:09:24,842 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42
[2024-06-20 19:09:24,842 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:09:25,804 INFO  L124   PetriNetUnfolderBase]: 1616/2586 cut-off events.
[2024-06-20 19:09:25,804 INFO  L125   PetriNetUnfolderBase]: For 20292/20292 co-relation queries the response was YES.
[2024-06-20 19:09:25,810 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 10985 conditions, 2586 events. 1616/2586 cut-off events. For 20292/20292 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 13588 event pairs, 587 based on Foata normal form. 1/2585 useless extension candidates. Maximal degree in co-relation 10954. Up to 2404 conditions per place. 
[2024-06-20 19:09:25,818 INFO  L140   encePairwiseOnDemand]: 34/42 looper letters, 69 selfloop transitions, 11 changer transitions 0/87 dead transitions.
[2024-06-20 19:09:25,818 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 87 transitions, 707 flow
[2024-06-20 19:09:25,819 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-20 19:09:25,819 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-20 19:09:25,819 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 117 transitions.
[2024-06-20 19:09:25,819 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4642857142857143
[2024-06-20 19:09:25,819 INFO  L175             Difference]: Start difference. First operand has 77 places, 69 transitions, 483 flow. Second operand 6 states and 117 transitions.
[2024-06-20 19:09:25,820 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 87 transitions, 707 flow
[2024-06-20 19:09:25,833 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 87 transitions, 649 flow, removed 6 selfloop flow, removed 7 redundant places.
[2024-06-20 19:09:25,834 INFO  L231             Difference]: Finished difference. Result has 76 places, 72 transitions, 485 flow
[2024-06-20 19:09:25,834 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=425, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=485, PETRI_PLACES=76, PETRI_TRANSITIONS=72}
[2024-06-20 19:09:25,835 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 33 predicate places.
[2024-06-20 19:09:25,835 INFO  L495      AbstractCegarLoop]: Abstraction has has 76 places, 72 transitions, 485 flow
[2024-06-20 19:09:25,835 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:09:25,835 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:09:25,835 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:09:25,835 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2024-06-20 19:09:25,836 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-20 19:09:25,836 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:09:25,836 INFO  L85        PathProgramCache]: Analyzing trace with hash 1674656052, now seen corresponding path program 1 times
[2024-06-20 19:09:25,836 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:09:25,836 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121483831]
[2024-06-20 19:09:25,836 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:09:25,837 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:09:25,876 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:09:36,788 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:09:36,788 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:09:36,788 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121483831]
[2024-06-20 19:09:36,788 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121483831] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:09:36,788 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:09:36,788 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:09:36,789 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775177498]
[2024-06-20 19:09:36,789 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:09:36,789 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:09:36,789 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:09:36,789 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:09:36,789 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:09:36,962 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42
[2024-06-20 19:09:36,962 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 72 transitions, 485 flow. Second operand  has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 9 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:09:36,962 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:09:36,962 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42
[2024-06-20 19:09:36,963 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:09:38,245 INFO  L124   PetriNetUnfolderBase]: 1644/2612 cut-off events.
[2024-06-20 19:09:38,245 INFO  L125   PetriNetUnfolderBase]: For 23315/23319 co-relation queries the response was YES.
[2024-06-20 19:09:38,251 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 11437 conditions, 2612 events. 1644/2612 cut-off events. For 23315/23319 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 13673 event pairs, 546 based on Foata normal form. 5/2608 useless extension candidates. Maximal degree in co-relation 11405. Up to 2298 conditions per place. 
[2024-06-20 19:09:38,258 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 69 selfloop transitions, 28 changer transitions 0/104 dead transitions.
[2024-06-20 19:09:38,258 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 104 transitions, 798 flow
[2024-06-20 19:09:38,260 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:09:38,260 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:09:38,260 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 162 transitions.
[2024-06-20 19:09:38,261 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.48214285714285715
[2024-06-20 19:09:38,261 INFO  L175             Difference]: Start difference. First operand has 76 places, 72 transitions, 485 flow. Second operand 8 states and 162 transitions.
[2024-06-20 19:09:38,261 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 104 transitions, 798 flow
[2024-06-20 19:09:38,273 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 104 transitions, 760 flow, removed 10 selfloop flow, removed 4 redundant places.
[2024-06-20 19:09:38,274 INFO  L231             Difference]: Finished difference. Result has 81 places, 78 transitions, 573 flow
[2024-06-20 19:09:38,274 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=447, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=573, PETRI_PLACES=81, PETRI_TRANSITIONS=78}
[2024-06-20 19:09:38,275 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 38 predicate places.
[2024-06-20 19:09:38,275 INFO  L495      AbstractCegarLoop]: Abstraction has has 81 places, 78 transitions, 573 flow
[2024-06-20 19:09:38,275 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 9 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:09:38,275 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:09:38,275 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:09:38,276 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2024-06-20 19:09:38,276 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-20 19:09:38,276 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:09:38,276 INFO  L85        PathProgramCache]: Analyzing trace with hash -1080501320, now seen corresponding path program 2 times
[2024-06-20 19:09:38,276 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:09:38,276 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213858750]
[2024-06-20 19:09:38,277 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:09:38,277 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:09:38,318 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:09:48,528 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:09:48,528 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:09:48,528 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213858750]
[2024-06-20 19:09:48,528 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213858750] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:09:48,528 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:09:48,528 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:09:48,529 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855468205]
[2024-06-20 19:09:48,529 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:09:48,529 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:09:48,529 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:09:48,529 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:09:48,529 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:09:48,688 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42
[2024-06-20 19:09:48,689 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 78 transitions, 573 flow. Second operand  has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 9 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:09:48,689 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:09:48,689 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42
[2024-06-20 19:09:48,689 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:09:49,950 INFO  L124   PetriNetUnfolderBase]: 1636/2600 cut-off events.
[2024-06-20 19:09:49,951 INFO  L125   PetriNetUnfolderBase]: For 26777/26781 co-relation queries the response was YES.
[2024-06-20 19:09:49,957 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 11960 conditions, 2600 events. 1636/2600 cut-off events. For 26777/26781 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 13528 event pairs, 544 based on Foata normal form. 5/2596 useless extension candidates. Maximal degree in co-relation 11926. Up to 2286 conditions per place. 
[2024-06-20 19:09:49,966 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 70 selfloop transitions, 34 changer transitions 0/111 dead transitions.
[2024-06-20 19:09:49,966 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 111 transitions, 932 flow
[2024-06-20 19:09:49,968 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:09:49,969 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:09:49,969 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 162 transitions.
[2024-06-20 19:09:49,969 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.48214285714285715
[2024-06-20 19:09:49,969 INFO  L175             Difference]: Start difference. First operand has 81 places, 78 transitions, 573 flow. Second operand 8 states and 162 transitions.
[2024-06-20 19:09:49,969 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 111 transitions, 932 flow
[2024-06-20 19:09:49,988 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 111 transitions, 849 flow, removed 11 selfloop flow, removed 5 redundant places.
[2024-06-20 19:09:49,990 INFO  L231             Difference]: Finished difference. Result has 85 places, 86 transitions, 668 flow
[2024-06-20 19:09:49,990 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=500, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=668, PETRI_PLACES=85, PETRI_TRANSITIONS=86}
[2024-06-20 19:09:49,991 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 42 predicate places.
[2024-06-20 19:09:49,991 INFO  L495      AbstractCegarLoop]: Abstraction has has 85 places, 86 transitions, 668 flow
[2024-06-20 19:09:49,991 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 9 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:09:49,991 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:09:49,991 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:09:49,991 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2024-06-20 19:09:49,991 INFO  L420      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:09:49,992 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:09:49,992 INFO  L85        PathProgramCache]: Analyzing trace with hash 1911128082, now seen corresponding path program 3 times
[2024-06-20 19:09:49,992 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:09:49,992 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750485905]
[2024-06-20 19:09:49,992 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:09:49,992 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:09:50,045 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:10:00,563 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:10:00,563 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:10:00,563 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750485905]
[2024-06-20 19:10:00,563 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750485905] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:10:00,563 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:10:00,563 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:10:00,563 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726382476]
[2024-06-20 19:10:00,563 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:10:00,564 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:10:00,564 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:10:00,564 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:10:00,564 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:10:00,791 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42
[2024-06-20 19:10:00,792 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 86 transitions, 668 flow. Second operand  has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 9 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:10:00,792 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:10:00,792 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42
[2024-06-20 19:10:00,792 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:10:01,998 INFO  L124   PetriNetUnfolderBase]: 1669/2672 cut-off events.
[2024-06-20 19:10:01,998 INFO  L125   PetriNetUnfolderBase]: For 30151/30155 co-relation queries the response was YES.
[2024-06-20 19:10:02,005 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 12527 conditions, 2672 events. 1669/2672 cut-off events. For 30151/30155 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 14172 event pairs, 449 based on Foata normal form. 5/2670 useless extension candidates. Maximal degree in co-relation 12491. Up to 2176 conditions per place. 
[2024-06-20 19:10:02,014 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 70 selfloop transitions, 41 changer transitions 0/118 dead transitions.
[2024-06-20 19:10:02,014 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 118 transitions, 1006 flow
[2024-06-20 19:10:02,016 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:10:02,016 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:10:02,017 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 166 transitions.
[2024-06-20 19:10:02,017 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.49404761904761907
[2024-06-20 19:10:02,017 INFO  L175             Difference]: Start difference. First operand has 85 places, 86 transitions, 668 flow. Second operand 8 states and 166 transitions.
[2024-06-20 19:10:02,017 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 118 transitions, 1006 flow
[2024-06-20 19:10:02,036 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 118 transitions, 942 flow, removed 14 selfloop flow, removed 3 redundant places.
[2024-06-20 19:10:02,038 INFO  L231             Difference]: Finished difference. Result has 91 places, 89 transitions, 750 flow
[2024-06-20 19:10:02,038 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=606, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=750, PETRI_PLACES=91, PETRI_TRANSITIONS=89}
[2024-06-20 19:10:02,039 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 48 predicate places.
[2024-06-20 19:10:02,039 INFO  L495      AbstractCegarLoop]: Abstraction has has 91 places, 89 transitions, 750 flow
[2024-06-20 19:10:02,039 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 9 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:10:02,039 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:10:02,039 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:10:02,039 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2024-06-20 19:10:02,039 INFO  L420      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:10:02,040 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:10:02,040 INFO  L85        PathProgramCache]: Analyzing trace with hash -1900444235, now seen corresponding path program 2 times
[2024-06-20 19:10:02,040 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:10:02,040 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106754217]
[2024-06-20 19:10:02,040 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:10:02,040 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:10:02,080 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:10:14,303 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:10:14,304 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:10:14,304 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106754217]
[2024-06-20 19:10:14,304 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106754217] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:10:14,304 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:10:14,304 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-20 19:10:14,304 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658620079]
[2024-06-20 19:10:14,304 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:10:14,304 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-20 19:10:14,305 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:10:14,305 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-20 19:10:14,305 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2024-06-20 19:10:14,439 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42
[2024-06-20 19:10:14,439 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 89 transitions, 750 flow. Second operand  has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:10:14,439 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:10:14,439 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42
[2024-06-20 19:10:14,439 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:10:15,414 INFO  L124   PetriNetUnfolderBase]: 1666/2684 cut-off events.
[2024-06-20 19:10:15,414 INFO  L125   PetriNetUnfolderBase]: For 33196/33203 co-relation queries the response was YES.
[2024-06-20 19:10:15,421 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 12821 conditions, 2684 events. 1666/2684 cut-off events. For 33196/33203 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 14323 event pairs, 548 based on Foata normal form. 7/2688 useless extension candidates. Maximal degree in co-relation 12783. Up to 2484 conditions per place. 
[2024-06-20 19:10:15,429 INFO  L140   encePairwiseOnDemand]: 34/42 looper letters, 78 selfloop transitions, 16 changer transitions 0/101 dead transitions.
[2024-06-20 19:10:15,429 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 101 transitions, 998 flow
[2024-06-20 19:10:15,430 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-20 19:10:15,430 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-20 19:10:15,430 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 113 transitions.
[2024-06-20 19:10:15,430 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44841269841269843
[2024-06-20 19:10:15,430 INFO  L175             Difference]: Start difference. First operand has 91 places, 89 transitions, 750 flow. Second operand 6 states and 113 transitions.
[2024-06-20 19:10:15,431 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 101 transitions, 998 flow
[2024-06-20 19:10:15,453 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 101 transitions, 908 flow, removed 12 selfloop flow, removed 5 redundant places.
[2024-06-20 19:10:15,455 INFO  L231             Difference]: Finished difference. Result has 92 places, 92 transitions, 742 flow
[2024-06-20 19:10:15,455 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=660, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=742, PETRI_PLACES=92, PETRI_TRANSITIONS=92}
[2024-06-20 19:10:15,456 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 49 predicate places.
[2024-06-20 19:10:15,456 INFO  L495      AbstractCegarLoop]: Abstraction has has 92 places, 92 transitions, 742 flow
[2024-06-20 19:10:15,456 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:10:15,456 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:10:15,456 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:10:15,456 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2024-06-20 19:10:15,456 INFO  L420      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:10:15,457 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:10:15,457 INFO  L85        PathProgramCache]: Analyzing trace with hash -1906152203, now seen corresponding path program 1 times
[2024-06-20 19:10:15,457 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:10:15,457 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238075335]
[2024-06-20 19:10:15,457 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:10:15,457 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:10:15,496 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:10:27,765 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:10:27,765 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:10:27,765 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238075335]
[2024-06-20 19:10:27,765 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238075335] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:10:27,766 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:10:27,766 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:10:27,766 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080903117]
[2024-06-20 19:10:27,766 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:10:27,766 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:10:27,766 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:10:27,766 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:10:27,767 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:10:27,914 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 42
[2024-06-20 19:10:27,914 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 92 transitions, 742 flow. Second operand  has 8 states, 8 states have (on average 13.625) internal successors, (109), 8 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:10:27,915 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:10:27,915 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 42
[2024-06-20 19:10:27,915 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:10:28,878 INFO  L124   PetriNetUnfolderBase]: 1506/2503 cut-off events.
[2024-06-20 19:10:28,878 INFO  L125   PetriNetUnfolderBase]: For 31769/31769 co-relation queries the response was YES.
[2024-06-20 19:10:28,885 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 11859 conditions, 2503 events. 1506/2503 cut-off events. For 31769/31769 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 13721 event pairs, 473 based on Foata normal form. 2/2503 useless extension candidates. Maximal degree in co-relation 11820. Up to 2262 conditions per place. 
[2024-06-20 19:10:28,891 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 89 selfloop transitions, 11 changer transitions 0/108 dead transitions.
[2024-06-20 19:10:28,891 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 108 transitions, 1002 flow
[2024-06-20 19:10:28,892 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-20 19:10:28,892 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-20 19:10:28,892 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 120 transitions.
[2024-06-20 19:10:28,893 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.47619047619047616
[2024-06-20 19:10:28,893 INFO  L175             Difference]: Start difference. First operand has 92 places, 92 transitions, 742 flow. Second operand 6 states and 120 transitions.
[2024-06-20 19:10:28,893 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 108 transitions, 1002 flow
[2024-06-20 19:10:28,912 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 108 transitions, 942 flow, removed 16 selfloop flow, removed 4 redundant places.
[2024-06-20 19:10:28,914 INFO  L231             Difference]: Finished difference. Result has 94 places, 95 transitions, 740 flow
[2024-06-20 19:10:28,914 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=682, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=740, PETRI_PLACES=94, PETRI_TRANSITIONS=95}
[2024-06-20 19:10:28,914 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 51 predicate places.
[2024-06-20 19:10:28,914 INFO  L495      AbstractCegarLoop]: Abstraction has has 94 places, 95 transitions, 740 flow
[2024-06-20 19:10:28,915 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 13.625) internal successors, (109), 8 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:10:28,915 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:10:28,915 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:10:28,915 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2024-06-20 19:10:28,915 INFO  L420      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:10:28,915 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:10:28,916 INFO  L85        PathProgramCache]: Analyzing trace with hash -1900438283, now seen corresponding path program 2 times
[2024-06-20 19:10:28,916 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:10:28,916 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316845424]
[2024-06-20 19:10:28,916 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:10:28,916 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:10:28,954 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:10:41,021 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:10:41,021 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:10:41,021 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316845424]
[2024-06-20 19:10:41,021 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316845424] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:10:41,021 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:10:41,021 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:10:41,021 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108344200]
[2024-06-20 19:10:41,021 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:10:41,021 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:10:41,022 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:10:41,022 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:10:41,022 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:10:41,177 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 42
[2024-06-20 19:10:41,178 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 95 transitions, 740 flow. Second operand  has 8 states, 8 states have (on average 13.625) internal successors, (109), 8 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:10:41,178 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:10:41,178 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 42
[2024-06-20 19:10:41,178 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:10:42,123 INFO  L124   PetriNetUnfolderBase]: 1508/2508 cut-off events.
[2024-06-20 19:10:42,124 INFO  L125   PetriNetUnfolderBase]: For 34723/34723 co-relation queries the response was YES.
[2024-06-20 19:10:42,131 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 12271 conditions, 2508 events. 1508/2508 cut-off events. For 34723/34723 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 13741 event pairs, 473 based on Foata normal form. 2/2508 useless extension candidates. Maximal degree in co-relation 12231. Up to 2256 conditions per place. 
[2024-06-20 19:10:42,139 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 88 selfloop transitions, 17 changer transitions 0/113 dead transitions.
[2024-06-20 19:10:42,139 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 113 transitions, 1024 flow
[2024-06-20 19:10:42,139 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 19:10:42,139 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 19:10:42,140 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 138 transitions.
[2024-06-20 19:10:42,140 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46938775510204084
[2024-06-20 19:10:42,140 INFO  L175             Difference]: Start difference. First operand has 94 places, 95 transitions, 740 flow. Second operand 7 states and 138 transitions.
[2024-06-20 19:10:42,140 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 113 transitions, 1024 flow
[2024-06-20 19:10:42,161 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 113 transitions, 988 flow, removed 9 selfloop flow, removed 4 redundant places.
[2024-06-20 19:10:42,162 INFO  L231             Difference]: Finished difference. Result has 97 places, 98 transitions, 780 flow
[2024-06-20 19:10:42,162 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=704, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=780, PETRI_PLACES=97, PETRI_TRANSITIONS=98}
[2024-06-20 19:10:42,163 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 54 predicate places.
[2024-06-20 19:10:42,163 INFO  L495      AbstractCegarLoop]: Abstraction has has 97 places, 98 transitions, 780 flow
[2024-06-20 19:10:42,163 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 13.625) internal successors, (109), 8 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:10:42,163 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:10:42,163 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:10:42,163 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2024-06-20 19:10:42,163 INFO  L420      AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:10:42,164 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:10:42,164 INFO  L85        PathProgramCache]: Analyzing trace with hash -1900430347, now seen corresponding path program 1 times
[2024-06-20 19:10:42,164 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:10:42,164 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541263223]
[2024-06-20 19:10:42,164 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:10:42,164 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:10:42,203 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:10:54,783 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:10:54,783 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:10:54,783 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541263223]
[2024-06-20 19:10:54,783 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541263223] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:10:54,783 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:10:54,783 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:10:54,783 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018851110]
[2024-06-20 19:10:54,783 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:10:54,784 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:10:54,784 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:10:54,784 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:10:54,784 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:10:54,894 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42
[2024-06-20 19:10:54,894 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 98 transitions, 780 flow. Second operand  has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:10:54,895 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:10:54,895 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42
[2024-06-20 19:10:54,895 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:10:55,873 INFO  L124   PetriNetUnfolderBase]: 1590/2589 cut-off events.
[2024-06-20 19:10:55,873 INFO  L125   PetriNetUnfolderBase]: For 37632/37632 co-relation queries the response was YES.
[2024-06-20 19:10:55,882 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 13033 conditions, 2589 events. 1590/2589 cut-off events. For 37632/37632 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 13860 event pairs, 500 based on Foata normal form. 1/2588 useless extension candidates. Maximal degree in co-relation 12992. Up to 2426 conditions per place. 
[2024-06-20 19:10:55,890 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 91 selfloop transitions, 14 changer transitions 0/111 dead transitions.
[2024-06-20 19:10:55,890 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 111 transitions, 1050 flow
[2024-06-20 19:10:55,890 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 19:10:55,891 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 19:10:55,891 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 126 transitions.
[2024-06-20 19:10:55,891 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42857142857142855
[2024-06-20 19:10:55,891 INFO  L175             Difference]: Start difference. First operand has 97 places, 98 transitions, 780 flow. Second operand 7 states and 126 transitions.
[2024-06-20 19:10:55,892 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 111 transitions, 1050 flow
[2024-06-20 19:10:55,919 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 111 transitions, 996 flow, removed 12 selfloop flow, removed 5 redundant places.
[2024-06-20 19:10:55,921 INFO  L231             Difference]: Finished difference. Result has 99 places, 101 transitions, 802 flow
[2024-06-20 19:10:55,921 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=726, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=802, PETRI_PLACES=99, PETRI_TRANSITIONS=101}
[2024-06-20 19:10:55,922 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 56 predicate places.
[2024-06-20 19:10:55,922 INFO  L495      AbstractCegarLoop]: Abstraction has has 99 places, 101 transitions, 802 flow
[2024-06-20 19:10:55,922 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:10:55,922 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:10:55,922 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:10:55,923 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2024-06-20 19:10:55,923 INFO  L420      AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:10:55,923 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:10:55,923 INFO  L85        PathProgramCache]: Analyzing trace with hash 861209855, now seen corresponding path program 1 times
[2024-06-20 19:10:55,923 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:10:55,923 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197915305]
[2024-06-20 19:10:55,923 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:10:55,924 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:10:55,973 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:11:08,408 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:11:08,409 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:11:08,409 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197915305]
[2024-06-20 19:11:08,409 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197915305] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:11:08,409 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:11:08,416 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:11:08,416 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403397737]
[2024-06-20 19:11:08,416 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:11:08,417 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:11:08,418 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:11:08,419 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:11:08,419 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:11:08,623 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42
[2024-06-20 19:11:08,624 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 101 transitions, 802 flow. Second operand  has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:11:08,624 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:11:08,624 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42
[2024-06-20 19:11:08,624 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:11:09,758 INFO  L124   PetriNetUnfolderBase]: 1687/2720 cut-off events.
[2024-06-20 19:11:09,759 INFO  L125   PetriNetUnfolderBase]: For 48345/48345 co-relation queries the response was YES.
[2024-06-20 19:11:09,767 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 14453 conditions, 2720 events. 1687/2720 cut-off events. For 48345/48345 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 14550 event pairs, 532 based on Foata normal form. 3/2721 useless extension candidates. Maximal degree in co-relation 14411. Up to 2449 conditions per place. 
[2024-06-20 19:11:09,775 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 106 selfloop transitions, 26 changer transitions 0/139 dead transitions.
[2024-06-20 19:11:09,775 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 139 transitions, 1212 flow
[2024-06-20 19:11:09,776 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:11:09,776 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:11:09,776 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 178 transitions.
[2024-06-20 19:11:09,777 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4708994708994709
[2024-06-20 19:11:09,777 INFO  L175             Difference]: Start difference. First operand has 99 places, 101 transitions, 802 flow. Second operand 9 states and 178 transitions.
[2024-06-20 19:11:09,777 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 139 transitions, 1212 flow
[2024-06-20 19:11:09,803 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 139 transitions, 1158 flow, removed 15 selfloop flow, removed 5 redundant places.
[2024-06-20 19:11:09,805 INFO  L231             Difference]: Finished difference. Result has 104 places, 108 transitions, 892 flow
[2024-06-20 19:11:09,805 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=748, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=892, PETRI_PLACES=104, PETRI_TRANSITIONS=108}
[2024-06-20 19:11:09,806 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 61 predicate places.
[2024-06-20 19:11:09,806 INFO  L495      AbstractCegarLoop]: Abstraction has has 104 places, 108 transitions, 892 flow
[2024-06-20 19:11:09,806 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:11:09,806 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:11:09,806 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:11:09,806 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2024-06-20 19:11:09,807 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-20 19:11:09,807 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:11:09,807 INFO  L85        PathProgramCache]: Analyzing trace with hash 2119238666, now seen corresponding path program 1 times
[2024-06-20 19:11:09,807 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:11:09,807 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167879358]
[2024-06-20 19:11:09,807 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:11:09,807 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:11:09,847 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:11:21,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-20 19:11:21,913 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:11:21,913 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167879358]
[2024-06-20 19:11:21,913 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167879358] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:11:21,913 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:11:21,913 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:11:21,913 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089444096]
[2024-06-20 19:11:21,914 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:11:21,914 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:11:21,914 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:11:21,914 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:11:21,914 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:11:22,082 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42
[2024-06-20 19:11:22,082 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 108 transitions, 892 flow. Second operand  has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:11:22,082 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:11:22,082 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42
[2024-06-20 19:11:22,082 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:11:23,442 INFO  L124   PetriNetUnfolderBase]: 1797/2920 cut-off events.
[2024-06-20 19:11:23,442 INFO  L125   PetriNetUnfolderBase]: For 55303/55303 co-relation queries the response was YES.
[2024-06-20 19:11:23,450 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 15978 conditions, 2920 events. 1797/2920 cut-off events. For 55303/55303 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 16116 event pairs, 546 based on Foata normal form. 12/2927 useless extension candidates. Maximal degree in co-relation 15934. Up to 2271 conditions per place. 
[2024-06-20 19:11:23,457 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 102 selfloop transitions, 37 changer transitions 0/146 dead transitions.
[2024-06-20 19:11:23,457 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 146 transitions, 1320 flow
[2024-06-20 19:11:23,460 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:11:23,460 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:11:23,460 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 167 transitions.
[2024-06-20 19:11:23,460 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.49702380952380953
[2024-06-20 19:11:23,460 INFO  L175             Difference]: Start difference. First operand has 104 places, 108 transitions, 892 flow. Second operand 8 states and 167 transitions.
[2024-06-20 19:11:23,460 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 146 transitions, 1320 flow
[2024-06-20 19:11:23,487 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 146 transitions, 1232 flow, removed 21 selfloop flow, removed 7 redundant places.
[2024-06-20 19:11:23,488 INFO  L231             Difference]: Finished difference. Result has 106 places, 113 transitions, 953 flow
[2024-06-20 19:11:23,489 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=804, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=953, PETRI_PLACES=106, PETRI_TRANSITIONS=113}
[2024-06-20 19:11:23,489 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 63 predicate places.
[2024-06-20 19:11:23,489 INFO  L495      AbstractCegarLoop]: Abstraction has has 106 places, 113 transitions, 953 flow
[2024-06-20 19:11:23,489 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:11:23,489 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:11:23,489 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:11:23,490 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2024-06-20 19:11:23,490 INFO  L420      AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:11:23,490 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:11:23,490 INFO  L85        PathProgramCache]: Analyzing trace with hash 861508385, now seen corresponding path program 2 times
[2024-06-20 19:11:23,490 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:11:23,490 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720652816]
[2024-06-20 19:11:23,490 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:11:23,491 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:11:23,529 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:11:36,324 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:11:36,324 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:11:36,324 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720652816]
[2024-06-20 19:11:36,324 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720652816] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:11:36,324 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:11:36,324 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:11:36,324 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700329417]
[2024-06-20 19:11:36,324 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:11:36,325 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:11:36,325 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:11:36,325 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:11:36,325 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:11:36,538 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42
[2024-06-20 19:11:36,539 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 113 transitions, 953 flow. Second operand  has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:11:36,539 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:11:36,539 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42
[2024-06-20 19:11:36,539 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:11:37,845 INFO  L124   PetriNetUnfolderBase]: 1848/3005 cut-off events.
[2024-06-20 19:11:37,845 INFO  L125   PetriNetUnfolderBase]: For 59991/59991 co-relation queries the response was YES.
[2024-06-20 19:11:37,854 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 16826 conditions, 3005 events. 1848/3005 cut-off events. For 59991/59991 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 16721 event pairs, 558 based on Foata normal form. 3/3006 useless extension candidates. Maximal degree in co-relation 16781. Up to 2662 conditions per place. 
[2024-06-20 19:11:37,863 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 112 selfloop transitions, 32 changer transitions 0/151 dead transitions.
[2024-06-20 19:11:37,863 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 151 transitions, 1471 flow
[2024-06-20 19:11:37,864 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:11:37,864 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:11:37,864 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 179 transitions.
[2024-06-20 19:11:37,864 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.47354497354497355
[2024-06-20 19:11:37,864 INFO  L175             Difference]: Start difference. First operand has 106 places, 113 transitions, 953 flow. Second operand 9 states and 179 transitions.
[2024-06-20 19:11:37,864 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 151 transitions, 1471 flow
[2024-06-20 19:11:37,897 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 151 transitions, 1420 flow, removed 9 selfloop flow, removed 3 redundant places.
[2024-06-20 19:11:37,899 INFO  L231             Difference]: Finished difference. Result has 113 places, 121 transitions, 1098 flow
[2024-06-20 19:11:37,899 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=902, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1098, PETRI_PLACES=113, PETRI_TRANSITIONS=121}
[2024-06-20 19:11:37,899 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 70 predicate places.
[2024-06-20 19:11:37,899 INFO  L495      AbstractCegarLoop]: Abstraction has has 113 places, 121 transitions, 1098 flow
[2024-06-20 19:11:37,899 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:11:37,899 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:11:37,900 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:11:37,900 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2024-06-20 19:11:37,900 INFO  L420      AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:11:37,900 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:11:37,900 INFO  L85        PathProgramCache]: Analyzing trace with hash 861508757, now seen corresponding path program 1 times
[2024-06-20 19:11:37,900 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:11:37,900 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357291300]
[2024-06-20 19:11:37,900 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:11:37,900 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:11:37,939 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:11:50,461 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:11:50,462 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:11:50,462 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357291300]
[2024-06-20 19:11:50,462 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357291300] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:11:50,462 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:11:50,462 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:11:50,462 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158615728]
[2024-06-20 19:11:50,462 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:11:50,462 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:11:50,462 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:11:50,463 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:11:50,463 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:11:50,569 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-20 19:11:50,569 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 121 transitions, 1098 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-20 19:11:50,569 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:11:50,569 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-20 19:11:50,569 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:11:51,701 INFO  L124   PetriNetUnfolderBase]: 1938/3097 cut-off events.
[2024-06-20 19:11:51,702 INFO  L125   PetriNetUnfolderBase]: For 66462/66462 co-relation queries the response was YES.
[2024-06-20 19:11:51,713 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 18086 conditions, 3097 events. 1938/3097 cut-off events. For 66462/66462 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 16834 event pairs, 590 based on Foata normal form. 1/3096 useless extension candidates. Maximal degree in co-relation 18039. Up to 2939 conditions per place. 
[2024-06-20 19:11:51,725 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 121 selfloop transitions, 14 changer transitions 0/140 dead transitions.
[2024-06-20 19:11:51,725 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 140 transitions, 1456 flow
[2024-06-20 19:11:51,725 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 19:11:51,725 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 19:11:51,725 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 126 transitions.
[2024-06-20 19:11:51,726 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42857142857142855
[2024-06-20 19:11:51,726 INFO  L175             Difference]: Start difference. First operand has 113 places, 121 transitions, 1098 flow. Second operand 7 states and 126 transitions.
[2024-06-20 19:11:51,726 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 140 transitions, 1456 flow
[2024-06-20 19:11:51,780 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 140 transitions, 1381 flow, removed 25 selfloop flow, removed 5 redundant places.
[2024-06-20 19:11:51,781 INFO  L231             Difference]: Finished difference. Result has 115 places, 124 transitions, 1111 flow
[2024-06-20 19:11:51,782 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1023, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1111, PETRI_PLACES=115, PETRI_TRANSITIONS=124}
[2024-06-20 19:11:51,782 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 72 predicate places.
[2024-06-20 19:11:51,782 INFO  L495      AbstractCegarLoop]: Abstraction has has 115 places, 124 transitions, 1111 flow
[2024-06-20 19:11:51,782 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-20 19:11:51,782 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:11:51,783 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:11:51,783 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2024-06-20 19:11:51,783 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-20 19:11:51,783 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:11:51,783 INFO  L85        PathProgramCache]: Analyzing trace with hash -1044896788, now seen corresponding path program 2 times
[2024-06-20 19:11:51,783 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:11:51,783 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253655340]
[2024-06-20 19:11:51,784 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:11:51,784 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:11:51,829 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:12:03,607 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:12:03,607 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:12:03,607 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253655340]
[2024-06-20 19:12:03,607 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253655340] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:12:03,607 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:12:03,607 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:12:03,607 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628885948]
[2024-06-20 19:12:03,607 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:12:03,608 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:12:03,608 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:12:03,608 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:12:03,608 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:12:03,803 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42
[2024-06-20 19:12:03,804 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 124 transitions, 1111 flow. Second operand  has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:12:03,804 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:12:03,804 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42
[2024-06-20 19:12:03,804 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:12:05,175 INFO  L124   PetriNetUnfolderBase]: 1843/2990 cut-off events.
[2024-06-20 19:12:05,175 INFO  L125   PetriNetUnfolderBase]: For 71722/71722 co-relation queries the response was YES.
[2024-06-20 19:12:05,184 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 17740 conditions, 2990 events. 1843/2990 cut-off events. For 71722/71722 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 16513 event pairs, 347 based on Foata normal form. 12/2997 useless extension candidates. Maximal degree in co-relation 17691. Up to 1909 conditions per place. 
[2024-06-20 19:12:05,192 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 106 selfloop transitions, 40 changer transitions 0/154 dead transitions.
[2024-06-20 19:12:05,192 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 154 transitions, 1503 flow
[2024-06-20 19:12:05,193 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 19:12:05,193 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 19:12:05,193 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 150 transitions.
[2024-06-20 19:12:05,193 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5102040816326531
[2024-06-20 19:12:05,193 INFO  L175             Difference]: Start difference. First operand has 115 places, 124 transitions, 1111 flow. Second operand 7 states and 150 transitions.
[2024-06-20 19:12:05,193 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 154 transitions, 1503 flow
[2024-06-20 19:12:05,233 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 154 transitions, 1431 flow, removed 24 selfloop flow, removed 5 redundant places.
[2024-06-20 19:12:05,235 INFO  L231             Difference]: Finished difference. Result has 117 places, 124 transitions, 1128 flow
[2024-06-20 19:12:05,235 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1039, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1128, PETRI_PLACES=117, PETRI_TRANSITIONS=124}
[2024-06-20 19:12:05,236 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 74 predicate places.
[2024-06-20 19:12:05,236 INFO  L495      AbstractCegarLoop]: Abstraction has has 117 places, 124 transitions, 1128 flow
[2024-06-20 19:12:05,236 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:12:05,236 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:12:05,236 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:12:05,236 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2024-06-20 19:12:05,236 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-20 19:12:05,237 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:12:05,237 INFO  L85        PathProgramCache]: Analyzing trace with hash -2027480738, now seen corresponding path program 3 times
[2024-06-20 19:12:05,237 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:12:05,237 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680389018]
[2024-06-20 19:12:05,237 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:12:05,238 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:12:05,278 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:12:16,393 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:12:16,393 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:12:16,393 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680389018]
[2024-06-20 19:12:16,393 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680389018] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:12:16,393 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:12:16,393 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:12:16,394 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61774677]
[2024-06-20 19:12:16,394 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:12:16,394 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:12:16,394 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:12:16,394 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:12:16,394 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:12:16,589 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42
[2024-06-20 19:12:16,589 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 124 transitions, 1128 flow. Second operand  has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:12:16,589 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:12:16,589 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42
[2024-06-20 19:12:16,589 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:12:17,772 INFO  L124   PetriNetUnfolderBase]: 1823/2959 cut-off events.
[2024-06-20 19:12:17,773 INFO  L125   PetriNetUnfolderBase]: For 74464/74468 co-relation queries the response was YES.
[2024-06-20 19:12:17,783 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 17745 conditions, 2959 events. 1823/2959 cut-off events. For 74464/74468 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 16317 event pairs, 310 based on Foata normal form. 13/2962 useless extension candidates. Maximal degree in co-relation 17695. Up to 1767 conditions per place. 
[2024-06-20 19:12:17,793 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 101 selfloop transitions, 39 changer transitions 0/148 dead transitions.
[2024-06-20 19:12:17,793 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 148 transitions, 1462 flow
[2024-06-20 19:12:17,795 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 19:12:17,795 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 19:12:17,795 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 142 transitions.
[2024-06-20 19:12:17,796 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.48299319727891155
[2024-06-20 19:12:17,796 INFO  L175             Difference]: Start difference. First operand has 117 places, 124 transitions, 1128 flow. Second operand 7 states and 142 transitions.
[2024-06-20 19:12:17,796 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 148 transitions, 1462 flow
[2024-06-20 19:12:17,842 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 148 transitions, 1358 flow, removed 5 selfloop flow, removed 6 redundant places.
[2024-06-20 19:12:17,844 INFO  L231             Difference]: Finished difference. Result has 117 places, 123 transitions, 1074 flow
[2024-06-20 19:12:17,844 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=992, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1074, PETRI_PLACES=117, PETRI_TRANSITIONS=123}
[2024-06-20 19:12:17,845 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 74 predicate places.
[2024-06-20 19:12:17,845 INFO  L495      AbstractCegarLoop]: Abstraction has has 117 places, 123 transitions, 1074 flow
[2024-06-20 19:12:17,845 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:12:17,845 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:12:17,845 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:12:17,845 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2024-06-20 19:12:17,845 INFO  L420      AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:12:17,846 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:12:17,846 INFO  L85        PathProgramCache]: Analyzing trace with hash 871697837, now seen corresponding path program 2 times
[2024-06-20 19:12:17,846 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:12:17,846 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463825391]
[2024-06-20 19:12:17,846 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:12:17,846 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:12:17,886 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:12:30,299 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:12:30,300 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:12:30,300 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463825391]
[2024-06-20 19:12:30,300 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463825391] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:12:30,300 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:12:30,300 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:12:30,300 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618355009]
[2024-06-20 19:12:30,300 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:12:30,300 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:12:30,301 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:12:30,301 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:12:30,316 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:12:30,474 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-20 19:12:30,474 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 123 transitions, 1074 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-20 19:12:30,474 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:12:30,474 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-20 19:12:30,474 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:12:31,469 INFO  L124   PetriNetUnfolderBase]: 1903/3042 cut-off events.
[2024-06-20 19:12:31,469 INFO  L125   PetriNetUnfolderBase]: For 70969/70979 co-relation queries the response was YES.
[2024-06-20 19:12:31,479 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 18068 conditions, 3042 events. 1903/3042 cut-off events. For 70969/70979 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 16522 event pairs, 569 based on Foata normal form. 9/3048 useless extension candidates. Maximal degree in co-relation 18017. Up to 2866 conditions per place. 
[2024-06-20 19:12:31,488 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 108 selfloop transitions, 27 changer transitions 0/140 dead transitions.
[2024-06-20 19:12:31,489 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 140 transitions, 1528 flow
[2024-06-20 19:12:31,489 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 19:12:31,489 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 19:12:31,489 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 123 transitions.
[2024-06-20 19:12:31,490 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41836734693877553
[2024-06-20 19:12:31,490 INFO  L175             Difference]: Start difference. First operand has 117 places, 123 transitions, 1074 flow. Second operand 7 states and 123 transitions.
[2024-06-20 19:12:31,490 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 140 transitions, 1528 flow
[2024-06-20 19:12:31,531 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 140 transitions, 1417 flow, removed 6 selfloop flow, removed 6 redundant places.
[2024-06-20 19:12:31,532 INFO  L231             Difference]: Finished difference. Result has 118 places, 129 transitions, 1137 flow
[2024-06-20 19:12:31,533 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=963, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1137, PETRI_PLACES=118, PETRI_TRANSITIONS=129}
[2024-06-20 19:12:31,533 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 75 predicate places.
[2024-06-20 19:12:31,533 INFO  L495      AbstractCegarLoop]: Abstraction has has 118 places, 129 transitions, 1137 flow
[2024-06-20 19:12:31,533 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-20 19:12:31,533 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:12:31,533 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:12:31,533 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26
[2024-06-20 19:12:31,533 INFO  L420      AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:12:31,534 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:12:31,534 INFO  L85        PathProgramCache]: Analyzing trace with hash 871685375, now seen corresponding path program 3 times
[2024-06-20 19:12:31,534 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:12:31,534 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593101647]
[2024-06-20 19:12:31,534 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:12:31,534 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:12:31,573 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:12:43,963 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:12:43,964 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:12:43,964 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593101647]
[2024-06-20 19:12:43,964 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593101647] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:12:43,964 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:12:43,964 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:12:43,964 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696596428]
[2024-06-20 19:12:43,964 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:12:43,965 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:12:43,965 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:12:43,965 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:12:43,965 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:12:44,168 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42
[2024-06-20 19:12:44,169 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 129 transitions, 1137 flow. Second operand  has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:12:44,169 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:12:44,169 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42
[2024-06-20 19:12:44,169 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:12:45,255 INFO  L124   PetriNetUnfolderBase]: 1855/3011 cut-off events.
[2024-06-20 19:12:45,255 INFO  L125   PetriNetUnfolderBase]: For 77627/77637 co-relation queries the response was YES.
[2024-06-20 19:12:45,266 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 18029 conditions, 3011 events. 1855/3011 cut-off events. For 77627/77637 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 16647 event pairs, 539 based on Foata normal form. 11/3019 useless extension candidates. Maximal degree in co-relation 17978. Up to 2598 conditions per place. 
[2024-06-20 19:12:45,276 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 104 selfloop transitions, 45 changer transitions 0/159 dead transitions.
[2024-06-20 19:12:45,276 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 159 transitions, 1733 flow
[2024-06-20 19:12:45,276 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:12:45,276 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:12:45,277 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 161 transitions.
[2024-06-20 19:12:45,277 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4791666666666667
[2024-06-20 19:12:45,277 INFO  L175             Difference]: Start difference. First operand has 118 places, 129 transitions, 1137 flow. Second operand 8 states and 161 transitions.
[2024-06-20 19:12:45,277 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 159 transitions, 1733 flow
[2024-06-20 19:12:45,320 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 159 transitions, 1663 flow, removed 26 selfloop flow, removed 3 redundant places.
[2024-06-20 19:12:45,322 INFO  L231             Difference]: Finished difference. Result has 124 places, 137 transitions, 1309 flow
[2024-06-20 19:12:45,322 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1067, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1309, PETRI_PLACES=124, PETRI_TRANSITIONS=137}
[2024-06-20 19:12:45,322 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 81 predicate places.
[2024-06-20 19:12:45,323 INFO  L495      AbstractCegarLoop]: Abstraction has has 124 places, 137 transitions, 1309 flow
[2024-06-20 19:12:45,323 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:12:45,323 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:12:45,323 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:12:45,323 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27
[2024-06-20 19:12:45,323 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-20 19:12:45,324 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:12:45,324 INFO  L85        PathProgramCache]: Analyzing trace with hash 1355002585, now seen corresponding path program 3 times
[2024-06-20 19:12:45,324 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:12:45,324 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049183416]
[2024-06-20 19:12:45,324 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:12:45,324 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:12:45,364 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:12:57,632 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:12:57,632 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:12:57,632 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049183416]
[2024-06-20 19:12:57,632 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049183416] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:12:57,632 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:12:57,632 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:12:57,632 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714717417]
[2024-06-20 19:12:57,633 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:12:57,633 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:12:57,633 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:12:57,633 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:12:57,633 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:12:57,761 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-20 19:12:57,761 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 137 transitions, 1309 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-20 19:12:57,761 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:12:57,761 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-20 19:12:57,761 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:12:58,768 INFO  L124   PetriNetUnfolderBase]: 1927/3082 cut-off events.
[2024-06-20 19:12:58,768 INFO  L125   PetriNetUnfolderBase]: For 84541/84551 co-relation queries the response was YES.
[2024-06-20 19:12:58,778 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 19247 conditions, 3082 events. 1927/3082 cut-off events. For 84541/84551 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 16815 event pairs, 575 based on Foata normal form. 9/3088 useless extension candidates. Maximal degree in co-relation 19193. Up to 2901 conditions per place. 
[2024-06-20 19:12:58,787 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 116 selfloop transitions, 26 changer transitions 0/147 dead transitions.
[2024-06-20 19:12:58,788 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 147 transitions, 1617 flow
[2024-06-20 19:12:58,788 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 19:12:58,788 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 19:12:58,788 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 123 transitions.
[2024-06-20 19:12:58,788 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41836734693877553
[2024-06-20 19:12:58,789 INFO  L175             Difference]: Start difference. First operand has 124 places, 137 transitions, 1309 flow. Second operand 7 states and 123 transitions.
[2024-06-20 19:12:58,789 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 147 transitions, 1617 flow
[2024-06-20 19:12:58,841 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 147 transitions, 1443 flow, removed 55 selfloop flow, removed 5 redundant places.
[2024-06-20 19:12:58,843 INFO  L231             Difference]: Finished difference. Result has 126 places, 137 transitions, 1193 flow
[2024-06-20 19:12:58,843 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1135, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1193, PETRI_PLACES=126, PETRI_TRANSITIONS=137}
[2024-06-20 19:12:58,844 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 83 predicate places.
[2024-06-20 19:12:58,844 INFO  L495      AbstractCegarLoop]: Abstraction has has 126 places, 137 transitions, 1193 flow
[2024-06-20 19:12:58,844 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-20 19:12:58,844 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:12:58,844 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:12:58,844 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28
[2024-06-20 19:12:58,844 INFO  L420      AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:12:58,845 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:12:58,845 INFO  L85        PathProgramCache]: Analyzing trace with hash 1038819953, now seen corresponding path program 1 times
[2024-06-20 19:12:58,845 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:12:58,845 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949306681]
[2024-06-20 19:12:58,845 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:12:58,845 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:12:58,897 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:13:10,543 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:13:10,544 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:13:10,544 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949306681]
[2024-06-20 19:13:10,544 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949306681] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:13:10,544 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:13:10,544 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:13:10,544 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745763942]
[2024-06-20 19:13:10,544 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:13:10,544 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:13:10,545 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:13:10,545 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:13:10,545 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:13:10,758 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 42
[2024-06-20 19:13:10,758 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 137 transitions, 1193 flow. Second operand  has 8 states, 8 states have (on average 13.75) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:13:10,758 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:13:10,758 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 42
[2024-06-20 19:13:10,758 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:13:11,771 INFO  L124   PetriNetUnfolderBase]: 1663/2809 cut-off events.
[2024-06-20 19:13:11,772 INFO  L125   PetriNetUnfolderBase]: For 75157/75157 co-relation queries the response was YES.
[2024-06-20 19:13:11,780 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 16606 conditions, 2809 events. 1663/2809 cut-off events. For 75157/75157 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 16057 event pairs, 459 based on Foata normal form. 1/2808 useless extension candidates. Maximal degree in co-relation 16551. Up to 2500 conditions per place. 
[2024-06-20 19:13:11,788 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 131 selfloop transitions, 14 changer transitions 0/156 dead transitions.
[2024-06-20 19:13:11,788 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 156 transitions, 1569 flow
[2024-06-20 19:13:11,789 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 19:13:11,789 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 19:13:11,789 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 137 transitions.
[2024-06-20 19:13:11,789 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46598639455782315
[2024-06-20 19:13:11,789 INFO  L175             Difference]: Start difference. First operand has 126 places, 137 transitions, 1193 flow. Second operand 7 states and 137 transitions.
[2024-06-20 19:13:11,789 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 156 transitions, 1569 flow
[2024-06-20 19:13:11,838 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 156 transitions, 1499 flow, removed 5 selfloop flow, removed 6 redundant places.
[2024-06-20 19:13:11,840 INFO  L231             Difference]: Finished difference. Result has 127 places, 140 transitions, 1209 flow
[2024-06-20 19:13:11,840 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1123, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1209, PETRI_PLACES=127, PETRI_TRANSITIONS=140}
[2024-06-20 19:13:11,840 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 84 predicate places.
[2024-06-20 19:13:11,840 INFO  L495      AbstractCegarLoop]: Abstraction has has 127 places, 140 transitions, 1209 flow
[2024-06-20 19:13:11,841 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 13.75) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:13:11,841 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:13:11,841 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:13:11,841 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29
[2024-06-20 19:13:11,841 INFO  L420      AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:13:11,841 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:13:11,841 INFO  L85        PathProgramCache]: Analyzing trace with hash -658025231, now seen corresponding path program 1 times
[2024-06-20 19:13:11,841 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:13:11,841 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573382420]
[2024-06-20 19:13:11,841 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:13:11,841 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:13:11,878 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:13:24,585 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:13:24,585 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:13:24,585 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573382420]
[2024-06-20 19:13:24,585 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573382420] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:13:24,585 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:13:24,585 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:13:24,585 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741886484]
[2024-06-20 19:13:24,585 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:13:24,586 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:13:24,586 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:13:24,586 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:13:24,586 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:13:24,772 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42
[2024-06-20 19:13:24,773 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 140 transitions, 1209 flow. Second operand  has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:13:24,773 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:13:24,773 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42
[2024-06-20 19:13:24,773 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:13:25,753 INFO  L124   PetriNetUnfolderBase]: 1767/2919 cut-off events.
[2024-06-20 19:13:25,753 INFO  L125   PetriNetUnfolderBase]: For 80308/80308 co-relation queries the response was YES.
[2024-06-20 19:13:25,764 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 17504 conditions, 2919 events. 1767/2919 cut-off events. For 80308/80308 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 16374 event pairs, 498 based on Foata normal form. 2/2919 useless extension candidates. Maximal degree in co-relation 17448. Up to 2683 conditions per place. 
[2024-06-20 19:13:25,774 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 138 selfloop transitions, 14 changer transitions 0/158 dead transitions.
[2024-06-20 19:13:25,774 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 158 transitions, 1603 flow
[2024-06-20 19:13:25,775 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 19:13:25,775 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 19:13:25,775 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 130 transitions.
[2024-06-20 19:13:25,775 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4421768707482993
[2024-06-20 19:13:25,775 INFO  L175             Difference]: Start difference. First operand has 127 places, 140 transitions, 1209 flow. Second operand 7 states and 130 transitions.
[2024-06-20 19:13:25,775 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 158 transitions, 1603 flow
[2024-06-20 19:13:25,838 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 158 transitions, 1539 flow, removed 20 selfloop flow, removed 5 redundant places.
[2024-06-20 19:13:25,840 INFO  L231             Difference]: Finished difference. Result has 129 places, 143 transitions, 1227 flow
[2024-06-20 19:13:25,840 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1145, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1227, PETRI_PLACES=129, PETRI_TRANSITIONS=143}
[2024-06-20 19:13:25,841 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 86 predicate places.
[2024-06-20 19:13:25,841 INFO  L495      AbstractCegarLoop]: Abstraction has has 129 places, 143 transitions, 1227 flow
[2024-06-20 19:13:25,841 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:13:25,841 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:13:25,841 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:13:25,841 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30
[2024-06-20 19:13:25,841 INFO  L420      AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:13:25,842 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:13:25,842 INFO  L85        PathProgramCache]: Analyzing trace with hash 1215956309, now seen corresponding path program 2 times
[2024-06-20 19:13:25,842 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:13:25,842 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422648193]
[2024-06-20 19:13:25,842 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:13:25,842 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:13:25,885 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:13:38,209 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:13:38,209 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:13:38,209 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422648193]
[2024-06-20 19:13:38,209 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422648193] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:13:38,209 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:13:38,209 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:13:38,209 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038238886]
[2024-06-20 19:13:38,209 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:13:38,210 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:13:38,210 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:13:38,210 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:13:38,210 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:13:38,375 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42
[2024-06-20 19:13:38,375 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 143 transitions, 1227 flow. Second operand  has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:13:38,375 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:13:38,375 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42
[2024-06-20 19:13:38,375 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:13:39,357 INFO  L124   PetriNetUnfolderBase]: 1785/2928 cut-off events.
[2024-06-20 19:13:39,358 INFO  L125   PetriNetUnfolderBase]: For 83705/83705 co-relation queries the response was YES.
[2024-06-20 19:13:39,369 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 18111 conditions, 2928 events. 1785/2928 cut-off events. For 83705/83705 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 16326 event pairs, 501 based on Foata normal form. 2/2928 useless extension candidates. Maximal degree in co-relation 18054. Up to 2679 conditions per place. 
[2024-06-20 19:13:39,377 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 134 selfloop transitions, 27 changer transitions 0/167 dead transitions.
[2024-06-20 19:13:39,378 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 167 transitions, 1765 flow
[2024-06-20 19:13:39,378 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:13:39,378 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:13:39,378 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 150 transitions.
[2024-06-20 19:13:39,378 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44642857142857145
[2024-06-20 19:13:39,379 INFO  L175             Difference]: Start difference. First operand has 129 places, 143 transitions, 1227 flow. Second operand 8 states and 150 transitions.
[2024-06-20 19:13:39,379 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 167 transitions, 1765 flow
[2024-06-20 19:13:39,434 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 167 transitions, 1705 flow, removed 18 selfloop flow, removed 5 redundant places.
[2024-06-20 19:13:39,436 INFO  L231             Difference]: Finished difference. Result has 132 places, 149 transitions, 1329 flow
[2024-06-20 19:13:39,437 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1167, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1329, PETRI_PLACES=132, PETRI_TRANSITIONS=149}
[2024-06-20 19:13:39,437 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 89 predicate places.
[2024-06-20 19:13:39,437 INFO  L495      AbstractCegarLoop]: Abstraction has has 132 places, 149 transitions, 1329 flow
[2024-06-20 19:13:39,437 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:13:39,437 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:13:39,437 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:13:39,437 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31
[2024-06-20 19:13:39,438 INFO  L420      AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:13:39,438 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:13:39,438 INFO  L85        PathProgramCache]: Analyzing trace with hash 1216193459, now seen corresponding path program 3 times
[2024-06-20 19:13:39,438 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:13:39,438 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179815897]
[2024-06-20 19:13:39,438 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:13:39,438 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:13:39,478 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:13:51,826 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:13:51,826 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:13:51,826 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179815897]
[2024-06-20 19:13:51,827 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179815897] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:13:51,827 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:13:51,827 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:13:51,827 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926525828]
[2024-06-20 19:13:51,827 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:13:51,827 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:13:51,827 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:13:51,828 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:13:51,828 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:13:52,048 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42
[2024-06-20 19:13:52,049 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 149 transitions, 1329 flow. Second operand  has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:13:52,049 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:13:52,049 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42
[2024-06-20 19:13:52,049 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:13:53,038 INFO  L124   PetriNetUnfolderBase]: 1779/2920 cut-off events.
[2024-06-20 19:13:53,039 INFO  L125   PetriNetUnfolderBase]: For 88719/88719 co-relation queries the response was YES.
[2024-06-20 19:13:53,051 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 18410 conditions, 2920 events. 1779/2920 cut-off events. For 88719/88719 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 16276 event pairs, 498 based on Foata normal form. 2/2920 useless extension candidates. Maximal degree in co-relation 18352. Up to 2674 conditions per place. 
[2024-06-20 19:13:53,061 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 132 selfloop transitions, 28 changer transitions 0/166 dead transitions.
[2024-06-20 19:13:53,061 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 166 transitions, 1707 flow
[2024-06-20 19:13:53,061 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:13:53,061 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:13:53,061 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 148 transitions.
[2024-06-20 19:13:53,062 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44047619047619047
[2024-06-20 19:13:53,062 INFO  L175             Difference]: Start difference. First operand has 132 places, 149 transitions, 1329 flow. Second operand 8 states and 148 transitions.
[2024-06-20 19:13:53,062 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 166 transitions, 1707 flow
[2024-06-20 19:13:53,131 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 166 transitions, 1607 flow, removed 39 selfloop flow, removed 4 redundant places.
[2024-06-20 19:13:53,133 INFO  L231             Difference]: Finished difference. Result has 136 places, 149 transitions, 1291 flow
[2024-06-20 19:13:53,133 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1229, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1291, PETRI_PLACES=136, PETRI_TRANSITIONS=149}
[2024-06-20 19:13:53,133 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 93 predicate places.
[2024-06-20 19:13:53,133 INFO  L495      AbstractCegarLoop]: Abstraction has has 136 places, 149 transitions, 1291 flow
[2024-06-20 19:13:53,133 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:13:53,134 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:13:53,134 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:13:53,134 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32
[2024-06-20 19:13:53,134 INFO  L420      AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:13:53,134 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:13:53,134 INFO  L85        PathProgramCache]: Analyzing trace with hash 927702667, now seen corresponding path program 1 times
[2024-06-20 19:13:53,134 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:13:53,134 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431997906]
[2024-06-20 19:13:53,134 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:13:53,135 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:13:53,175 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:14:05,512 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:14:05,513 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:14:05,513 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431997906]
[2024-06-20 19:14:05,513 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431997906] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:14:05,513 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:14:05,513 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:14:05,513 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116392233]
[2024-06-20 19:14:05,513 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:14:05,513 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:14:05,513 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:14:05,514 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:14:05,514 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:14:05,707 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-20 19:14:05,707 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 149 transitions, 1291 flow. Second operand  has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:14:05,707 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:14:05,707 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-20 19:14:05,707 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:14:06,880 INFO  L124   PetriNetUnfolderBase]: 1961/3132 cut-off events.
[2024-06-20 19:14:06,880 INFO  L125   PetriNetUnfolderBase]: For 111000/111000 co-relation queries the response was YES.
[2024-06-20 19:14:06,893 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 20549 conditions, 3132 events. 1961/3132 cut-off events. For 111000/111000 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 17130 event pairs, 569 based on Foata normal form. 3/3133 useless extension candidates. Maximal degree in co-relation 20489. Up to 2885 conditions per place. 
[2024-06-20 19:14:06,905 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 151 selfloop transitions, 30 changer transitions 0/186 dead transitions.
[2024-06-20 19:14:06,905 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 186 transitions, 1815 flow
[2024-06-20 19:14:06,905 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 19:14:06,906 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 19:14:06,906 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 185 transitions.
[2024-06-20 19:14:06,906 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44047619047619047
[2024-06-20 19:14:06,906 INFO  L175             Difference]: Start difference. First operand has 136 places, 149 transitions, 1291 flow. Second operand 10 states and 185 transitions.
[2024-06-20 19:14:06,906 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 186 transitions, 1815 flow
[2024-06-20 19:14:06,983 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 186 transitions, 1749 flow, removed 3 selfloop flow, removed 7 redundant places.
[2024-06-20 19:14:06,985 INFO  L231             Difference]: Finished difference. Result has 139 places, 153 transitions, 1368 flow
[2024-06-20 19:14:06,985 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1225, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1368, PETRI_PLACES=139, PETRI_TRANSITIONS=153}
[2024-06-20 19:14:06,985 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 96 predicate places.
[2024-06-20 19:14:06,985 INFO  L495      AbstractCegarLoop]: Abstraction has has 139 places, 153 transitions, 1368 flow
[2024-06-20 19:14:06,986 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:14:06,986 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:14:06,986 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:14:06,986 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33
[2024-06-20 19:14:06,986 INFO  L420      AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:14:06,986 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:14:06,986 INFO  L85        PathProgramCache]: Analyzing trace with hash 931246804, now seen corresponding path program 1 times
[2024-06-20 19:14:06,986 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:14:06,986 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934235811]
[2024-06-20 19:14:06,986 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:14:06,986 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:14:07,027 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:14:18,998 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:14:18,999 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:14:18,999 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934235811]
[2024-06-20 19:14:18,999 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934235811] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:14:18,999 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:14:18,999 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:14:18,999 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058402880]
[2024-06-20 19:14:18,999 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:14:18,999 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:14:18,999 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:14:19,000 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:14:19,000 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:14:19,198 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42
[2024-06-20 19:14:19,198 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 153 transitions, 1368 flow. Second operand  has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:14:19,198 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:14:19,198 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42
[2024-06-20 19:14:19,198 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:14:20,372 INFO  L124   PetriNetUnfolderBase]: 1924/3107 cut-off events.
[2024-06-20 19:14:20,372 INFO  L125   PetriNetUnfolderBase]: For 120551/120551 co-relation queries the response was YES.
[2024-06-20 19:14:20,385 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 21204 conditions, 3107 events. 1924/3107 cut-off events. For 120551/120551 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 17262 event pairs, 543 based on Foata normal form. 4/3109 useless extension candidates. Maximal degree in co-relation 21143. Up to 2774 conditions per place. 
[2024-06-20 19:14:20,395 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 149 selfloop transitions, 25 changer transitions 0/188 dead transitions.
[2024-06-20 19:14:20,395 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 188 transitions, 1855 flow
[2024-06-20 19:14:20,396 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:14:20,396 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:14:20,396 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 178 transitions.
[2024-06-20 19:14:20,396 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4708994708994709
[2024-06-20 19:14:20,396 INFO  L175             Difference]: Start difference. First operand has 139 places, 153 transitions, 1368 flow. Second operand 9 states and 178 transitions.
[2024-06-20 19:14:20,396 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 188 transitions, 1855 flow
[2024-06-20 19:14:20,477 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 188 transitions, 1740 flow, removed 30 selfloop flow, removed 8 redundant places.
[2024-06-20 19:14:20,479 INFO  L231             Difference]: Finished difference. Result has 140 places, 157 transitions, 1373 flow
[2024-06-20 19:14:20,480 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1253, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1373, PETRI_PLACES=140, PETRI_TRANSITIONS=157}
[2024-06-20 19:14:20,480 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 97 predicate places.
[2024-06-20 19:14:20,480 INFO  L495      AbstractCegarLoop]: Abstraction has has 140 places, 157 transitions, 1373 flow
[2024-06-20 19:14:20,480 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:14:20,480 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:14:20,481 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:14:20,481 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34
[2024-06-20 19:14:20,481 INFO  L420      AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:14:20,481 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:14:20,481 INFO  L85        PathProgramCache]: Analyzing trace with hash 936960724, now seen corresponding path program 2 times
[2024-06-20 19:14:20,481 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:14:20,481 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85483692]
[2024-06-20 19:14:20,482 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:14:20,482 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:14:20,521 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:14:32,868 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:14:32,868 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:14:32,868 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85483692]
[2024-06-20 19:14:32,868 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85483692] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:14:32,868 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:14:32,868 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:14:32,869 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34595837]
[2024-06-20 19:14:32,869 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:14:32,869 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:14:32,869 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:14:32,869 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:14:32,869 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:14:33,025 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42
[2024-06-20 19:14:33,025 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 157 transitions, 1373 flow. Second operand  has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:14:33,025 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:14:33,025 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42
[2024-06-20 19:14:33,025 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:14:34,240 INFO  L124   PetriNetUnfolderBase]: 1926/3115 cut-off events.
[2024-06-20 19:14:34,240 INFO  L125   PetriNetUnfolderBase]: For 125459/125459 co-relation queries the response was YES.
[2024-06-20 19:14:34,252 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 21326 conditions, 3115 events. 1926/3115 cut-off events. For 125459/125459 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 17322 event pairs, 542 based on Foata normal form. 4/3117 useless extension candidates. Maximal degree in co-relation 21264. Up to 2723 conditions per place. 
[2024-06-20 19:14:34,262 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 138 selfloop transitions, 38 changer transitions 0/190 dead transitions.
[2024-06-20 19:14:34,262 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 190 transitions, 1933 flow
[2024-06-20 19:14:34,262 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:14:34,263 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:14:34,265 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 178 transitions.
[2024-06-20 19:14:34,268 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4708994708994709
[2024-06-20 19:14:34,268 INFO  L175             Difference]: Start difference. First operand has 140 places, 157 transitions, 1373 flow. Second operand 9 states and 178 transitions.
[2024-06-20 19:14:34,268 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 190 transitions, 1933 flow
[2024-06-20 19:14:34,362 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 190 transitions, 1867 flow, removed 18 selfloop flow, removed 5 redundant places.
[2024-06-20 19:14:34,364 INFO  L231             Difference]: Finished difference. Result has 144 places, 160 transitions, 1448 flow
[2024-06-20 19:14:34,365 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1307, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1448, PETRI_PLACES=144, PETRI_TRANSITIONS=160}
[2024-06-20 19:14:34,365 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 101 predicate places.
[2024-06-20 19:14:34,365 INFO  L495      AbstractCegarLoop]: Abstraction has has 144 places, 160 transitions, 1448 flow
[2024-06-20 19:14:34,365 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:14:34,365 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:14:34,365 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:14:34,366 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35
[2024-06-20 19:14:34,366 INFO  L420      AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:14:34,366 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:14:34,366 INFO  L85        PathProgramCache]: Analyzing trace with hash -1260078949, now seen corresponding path program 2 times
[2024-06-20 19:14:34,366 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:14:34,366 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449637515]
[2024-06-20 19:14:34,366 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:14:34,366 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:14:34,405 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:14:46,737 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:14:46,738 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:14:46,738 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449637515]
[2024-06-20 19:14:46,738 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449637515] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:14:46,738 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:14:46,738 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:14:46,738 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252915338]
[2024-06-20 19:14:46,738 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:14:46,738 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:14:46,738 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:14:46,739 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:14:46,739 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:14:46,924 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-20 19:14:46,924 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 160 transitions, 1448 flow. Second operand  has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:14:46,924 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:14:46,924 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-20 19:14:46,924 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:14:48,130 INFO  L124   PetriNetUnfolderBase]: 2060/3290 cut-off events.
[2024-06-20 19:14:48,130 INFO  L125   PetriNetUnfolderBase]: For 134576/134576 co-relation queries the response was YES.
[2024-06-20 19:14:48,142 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 22826 conditions, 3290 events. 2060/3290 cut-off events. For 134576/134576 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 18133 event pairs, 572 based on Foata normal form. 3/3288 useless extension candidates. Maximal degree in co-relation 22763. Up to 2793 conditions per place. 
[2024-06-20 19:14:48,153 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 131 selfloop transitions, 59 changer transitions 0/195 dead transitions.
[2024-06-20 19:14:48,153 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 195 transitions, 2290 flow
[2024-06-20 19:14:48,154 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:14:48,154 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:14:48,154 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 154 transitions.
[2024-06-20 19:14:48,154 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4583333333333333
[2024-06-20 19:14:48,154 INFO  L175             Difference]: Start difference. First operand has 144 places, 160 transitions, 1448 flow. Second operand 8 states and 154 transitions.
[2024-06-20 19:14:48,155 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 195 transitions, 2290 flow
[2024-06-20 19:14:48,255 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 195 transitions, 2199 flow, removed 21 selfloop flow, removed 6 redundant places.
[2024-06-20 19:14:48,257 INFO  L231             Difference]: Finished difference. Result has 148 places, 171 transitions, 1733 flow
[2024-06-20 19:14:48,257 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1357, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1733, PETRI_PLACES=148, PETRI_TRANSITIONS=171}
[2024-06-20 19:14:48,257 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 105 predicate places.
[2024-06-20 19:14:48,258 INFO  L495      AbstractCegarLoop]: Abstraction has has 148 places, 171 transitions, 1733 flow
[2024-06-20 19:14:48,258 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:14:48,258 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:14:48,258 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:14:48,258 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36
[2024-06-20 19:14:48,258 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-20 19:14:48,258 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:14:48,259 INFO  L85        PathProgramCache]: Analyzing trace with hash -1260078546, now seen corresponding path program 1 times
[2024-06-20 19:14:48,259 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:14:48,259 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804658429]
[2024-06-20 19:14:48,259 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:14:48,259 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:14:48,296 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:15:01,524 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:15:01,524 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:15:01,524 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804658429]
[2024-06-20 19:15:01,525 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804658429] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:15:01,525 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:15:01,525 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:15:01,525 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665619943]
[2024-06-20 19:15:01,525 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:15:01,525 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:15:01,525 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:15:01,525 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:15:01,526 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:15:01,730 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-20 19:15:01,731 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 171 transitions, 1733 flow. Second operand  has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:15:01,731 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:15:01,731 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-20 19:15:01,731 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:15:02,890 INFO  L124   PetriNetUnfolderBase]: 2065/3297 cut-off events.
[2024-06-20 19:15:02,890 INFO  L125   PetriNetUnfolderBase]: For 145061/145061 co-relation queries the response was YES.
[2024-06-20 19:15:02,905 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 23876 conditions, 3297 events. 2065/3297 cut-off events. For 145061/145061 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 18152 event pairs, 571 based on Foata normal form. 1/3296 useless extension candidates. Maximal degree in co-relation 23810. Up to 3106 conditions per place. 
[2024-06-20 19:15:02,918 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 169 selfloop transitions, 17 changer transitions 0/191 dead transitions.
[2024-06-20 19:15:02,918 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 191 transitions, 2211 flow
[2024-06-20 19:15:02,919 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:15:02,919 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:15:02,919 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 139 transitions.
[2024-06-20 19:15:02,919 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41369047619047616
[2024-06-20 19:15:02,919 INFO  L175             Difference]: Start difference. First operand has 148 places, 171 transitions, 1733 flow. Second operand 8 states and 139 transitions.
[2024-06-20 19:15:02,920 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 191 transitions, 2211 flow
[2024-06-20 19:15:03,064 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 191 transitions, 2087 flow, removed 46 selfloop flow, removed 3 redundant places.
[2024-06-20 19:15:03,066 INFO  L231             Difference]: Finished difference. Result has 153 places, 174 transitions, 1719 flow
[2024-06-20 19:15:03,067 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1609, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1719, PETRI_PLACES=153, PETRI_TRANSITIONS=174}
[2024-06-20 19:15:03,067 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 110 predicate places.
[2024-06-20 19:15:03,067 INFO  L495      AbstractCegarLoop]: Abstraction has has 153 places, 174 transitions, 1719 flow
[2024-06-20 19:15:03,067 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:15:03,067 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:15:03,067 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:15:03,068 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37
[2024-06-20 19:15:03,068 INFO  L420      AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:15:03,068 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:15:03,068 INFO  L85        PathProgramCache]: Analyzing trace with hash 936957097, now seen corresponding path program 3 times
[2024-06-20 19:15:03,068 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:15:03,068 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894663819]
[2024-06-20 19:15:03,068 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:15:03,069 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:15:03,109 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:15:15,529 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:15:15,529 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:15:15,530 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894663819]
[2024-06-20 19:15:15,530 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894663819] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:15:15,530 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:15:15,530 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:15:15,530 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351894192]
[2024-06-20 19:15:15,530 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:15:15,530 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:15:15,530 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:15:15,531 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:15:15,531 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:15:15,722 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-20 19:15:15,722 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 174 transitions, 1719 flow. Second operand  has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:15:15,722 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:15:15,722 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-20 19:15:15,722 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:15:16,936 INFO  L124   PetriNetUnfolderBase]: 2099/3350 cut-off events.
[2024-06-20 19:15:16,936 INFO  L125   PetriNetUnfolderBase]: For 151417/151417 co-relation queries the response was YES.
[2024-06-20 19:15:16,950 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 24491 conditions, 3350 events. 2099/3350 cut-off events. For 151417/151417 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 18487 event pairs, 564 based on Foata normal form. 3/3351 useless extension candidates. Maximal degree in co-relation 24423. Up to 2943 conditions per place. 
[2024-06-20 19:15:16,962 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 161 selfloop transitions, 51 changer transitions 0/217 dead transitions.
[2024-06-20 19:15:16,962 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 217 transitions, 2470 flow
[2024-06-20 19:15:16,962 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 19:15:16,963 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 19:15:16,963 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 188 transitions.
[2024-06-20 19:15:16,963 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44761904761904764
[2024-06-20 19:15:16,963 INFO  L175             Difference]: Start difference. First operand has 153 places, 174 transitions, 1719 flow. Second operand 10 states and 188 transitions.
[2024-06-20 19:15:16,963 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 217 transitions, 2470 flow
[2024-06-20 19:15:17,054 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 217 transitions, 2382 flow, removed 29 selfloop flow, removed 6 redundant places.
[2024-06-20 19:15:17,057 INFO  L231             Difference]: Finished difference. Result has 159 places, 185 transitions, 1954 flow
[2024-06-20 19:15:17,057 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1631, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1954, PETRI_PLACES=159, PETRI_TRANSITIONS=185}
[2024-06-20 19:15:17,058 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 116 predicate places.
[2024-06-20 19:15:17,058 INFO  L495      AbstractCegarLoop]: Abstraction has has 159 places, 185 transitions, 1954 flow
[2024-06-20 19:15:17,058 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:15:17,058 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:15:17,058 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:15:17,058 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38
[2024-06-20 19:15:17,058 INFO  L420      AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:15:17,059 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:15:17,059 INFO  L85        PathProgramCache]: Analyzing trace with hash 2127356628, now seen corresponding path program 3 times
[2024-06-20 19:15:17,059 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:15:17,059 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769147459]
[2024-06-20 19:15:17,059 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:15:17,059 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:15:17,098 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:15:29,118 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:15:29,119 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:15:29,119 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769147459]
[2024-06-20 19:15:29,119 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769147459] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:15:29,119 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:15:29,119 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:15:29,119 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616241487]
[2024-06-20 19:15:29,119 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:15:29,119 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:15:29,119 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:15:29,120 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:15:29,120 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:15:29,310 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42
[2024-06-20 19:15:29,311 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 185 transitions, 1954 flow. Second operand  has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:15:29,311 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:15:29,311 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42
[2024-06-20 19:15:29,311 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:15:30,486 INFO  L124   PetriNetUnfolderBase]: 2027/3270 cut-off events.
[2024-06-20 19:15:30,486 INFO  L125   PetriNetUnfolderBase]: For 158488/158498 co-relation queries the response was YES.
[2024-06-20 19:15:30,502 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 24546 conditions, 3270 events. 2027/3270 cut-off events. For 158488/158498 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 18282 event pairs, 563 based on Foata normal form. 10/3277 useless extension candidates. Maximal degree in co-relation 24475. Up to 2889 conditions per place. 
[2024-06-20 19:15:30,514 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 166 selfloop transitions, 24 changer transitions 0/209 dead transitions.
[2024-06-20 19:15:30,514 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 209 transitions, 2400 flow
[2024-06-20 19:15:30,515 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:15:30,515 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:15:30,515 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 157 transitions.
[2024-06-20 19:15:30,515 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46726190476190477
[2024-06-20 19:15:30,515 INFO  L175             Difference]: Start difference. First operand has 159 places, 185 transitions, 1954 flow. Second operand 8 states and 157 transitions.
[2024-06-20 19:15:30,515 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 209 transitions, 2400 flow
[2024-06-20 19:15:30,648 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 209 transitions, 2291 flow, removed 42 selfloop flow, removed 5 redundant places.
[2024-06-20 19:15:30,651 INFO  L231             Difference]: Finished difference. Result has 162 places, 185 transitions, 1899 flow
[2024-06-20 19:15:30,651 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1845, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1899, PETRI_PLACES=162, PETRI_TRANSITIONS=185}
[2024-06-20 19:15:30,651 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 119 predicate places.
[2024-06-20 19:15:30,652 INFO  L495      AbstractCegarLoop]: Abstraction has has 162 places, 185 transitions, 1899 flow
[2024-06-20 19:15:30,652 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:15:30,652 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:15:30,652 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:15:30,652 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39
[2024-06-20 19:15:30,652 INFO  L420      AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:15:30,653 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:15:30,653 INFO  L85        PathProgramCache]: Analyzing trace with hash -1159374794, now seen corresponding path program 4 times
[2024-06-20 19:15:30,653 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:15:30,653 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048273028]
[2024-06-20 19:15:30,653 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:15:30,653 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:15:30,690 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:15:42,919 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:15:42,919 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:15:42,919 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048273028]
[2024-06-20 19:15:42,919 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048273028] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:15:42,919 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:15:42,919 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:15:42,919 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937300839]
[2024-06-20 19:15:42,919 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:15:42,920 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:15:42,920 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:15:42,920 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:15:42,920 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:15:43,135 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42
[2024-06-20 19:15:43,136 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 185 transitions, 1899 flow. Second operand  has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:15:43,136 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:15:43,136 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42
[2024-06-20 19:15:43,136 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:15:44,262 INFO  L124   PetriNetUnfolderBase]: 2052/3305 cut-off events.
[2024-06-20 19:15:44,263 INFO  L125   PetriNetUnfolderBase]: For 167427/167457 co-relation queries the response was YES.
[2024-06-20 19:15:44,279 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 25042 conditions, 3305 events. 2052/3305 cut-off events. For 167427/167457 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 18574 event pairs, 553 based on Foata normal form. 14/3301 useless extension candidates. Maximal degree in co-relation 24969. Up to 2898 conditions per place. 
[2024-06-20 19:15:44,291 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 158 selfloop transitions, 33 changer transitions 0/210 dead transitions.
[2024-06-20 19:15:44,291 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 210 transitions, 2399 flow
[2024-06-20 19:15:44,291 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:15:44,291 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:15:44,292 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 157 transitions.
[2024-06-20 19:15:44,292 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46726190476190477
[2024-06-20 19:15:44,292 INFO  L175             Difference]: Start difference. First operand has 162 places, 185 transitions, 1899 flow. Second operand 8 states and 157 transitions.
[2024-06-20 19:15:44,292 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 210 transitions, 2399 flow
[2024-06-20 19:15:44,399 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 210 transitions, 2275 flow, removed 8 selfloop flow, removed 10 redundant places.
[2024-06-20 19:15:44,401 INFO  L231             Difference]: Finished difference. Result has 160 places, 188 transitions, 1905 flow
[2024-06-20 19:15:44,402 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1775, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1905, PETRI_PLACES=160, PETRI_TRANSITIONS=188}
[2024-06-20 19:15:44,402 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 117 predicate places.
[2024-06-20 19:15:44,402 INFO  L495      AbstractCegarLoop]: Abstraction has has 160 places, 188 transitions, 1905 flow
[2024-06-20 19:15:44,402 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:15:44,402 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:15:44,402 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:15:44,402 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40
[2024-06-20 19:15:44,402 INFO  L420      AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:15:44,403 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:15:44,403 INFO  L85        PathProgramCache]: Analyzing trace with hash -960073004, now seen corresponding path program 5 times
[2024-06-20 19:15:44,403 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:15:44,403 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070123256]
[2024-06-20 19:15:44,403 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:15:44,403 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:15:44,440 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:15:56,835 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:15:56,836 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:15:56,836 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070123256]
[2024-06-20 19:15:56,836 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070123256] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:15:56,836 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:15:56,836 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:15:56,836 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858067168]
[2024-06-20 19:15:56,836 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:15:56,836 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:15:56,836 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:15:56,837 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:15:56,837 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:15:57,016 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42
[2024-06-20 19:15:57,016 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 188 transitions, 1905 flow. Second operand  has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:15:57,017 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:15:57,017 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42
[2024-06-20 19:15:57,017 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:15:58,274 INFO  L124   PetriNetUnfolderBase]: 2056/3321 cut-off events.
[2024-06-20 19:15:58,274 INFO  L125   PetriNetUnfolderBase]: For 174609/174639 co-relation queries the response was YES.
[2024-06-20 19:15:58,291 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 25306 conditions, 3321 events. 2056/3321 cut-off events. For 174609/174639 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 18729 event pairs, 549 based on Foata normal form. 14/3317 useless extension candidates. Maximal degree in co-relation 25232. Up to 2807 conditions per place. 
[2024-06-20 19:15:58,303 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 135 selfloop transitions, 58 changer transitions 0/212 dead transitions.
[2024-06-20 19:15:58,303 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 212 transitions, 2497 flow
[2024-06-20 19:15:58,303 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:15:58,303 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:15:58,303 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 159 transitions.
[2024-06-20 19:15:58,304 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4732142857142857
[2024-06-20 19:15:58,304 INFO  L175             Difference]: Start difference. First operand has 160 places, 188 transitions, 1905 flow. Second operand 8 states and 159 transitions.
[2024-06-20 19:15:58,304 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 212 transitions, 2497 flow
[2024-06-20 19:15:58,420 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 212 transitions, 2399 flow, removed 18 selfloop flow, removed 6 redundant places.
[2024-06-20 19:15:58,422 INFO  L231             Difference]: Finished difference. Result has 162 places, 191 transitions, 1987 flow
[2024-06-20 19:15:58,423 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1807, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1987, PETRI_PLACES=162, PETRI_TRANSITIONS=191}
[2024-06-20 19:15:58,423 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 119 predicate places.
[2024-06-20 19:15:58,423 INFO  L495      AbstractCegarLoop]: Abstraction has has 162 places, 191 transitions, 1987 flow
[2024-06-20 19:15:58,423 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:15:58,423 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:15:58,423 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:15:58,424 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41
[2024-06-20 19:15:58,424 INFO  L420      AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:15:58,424 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:15:58,424 INFO  L85        PathProgramCache]: Analyzing trace with hash -965786924, now seen corresponding path program 6 times
[2024-06-20 19:15:58,424 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:15:58,424 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667668607]
[2024-06-20 19:15:58,424 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:15:58,424 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:15:58,462 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:16:10,945 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:16:10,946 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:16:10,946 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667668607]
[2024-06-20 19:16:10,946 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667668607] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:16:10,946 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:16:10,946 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:16:10,946 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441550053]
[2024-06-20 19:16:10,946 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:16:10,947 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:16:10,947 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:16:10,947 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:16:10,947 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:16:11,162 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42
[2024-06-20 19:16:11,162 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 191 transitions, 1987 flow. Second operand  has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:16:11,162 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:16:11,162 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42
[2024-06-20 19:16:11,162 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:16:12,388 INFO  L124   PetriNetUnfolderBase]: 2040/3295 cut-off events.
[2024-06-20 19:16:12,389 INFO  L125   PetriNetUnfolderBase]: For 180201/180231 co-relation queries the response was YES.
[2024-06-20 19:16:12,404 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 25213 conditions, 3295 events. 2040/3295 cut-off events. For 180201/180231 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 18598 event pairs, 543 based on Foata normal form. 16/3293 useless extension candidates. Maximal degree in co-relation 25138. Up to 2794 conditions per place. 
[2024-06-20 19:16:12,415 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 138 selfloop transitions, 54 changer transitions 0/211 dead transitions.
[2024-06-20 19:16:12,415 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 211 transitions, 2437 flow
[2024-06-20 19:16:12,415 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:16:12,415 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:16:12,415 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 159 transitions.
[2024-06-20 19:16:12,416 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4732142857142857
[2024-06-20 19:16:12,416 INFO  L175             Difference]: Start difference. First operand has 162 places, 191 transitions, 1987 flow. Second operand 8 states and 159 transitions.
[2024-06-20 19:16:12,416 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 211 transitions, 2437 flow
[2024-06-20 19:16:12,546 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 211 transitions, 2256 flow, removed 43 selfloop flow, removed 5 redundant places.
[2024-06-20 19:16:12,548 INFO  L231             Difference]: Finished difference. Result has 165 places, 191 transitions, 1922 flow
[2024-06-20 19:16:12,548 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1806, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1922, PETRI_PLACES=165, PETRI_TRANSITIONS=191}
[2024-06-20 19:16:12,549 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 122 predicate places.
[2024-06-20 19:16:12,549 INFO  L495      AbstractCegarLoop]: Abstraction has has 165 places, 191 transitions, 1922 flow
[2024-06-20 19:16:12,549 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:16:12,549 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:16:12,549 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:16:12,549 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42
[2024-06-20 19:16:12,549 INFO  L420      AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:16:12,550 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:16:12,550 INFO  L85        PathProgramCache]: Analyzing trace with hash -952892381, now seen corresponding path program 4 times
[2024-06-20 19:16:12,550 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:16:12,550 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039561854]
[2024-06-20 19:16:12,550 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:16:12,550 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:16:12,591 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:16:26,144 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:16:26,144 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:16:26,144 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039561854]
[2024-06-20 19:16:26,144 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039561854] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:16:26,144 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:16:26,144 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:16:26,144 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474488361]
[2024-06-20 19:16:26,144 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:16:26,145 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:16:26,145 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:16:26,145 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:16:26,145 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:16:26,357 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-20 19:16:26,357 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 191 transitions, 1922 flow. Second operand  has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:16:26,357 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:16:26,357 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-20 19:16:26,357 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:16:27,612 INFO  L124   PetriNetUnfolderBase]: 2156/3435 cut-off events.
[2024-06-20 19:16:27,613 INFO  L125   PetriNetUnfolderBase]: For 187092/187102 co-relation queries the response was YES.
[2024-06-20 19:16:27,629 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 26319 conditions, 3435 events. 2156/3435 cut-off events. For 187092/187102 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 18978 event pairs, 567 based on Foata normal form. 11/3443 useless extension candidates. Maximal degree in co-relation 26243. Up to 2842 conditions per place. 
[2024-06-20 19:16:27,641 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 137 selfloop transitions, 86 changer transitions 0/228 dead transitions.
[2024-06-20 19:16:27,641 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 228 transitions, 2902 flow
[2024-06-20 19:16:27,641 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:16:27,641 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:16:27,642 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 172 transitions.
[2024-06-20 19:16:27,642 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.455026455026455
[2024-06-20 19:16:27,642 INFO  L175             Difference]: Start difference. First operand has 165 places, 191 transitions, 1922 flow. Second operand 9 states and 172 transitions.
[2024-06-20 19:16:27,642 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 228 transitions, 2902 flow
[2024-06-20 19:16:27,768 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 228 transitions, 2767 flow, removed 0 selfloop flow, removed 8 redundant places.
[2024-06-20 19:16:27,771 INFO  L231             Difference]: Finished difference. Result has 167 places, 202 transitions, 2206 flow
[2024-06-20 19:16:27,771 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1787, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=78, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2206, PETRI_PLACES=167, PETRI_TRANSITIONS=202}
[2024-06-20 19:16:27,771 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 124 predicate places.
[2024-06-20 19:16:27,771 INFO  L495      AbstractCegarLoop]: Abstraction has has 167 places, 202 transitions, 2206 flow
[2024-06-20 19:16:27,771 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:16:27,771 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:16:27,771 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:16:27,772 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43
[2024-06-20 19:16:27,772 INFO  L420      AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:16:27,772 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:16:27,772 INFO  L85        PathProgramCache]: Analyzing trace with hash -952891978, now seen corresponding path program 2 times
[2024-06-20 19:16:27,772 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:16:27,772 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789886225]
[2024-06-20 19:16:27,772 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:16:27,772 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:16:27,810 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:16:41,021 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:16:41,021 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:16:41,021 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789886225]
[2024-06-20 19:16:41,021 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789886225] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:16:41,022 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:16:41,022 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:16:41,022 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694143733]
[2024-06-20 19:16:41,022 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:16:41,022 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:16:41,022 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:16:41,022 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:16:41,022 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:16:41,229 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-20 19:16:41,229 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 202 transitions, 2206 flow. Second operand  has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:16:41,229 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:16:41,229 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-20 19:16:41,229 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:16:42,401 INFO  L124   PetriNetUnfolderBase]: 2169/3451 cut-off events.
[2024-06-20 19:16:42,401 INFO  L125   PetriNetUnfolderBase]: For 200310/200320 co-relation queries the response was YES.
[2024-06-20 19:16:42,418 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 27509 conditions, 3451 events. 2169/3451 cut-off events. For 200310/200320 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 19144 event pairs, 598 based on Foata normal form. 9/3457 useless extension candidates. Maximal degree in co-relation 27431. Up to 3222 conditions per place. 
[2024-06-20 19:16:42,430 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 183 selfloop transitions, 38 changer transitions 0/226 dead transitions.
[2024-06-20 19:16:42,430 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 226 transitions, 3086 flow
[2024-06-20 19:16:42,431 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:16:42,431 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:16:42,431 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 140 transitions.
[2024-06-20 19:16:42,431 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4166666666666667
[2024-06-20 19:16:42,431 INFO  L175             Difference]: Start difference. First operand has 167 places, 202 transitions, 2206 flow. Second operand 8 states and 140 transitions.
[2024-06-20 19:16:42,431 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 226 transitions, 3086 flow
[2024-06-20 19:16:42,612 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 226 transitions, 2914 flow, removed 57 selfloop flow, removed 4 redundant places.
[2024-06-20 19:16:42,614 INFO  L231             Difference]: Finished difference. Result has 172 places, 213 transitions, 2379 flow
[2024-06-20 19:16:42,615 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2034, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2379, PETRI_PLACES=172, PETRI_TRANSITIONS=213}
[2024-06-20 19:16:42,615 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 129 predicate places.
[2024-06-20 19:16:42,615 INFO  L495      AbstractCegarLoop]: Abstraction has has 172 places, 213 transitions, 2379 flow
[2024-06-20 19:16:42,615 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:16:42,615 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:16:42,615 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:16:42,616 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44
[2024-06-20 19:16:42,616 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-20 19:16:42,616 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:16:42,616 INFO  L85        PathProgramCache]: Analyzing trace with hash -952878958, now seen corresponding path program 3 times
[2024-06-20 19:16:42,616 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:16:42,616 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786995580]
[2024-06-20 19:16:42,616 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:16:42,616 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:16:42,654 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:16:55,627 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:16:55,627 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:16:55,627 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786995580]
[2024-06-20 19:16:55,628 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786995580] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:16:55,628 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:16:55,628 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:16:55,628 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837865931]
[2024-06-20 19:16:55,628 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:16:55,628 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:16:55,628 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:16:55,629 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:16:55,629 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:16:55,844 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-20 19:16:55,844 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 213 transitions, 2379 flow. Second operand  has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:16:55,844 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:16:55,844 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-20 19:16:55,844 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:16:57,020 INFO  L124   PetriNetUnfolderBase]: 2166/3447 cut-off events.
[2024-06-20 19:16:57,021 INFO  L125   PetriNetUnfolderBase]: For 208039/208049 co-relation queries the response was YES.
[2024-06-20 19:16:57,042 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 27668 conditions, 3447 events. 2166/3447 cut-off events. For 208039/208049 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 19058 event pairs, 598 based on Foata normal form. 9/3453 useless extension candidates. Maximal degree in co-relation 27587. Up to 3219 conditions per place. 
[2024-06-20 19:16:57,057 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 180 selfloop transitions, 40 changer transitions 0/225 dead transitions.
[2024-06-20 19:16:57,057 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 225 transitions, 2935 flow
[2024-06-20 19:16:57,058 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:16:57,058 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:16:57,058 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 138 transitions.
[2024-06-20 19:16:57,058 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4107142857142857
[2024-06-20 19:16:57,058 INFO  L175             Difference]: Start difference. First operand has 172 places, 213 transitions, 2379 flow. Second operand 8 states and 138 transitions.
[2024-06-20 19:16:57,058 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 225 transitions, 2935 flow
[2024-06-20 19:16:57,239 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 225 transitions, 2775 flow, removed 71 selfloop flow, removed 3 redundant places.
[2024-06-20 19:16:57,241 INFO  L231             Difference]: Finished difference. Result has 177 places, 213 transitions, 2305 flow
[2024-06-20 19:16:57,241 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2219, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2305, PETRI_PLACES=177, PETRI_TRANSITIONS=213}
[2024-06-20 19:16:57,242 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 134 predicate places.
[2024-06-20 19:16:57,242 INFO  L495      AbstractCegarLoop]: Abstraction has has 177 places, 213 transitions, 2305 flow
[2024-06-20 19:16:57,242 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:16:57,242 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:16:57,242 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:16:57,242 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45
[2024-06-20 19:16:57,242 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-20 19:16:57,242 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:16:57,243 INFO  L85        PathProgramCache]: Analyzing trace with hash -1094828733, now seen corresponding path program 5 times
[2024-06-20 19:16:57,243 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:16:57,243 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929825634]
[2024-06-20 19:16:57,243 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:16:57,243 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:16:57,280 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:17:10,349 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:17:10,349 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:17:10,349 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929825634]
[2024-06-20 19:17:10,349 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929825634] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:17:10,349 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:17:10,350 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:17:10,350 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096077297]
[2024-06-20 19:17:10,350 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:17:10,350 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:17:10,350 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:17:10,350 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:17:10,350 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:17:10,570 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-20 19:17:10,570 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 213 transitions, 2305 flow. Second operand  has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:17:10,570 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:17:10,570 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-20 19:17:10,570 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:17:11,862 INFO  L124   PetriNetUnfolderBase]: 2197/3496 cut-off events.
[2024-06-20 19:17:11,862 INFO  L125   PetriNetUnfolderBase]: For 218730/218740 co-relation queries the response was YES.
[2024-06-20 19:17:11,880 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 28222 conditions, 3496 events. 2197/3496 cut-off events. For 218730/218740 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 19382 event pairs, 581 based on Foata normal form. 11/3504 useless extension candidates. Maximal degree in co-relation 28139. Up to 2885 conditions per place. 
[2024-06-20 19:17:11,894 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 151 selfloop transitions, 91 changer transitions 0/247 dead transitions.
[2024-06-20 19:17:11,895 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 247 transitions, 3355 flow
[2024-06-20 19:17:11,895 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:17:11,895 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:17:11,895 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 174 transitions.
[2024-06-20 19:17:11,896 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4603174603174603
[2024-06-20 19:17:11,896 INFO  L175             Difference]: Start difference. First operand has 177 places, 213 transitions, 2305 flow. Second operand 9 states and 174 transitions.
[2024-06-20 19:17:11,896 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 247 transitions, 3355 flow
[2024-06-20 19:17:12,101 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 247 transitions, 3274 flow, removed 6 selfloop flow, removed 6 redundant places.
[2024-06-20 19:17:12,104 INFO  L231             Difference]: Finished difference. Result has 181 places, 222 transitions, 2662 flow
[2024-06-20 19:17:12,105 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2224, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2662, PETRI_PLACES=181, PETRI_TRANSITIONS=222}
[2024-06-20 19:17:12,105 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 138 predicate places.
[2024-06-20 19:17:12,105 INFO  L495      AbstractCegarLoop]: Abstraction has has 181 places, 222 transitions, 2662 flow
[2024-06-20 19:17:12,105 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:17:12,105 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:17:12,106 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:17:12,106 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46
[2024-06-20 19:17:12,107 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-20 19:17:12,107 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:17:12,107 INFO  L85        PathProgramCache]: Analyzing trace with hash -965779391, now seen corresponding path program 6 times
[2024-06-20 19:17:12,107 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:17:12,107 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132384670]
[2024-06-20 19:17:12,107 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:17:12,107 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:17:12,149 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:17:25,011 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:17:25,011 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:17:25,011 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132384670]
[2024-06-20 19:17:25,011 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132384670] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:17:25,011 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:17:25,011 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:17:25,011 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617680371]
[2024-06-20 19:17:25,011 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:17:25,011 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:17:25,012 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:17:25,012 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:17:25,012 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:17:25,201 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-20 19:17:25,202 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 222 transitions, 2662 flow. Second operand  has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:17:25,202 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:17:25,202 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-20 19:17:25,202 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:17:26,499 INFO  L124   PetriNetUnfolderBase]: 2192/3494 cut-off events.
[2024-06-20 19:17:26,499 INFO  L125   PetriNetUnfolderBase]: For 226523/226531 co-relation queries the response was YES.
[2024-06-20 19:17:26,521 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 28804 conditions, 3494 events. 2192/3494 cut-off events. For 226523/226531 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 19384 event pairs, 579 based on Foata normal form. 9/3500 useless extension candidates. Maximal degree in co-relation 28719. Up to 2883 conditions per place. 
[2024-06-20 19:17:26,538 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 156 selfloop transitions, 86 changer transitions 0/247 dead transitions.
[2024-06-20 19:17:26,538 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 247 transitions, 3504 flow
[2024-06-20 19:17:26,538 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:17:26,538 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:17:26,539 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 174 transitions.
[2024-06-20 19:17:26,539 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4603174603174603
[2024-06-20 19:17:26,539 INFO  L175             Difference]: Start difference. First operand has 181 places, 222 transitions, 2662 flow. Second operand 9 states and 174 transitions.
[2024-06-20 19:17:26,539 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 247 transitions, 3504 flow
[2024-06-20 19:17:26,792 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 247 transitions, 3271 flow, removed 84 selfloop flow, removed 4 redundant places.
[2024-06-20 19:17:26,795 INFO  L231             Difference]: Finished difference. Result has 186 places, 222 transitions, 2609 flow
[2024-06-20 19:17:26,795 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2429, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=86, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2609, PETRI_PLACES=186, PETRI_TRANSITIONS=222}
[2024-06-20 19:17:26,795 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 143 predicate places.
[2024-06-20 19:17:26,796 INFO  L495      AbstractCegarLoop]: Abstraction has has 186 places, 222 transitions, 2609 flow
[2024-06-20 19:17:26,796 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:17:26,796 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:17:26,796 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:17:26,796 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47
[2024-06-20 19:17:26,796 INFO  L420      AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:17:26,796 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:17:26,797 INFO  L85        PathProgramCache]: Analyzing trace with hash -965778988, now seen corresponding path program 4 times
[2024-06-20 19:17:26,797 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:17:26,797 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610788551]
[2024-06-20 19:17:26,797 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:17:26,797 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:17:26,835 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:17:39,574 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:17:39,575 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:17:39,575 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610788551]
[2024-06-20 19:17:39,575 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610788551] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:17:39,575 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:17:39,575 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:17:39,575 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198824587]
[2024-06-20 19:17:39,575 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:17:39,575 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:17:39,575 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:17:39,576 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:17:39,576 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:17:39,830 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-20 19:17:39,831 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 222 transitions, 2609 flow. Second operand  has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:17:39,831 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:17:39,831 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-20 19:17:39,831 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:17:41,137 INFO  L124   PetriNetUnfolderBase]: 2189/3490 cut-off events.
[2024-06-20 19:17:41,137 INFO  L125   PetriNetUnfolderBase]: For 228566/228574 co-relation queries the response was YES.
[2024-06-20 19:17:41,164 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 28768 conditions, 3490 events. 2189/3490 cut-off events. For 228566/228574 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 19369 event pairs, 601 based on Foata normal form. 7/3494 useless extension candidates. Maximal degree in co-relation 28681. Up to 3253 conditions per place. 
[2024-06-20 19:17:41,182 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 191 selfloop transitions, 38 changer transitions 0/234 dead transitions.
[2024-06-20 19:17:41,182 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 234 transitions, 3101 flow
[2024-06-20 19:17:41,183 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:17:41,183 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:17:41,183 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 139 transitions.
[2024-06-20 19:17:41,183 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41369047619047616
[2024-06-20 19:17:41,183 INFO  L175             Difference]: Start difference. First operand has 186 places, 222 transitions, 2609 flow. Second operand 8 states and 139 transitions.
[2024-06-20 19:17:41,183 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 234 transitions, 3101 flow
[2024-06-20 19:17:41,457 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 234 transitions, 2847 flow, removed 28 selfloop flow, removed 9 redundant places.
[2024-06-20 19:17:41,460 INFO  L231             Difference]: Finished difference. Result has 185 places, 223 transitions, 2445 flow
[2024-06-20 19:17:41,460 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2355, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2445, PETRI_PLACES=185, PETRI_TRANSITIONS=223}
[2024-06-20 19:17:41,460 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 142 predicate places.
[2024-06-20 19:17:41,460 INFO  L495      AbstractCegarLoop]: Abstraction has has 185 places, 223 transitions, 2445 flow
[2024-06-20 19:17:41,461 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:17:41,461 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:17:41,461 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:17:41,461 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48
[2024-06-20 19:17:41,461 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-20 19:17:41,461 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:17:41,461 INFO  L85        PathProgramCache]: Analyzing trace with hash 2135073489, now seen corresponding path program 1 times
[2024-06-20 19:17:41,461 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:17:41,461 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155259869]
[2024-06-20 19:17:41,462 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:17:41,462 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:17:41,518 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:17:54,625 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:17:54,625 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:17:54,625 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155259869]
[2024-06-20 19:17:54,625 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155259869] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:17:54,625 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:17:54,625 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:17:54,625 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215579697]
[2024-06-20 19:17:54,626 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:17:54,626 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:17:54,626 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:17:54,626 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:17:54,626 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:17:54,805 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42
[2024-06-20 19:17:54,805 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 223 transitions, 2445 flow. Second operand  has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 9 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-20 19:17:54,805 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:17:54,805 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42
[2024-06-20 19:17:54,805 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:17:56,130 INFO  L124   PetriNetUnfolderBase]: 2082/3378 cut-off events.
[2024-06-20 19:17:56,130 INFO  L125   PetriNetUnfolderBase]: For 236637/236637 co-relation queries the response was YES.
[2024-06-20 19:17:56,149 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 27749 conditions, 3378 events. 2082/3378 cut-off events. For 236637/236637 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 19160 event pairs, 552 based on Foata normal form. 1/3377 useless extension candidates. Maximal degree in co-relation 27663. Up to 3093 conditions per place. 
[2024-06-20 19:17:56,166 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 215 selfloop transitions, 17 changer transitions 0/243 dead transitions.
[2024-06-20 19:17:56,166 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 243 transitions, 3017 flow
[2024-06-20 19:17:56,166 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:17:56,166 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:17:56,167 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 146 transitions.
[2024-06-20 19:17:56,167 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43452380952380953
[2024-06-20 19:17:56,167 INFO  L175             Difference]: Start difference. First operand has 185 places, 223 transitions, 2445 flow. Second operand 8 states and 146 transitions.
[2024-06-20 19:17:56,167 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 243 transitions, 3017 flow
[2024-06-20 19:17:56,387 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 243 transitions, 2953 flow, removed 4 selfloop flow, removed 5 redundant places.
[2024-06-20 19:17:56,390 INFO  L231             Difference]: Finished difference. Result has 188 places, 226 transitions, 2493 flow
[2024-06-20 19:17:56,391 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2381, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=206, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2493, PETRI_PLACES=188, PETRI_TRANSITIONS=226}
[2024-06-20 19:17:56,391 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 145 predicate places.
[2024-06-20 19:17:56,391 INFO  L495      AbstractCegarLoop]: Abstraction has has 188 places, 226 transitions, 2493 flow
[2024-06-20 19:17:56,391 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 9 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-20 19:17:56,391 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:17:56,392 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:17:56,392 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49
[2024-06-20 19:17:56,392 INFO  L420      AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:17:56,392 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:17:56,392 INFO  L85        PathProgramCache]: Analyzing trace with hash 1076055288, now seen corresponding path program 1 times
[2024-06-20 19:17:56,392 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:17:56,392 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086380600]
[2024-06-20 19:17:56,393 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:17:56,393 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:17:56,436 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:18:10,411 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:18:10,411 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:18:10,411 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086380600]
[2024-06-20 19:18:10,411 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086380600] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:18:10,411 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:18:10,411 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:18:10,411 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470614789]
[2024-06-20 19:18:10,411 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:18:10,412 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:18:10,412 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:18:10,412 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:18:10,412 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:18:10,638 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42
[2024-06-20 19:18:10,653 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 226 transitions, 2493 flow. Second operand  has 10 states, 10 states have (on average 12.5) internal successors, (125), 10 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:18:10,653 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:18:10,653 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42
[2024-06-20 19:18:10,654 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:18:12,008 INFO  L124   PetriNetUnfolderBase]: 2092/3402 cut-off events.
[2024-06-20 19:18:12,008 INFO  L125   PetriNetUnfolderBase]: For 250568/250568 co-relation queries the response was YES.
[2024-06-20 19:18:12,028 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 28283 conditions, 3402 events. 2092/3402 cut-off events. For 250568/250568 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 19410 event pairs, 543 based on Foata normal form. 4/3404 useless extension candidates. Maximal degree in co-relation 28196. Up to 3100 conditions per place. 
[2024-06-20 19:18:12,043 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 218 selfloop transitions, 17 changer transitions 0/246 dead transitions.
[2024-06-20 19:18:12,043 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 246 transitions, 3077 flow
[2024-06-20 19:18:12,044 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:18:12,044 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:18:12,044 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 146 transitions.
[2024-06-20 19:18:12,044 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43452380952380953
[2024-06-20 19:18:12,044 INFO  L175             Difference]: Start difference. First operand has 188 places, 226 transitions, 2493 flow. Second operand 8 states and 146 transitions.
[2024-06-20 19:18:12,044 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 246 transitions, 3077 flow
[2024-06-20 19:18:12,215 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 246 transitions, 2987 flow, removed 30 selfloop flow, removed 6 redundant places.
[2024-06-20 19:18:12,218 INFO  L231             Difference]: Finished difference. Result has 190 places, 229 transitions, 2505 flow
[2024-06-20 19:18:12,218 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2403, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2505, PETRI_PLACES=190, PETRI_TRANSITIONS=229}
[2024-06-20 19:18:12,218 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 147 predicate places.
[2024-06-20 19:18:12,218 INFO  L495      AbstractCegarLoop]: Abstraction has has 190 places, 229 transitions, 2505 flow
[2024-06-20 19:18:12,219 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 12.5) internal successors, (125), 10 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:18:12,219 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:18:12,219 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:18:12,219 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50
[2024-06-20 19:18:12,219 INFO  L420      AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:18:12,219 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:18:12,219 INFO  L85        PathProgramCache]: Analyzing trace with hash -960059116, now seen corresponding path program 2 times
[2024-06-20 19:18:12,220 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:18:12,220 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690590316]
[2024-06-20 19:18:12,220 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:18:12,220 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:18:12,257 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:18:25,666 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:18:25,666 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:18:25,666 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690590316]
[2024-06-20 19:18:25,666 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690590316] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:18:25,666 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:18:25,666 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:18:25,666 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116371772]
[2024-06-20 19:18:25,666 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:18:25,666 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:18:25,667 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:18:25,667 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:18:25,667 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:18:25,907 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42
[2024-06-20 19:18:25,907 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 229 transitions, 2505 flow. Second operand  has 10 states, 10 states have (on average 12.5) internal successors, (125), 10 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:18:25,907 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:18:25,907 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42
[2024-06-20 19:18:25,907 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:18:27,256 INFO  L124   PetriNetUnfolderBase]: 2111/3437 cut-off events.
[2024-06-20 19:18:27,257 INFO  L125   PetriNetUnfolderBase]: For 264016/264016 co-relation queries the response was YES.
[2024-06-20 19:18:27,276 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 29041 conditions, 3437 events. 2111/3437 cut-off events. For 264016/264016 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 19695 event pairs, 546 based on Foata normal form. 4/3436 useless extension candidates. Maximal degree in co-relation 28953. Up to 3071 conditions per place. 
[2024-06-20 19:18:27,290 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 206 selfloop transitions, 38 changer transitions 0/255 dead transitions.
[2024-06-20 19:18:27,291 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 255 transitions, 3287 flow
[2024-06-20 19:18:27,291 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:18:27,291 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:18:27,292 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 168 transitions.
[2024-06-20 19:18:27,292 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4444444444444444
[2024-06-20 19:18:27,292 INFO  L175             Difference]: Start difference. First operand has 190 places, 229 transitions, 2505 flow. Second operand 9 states and 168 transitions.
[2024-06-20 19:18:27,292 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 255 transitions, 3287 flow
[2024-06-20 19:18:27,546 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 255 transitions, 3207 flow, removed 25 selfloop flow, removed 6 redundant places.
[2024-06-20 19:18:27,549 INFO  L231             Difference]: Finished difference. Result has 193 places, 235 transitions, 2637 flow
[2024-06-20 19:18:27,549 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2425, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2637, PETRI_PLACES=193, PETRI_TRANSITIONS=235}
[2024-06-20 19:18:27,549 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 150 predicate places.
[2024-06-20 19:18:27,549 INFO  L495      AbstractCegarLoop]: Abstraction has has 193 places, 235 transitions, 2637 flow
[2024-06-20 19:18:27,549 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 12.5) internal successors, (125), 10 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:18:27,549 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:18:27,549 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:18:27,549 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51
[2024-06-20 19:18:27,550 INFO  L420      AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:18:27,550 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:18:27,550 INFO  L85        PathProgramCache]: Analyzing trace with hash -952440556, now seen corresponding path program 3 times
[2024-06-20 19:18:27,550 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:18:27,550 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681000159]
[2024-06-20 19:18:27,550 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:18:27,550 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:18:27,589 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:18:41,367 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:18:41,368 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:18:41,368 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681000159]
[2024-06-20 19:18:41,368 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681000159] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:18:41,368 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:18:41,368 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:18:41,368 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785455848]
[2024-06-20 19:18:41,368 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:18:41,368 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:18:41,368 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:18:41,369 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:18:41,369 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:18:41,590 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42
[2024-06-20 19:18:41,590 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 235 transitions, 2637 flow. Second operand  has 10 states, 10 states have (on average 12.5) internal successors, (125), 10 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:18:41,590 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:18:41,590 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42
[2024-06-20 19:18:41,590 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:18:42,898 INFO  L124   PetriNetUnfolderBase]: 2131/3469 cut-off events.
[2024-06-20 19:18:42,898 INFO  L125   PetriNetUnfolderBase]: For 276208/276208 co-relation queries the response was YES.
[2024-06-20 19:18:42,919 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 29775 conditions, 3469 events. 2131/3469 cut-off events. For 276208/276208 co-relation queries the response was YES. Maximal size of possible extension queue 206. Compared 19904 event pairs, 540 based on Foata normal form. 4/3471 useless extension candidates. Maximal degree in co-relation 29686. Up to 3089 conditions per place. 
[2024-06-20 19:18:42,938 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 203 selfloop transitions, 44 changer transitions 0/258 dead transitions.
[2024-06-20 19:18:42,938 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 258 transitions, 3371 flow
[2024-06-20 19:18:42,939 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:18:42,939 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:18:42,939 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 166 transitions.
[2024-06-20 19:18:42,939 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43915343915343913
[2024-06-20 19:18:42,939 INFO  L175             Difference]: Start difference. First operand has 193 places, 235 transitions, 2637 flow. Second operand 9 states and 166 transitions.
[2024-06-20 19:18:42,939 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 258 transitions, 3371 flow
[2024-06-20 19:18:43,340 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 258 transitions, 3271 flow, removed 34 selfloop flow, removed 5 redundant places.
[2024-06-20 19:18:43,343 INFO  L231             Difference]: Finished difference. Result has 197 places, 238 transitions, 2700 flow
[2024-06-20 19:18:43,343 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2543, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2700, PETRI_PLACES=197, PETRI_TRANSITIONS=238}
[2024-06-20 19:18:43,343 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 154 predicate places.
[2024-06-20 19:18:43,343 INFO  L495      AbstractCegarLoop]: Abstraction has has 197 places, 238 transitions, 2700 flow
[2024-06-20 19:18:43,343 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 12.5) internal successors, (125), 10 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:18:43,343 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:18:43,343 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:18:43,343 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52
[2024-06-20 19:18:43,344 INFO  L420      AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:18:43,344 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:18:43,344 INFO  L85        PathProgramCache]: Analyzing trace with hash -952707466, now seen corresponding path program 4 times
[2024-06-20 19:18:43,344 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:18:43,344 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629583329]
[2024-06-20 19:18:43,344 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:18:43,344 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:18:43,382 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:18:56,837 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:18:56,838 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:18:56,838 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629583329]
[2024-06-20 19:18:56,838 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629583329] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:18:56,838 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:18:56,838 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:18:56,838 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845943219]
[2024-06-20 19:18:56,838 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:18:56,838 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:18:56,838 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:18:56,839 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:18:56,839 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:18:57,076 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42
[2024-06-20 19:18:57,076 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 238 transitions, 2700 flow. Second operand  has 10 states, 10 states have (on average 12.5) internal successors, (125), 10 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:18:57,076 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:18:57,076 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42
[2024-06-20 19:18:57,076 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:18:58,385 INFO  L124   PetriNetUnfolderBase]: 2119/3453 cut-off events.
[2024-06-20 19:18:58,386 INFO  L125   PetriNetUnfolderBase]: For 279165/279165 co-relation queries the response was YES.
[2024-06-20 19:18:58,406 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 29649 conditions, 3453 events. 2119/3453 cut-off events. For 279165/279165 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 19819 event pairs, 538 based on Foata normal form. 4/3455 useless extension candidates. Maximal degree in co-relation 29558. Up to 3081 conditions per place. 
[2024-06-20 19:18:58,422 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 204 selfloop transitions, 42 changer transitions 0/257 dead transitions.
[2024-06-20 19:18:58,422 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 257 transitions, 3260 flow
[2024-06-20 19:18:58,422 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:18:58,422 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:18:58,423 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 166 transitions.
[2024-06-20 19:18:58,423 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43915343915343913
[2024-06-20 19:18:58,423 INFO  L175             Difference]: Start difference. First operand has 197 places, 238 transitions, 2700 flow. Second operand 9 states and 166 transitions.
[2024-06-20 19:18:58,423 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 257 transitions, 3260 flow
[2024-06-20 19:18:58,767 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 257 transitions, 3095 flow, removed 50 selfloop flow, removed 6 redundant places.
[2024-06-20 19:18:58,770 INFO  L231             Difference]: Finished difference. Result has 200 places, 238 transitions, 2625 flow
[2024-06-20 19:18:58,771 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2535, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2625, PETRI_PLACES=200, PETRI_TRANSITIONS=238}
[2024-06-20 19:18:58,771 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 157 predicate places.
[2024-06-20 19:18:58,771 INFO  L495      AbstractCegarLoop]: Abstraction has has 200 places, 238 transitions, 2625 flow
[2024-06-20 19:18:58,771 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 12.5) internal successors, (125), 10 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:18:58,771 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:18:58,771 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:18:58,771 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53
[2024-06-20 19:18:58,771 INFO  L420      AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:18:58,772 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:18:58,772 INFO  L85        PathProgramCache]: Analyzing trace with hash -1081468818, now seen corresponding path program 1 times
[2024-06-20 19:18:58,772 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:18:58,772 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451990676]
[2024-06-20 19:18:58,772 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:18:58,772 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:18:58,819 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:19:13,402 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:19:13,402 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:19:13,402 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451990676]
[2024-06-20 19:19:13,402 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451990676] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:19:13,403 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:19:13,403 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-20 19:19:13,403 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651930119]
[2024-06-20 19:19:13,403 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:19:13,403 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-20 19:19:13,403 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:19:13,403 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-20 19:19:13,403 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110
[2024-06-20 19:19:13,630 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-20 19:19:13,630 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 238 transitions, 2625 flow. Second operand  has 11 states, 11 states have (on average 11.454545454545455) internal successors, (126), 11 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:19:13,630 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:19:13,630 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-20 19:19:13,630 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:19:14,949 INFO  L124   PetriNetUnfolderBase]: 2247/3574 cut-off events.
[2024-06-20 19:19:14,949 INFO  L125   PetriNetUnfolderBase]: For 282503/282503 co-relation queries the response was YES.
[2024-06-20 19:19:14,972 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 30358 conditions, 3574 events. 2247/3574 cut-off events. For 282503/282503 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 19957 event pairs, 601 based on Foata normal form. 1/3573 useless extension candidates. Maximal degree in co-relation 30266. Up to 3371 conditions per place. 
[2024-06-20 19:19:14,988 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 228 selfloop transitions, 20 changer transitions 0/253 dead transitions.
[2024-06-20 19:19:14,988 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 253 transitions, 3225 flow
[2024-06-20 19:19:14,990 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:19:14,990 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:19:14,990 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 147 transitions.
[2024-06-20 19:19:14,990 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3888888888888889
[2024-06-20 19:19:14,990 INFO  L175             Difference]: Start difference. First operand has 200 places, 238 transitions, 2625 flow. Second operand 9 states and 147 transitions.
[2024-06-20 19:19:14,990 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 253 transitions, 3225 flow
[2024-06-20 19:19:15,310 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 253 transitions, 3112 flow, removed 0 selfloop flow, removed 9 redundant places.
[2024-06-20 19:19:15,313 INFO  L231             Difference]: Finished difference. Result has 200 places, 241 transitions, 2640 flow
[2024-06-20 19:19:15,313 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2512, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=218, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2640, PETRI_PLACES=200, PETRI_TRANSITIONS=241}
[2024-06-20 19:19:15,314 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 157 predicate places.
[2024-06-20 19:19:15,314 INFO  L495      AbstractCegarLoop]: Abstraction has has 200 places, 241 transitions, 2640 flow
[2024-06-20 19:19:15,314 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 11.454545454545455) internal successors, (126), 11 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:19:15,314 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:19:15,314 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:19:15,314 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54
[2024-06-20 19:19:15,314 INFO  L420      AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:19:15,314 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:19:15,314 INFO  L85        PathProgramCache]: Analyzing trace with hash -1314569218, now seen corresponding path program 1 times
[2024-06-20 19:19:15,315 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:19:15,315 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736535816]
[2024-06-20 19:19:15,315 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:19:15,315 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:19:15,352 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:19:29,280 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:19:29,280 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:19:29,280 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736535816]
[2024-06-20 19:19:29,280 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736535816] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:19:29,281 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:19:29,281 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:19:29,281 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414951165]
[2024-06-20 19:19:29,281 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:19:29,281 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:19:29,281 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:19:29,282 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:19:29,282 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:19:29,469 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42
[2024-06-20 19:19:29,470 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 241 transitions, 2640 flow. Second operand  has 10 states, 10 states have (on average 12.5) internal successors, (125), 10 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:19:29,470 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:19:29,470 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42
[2024-06-20 19:19:29,470 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:19:31,150 INFO  L124   PetriNetUnfolderBase]: 2213/3564 cut-off events.
[2024-06-20 19:19:31,151 INFO  L125   PetriNetUnfolderBase]: For 304951/304951 co-relation queries the response was YES.
[2024-06-20 19:19:31,173 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 30700 conditions, 3564 events. 2213/3564 cut-off events. For 304951/304951 co-relation queries the response was YES. Maximal size of possible extension queue 208. Compared 20213 event pairs, 440 based on Foata normal form. 10/3568 useless extension candidates. Maximal degree in co-relation 30607. Up to 3045 conditions per place. 
[2024-06-20 19:19:31,190 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 232 selfloop transitions, 27 changer transitions 0/284 dead transitions.
[2024-06-20 19:19:31,190 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 284 transitions, 3370 flow
[2024-06-20 19:19:31,191 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 19:19:31,191 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 19:19:31,191 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 197 transitions.
[2024-06-20 19:19:31,191 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46904761904761905
[2024-06-20 19:19:31,191 INFO  L175             Difference]: Start difference. First operand has 200 places, 241 transitions, 2640 flow. Second operand 10 states and 197 transitions.
[2024-06-20 19:19:31,192 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 284 transitions, 3370 flow
[2024-06-20 19:19:31,492 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 284 transitions, 3192 flow, removed 38 selfloop flow, removed 10 redundant places.
[2024-06-20 19:19:31,495 INFO  L231             Difference]: Finished difference. Result has 201 places, 245 transitions, 2615 flow
[2024-06-20 19:19:31,496 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2462, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2615, PETRI_PLACES=201, PETRI_TRANSITIONS=245}
[2024-06-20 19:19:31,496 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 158 predicate places.
[2024-06-20 19:19:31,496 INFO  L495      AbstractCegarLoop]: Abstraction has has 201 places, 245 transitions, 2615 flow
[2024-06-20 19:19:31,496 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 12.5) internal successors, (125), 10 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:19:31,496 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:19:31,496 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:19:31,496 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55
[2024-06-20 19:19:31,496 INFO  L420      AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:19:31,497 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:19:31,497 INFO  L85        PathProgramCache]: Analyzing trace with hash -1305998338, now seen corresponding path program 2 times
[2024-06-20 19:19:31,497 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:19:31,497 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835572928]
[2024-06-20 19:19:31,497 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:19:31,497 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:19:31,544 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:19:44,974 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:19:44,974 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:19:44,974 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835572928]
[2024-06-20 19:19:44,974 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835572928] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:19:44,974 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:19:44,975 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:19:44,975 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065869286]
[2024-06-20 19:19:44,975 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:19:44,975 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:19:44,975 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:19:44,975 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:19:44,975 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:19:45,193 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42
[2024-06-20 19:19:45,194 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 245 transitions, 2615 flow. Second operand  has 10 states, 10 states have (on average 12.5) internal successors, (125), 10 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:19:45,194 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:19:45,194 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42
[2024-06-20 19:19:45,194 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:19:46,873 INFO  L124   PetriNetUnfolderBase]: 2255/3630 cut-off events.
[2024-06-20 19:19:46,873 INFO  L125   PetriNetUnfolderBase]: For 321061/321061 co-relation queries the response was YES.
[2024-06-20 19:19:46,895 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 31783 conditions, 3630 events. 2255/3630 cut-off events. For 321061/321061 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 20628 event pairs, 581 based on Foata normal form. 12/3636 useless extension candidates. Maximal degree in co-relation 31689. Up to 3144 conditions per place. 
[2024-06-20 19:19:46,910 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 231 selfloop transitions, 28 changer transitions 0/284 dead transitions.
[2024-06-20 19:19:46,910 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 284 transitions, 3349 flow
[2024-06-20 19:19:46,911 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 19:19:46,911 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 19:19:46,911 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 196 transitions.
[2024-06-20 19:19:46,911 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4666666666666667
[2024-06-20 19:19:46,911 INFO  L175             Difference]: Start difference. First operand has 201 places, 245 transitions, 2615 flow. Second operand 10 states and 196 transitions.
[2024-06-20 19:19:46,911 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 284 transitions, 3349 flow
[2024-06-20 19:19:47,314 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 284 transitions, 3244 flow, removed 29 selfloop flow, removed 7 redundant places.
[2024-06-20 19:19:47,317 INFO  L231             Difference]: Finished difference. Result has 204 places, 247 transitions, 2646 flow
[2024-06-20 19:19:47,317 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2510, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2646, PETRI_PLACES=204, PETRI_TRANSITIONS=247}
[2024-06-20 19:19:47,318 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 161 predicate places.
[2024-06-20 19:19:47,318 INFO  L495      AbstractCegarLoop]: Abstraction has has 204 places, 247 transitions, 2646 flow
[2024-06-20 19:19:47,318 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 12.5) internal successors, (125), 10 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:19:47,318 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:19:47,318 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:19:47,318 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56
[2024-06-20 19:19:47,318 INFO  L420      AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:19:47,318 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:19:47,318 INFO  L85        PathProgramCache]: Analyzing trace with hash -694974076, now seen corresponding path program 1 times
[2024-06-20 19:19:47,319 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:19:47,319 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731417807]
[2024-06-20 19:19:47,319 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:19:47,319 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:19:47,360 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:20:00,297 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:20:00,298 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:20:00,298 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731417807]
[2024-06-20 19:20:00,298 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731417807] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:20:00,298 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:20:00,298 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-20 19:20:00,298 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739417254]
[2024-06-20 19:20:00,298 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:20:00,298 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-20 19:20:00,298 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:20:00,298 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-20 19:20:00,299 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110
[2024-06-20 19:20:00,548 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-20 19:20:00,548 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 247 transitions, 2646 flow. Second operand  has 11 states, 11 states have (on average 11.454545454545455) internal successors, (126), 11 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:20:00,548 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:20:00,548 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-20 19:20:00,548 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:20:02,061 INFO  L124   PetriNetUnfolderBase]: 2342/3725 cut-off events.
[2024-06-20 19:20:02,061 INFO  L125   PetriNetUnfolderBase]: For 317021/317021 co-relation queries the response was YES.
[2024-06-20 19:20:02,085 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 32508 conditions, 3725 events. 2342/3725 cut-off events. For 317021/317021 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 20923 event pairs, 612 based on Foata normal form. 3/3726 useless extension candidates. Maximal degree in co-relation 32413. Up to 3420 conditions per place. 
[2024-06-20 19:20:02,100 INFO  L140   encePairwiseOnDemand]: 29/42 looper letters, 247 selfloop transitions, 34 changer transitions 0/286 dead transitions.
[2024-06-20 19:20:02,100 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 286 transitions, 3418 flow
[2024-06-20 19:20:02,101 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-20 19:20:02,101 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-20 19:20:02,101 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 201 transitions.
[2024-06-20 19:20:02,101 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43506493506493504
[2024-06-20 19:20:02,101 INFO  L175             Difference]: Start difference. First operand has 204 places, 247 transitions, 2646 flow. Second operand 11 states and 201 transitions.
[2024-06-20 19:20:02,101 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 286 transitions, 3418 flow
[2024-06-20 19:20:02,405 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 286 transitions, 3314 flow, removed 26 selfloop flow, removed 8 redundant places.
[2024-06-20 19:20:02,410 INFO  L231             Difference]: Finished difference. Result has 207 places, 251 transitions, 2725 flow
[2024-06-20 19:20:02,411 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2542, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2725, PETRI_PLACES=207, PETRI_TRANSITIONS=251}
[2024-06-20 19:20:02,411 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 164 predicate places.
[2024-06-20 19:20:02,411 INFO  L495      AbstractCegarLoop]: Abstraction has has 207 places, 251 transitions, 2725 flow
[2024-06-20 19:20:02,411 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 11.454545454545455) internal successors, (126), 11 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:20:02,411 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:20:02,411 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:20:02,411 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57
[2024-06-20 19:20:02,411 INFO  L420      AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:20:02,412 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:20:02,412 INFO  L85        PathProgramCache]: Analyzing trace with hash -1196239366, now seen corresponding path program 1 times
[2024-06-20 19:20:02,412 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:20:02,412 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561382251]
[2024-06-20 19:20:02,412 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:20:02,412 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:20:02,465 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:20:15,065 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:20:15,065 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:20:15,065 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561382251]
[2024-06-20 19:20:15,065 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561382251] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:20:15,065 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:20:15,065 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 19:20:15,066 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771815393]
[2024-06-20 19:20:15,066 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:20:15,066 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 19:20:15,066 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:20:15,066 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 19:20:15,066 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72
[2024-06-20 19:20:15,225 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42
[2024-06-20 19:20:15,225 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 251 transitions, 2725 flow. Second operand  has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 9 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-20 19:20:15,225 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:20:15,225 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42
[2024-06-20 19:20:15,225 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:20:16,643 INFO  L124   PetriNetUnfolderBase]: 2277/3660 cut-off events.
[2024-06-20 19:20:16,643 INFO  L125   PetriNetUnfolderBase]: For 327991/327991 co-relation queries the response was YES.
[2024-06-20 19:20:16,666 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 32700 conditions, 3660 events. 2277/3660 cut-off events. For 327991/327991 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 20888 event pairs, 592 based on Foata normal form. 2/3653 useless extension candidates. Maximal degree in co-relation 32604. Up to 3152 conditions per place. 
[2024-06-20 19:20:16,683 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 216 selfloop transitions, 37 changer transitions 0/278 dead transitions.
[2024-06-20 19:20:16,683 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 278 transitions, 3373 flow
[2024-06-20 19:20:16,685 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:20:16,685 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:20:16,686 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 160 transitions.
[2024-06-20 19:20:16,686 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.47619047619047616
[2024-06-20 19:20:16,686 INFO  L175             Difference]: Start difference. First operand has 207 places, 251 transitions, 2725 flow. Second operand 8 states and 160 transitions.
[2024-06-20 19:20:16,686 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 278 transitions, 3373 flow
[2024-06-20 19:20:17,011 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 278 transitions, 3218 flow, removed 46 selfloop flow, removed 9 redundant places.
[2024-06-20 19:20:17,015 INFO  L231             Difference]: Finished difference. Result has 206 places, 255 transitions, 2743 flow
[2024-06-20 19:20:17,015 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2570, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=251, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2743, PETRI_PLACES=206, PETRI_TRANSITIONS=255}
[2024-06-20 19:20:17,016 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 163 predicate places.
[2024-06-20 19:20:17,016 INFO  L495      AbstractCegarLoop]: Abstraction has has 206 places, 255 transitions, 2743 flow
[2024-06-20 19:20:17,016 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 9 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-20 19:20:17,016 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:20:17,016 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:20:17,016 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58
[2024-06-20 19:20:17,016 INFO  L420      AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:20:17,017 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:20:17,017 INFO  L85        PathProgramCache]: Analyzing trace with hash -1792145548, now seen corresponding path program 1 times
[2024-06-20 19:20:17,017 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:20:17,017 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362281793]
[2024-06-20 19:20:17,017 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:20:17,017 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:20:17,056 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:20:30,338 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:20:30,338 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:20:30,338 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362281793]
[2024-06-20 19:20:30,339 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362281793] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:20:30,339 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:20:30,339 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:20:30,339 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543541734]
[2024-06-20 19:20:30,339 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:20:30,339 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:20:30,339 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:20:30,339 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:20:30,340 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:20:30,525 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-20 19:20:30,526 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 255 transitions, 2743 flow. Second operand  has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:20:30,526 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:20:30,526 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-20 19:20:30,526 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:20:32,095 INFO  L124   PetriNetUnfolderBase]: 2372/3763 cut-off events.
[2024-06-20 19:20:32,096 INFO  L125   PetriNetUnfolderBase]: For 339767/339767 co-relation queries the response was YES.
[2024-06-20 19:20:32,119 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 33586 conditions, 3763 events. 2372/3763 cut-off events. For 339767/339767 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 21009 event pairs, 610 based on Foata normal form. 4/3765 useless extension candidates. Maximal degree in co-relation 33489. Up to 3465 conditions per place. 
[2024-06-20 19:20:32,136 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 258 selfloop transitions, 29 changer transitions 0/292 dead transitions.
[2024-06-20 19:20:32,136 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 292 transitions, 3502 flow
[2024-06-20 19:20:32,137 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 19:20:32,137 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 19:20:32,137 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 186 transitions.
[2024-06-20 19:20:32,137 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44285714285714284
[2024-06-20 19:20:32,137 INFO  L175             Difference]: Start difference. First operand has 206 places, 255 transitions, 2743 flow. Second operand 10 states and 186 transitions.
[2024-06-20 19:20:32,137 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 292 transitions, 3502 flow
[2024-06-20 19:20:32,564 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 292 transitions, 3350 flow, removed 33 selfloop flow, removed 7 redundant places.
[2024-06-20 19:20:32,567 INFO  L231             Difference]: Finished difference. Result has 209 places, 259 transitions, 2751 flow
[2024-06-20 19:20:32,568 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2591, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2751, PETRI_PLACES=209, PETRI_TRANSITIONS=259}
[2024-06-20 19:20:32,568 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 166 predicate places.
[2024-06-20 19:20:32,568 INFO  L495      AbstractCegarLoop]: Abstraction has has 209 places, 259 transitions, 2751 flow
[2024-06-20 19:20:32,568 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:20:32,568 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:20:32,569 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:20:32,569 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59
[2024-06-20 19:20:32,569 INFO  L420      AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:20:32,569 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:20:32,569 INFO  L85        PathProgramCache]: Analyzing trace with hash -1191477580, now seen corresponding path program 2 times
[2024-06-20 19:20:32,569 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:20:32,569 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990286960]
[2024-06-20 19:20:32,569 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:20:32,570 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:20:32,608 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:20:46,026 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:20:46,026 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:20:46,026 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990286960]
[2024-06-20 19:20:46,026 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990286960] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:20:46,026 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:20:46,026 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:20:46,026 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480066316]
[2024-06-20 19:20:46,026 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:20:46,026 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:20:46,027 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:20:46,027 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:20:46,027 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:20:46,241 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-20 19:20:46,242 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 259 transitions, 2751 flow. Second operand  has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:20:46,242 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:20:46,242 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-20 19:20:46,242 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:20:47,663 INFO  L124   PetriNetUnfolderBase]: 2408/3825 cut-off events.
[2024-06-20 19:20:47,663 INFO  L125   PetriNetUnfolderBase]: For 355069/355069 co-relation queries the response was YES.
[2024-06-20 19:20:47,685 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 34371 conditions, 3825 events. 2408/3825 cut-off events. For 355069/355069 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 21493 event pairs, 612 based on Foata normal form. 4/3827 useless extension candidates. Maximal degree in co-relation 34273. Up to 3362 conditions per place. 
[2024-06-20 19:20:47,700 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 234 selfloop transitions, 60 changer transitions 0/299 dead transitions.
[2024-06-20 19:20:47,700 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 299 transitions, 3852 flow
[2024-06-20 19:20:47,701 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 19:20:47,701 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 19:20:47,701 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 189 transitions.
[2024-06-20 19:20:47,701 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45
[2024-06-20 19:20:47,701 INFO  L175             Difference]: Start difference. First operand has 209 places, 259 transitions, 2751 flow. Second operand 10 states and 189 transitions.
[2024-06-20 19:20:47,701 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 299 transitions, 3852 flow
[2024-06-20 19:20:48,113 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 299 transitions, 3755 flow, removed 22 selfloop flow, removed 8 redundant places.
[2024-06-20 19:20:48,116 INFO  L231             Difference]: Finished difference. Result has 211 places, 266 transitions, 2956 flow
[2024-06-20 19:20:48,116 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2654, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2956, PETRI_PLACES=211, PETRI_TRANSITIONS=266}
[2024-06-20 19:20:48,116 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 168 predicate places.
[2024-06-20 19:20:48,117 INFO  L495      AbstractCegarLoop]: Abstraction has has 211 places, 266 transitions, 2956 flow
[2024-06-20 19:20:48,117 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:20:48,117 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:20:48,117 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:20:48,117 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60
[2024-06-20 19:20:48,117 INFO  L420      AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:20:48,117 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:20:48,117 INFO  L85        PathProgramCache]: Analyzing trace with hash -407737190, now seen corresponding path program 3 times
[2024-06-20 19:20:48,118 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:20:48,118 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772377214]
[2024-06-20 19:20:48,118 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:20:48,118 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:20:48,155 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:21:01,055 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:21:01,055 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:21:01,055 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772377214]
[2024-06-20 19:21:01,055 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772377214] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:21:01,055 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:21:01,055 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:21:01,055 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87836711]
[2024-06-20 19:21:01,055 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:21:01,056 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:21:01,056 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:21:01,056 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:21:01,056 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:21:01,261 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-20 19:21:01,261 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 266 transitions, 2956 flow. Second operand  has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:21:01,261 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:21:01,261 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-20 19:21:01,261 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:21:02,777 INFO  L124   PetriNetUnfolderBase]: 2396/3807 cut-off events.
[2024-06-20 19:21:02,777 INFO  L125   PetriNetUnfolderBase]: For 358558/358558 co-relation queries the response was YES.
[2024-06-20 19:21:02,803 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 34193 conditions, 3807 events. 2396/3807 cut-off events. For 358558/358558 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 21368 event pairs, 597 based on Foata normal form. 4/3809 useless extension candidates. Maximal degree in co-relation 34094. Up to 3354 conditions per place. 
[2024-06-20 19:21:02,819 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 233 selfloop transitions, 60 changer transitions 0/298 dead transitions.
[2024-06-20 19:21:02,819 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 298 transitions, 3764 flow
[2024-06-20 19:21:02,820 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 19:21:02,820 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 19:21:02,820 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 187 transitions.
[2024-06-20 19:21:02,820 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4452380952380952
[2024-06-20 19:21:02,820 INFO  L175             Difference]: Start difference. First operand has 211 places, 266 transitions, 2956 flow. Second operand 10 states and 187 transitions.
[2024-06-20 19:21:02,820 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 298 transitions, 3764 flow
[2024-06-20 19:21:03,253 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 298 transitions, 3596 flow, removed 52 selfloop flow, removed 6 redundant places.
[2024-06-20 19:21:03,257 INFO  L231             Difference]: Finished difference. Result has 215 places, 266 transitions, 2918 flow
[2024-06-20 19:21:03,257 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2788, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=266, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=206, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2918, PETRI_PLACES=215, PETRI_TRANSITIONS=266}
[2024-06-20 19:21:03,257 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 172 predicate places.
[2024-06-20 19:21:03,257 INFO  L495      AbstractCegarLoop]: Abstraction has has 215 places, 266 transitions, 2918 flow
[2024-06-20 19:21:03,258 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:21:03,258 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:21:03,258 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:21:03,258 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61
[2024-06-20 19:21:03,258 INFO  L420      AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:21:03,258 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:21:03,258 INFO  L85        PathProgramCache]: Analyzing trace with hash 4319702, now seen corresponding path program 3 times
[2024-06-20 19:21:03,258 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:21:03,258 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982872598]
[2024-06-20 19:21:03,258 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:21:03,258 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:21:03,299 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
Killed by 15