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


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


Checking for ERROR reachability
Using default analysis
Version bcb38a6f
Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false
--- Real Ultimate output ---
This is Ultimate 0.2.4-tmp.fs.goblint-validation-bcb38a6-m
[2024-06-03 22:27:29,390 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-06-03 22:27:29,462 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-06-03 22:27:29,466 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-06-03 22:27:29,467 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-06-03 22:27:29,496 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-06-03 22:27:29,497 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-06-03 22:27:29,498 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-06-03 22:27:29,498 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-06-03 22:27:29,501 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-06-03 22:27:29,501 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-06-03 22:27:29,502 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-06-03 22:27:29,502 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-06-03 22:27:29,503 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-06-03 22:27:29,504 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-06-03 22:27:29,504 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-06-03 22:27:29,504 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-06-03 22:27:29,504 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-06-03 22:27:29,505 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-06-03 22:27:29,505 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-06-03 22:27:29,506 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-06-03 22:27:29,506 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-06-03 22:27:29,507 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-06-03 22:27:29,507 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-06-03 22:27:29,507 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-06-03 22:27:29,507 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-06-03 22:27:29,507 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-06-03 22:27:29,508 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-06-03 22:27:29,508 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-06-03 22:27:29,508 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-06-03 22:27:29,509 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-06-03 22:27:29,509 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-06-03 22:27:29,509 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-06-03 22:27:29,510 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-06-03 22:27:29,510 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-06-03 22:27:29,510 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-06-03 22:27:29,510 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-06-03 22:27:29,510 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-06-03 22:27:29,510 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-06-03 22:27:29,511 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-06-03 22:27:29,511 INFO  L153        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-06-03 22:27:29,511 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-06-03 22:27:29,511 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-06-03 22:27:29,511 INFO  L153        SettingsManager]:  * Looper check in Petri net analysis=SEMANTIC
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false
[2024-06-03 22:27:29,705 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-06-03 22:27:29,731 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-06-03 22:27:29,734 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-06-03 22:27:29,734 INFO  L270        PluginConnector]: Initializing Witness Parser...
[2024-06-03 22:27:29,735 INFO  L274        PluginConnector]: Witness Parser initialized
[2024-06-03 22:27:29,736 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/safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.yml/witness.yml
[2024-06-03 22:27:29,923 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-06-03 22:27:29,923 INFO  L274        PluginConnector]: CDTParser initialized
[2024-06-03 22:27:29,924 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i
[2024-06-03 22:27:31,026 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-06-03 22:27:31,269 INFO  L384              CDTParser]: Found 1 translation units.
[2024-06-03 22:27:31,272 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i
[2024-06-03 22:27:31,290 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5734aeda6/4937e2fec9b74590a7911d61d9c4353b/FLAG4a7aa06be
[2024-06-03 22:27:31,303 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5734aeda6/4937e2fec9b74590a7911d61d9c4353b
[2024-06-03 22:27:31,304 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-06-03 22:27:31,305 INFO  L133        ToolchainWalker]: Walking toolchain with 5 elements.
[2024-06-03 22:27:31,307 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-06-03 22:27:31,307 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-06-03 22:27:31,311 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-06-03 22:27:31,311 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 10:27:29" (1/2) ...
[2024-06-03 22:27:31,312 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53f476f and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:27:31, skipping insertion in model container
[2024-06-03 22:27:31,312 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 10:27:29" (1/2) ...
[2024-06-03 22:27:31,313 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@5ed3ab85 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:27:31, skipping insertion in model container
[2024-06-03 22:27:31,313 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.06 10:27:31" (2/2) ...
[2024-06-03 22:27:31,314 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53f476f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:27:31, skipping insertion in model container
[2024-06-03 22:27:31,314 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.06 10:27:31" (2/2) ...
[2024-06-03 22:27:31,314 INFO  L83    nessWitnessExtractor]: Extracting all invariants from correctness witness
[2024-06-03 22:27:31,448 INFO  L95    edCorrectnessWitness]: Found the following entries in the witness:
[2024-06-03 22:27:31,450 INFO  L97    edCorrectnessWitness]: Location invariant before [L851-L851] ((((((((((((((((((! multithreaded || y$r_buff1_thd3 == (_Bool)0) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 127) && ((__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1) || __unbuffered_p2_EBX == 2)))) && (! multithreaded || ((0 <= y && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((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_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_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_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_thd3) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$w_buff1 >= 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_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_thd3) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd3) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd3) + (long long )y$w_buff1 >= 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) && (2LL - (long long )y$w_buff0) + (long long )y$w_buff1 >= 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 )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_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_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 )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 )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_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_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 )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 )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_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_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 )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )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_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_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 )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )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_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_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 )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_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_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 )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_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_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$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_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_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$mem_tmp + (long long )y$r_buff0_thd0 >= 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_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$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_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_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_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_thd3 + (long long )y$r_buff1_thd0 >= 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_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_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_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$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )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_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_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 )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_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_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) && (2LL + (long long )__unbuffered_cnt) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )__unbuffered_p1_EAX) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )__unbuffered_p1_EAX) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )__unbuffered_p2_EAX) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )__unbuffered_p2_EAX) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )__unbuffered_p2_EBX) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )__unbuffered_p2_EBX) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )x) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )x) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$flush_delayed) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$flush_delayed) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$mem_tmp) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$mem_tmp) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff0_thd0) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff0_thd0) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff0_thd2) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff0_thd2) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff0_thd3) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff0_thd3) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff1_thd0) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff1_thd0) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff1_thd2) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff1_thd2) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff1_thd3) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff1_thd3) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$read_delayed) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$read_delayed) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )y$w_buff1 >= 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_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_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_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_thd3) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) - (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) - (long long )y$read_delayed >= 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_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_thd3) - (long long )y$read_delayed >= 0LL) && (2LL - (long long )y$r_buff0_thd0) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff0_thd0) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff0_thd2) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff0_thd2) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff0_thd3) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff0_thd3) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff1_thd0) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff1_thd0) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff1_thd2) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff1_thd2) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff1_thd3) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff1_thd3) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$read_delayed) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$read_delayed) - (long long )y$w_buff1 >= 0LL) && (4LL - (long long )y$w_buff0) - (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd0 >= 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_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_p1_EAX - (long long )y$r_buff0_thd0 >= 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_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_p2_EAX - (long long )y$r_buff0_thd0 >= 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_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_EBX - (long long )y$r_buff0_thd0 >= 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_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 )main$tmp_guard1 - (long long )y$r_buff0_thd0 >= 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_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 )x - (long long )y$r_buff0_thd0 >= 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_thd2 >= 0LL) && (long long )x - (long long )y$r_buff1_thd3 >= 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_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_thd2 >= 0LL) && (long long )y - (long long )y$r_buff1_thd3 >= 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_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_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$mem_tmp - (long long )y$r_buff0_thd0 >= 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_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$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_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_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_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_thd3 - (long long )y$r_buff1_thd0 >= 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_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_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_thd3 - (long long )y$read_delayed >= 0LL) && (long long )y$w_buff0 - (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd0 >= 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_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$$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_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_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd3 >= 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 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p2_EAX <= 127) && __unbuffered_p2_EBX <= 127) && x <= 1) && y <= 127) && y$mem_tmp <= 127) && y$w_buff0 <= 2) && y$w_buff0 <= 127) && y$w_buff1 <= 2) && y$w_buff1 <= 127) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff0_thd3 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$r_buff1_thd3 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && y$w_buff0 % 2 == 0) && y$w_buff1 % 2 == 0) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (x == 0 || x == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 2)) && (y$w_buff1 == 0 || y$w_buff1 == 2)) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)) && ((__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1) || __unbuffered_p2_EBX == 2)) && ((y == 0 || y == 1) || y == 2)) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((((0 <= y$w_buff1 && y$w_buff1 <= 2) && y$w_buff1 <= 127) && y$w_buff1 % 2 == 0) && (y$w_buff1 == 0 || y$w_buff1 == 2)))) && (! multithreaded || y$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 127) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((((0 <= y$w_buff0 && y$w_buff0 <= 2) && y$w_buff0 <= 127) && y$w_buff0 % 2 == 0) && (y$w_buff0 == 0 || y$w_buff0 == 2)))) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 127) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || y$read_delayed == (_Bool)0)
[2024-06-03 22:27:31,450 INFO  L97    edCorrectnessWitness]: Location invariant before [L849-L849] ((((((((((((((((((! multithreaded || y$r_buff1_thd3 == (_Bool)0) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 127) && ((__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1) || __unbuffered_p2_EBX == 2)))) && (! multithreaded || ((0 <= y && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((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_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_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_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_thd3) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$w_buff1 >= 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_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_thd3) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd3) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd3) + (long long )y$w_buff1 >= 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) && (2LL - (long long )y$w_buff0) + (long long )y$w_buff1 >= 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 )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_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_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 )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 )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_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_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 )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 )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_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_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 )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )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_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_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 )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )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_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_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 )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_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_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 )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_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_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$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_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_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$mem_tmp + (long long )y$r_buff0_thd0 >= 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_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$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_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_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_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_thd3 + (long long )y$r_buff1_thd0 >= 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_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_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_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$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )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_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_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 )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_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_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) && (2LL + (long long )__unbuffered_cnt) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )__unbuffered_p1_EAX) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )__unbuffered_p1_EAX) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )__unbuffered_p2_EAX) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )__unbuffered_p2_EAX) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )__unbuffered_p2_EBX) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )__unbuffered_p2_EBX) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )x) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )x) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$flush_delayed) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$flush_delayed) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$mem_tmp) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$mem_tmp) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff0_thd0) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff0_thd0) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff0_thd2) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff0_thd2) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff0_thd3) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff0_thd3) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff1_thd0) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff1_thd0) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff1_thd2) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff1_thd2) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff1_thd3) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff1_thd3) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$read_delayed) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$read_delayed) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )y$w_buff1 >= 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_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_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_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_thd3) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) - (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) - (long long )y$read_delayed >= 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_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_thd3) - (long long )y$read_delayed >= 0LL) && (2LL - (long long )y$r_buff0_thd0) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff0_thd0) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff0_thd2) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff0_thd2) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff0_thd3) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff0_thd3) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff1_thd0) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff1_thd0) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff1_thd2) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff1_thd2) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff1_thd3) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff1_thd3) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$read_delayed) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$read_delayed) - (long long )y$w_buff1 >= 0LL) && (4LL - (long long )y$w_buff0) - (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd0 >= 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_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_p1_EAX - (long long )y$r_buff0_thd0 >= 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_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_p2_EAX - (long long )y$r_buff0_thd0 >= 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_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_EBX - (long long )y$r_buff0_thd0 >= 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_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 )main$tmp_guard1 - (long long )y$r_buff0_thd0 >= 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_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 )x - (long long )y$r_buff0_thd0 >= 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_thd2 >= 0LL) && (long long )x - (long long )y$r_buff1_thd3 >= 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_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_thd2 >= 0LL) && (long long )y - (long long )y$r_buff1_thd3 >= 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_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_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$mem_tmp - (long long )y$r_buff0_thd0 >= 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_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$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_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_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_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_thd3 - (long long )y$r_buff1_thd0 >= 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_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_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_thd3 - (long long )y$read_delayed >= 0LL) && (long long )y$w_buff0 - (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd0 >= 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_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$$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_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_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd3 >= 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 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p2_EAX <= 127) && __unbuffered_p2_EBX <= 127) && x <= 1) && y <= 127) && y$mem_tmp <= 127) && y$w_buff0 <= 2) && y$w_buff0 <= 127) && y$w_buff1 <= 2) && y$w_buff1 <= 127) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff0_thd3 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$r_buff1_thd3 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && y$w_buff0 % 2 == 0) && y$w_buff1 % 2 == 0) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (x == 0 || x == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 2)) && (y$w_buff1 == 0 || y$w_buff1 == 2)) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)) && ((__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1) || __unbuffered_p2_EBX == 2)) && ((y == 0 || y == 1) || y == 2)) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((((0 <= y$w_buff1 && y$w_buff1 <= 2) && y$w_buff1 <= 127) && y$w_buff1 % 2 == 0) && (y$w_buff1 == 0 || y$w_buff1 == 2)))) && (! multithreaded || y$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 127) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((((0 <= y$w_buff0 && y$w_buff0 <= 2) && y$w_buff0 <= 127) && y$w_buff0 % 2 == 0) && (y$w_buff0 == 0 || y$w_buff0 == 2)))) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 127) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || y$read_delayed == (_Bool)0)
[2024-06-03 22:27:31,451 INFO  L97    edCorrectnessWitness]: Location invariant before [L852-L852] ((((((((((((((((((! multithreaded || y$r_buff1_thd3 == (_Bool)0) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 127) && ((__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1) || __unbuffered_p2_EBX == 2)))) && (! multithreaded || ((0 <= y && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((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_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_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_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_thd3) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$w_buff1 >= 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_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_thd3) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd3) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd3) + (long long )y$w_buff1 >= 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) && (2LL - (long long )y$w_buff0) + (long long )y$w_buff1 >= 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 )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_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_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 )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 )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_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_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 )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 )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_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_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 )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )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_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_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 )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )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_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_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 )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_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_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 )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_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_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$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_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_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$mem_tmp + (long long )y$r_buff0_thd0 >= 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_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$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_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_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_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_thd3 + (long long )y$r_buff1_thd0 >= 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_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_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_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$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )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_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_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 )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_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_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) && (2LL + (long long )__unbuffered_cnt) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )__unbuffered_p1_EAX) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )__unbuffered_p1_EAX) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )__unbuffered_p2_EAX) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )__unbuffered_p2_EAX) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )__unbuffered_p2_EBX) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )__unbuffered_p2_EBX) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )x) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )x) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$flush_delayed) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$flush_delayed) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$mem_tmp) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$mem_tmp) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff0_thd0) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff0_thd0) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff0_thd2) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff0_thd2) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff0_thd3) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff0_thd3) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff1_thd0) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff1_thd0) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff1_thd2) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff1_thd2) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff1_thd3) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff1_thd3) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$read_delayed) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$read_delayed) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )y$w_buff1 >= 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_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_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_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_thd3) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) - (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) - (long long )y$read_delayed >= 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_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_thd3) - (long long )y$read_delayed >= 0LL) && (2LL - (long long )y$r_buff0_thd0) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff0_thd0) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff0_thd2) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff0_thd2) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff0_thd3) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff0_thd3) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff1_thd0) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff1_thd0) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff1_thd2) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff1_thd2) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff1_thd3) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff1_thd3) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$read_delayed) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$read_delayed) - (long long )y$w_buff1 >= 0LL) && (4LL - (long long )y$w_buff0) - (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd0 >= 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_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_p1_EAX - (long long )y$r_buff0_thd0 >= 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_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_p2_EAX - (long long )y$r_buff0_thd0 >= 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_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_EBX - (long long )y$r_buff0_thd0 >= 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_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 )main$tmp_guard1 - (long long )y$r_buff0_thd0 >= 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_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 )x - (long long )y$r_buff0_thd0 >= 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_thd2 >= 0LL) && (long long )x - (long long )y$r_buff1_thd3 >= 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_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_thd2 >= 0LL) && (long long )y - (long long )y$r_buff1_thd3 >= 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_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_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$mem_tmp - (long long )y$r_buff0_thd0 >= 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_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$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_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_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_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_thd3 - (long long )y$r_buff1_thd0 >= 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_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_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_thd3 - (long long )y$read_delayed >= 0LL) && (long long )y$w_buff0 - (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd0 >= 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_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$$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_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_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd3 >= 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 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p2_EAX <= 127) && __unbuffered_p2_EBX <= 127) && x <= 1) && y <= 127) && y$mem_tmp <= 127) && y$w_buff0 <= 2) && y$w_buff0 <= 127) && y$w_buff1 <= 2) && y$w_buff1 <= 127) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff0_thd3 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$r_buff1_thd3 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && y$w_buff0 % 2 == 0) && y$w_buff1 % 2 == 0) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (x == 0 || x == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 2)) && (y$w_buff1 == 0 || y$w_buff1 == 2)) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)) && ((__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1) || __unbuffered_p2_EBX == 2)) && ((y == 0 || y == 1) || y == 2)) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((((0 <= y$w_buff1 && y$w_buff1 <= 2) && y$w_buff1 <= 127) && y$w_buff1 % 2 == 0) && (y$w_buff1 == 0 || y$w_buff1 == 2)))) && (! multithreaded || y$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 127) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((((0 <= y$w_buff0 && y$w_buff0 <= 2) && y$w_buff0 <= 127) && y$w_buff0 % 2 == 0) && (y$w_buff0 == 0 || y$w_buff0 == 2)))) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 127) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || y$read_delayed == (_Bool)0)
[2024-06-03 22:27:31,451 INFO  L103   edCorrectnessWitness]: ghost_variable multithreaded = 0
[2024-06-03 22:27:31,452 INFO  L106   edCorrectnessWitness]: ghost_update [L847-L847] multithreaded = 1;
[2024-06-03 22:27:31,485 INFO  L177         MainTranslator]: Built tables and reachable declarations
[2024-06-03 22:27:31,811 INFO  L207          PostProcessor]: Analyzing one entry point: main
[2024-06-03 22:27:31,823 INFO  L202         MainTranslator]: Completed pre-run
Start Parsing Local
Start Parsing Local
Start Parsing Local
Start Parsing Local
Start Parsing Local
[2024-06-03 22:27:32,091 INFO  L207          PostProcessor]: Analyzing one entry point: main
[2024-06-03 22:27:32,125 INFO  L206         MainTranslator]: Completed translation
[2024-06-03 22:27:32,126 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:27:32 WrapperNode
[2024-06-03 22:27:32,126 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-06-03 22:27:32,128 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-06-03 22:27:32,128 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-06-03 22:27:32,128 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-06-03 22:27:32,133 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:27:32" (1/1) ...
[2024-06-03 22:27:32,176 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:27:32" (1/1) ...
[2024-06-03 22:27:32,298 INFO  L138                Inliner]: procedures = 175, calls = 43, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 144
[2024-06-03 22:27:32,298 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-06-03 22:27:32,299 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-06-03 22:27:32,299 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-06-03 22:27:32,299 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-06-03 22:27:32,308 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:27:32" (1/1) ...
[2024-06-03 22:27:32,308 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:27:32" (1/1) ...
[2024-06-03 22:27:32,336 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:27:32" (1/1) ...
[2024-06-03 22:27:32,385 INFO  L175           MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2024-06-03 22:27:32,385 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:27:32" (1/1) ...
[2024-06-03 22:27:32,386 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:27:32" (1/1) ...
[2024-06-03 22:27:32,421 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:27:32" (1/1) ...
[2024-06-03 22:27:32,423 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:27:32" (1/1) ...
[2024-06-03 22:27:32,442 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:27:32" (1/1) ...
[2024-06-03 22:27:32,446 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:27:32" (1/1) ...
[2024-06-03 22:27:32,473 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-06-03 22:27:32,474 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-06-03 22:27:32,474 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-06-03 22:27:32,475 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-06-03 22:27:32,475 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:27:32" (1/1) ...
[2024-06-03 22:27:32,479 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-06-03 22:27:32,486 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-06-03 22:27:32,514 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-06-03 22:27:32,541 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-06-03 22:27:32,572 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2024-06-03 22:27:32,572 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-06-03 22:27:32,572 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2024-06-03 22:27:32,572 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2024-06-03 22:27:32,573 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2024-06-03 22:27:32,573 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2024-06-03 22:27:32,573 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2024-06-03 22:27:32,573 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2024-06-03 22:27:32,573 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-06-03 22:27:32,573 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2024-06-03 22:27:32,573 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-06-03 22:27:32,574 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-06-03 22:27:32,575 WARN  L214             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement
[2024-06-03 22:27:32,700 INFO  L244             CfgBuilder]: Building ICFG
[2024-06-03 22:27:32,702 INFO  L270             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-06-03 22:27:33,667 INFO  L289             CfgBuilder]: Ommited future-live optimization because the input is a concurrent program.
[2024-06-03 22:27:33,668 INFO  L293             CfgBuilder]: Performing block encoding
[2024-06-03 22:27:33,893 INFO  L315             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-06-03 22:27:33,894 INFO  L320             CfgBuilder]: Removed 0 assume(true) statements.
[2024-06-03 22:27:33,894 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.06 10:27:33 BoogieIcfgContainer
[2024-06-03 22:27:33,894 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-06-03 22:27:33,896 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-06-03 22:27:33,896 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-06-03 22:27:33,898 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-06-03 22:27:33,898 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 10:27:29" (1/4) ...
[2024-06-03 22:27:33,899 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@564faf16 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 03.06 10:27:33, skipping insertion in model container
[2024-06-03 22:27:33,899 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.06 10:27:31" (2/4) ...
[2024-06-03 22:27:33,899 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@564faf16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.06 10:27:33, skipping insertion in model container
[2024-06-03 22:27:33,899 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:27:32" (3/4) ...
[2024-06-03 22:27:33,900 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@564faf16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.06 10:27:33, skipping insertion in model container
[2024-06-03 22:27:33,900 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.06 10:27:33" (4/4) ...
[2024-06-03 22:27:33,901 INFO  L112   eAbstractionObserver]: Analyzing ICFG safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i
[2024-06-03 22:27:33,914 INFO  L204   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-06-03 22:27:33,915 INFO  L163   ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations.
[2024-06-03 22:27:33,915 INFO  L522   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-06-03 22:27:34,004 INFO  L144    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-06-03 22:27:34,025 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 51 places, 41 transitions, 94 flow
[2024-06-03 22:27:34,075 INFO  L124   PetriNetUnfolderBase]: 0/38 cut-off events.
[2024-06-03 22:27:34,075 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-06-03 22:27:34,078 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 48 conditions, 38 events. 0/38 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 61 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. 
[2024-06-03 22:27:34,078 INFO  L82        GeneralOperation]: Start removeDead. Operand has 51 places, 41 transitions, 94 flow
[2024-06-03 22:27:34,080 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 42 places, 32 transitions, 73 flow
[2024-06-03 22:27:34,091 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-06-03 22:27:34,098 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;@38250e78, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-06-03 22:27:34,098 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2024-06-03 22:27:34,104 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-06-03 22:27:34,105 INFO  L124   PetriNetUnfolderBase]: 0/7 cut-off events.
[2024-06-03 22:27:34,105 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-06-03 22:27:34,105 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:27:34,105 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1]
[2024-06-03 22:27:34,106 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:27:34,111 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:27:34,111 INFO  L85        PathProgramCache]: Analyzing trace with hash 813129144, now seen corresponding path program 1 times
[2024-06-03 22:27:34,119 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:27:34,120 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250775736]
[2024-06-03 22:27:34,120 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:27:34,121 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:27:34,404 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:27:38,874 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:27:38,875 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:27:38,875 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250775736]
[2024-06-03 22:27:38,875 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250775736] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:27:38,876 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:27:38,876 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-06-03 22:27:38,877 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668622680]
[2024-06-03 22:27:38,877 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:27:38,883 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-06-03 22:27:38,886 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:27:38,903 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-06-03 22:27:38,903 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-06-03 22:27:38,960 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41
[2024-06-03 22:27:38,962 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 73 flow. Second operand  has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:27:38,962 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:27:38,963 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41
[2024-06-03 22:27:38,963 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:27:39,745 INFO  L124   PetriNetUnfolderBase]: 1354/2039 cut-off events.
[2024-06-03 22:27:39,746 INFO  L125   PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES.
[2024-06-03 22:27:39,751 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4153 conditions, 2039 events. 1354/2039 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 9585 event pairs, 715 based on Foata normal form. 4/2007 useless extension candidates. Maximal degree in co-relation 4138. Up to 2016 conditions per place. 
[2024-06-03 22:27:39,759 INFO  L140   encePairwiseOnDemand]: 34/41 looper letters, 37 selfloop transitions, 4 changer transitions 0/45 dead transitions.
[2024-06-03 22:27:39,759 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 45 transitions, 187 flow
[2024-06-03 22:27:39,761 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-06-03 22:27:39,763 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-06-03 22:27:39,767 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions.
[2024-06-03 22:27:39,769 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5772357723577236
[2024-06-03 22:27:39,770 INFO  L175             Difference]: Start difference. First operand has 42 places, 32 transitions, 73 flow. Second operand 3 states and 71 transitions.
[2024-06-03 22:27:39,770 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 45 transitions, 187 flow
[2024-06-03 22:27:39,772 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 45 transitions, 182 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-06-03 22:27:39,774 INFO  L231             Difference]: Finished difference. Result has 42 places, 35 transitions, 100 flow
[2024-06-03 22:27:39,775 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=42, PETRI_TRANSITIONS=35}
[2024-06-03 22:27:39,777 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 0 predicate places.
[2024-06-03 22:27:39,778 INFO  L495      AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 100 flow
[2024-06-03 22:27:39,778 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:27:39,778 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:27:39,778 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:27:39,778 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-06-03 22:27:39,779 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:27:39,779 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:27:39,779 INFO  L85        PathProgramCache]: Analyzing trace with hash -266915881, now seen corresponding path program 1 times
[2024-06-03 22:27:39,779 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:27:39,779 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840333355]
[2024-06-03 22:27:39,780 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:27:39,780 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:27:39,826 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:27:43,059 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:27:43,059 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:27:43,059 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840333355]
[2024-06-03 22:27:43,060 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840333355] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:27:43,060 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:27:43,060 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-06-03 22:27:43,060 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584737427]
[2024-06-03 22:27:43,060 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:27:43,062 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-06-03 22:27:43,062 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:27:43,063 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-06-03 22:27:43,063 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-06-03 22:27:43,134 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41
[2024-06-03 22:27:43,134 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 100 flow. Second operand  has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:27:43,134 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:27:43,134 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41
[2024-06-03 22:27:43,134 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:27:43,950 INFO  L124   PetriNetUnfolderBase]: 1363/2051 cut-off events.
[2024-06-03 22:27:43,950 INFO  L125   PetriNetUnfolderBase]: For 313/316 co-relation queries the response was YES.
[2024-06-03 22:27:43,954 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4741 conditions, 2051 events. 1363/2051 cut-off events. For 313/316 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 9357 event pairs, 772 based on Foata normal form. 8/2057 useless extension candidates. Maximal degree in co-relation 4726. Up to 2013 conditions per place. 
[2024-06-03 22:27:43,962 INFO  L140   encePairwiseOnDemand]: 32/41 looper letters, 47 selfloop transitions, 7 changer transitions 0/58 dead transitions.
[2024-06-03 22:27:43,962 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 58 transitions, 272 flow
[2024-06-03 22:27:43,962 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-06-03 22:27:43,963 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-06-03 22:27:43,965 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 90 transitions.
[2024-06-03 22:27:43,965 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5487804878048781
[2024-06-03 22:27:43,966 INFO  L175             Difference]: Start difference. First operand has 42 places, 35 transitions, 100 flow. Second operand 4 states and 90 transitions.
[2024-06-03 22:27:43,966 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 58 transitions, 272 flow
[2024-06-03 22:27:43,967 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 58 transitions, 266 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-06-03 22:27:43,969 INFO  L231             Difference]: Finished difference. Result has 46 places, 41 transitions, 156 flow
[2024-06-03 22:27:43,969 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=156, PETRI_PLACES=46, PETRI_TRANSITIONS=41}
[2024-06-03 22:27:43,970 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 4 predicate places.
[2024-06-03 22:27:43,970 INFO  L495      AbstractCegarLoop]: Abstraction has has 46 places, 41 transitions, 156 flow
[2024-06-03 22:27:43,970 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:27:43,970 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:27:43,971 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:27:43,973 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-06-03 22:27:43,973 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:27:43,973 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:27:43,974 INFO  L85        PathProgramCache]: Analyzing trace with hash 315543111, now seen corresponding path program 1 times
[2024-06-03 22:27:43,974 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:27:43,978 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347946782]
[2024-06-03 22:27:43,978 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:27:43,979 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:27:44,044 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:27:47,086 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:27:47,086 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:27:47,086 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347946782]
[2024-06-03 22:27:47,086 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347946782] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:27:47,087 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:27:47,087 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-06-03 22:27:47,087 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194248903]
[2024-06-03 22:27:47,087 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:27:47,087 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-06-03 22:27:47,088 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:27:47,088 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-06-03 22:27:47,088 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-06-03 22:27:47,175 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41
[2024-06-03 22:27:47,175 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 41 transitions, 156 flow. Second operand  has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:27:47,175 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:27:47,175 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41
[2024-06-03 22:27:47,175 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:27:48,001 INFO  L124   PetriNetUnfolderBase]: 1664/2485 cut-off events.
[2024-06-03 22:27:48,002 INFO  L125   PetriNetUnfolderBase]: For 1152/1152 co-relation queries the response was YES.
[2024-06-03 22:27:48,006 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6479 conditions, 2485 events. 1664/2485 cut-off events. For 1152/1152 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 11409 event pairs, 791 based on Foata normal form. 6/2490 useless extension candidates. Maximal degree in co-relation 6461. Up to 2418 conditions per place. 
[2024-06-03 22:27:48,014 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 64 selfloop transitions, 10 changer transitions 0/77 dead transitions.
[2024-06-03 22:27:48,015 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 77 transitions, 413 flow
[2024-06-03 22:27:48,015 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-03 22:27:48,015 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-03 22:27:48,016 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 108 transitions.
[2024-06-03 22:27:48,016 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.526829268292683
[2024-06-03 22:27:48,016 INFO  L175             Difference]: Start difference. First operand has 46 places, 41 transitions, 156 flow. Second operand 5 states and 108 transitions.
[2024-06-03 22:27:48,016 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 77 transitions, 413 flow
[2024-06-03 22:27:48,018 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 77 transitions, 398 flow, removed 3 selfloop flow, removed 1 redundant places.
[2024-06-03 22:27:48,019 INFO  L231             Difference]: Finished difference. Result has 52 places, 50 transitions, 232 flow
[2024-06-03 22:27:48,019 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=232, PETRI_PLACES=52, PETRI_TRANSITIONS=50}
[2024-06-03 22:27:48,020 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 10 predicate places.
[2024-06-03 22:27:48,020 INFO  L495      AbstractCegarLoop]: Abstraction has has 52 places, 50 transitions, 232 flow
[2024-06-03 22:27:48,020 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:27:48,020 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:27:48,020 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:27:48,021 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-06-03 22:27:48,021 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:27:48,021 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:27:48,021 INFO  L85        PathProgramCache]: Analyzing trace with hash 1275019600, now seen corresponding path program 1 times
[2024-06-03 22:27:48,022 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:27:48,022 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120863896]
[2024-06-03 22:27:48,022 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:27:48,022 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:27:48,059 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:27:51,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-03 22:27:51,611 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:27:51,614 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120863896]
[2024-06-03 22:27:51,614 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120863896] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:27:51,615 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:27:51,615 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-06-03 22:27:51,615 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076140931]
[2024-06-03 22:27:51,615 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:27:51,615 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-06-03 22:27:51,615 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:27:51,616 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-06-03 22:27:51,616 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2024-06-03 22:27:51,719 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41
[2024-06-03 22:27:51,720 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 50 transitions, 232 flow. Second operand  has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 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-03 22:27:51,720 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:27:51,720 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41
[2024-06-03 22:27:51,720 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:27:52,659 INFO  L124   PetriNetUnfolderBase]: 1658/2476 cut-off events.
[2024-06-03 22:27:52,660 INFO  L125   PetriNetUnfolderBase]: For 2199/2199 co-relation queries the response was YES.
[2024-06-03 22:27:52,663 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7121 conditions, 2476 events. 1658/2476 cut-off events. For 2199/2199 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 11153 event pairs, 722 based on Foata normal form. 3/2478 useless extension candidates. Maximal degree in co-relation 7099. Up to 2418 conditions per place. 
[2024-06-03 22:27:52,670 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 71 selfloop transitions, 13 changer transitions 0/87 dead transitions.
[2024-06-03 22:27:52,671 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 87 transitions, 513 flow
[2024-06-03 22:27:52,671 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-03 22:27:52,671 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-03 22:27:52,672 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 120 transitions.
[2024-06-03 22:27:52,672 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4878048780487805
[2024-06-03 22:27:52,672 INFO  L175             Difference]: Start difference. First operand has 52 places, 50 transitions, 232 flow. Second operand 6 states and 120 transitions.
[2024-06-03 22:27:52,673 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 87 transitions, 513 flow
[2024-06-03 22:27:52,676 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 87 transitions, 509 flow, removed 2 selfloop flow, removed 0 redundant places.
[2024-06-03 22:27:52,677 INFO  L231             Difference]: Finished difference. Result has 60 places, 59 transitions, 327 flow
[2024-06-03 22:27:52,677 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=327, PETRI_PLACES=60, PETRI_TRANSITIONS=59}
[2024-06-03 22:27:52,678 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 18 predicate places.
[2024-06-03 22:27:52,678 INFO  L495      AbstractCegarLoop]: Abstraction has has 60 places, 59 transitions, 327 flow
[2024-06-03 22:27:52,678 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 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-03 22:27:52,678 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:27:52,679 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:27:52,679 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-06-03 22:27:52,679 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:27:52,679 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:27:52,679 INFO  L85        PathProgramCache]: Analyzing trace with hash 870902828, now seen corresponding path program 1 times
[2024-06-03 22:27:52,679 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:27:52,680 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426700713]
[2024-06-03 22:27:52,680 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:27:52,680 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:27:52,723 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:27:56,321 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:27:56,322 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:27:56,322 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426700713]
[2024-06-03 22:27:56,322 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426700713] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:27:56,322 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:27:56,322 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-03 22:27:56,323 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110436503]
[2024-06-03 22:27:56,323 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:27:56,324 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-03 22:27:56,324 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:27:56,325 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-03 22:27:56,325 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2024-06-03 22:27:56,443 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41
[2024-06-03 22:27:56,444 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 59 transitions, 327 flow. Second operand  has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:27:56,444 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:27:56,445 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41
[2024-06-03 22:27:56,445 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:27:57,524 INFO  L124   PetriNetUnfolderBase]: 1649/2461 cut-off events.
[2024-06-03 22:27:57,524 INFO  L125   PetriNetUnfolderBase]: For 3519/3519 co-relation queries the response was YES.
[2024-06-03 22:27:57,529 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7739 conditions, 2461 events. 1649/2461 cut-off events. For 3519/3519 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 11067 event pairs, 558 based on Foata normal form. 6/2466 useless extension candidates. Maximal degree in co-relation 7712. Up to 2373 conditions per place. 
[2024-06-03 22:27:57,538 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 75 selfloop transitions, 15 changer transitions 0/93 dead transitions.
[2024-06-03 22:27:57,538 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 93 transitions, 593 flow
[2024-06-03 22:27:57,539 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-03 22:27:57,540 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-03 22:27:57,541 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 134 transitions.
[2024-06-03 22:27:57,542 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46689895470383275
[2024-06-03 22:27:57,542 INFO  L175             Difference]: Start difference. First operand has 60 places, 59 transitions, 327 flow. Second operand 7 states and 134 transitions.
[2024-06-03 22:27:57,543 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 93 transitions, 593 flow
[2024-06-03 22:27:57,551 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 93 transitions, 581 flow, removed 4 selfloop flow, removed 1 redundant places.
[2024-06-03 22:27:57,553 INFO  L231             Difference]: Finished difference. Result has 65 places, 60 transitions, 358 flow
[2024-06-03 22:27:57,553 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=305, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=358, PETRI_PLACES=65, PETRI_TRANSITIONS=60}
[2024-06-03 22:27:57,556 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 23 predicate places.
[2024-06-03 22:27:57,556 INFO  L495      AbstractCegarLoop]: Abstraction has has 65 places, 60 transitions, 358 flow
[2024-06-03 22:27:57,557 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:27:57,558 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:27:57,558 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:27:57,558 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-06-03 22:27:57,558 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:27:57,558 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:27:57,558 INFO  L85        PathProgramCache]: Analyzing trace with hash -1076944120, now seen corresponding path program 1 times
[2024-06-03 22:27:57,559 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:27:57,559 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444008854]
[2024-06-03 22:27:57,559 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:27:57,559 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:27:57,586 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:28:06,380 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:28:06,381 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:28:06,381 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444008854]
[2024-06-03 22:28:06,381 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444008854] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:28:06,381 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:28:06,381 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-03 22:28:06,381 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428281669]
[2024-06-03 22:28:06,381 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:28:06,381 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-03 22:28:06,382 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:28:06,382 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-03 22:28:06,382 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-06-03 22:28:06,483 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-03 22:28:06,483 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 60 transitions, 358 flow. Second operand  has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:28:06,483 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:28:06,484 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-03 22:28:06,484 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:28:07,425 INFO  L124   PetriNetUnfolderBase]: 1669/2490 cut-off events.
[2024-06-03 22:28:07,425 INFO  L125   PetriNetUnfolderBase]: For 4783/4786 co-relation queries the response was YES.
[2024-06-03 22:28:07,432 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 8272 conditions, 2490 events. 1669/2490 cut-off events. For 4783/4786 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 11217 event pairs, 639 based on Foata normal form. 12/2500 useless extension candidates. Maximal degree in co-relation 8243. Up to 2403 conditions per place. 
[2024-06-03 22:28:07,444 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 65 selfloop transitions, 13 changer transitions 0/81 dead transitions.
[2024-06-03 22:28:07,444 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 81 transitions, 582 flow
[2024-06-03 22:28:07,444 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-03 22:28:07,445 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-03 22:28:07,445 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 90 transitions.
[2024-06-03 22:28:07,445 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43902439024390244
[2024-06-03 22:28:07,445 INFO  L175             Difference]: Start difference. First operand has 65 places, 60 transitions, 358 flow. Second operand 5 states and 90 transitions.
[2024-06-03 22:28:07,445 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 81 transitions, 582 flow
[2024-06-03 22:28:07,454 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 81 transitions, 547 flow, removed 4 selfloop flow, removed 5 redundant places.
[2024-06-03 22:28:07,456 INFO  L231             Difference]: Finished difference. Result has 65 places, 65 transitions, 394 flow
[2024-06-03 22:28:07,456 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=323, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=394, PETRI_PLACES=65, PETRI_TRANSITIONS=65}
[2024-06-03 22:28:07,459 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 23 predicate places.
[2024-06-03 22:28:07,459 INFO  L495      AbstractCegarLoop]: Abstraction has has 65 places, 65 transitions, 394 flow
[2024-06-03 22:28:07,459 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:28:07,460 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:28:07,460 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:28:07,460 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-06-03 22:28:07,460 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:28:07,460 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:28:07,461 INFO  L85        PathProgramCache]: Analyzing trace with hash -33630803, now seen corresponding path program 1 times
[2024-06-03 22:28:07,461 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:28:07,465 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014319208]
[2024-06-03 22:28:07,465 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:28:07,465 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:28:07,503 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:28:14,536 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:28:14,536 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:28:14,536 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014319208]
[2024-06-03 22:28:14,537 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014319208] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:28:14,537 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:28:14,537 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-03 22:28:14,537 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271209833]
[2024-06-03 22:28:14,537 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:28:14,538 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-03 22:28:14,538 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:28:14,538 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-03 22:28:14,538 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-03 22:28:14,720 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-03 22:28:14,720 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 65 transitions, 394 flow. Second operand  has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:28:14,720 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:28:14,720 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-03 22:28:14,720 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:28:15,792 INFO  L124   PetriNetUnfolderBase]: 1719/2559 cut-off events.
[2024-06-03 22:28:15,793 INFO  L125   PetriNetUnfolderBase]: For 6197/6197 co-relation queries the response was YES.
[2024-06-03 22:28:15,797 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 9293 conditions, 2559 events. 1719/2559 cut-off events. For 6197/6197 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 11617 event pairs, 628 based on Foata normal form. 5/2563 useless extension candidates. Maximal degree in co-relation 9262. Up to 2398 conditions per place. 
[2024-06-03 22:28:15,806 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 83 selfloop transitions, 25 changer transitions 0/111 dead transitions.
[2024-06-03 22:28:15,806 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 111 transitions, 800 flow
[2024-06-03 22:28:15,807 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 22:28:15,807 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 22:28:15,807 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 143 transitions.
[2024-06-03 22:28:15,808 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43597560975609756
[2024-06-03 22:28:15,808 INFO  L175             Difference]: Start difference. First operand has 65 places, 65 transitions, 394 flow. Second operand 8 states and 143 transitions.
[2024-06-03 22:28:15,808 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 111 transitions, 800 flow
[2024-06-03 22:28:15,811 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 111 transitions, 767 flow, removed 7 selfloop flow, removed 3 redundant places.
[2024-06-03 22:28:15,813 INFO  L231             Difference]: Finished difference. Result has 70 places, 71 transitions, 466 flow
[2024-06-03 22:28:15,813 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=361, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=466, PETRI_PLACES=70, PETRI_TRANSITIONS=71}
[2024-06-03 22:28:15,814 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 28 predicate places.
[2024-06-03 22:28:15,815 INFO  L495      AbstractCegarLoop]: Abstraction has has 70 places, 71 transitions, 466 flow
[2024-06-03 22:28:15,815 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:28:15,815 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:28:15,815 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:28:15,816 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-06-03 22:28:15,816 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:28:15,816 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:28:15,816 INFO  L85        PathProgramCache]: Analyzing trace with hash -33510647, now seen corresponding path program 1 times
[2024-06-03 22:28:15,816 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:28:15,816 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813972491]
[2024-06-03 22:28:15,816 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:28:15,817 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:28:15,853 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:28:22,513 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:28:22,514 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:28:22,514 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813972491]
[2024-06-03 22:28:22,514 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813972491] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:28:22,514 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:28:22,514 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-03 22:28:22,514 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033856174]
[2024-06-03 22:28:22,514 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:28:22,514 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-03 22:28:22,514 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:28:22,515 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-03 22:28:22,515 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-03 22:28:22,659 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-03 22:28:22,660 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 71 transitions, 466 flow. Second operand  has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:28:22,660 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:28:22,660 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-03 22:28:22,660 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:28:23,599 INFO  L124   PetriNetUnfolderBase]: 1741/2592 cut-off events.
[2024-06-03 22:28:23,599 INFO  L125   PetriNetUnfolderBase]: For 8304/8310 co-relation queries the response was YES.
[2024-06-03 22:28:23,604 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 10002 conditions, 2592 events. 1741/2592 cut-off events. For 8304/8310 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 11762 event pairs, 610 based on Foata normal form. 8/2598 useless extension candidates. Maximal degree in co-relation 9970. Up to 2475 conditions per place. 
[2024-06-03 22:28:23,611 INFO  L140   encePairwiseOnDemand]: 32/41 looper letters, 89 selfloop transitions, 21 changer transitions 0/113 dead transitions.
[2024-06-03 22:28:23,611 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 113 transitions, 858 flow
[2024-06-03 22:28:23,613 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 22:28:23,613 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 22:28:23,613 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 134 transitions.
[2024-06-03 22:28:23,614 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.40853658536585363
[2024-06-03 22:28:23,614 INFO  L175             Difference]: Start difference. First operand has 70 places, 71 transitions, 466 flow. Second operand 8 states and 134 transitions.
[2024-06-03 22:28:23,614 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 113 transitions, 858 flow
[2024-06-03 22:28:23,621 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 113 transitions, 816 flow, removed 8 selfloop flow, removed 5 redundant places.
[2024-06-03 22:28:23,622 INFO  L231             Difference]: Finished difference. Result has 75 places, 82 transitions, 567 flow
[2024-06-03 22:28:23,622 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=426, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=567, PETRI_PLACES=75, PETRI_TRANSITIONS=82}
[2024-06-03 22:28:23,624 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 33 predicate places.
[2024-06-03 22:28:23,624 INFO  L495      AbstractCegarLoop]: Abstraction has has 75 places, 82 transitions, 567 flow
[2024-06-03 22:28:23,624 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:28:23,624 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:28:23,624 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:28:23,625 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-06-03 22:28:23,625 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:28:23,625 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:28:23,625 INFO  L85        PathProgramCache]: Analyzing trace with hash 294640413, now seen corresponding path program 2 times
[2024-06-03 22:28:23,625 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:28:23,625 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675809908]
[2024-06-03 22:28:23,625 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:28:23,626 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:28:23,664 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:28:31,061 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:28:31,061 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:28:31,061 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675809908]
[2024-06-03 22:28:31,062 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675809908] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:28:31,062 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:28:31,062 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-03 22:28:31,062 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867743972]
[2024-06-03 22:28:31,062 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:28:31,062 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-03 22:28:31,062 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:28:31,062 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-03 22:28:31,062 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2024-06-03 22:28:31,124 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-03 22:28:31,124 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 82 transitions, 567 flow. Second operand  has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:28:31,124 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:28:31,124 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-03 22:28:31,124 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:28:32,186 INFO  L124   PetriNetUnfolderBase]: 1727/2573 cut-off events.
[2024-06-03 22:28:32,186 INFO  L125   PetriNetUnfolderBase]: For 10337/10340 co-relation queries the response was YES.
[2024-06-03 22:28:32,191 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 10540 conditions, 2573 events. 1727/2573 cut-off events. For 10337/10340 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 11661 event pairs, 644 based on Foata normal form. 7/2578 useless extension candidates. Maximal degree in co-relation 10506. Up to 2443 conditions per place. 
[2024-06-03 22:28:32,199 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 82 selfloop transitions, 23 changer transitions 0/108 dead transitions.
[2024-06-03 22:28:32,199 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 108 transitions, 855 flow
[2024-06-03 22:28:32,199 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-03 22:28:32,199 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-03 22:28:32,200 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 111 transitions.
[2024-06-03 22:28:32,200 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45121951219512196
[2024-06-03 22:28:32,200 INFO  L175             Difference]: Start difference. First operand has 75 places, 82 transitions, 567 flow. Second operand 6 states and 111 transitions.
[2024-06-03 22:28:32,200 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 108 transitions, 855 flow
[2024-06-03 22:28:32,209 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 108 transitions, 817 flow, removed 15 selfloop flow, removed 2 redundant places.
[2024-06-03 22:28:32,210 INFO  L231             Difference]: Finished difference. Result has 79 places, 82 transitions, 591 flow
[2024-06-03 22:28:32,211 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=529, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=591, PETRI_PLACES=79, PETRI_TRANSITIONS=82}
[2024-06-03 22:28:32,211 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 37 predicate places.
[2024-06-03 22:28:32,211 INFO  L495      AbstractCegarLoop]: Abstraction has has 79 places, 82 transitions, 591 flow
[2024-06-03 22:28:32,211 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:28:32,211 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:28:32,212 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:28:32,212 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-06-03 22:28:32,212 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:28:32,212 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:28:32,212 INFO  L85        PathProgramCache]: Analyzing trace with hash -636062139, now seen corresponding path program 2 times
[2024-06-03 22:28:32,212 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:28:32,213 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545645262]
[2024-06-03 22:28:32,213 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:28:32,213 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:28:32,242 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:28:38,548 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:28:38,548 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:28:38,548 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545645262]
[2024-06-03 22:28:38,548 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545645262] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:28:38,548 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:28:38,549 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-03 22:28:38,549 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916179329]
[2024-06-03 22:28:38,549 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:28:38,549 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-03 22:28:38,549 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:28:38,550 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-03 22:28:38,550 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-03 22:28:38,661 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-03 22:28:38,661 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 82 transitions, 591 flow. Second operand  has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:28:38,662 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:28:38,662 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-03 22:28:38,662 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:28:39,562 INFO  L124   PetriNetUnfolderBase]: 1733/2582 cut-off events.
[2024-06-03 22:28:39,562 INFO  L125   PetriNetUnfolderBase]: For 12195/12198 co-relation queries the response was YES.
[2024-06-03 22:28:39,567 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 10876 conditions, 2582 events. 1733/2582 cut-off events. For 12195/12198 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 11676 event pairs, 622 based on Foata normal form. 6/2586 useless extension candidates. Maximal degree in co-relation 10840. Up to 2523 conditions per place. 
[2024-06-03 22:28:39,574 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 89 selfloop transitions, 16 changer transitions 0/108 dead transitions.
[2024-06-03 22:28:39,574 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 108 transitions, 887 flow
[2024-06-03 22:28:39,578 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-03 22:28:39,578 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-03 22:28:39,578 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 112 transitions.
[2024-06-03 22:28:39,579 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3902439024390244
[2024-06-03 22:28:39,579 INFO  L175             Difference]: Start difference. First operand has 79 places, 82 transitions, 591 flow. Second operand 7 states and 112 transitions.
[2024-06-03 22:28:39,579 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 108 transitions, 887 flow
[2024-06-03 22:28:39,586 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 108 transitions, 841 flow, removed 0 selfloop flow, removed 5 redundant places.
[2024-06-03 22:28:39,588 INFO  L231             Difference]: Finished difference. Result has 82 places, 88 transitions, 633 flow
[2024-06-03 22:28:39,588 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=545, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=633, PETRI_PLACES=82, PETRI_TRANSITIONS=88}
[2024-06-03 22:28:39,588 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 40 predicate places.
[2024-06-03 22:28:39,589 INFO  L495      AbstractCegarLoop]: Abstraction has has 82 places, 88 transitions, 633 flow
[2024-06-03 22:28:39,589 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:28:39,589 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:28:39,589 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:28:39,589 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-06-03 22:28:39,589 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:28:39,589 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:28:39,590 INFO  L85        PathProgramCache]: Analyzing trace with hash -636053211, now seen corresponding path program 1 times
[2024-06-03 22:28:39,590 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:28:39,590 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253395512]
[2024-06-03 22:28:39,590 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:28:39,590 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:28:39,623 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:28:47,738 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:28:47,739 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:28:47,739 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253395512]
[2024-06-03 22:28:47,739 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253395512] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:28:47,739 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:28:47,739 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 22:28:47,739 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954376775]
[2024-06-03 22:28:47,740 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:28:47,740 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 22:28:47,740 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:28:47,740 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 22:28:47,740 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-03 22:28:47,854 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-03 22:28:47,854 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 88 transitions, 633 flow. Second operand  has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:28:47,854 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:28:47,854 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-03 22:28:47,855 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:28:48,947 INFO  L124   PetriNetUnfolderBase]: 1777/2650 cut-off events.
[2024-06-03 22:28:48,947 INFO  L125   PetriNetUnfolderBase]: For 14688/14691 co-relation queries the response was YES.
[2024-06-03 22:28:48,952 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 11404 conditions, 2650 events. 1777/2650 cut-off events. For 14688/14691 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 12000 event pairs, 585 based on Foata normal form. 20/2668 useless extension candidates. Maximal degree in co-relation 11366. Up to 2487 conditions per place. 
[2024-06-03 22:28:48,958 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 94 selfloop transitions, 20 changer transitions 0/117 dead transitions.
[2024-06-03 22:28:48,958 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 117 transitions, 969 flow
[2024-06-03 22:28:48,959 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-03 22:28:48,959 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-03 22:28:48,959 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 110 transitions.
[2024-06-03 22:28:48,960 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44715447154471544
[2024-06-03 22:28:48,960 INFO  L175             Difference]: Start difference. First operand has 82 places, 88 transitions, 633 flow. Second operand 6 states and 110 transitions.
[2024-06-03 22:28:48,960 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 117 transitions, 969 flow
[2024-06-03 22:28:48,970 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 117 transitions, 935 flow, removed 4 selfloop flow, removed 4 redundant places.
[2024-06-03 22:28:48,971 INFO  L231             Difference]: Finished difference. Result has 84 places, 91 transitions, 677 flow
[2024-06-03 22:28:48,971 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=599, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=677, PETRI_PLACES=84, PETRI_TRANSITIONS=91}
[2024-06-03 22:28:48,972 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 42 predicate places.
[2024-06-03 22:28:48,972 INFO  L495      AbstractCegarLoop]: Abstraction has has 84 places, 91 transitions, 677 flow
[2024-06-03 22:28:48,972 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:28:48,972 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:28:48,972 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:28:48,972 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-06-03 22:28:48,972 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:28:48,973 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:28:48,973 INFO  L85        PathProgramCache]: Analyzing trace with hash 540110242, now seen corresponding path program 1 times
[2024-06-03 22:28:48,973 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:28:48,973 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823808931]
[2024-06-03 22:28:48,973 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:28:48,973 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:28:49,022 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:28:55,341 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:28:55,342 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:28:55,342 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823808931]
[2024-06-03 22:28:55,342 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823808931] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:28:55,342 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:28:55,342 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 22:28:55,342 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825015261]
[2024-06-03 22:28:55,343 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:28:55,343 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 22:28:55,343 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:28:55,343 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 22:28:55,344 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-03 22:28:55,510 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-03 22:28:55,510 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 91 transitions, 677 flow. Second operand  has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:28:55,510 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:28:55,510 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-03 22:28:55,510 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:28:56,682 INFO  L124   PetriNetUnfolderBase]: 1889/2805 cut-off events.
[2024-06-03 22:28:56,682 INFO  L125   PetriNetUnfolderBase]: For 17596/17596 co-relation queries the response was YES.
[2024-06-03 22:28:56,689 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 12723 conditions, 2805 events. 1889/2805 cut-off events. For 17596/17596 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 12946 event pairs, 547 based on Foata normal form. 5/2809 useless extension candidates. Maximal degree in co-relation 12684. Up to 2435 conditions per place. 
[2024-06-03 22:28:56,712 INFO  L140   encePairwiseOnDemand]: 27/41 looper letters, 113 selfloop transitions, 49 changer transitions 0/165 dead transitions.
[2024-06-03 22:28:56,713 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 165 transitions, 1437 flow
[2024-06-03 22:28:56,713 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 22:28:56,713 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 22:28:56,714 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 170 transitions.
[2024-06-03 22:28:56,714 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46070460704607047
[2024-06-03 22:28:56,714 INFO  L175             Difference]: Start difference. First operand has 84 places, 91 transitions, 677 flow. Second operand 9 states and 170 transitions.
[2024-06-03 22:28:56,714 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 165 transitions, 1437 flow
[2024-06-03 22:28:56,730 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 165 transitions, 1391 flow, removed 3 selfloop flow, removed 4 redundant places.
[2024-06-03 22:28:56,732 INFO  L231             Difference]: Finished difference. Result has 94 places, 114 transitions, 1015 flow
[2024-06-03 22:28:56,732 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=637, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1015, PETRI_PLACES=94, PETRI_TRANSITIONS=114}
[2024-06-03 22:28:56,732 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 52 predicate places.
[2024-06-03 22:28:56,733 INFO  L495      AbstractCegarLoop]: Abstraction has has 94 places, 114 transitions, 1015 flow
[2024-06-03 22:28:56,733 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:28:56,733 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:28:56,733 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:28:56,733 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-06-03 22:28:56,733 INFO  L420      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:28:56,733 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:28:56,734 INFO  L85        PathProgramCache]: Analyzing trace with hash -167046288, now seen corresponding path program 2 times
[2024-06-03 22:28:56,734 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:28:56,734 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888909558]
[2024-06-03 22:28:56,734 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:28:56,734 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:28:56,770 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:29:04,776 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:29:04,777 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:29:04,777 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888909558]
[2024-06-03 22:29:04,777 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888909558] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:29:04,777 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:29:04,777 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 22:29:04,777 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108517706]
[2024-06-03 22:29:04,777 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:29:04,778 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 22:29:04,785 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:29:04,786 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 22:29:04,786 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-03 22:29:04,886 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-03 22:29:04,887 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 114 transitions, 1015 flow. Second operand  has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:29:04,887 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:29:04,887 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-03 22:29:04,887 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:29:06,047 INFO  L124   PetriNetUnfolderBase]: 1915/2842 cut-off events.
[2024-06-03 22:29:06,048 INFO  L125   PetriNetUnfolderBase]: For 23794/23794 co-relation queries the response was YES.
[2024-06-03 22:29:06,056 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 15000 conditions, 2842 events. 1915/2842 cut-off events. For 23794/23794 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 12967 event pairs, 593 based on Foata normal form. 5/2846 useless extension candidates. Maximal degree in co-relation 14955. Up to 2669 conditions per place. 
[2024-06-03 22:29:06,066 INFO  L140   encePairwiseOnDemand]: 28/41 looper letters, 126 selfloop transitions, 32 changer transitions 0/161 dead transitions.
[2024-06-03 22:29:06,066 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 161 transitions, 1564 flow
[2024-06-03 22:29:06,067 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 22:29:06,067 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 22:29:06,068 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 158 transitions.
[2024-06-03 22:29:06,068 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4281842818428184
[2024-06-03 22:29:06,068 INFO  L175             Difference]: Start difference. First operand has 94 places, 114 transitions, 1015 flow. Second operand 9 states and 158 transitions.
[2024-06-03 22:29:06,068 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 161 transitions, 1564 flow
[2024-06-03 22:29:06,110 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 161 transitions, 1506 flow, removed 28 selfloop flow, removed 1 redundant places.
[2024-06-03 22:29:06,112 INFO  L231             Difference]: Finished difference. Result has 102 places, 119 transitions, 1100 flow
[2024-06-03 22:29:06,112 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=965, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1100, PETRI_PLACES=102, PETRI_TRANSITIONS=119}
[2024-06-03 22:29:06,113 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 60 predicate places.
[2024-06-03 22:29:06,113 INFO  L495      AbstractCegarLoop]: Abstraction has has 102 places, 119 transitions, 1100 flow
[2024-06-03 22:29:06,113 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:29:06,114 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:29:06,114 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:29:06,114 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2024-06-03 22:29:06,114 INFO  L420      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:29:06,114 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:29:06,114 INFO  L85        PathProgramCache]: Analyzing trace with hash -1042553427, now seen corresponding path program 1 times
[2024-06-03 22:29:06,114 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:29:06,115 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948323637]
[2024-06-03 22:29:06,115 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:29:06,115 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:29:06,152 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:29:13,077 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:29:13,077 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:29:13,077 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948323637]
[2024-06-03 22:29:13,078 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948323637] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:29:13,078 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:29:13,078 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 22:29:13,078 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914473124]
[2024-06-03 22:29:13,078 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:29:13,078 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 22:29:13,078 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:29:13,079 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 22:29:13,079 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-06-03 22:29:13,196 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-03 22:29:13,203 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 119 transitions, 1100 flow. Second operand  has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:29:13,204 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:29:13,204 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-03 22:29:13,204 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:29:14,364 INFO  L124   PetriNetUnfolderBase]: 1991/2952 cut-off events.
[2024-06-03 22:29:14,364 INFO  L125   PetriNetUnfolderBase]: For 27338/27338 co-relation queries the response was YES.
[2024-06-03 22:29:14,372 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 15859 conditions, 2952 events. 1991/2952 cut-off events. For 27338/27338 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 13590 event pairs, 535 based on Foata normal form. 8/2959 useless extension candidates. Maximal degree in co-relation 15811. Up to 2598 conditions per place. 
[2024-06-03 22:29:14,381 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 131 selfloop transitions, 49 changer transitions 0/183 dead transitions.
[2024-06-03 22:29:14,381 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 183 transitions, 1931 flow
[2024-06-03 22:29:14,383 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 22:29:14,383 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 22:29:14,383 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 164 transitions.
[2024-06-03 22:29:14,384 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4444444444444444
[2024-06-03 22:29:14,384 INFO  L175             Difference]: Start difference. First operand has 102 places, 119 transitions, 1100 flow. Second operand 9 states and 164 transitions.
[2024-06-03 22:29:14,384 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 183 transitions, 1931 flow
[2024-06-03 22:29:14,405 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 183 transitions, 1832 flow, removed 16 selfloop flow, removed 7 redundant places.
[2024-06-03 22:29:14,407 INFO  L231             Difference]: Finished difference. Result has 106 places, 135 transitions, 1312 flow
[2024-06-03 22:29:14,407 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1016, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1312, PETRI_PLACES=106, PETRI_TRANSITIONS=135}
[2024-06-03 22:29:14,407 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 64 predicate places.
[2024-06-03 22:29:14,408 INFO  L495      AbstractCegarLoop]: Abstraction has has 106 places, 135 transitions, 1312 flow
[2024-06-03 22:29:14,408 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:29:14,408 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:29:14,408 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:29:14,408 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2024-06-03 22:29:14,408 INFO  L420      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:29:14,409 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:29:14,409 INFO  L85        PathProgramCache]: Analyzing trace with hash 543919677, now seen corresponding path program 2 times
[2024-06-03 22:29:14,409 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:29:14,409 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233636589]
[2024-06-03 22:29:14,409 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:29:14,409 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:29:14,438 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:29:21,403 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:29:21,403 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:29:21,404 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233636589]
[2024-06-03 22:29:21,404 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233636589] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:29:21,404 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:29:21,404 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 22:29:21,404 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085034607]
[2024-06-03 22:29:21,404 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:29:21,404 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 22:29:21,405 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:29:21,405 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 22:29:21,405 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-03 22:29:21,538 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-03 22:29:21,539 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 135 transitions, 1312 flow. Second operand  has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:29:21,539 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:29:21,539 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-03 22:29:21,539 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:29:22,875 INFO  L124   PetriNetUnfolderBase]: 2105/3119 cut-off events.
[2024-06-03 22:29:22,875 INFO  L125   PetriNetUnfolderBase]: For 33191/33194 co-relation queries the response was YES.
[2024-06-03 22:29:22,885 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 17774 conditions, 3119 events. 2105/3119 cut-off events. For 33191/33194 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 14444 event pairs, 570 based on Foata normal form. 10/3127 useless extension candidates. Maximal degree in co-relation 17723. Up to 2840 conditions per place. 
[2024-06-03 22:29:22,896 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 143 selfloop transitions, 41 changer transitions 0/187 dead transitions.
[2024-06-03 22:29:22,896 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 187 transitions, 2028 flow
[2024-06-03 22:29:22,898 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 22:29:22,898 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 22:29:22,899 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 160 transitions.
[2024-06-03 22:29:22,900 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43360433604336046
[2024-06-03 22:29:22,900 INFO  L175             Difference]: Start difference. First operand has 106 places, 135 transitions, 1312 flow. Second operand 9 states and 160 transitions.
[2024-06-03 22:29:22,900 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 187 transitions, 2028 flow
[2024-06-03 22:29:22,933 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 187 transitions, 1939 flow, removed 29 selfloop flow, removed 4 redundant places.
[2024-06-03 22:29:22,935 INFO  L231             Difference]: Finished difference. Result has 112 places, 144 transitions, 1450 flow
[2024-06-03 22:29:22,936 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1235, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1450, PETRI_PLACES=112, PETRI_TRANSITIONS=144}
[2024-06-03 22:29:22,937 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 70 predicate places.
[2024-06-03 22:29:22,937 INFO  L495      AbstractCegarLoop]: Abstraction has has 112 places, 144 transitions, 1450 flow
[2024-06-03 22:29:22,937 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:29:22,938 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:29:22,938 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:29:22,938 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2024-06-03 22:29:22,938 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-03 22:29:22,938 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:29:22,938 INFO  L85        PathProgramCache]: Analyzing trace with hash 543925257, now seen corresponding path program 3 times
[2024-06-03 22:29:22,938 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:29:22,939 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899205519]
[2024-06-03 22:29:22,939 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:29:22,939 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:29:23,011 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:29:30,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-03 22:29:30,067 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:29:30,068 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899205519]
[2024-06-03 22:29:30,068 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899205519] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:29:30,068 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:29:30,068 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 22:29:30,068 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398364574]
[2024-06-03 22:29:30,068 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:29:30,069 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 22:29:30,069 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:29:30,069 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 22:29:30,069 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-03 22:29:30,227 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-03 22:29:30,227 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 144 transitions, 1450 flow. Second operand  has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:29:30,227 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:29:30,227 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-03 22:29:30,228 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:29:31,499 INFO  L124   PetriNetUnfolderBase]: 2095/3105 cut-off events.
[2024-06-03 22:29:31,500 INFO  L125   PetriNetUnfolderBase]: For 35516/35519 co-relation queries the response was YES.
[2024-06-03 22:29:31,509 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 18076 conditions, 3105 events. 2095/3105 cut-off events. For 35516/35519 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 14408 event pairs, 566 based on Foata normal form. 6/3109 useless extension candidates. Maximal degree in co-relation 18022. Up to 2836 conditions per place. 
[2024-06-03 22:29:31,519 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 150 selfloop transitions, 45 changer transitions 0/198 dead transitions.
[2024-06-03 22:29:31,519 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 198 transitions, 2145 flow
[2024-06-03 22:29:31,521 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-03 22:29:31,521 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-03 22:29:31,533 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 188 transitions.
[2024-06-03 22:29:31,534 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41685144124168516
[2024-06-03 22:29:31,534 INFO  L175             Difference]: Start difference. First operand has 112 places, 144 transitions, 1450 flow. Second operand 11 states and 188 transitions.
[2024-06-03 22:29:31,534 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 198 transitions, 2145 flow
[2024-06-03 22:29:31,571 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 198 transitions, 2086 flow, removed 14 selfloop flow, removed 5 redundant places.
[2024-06-03 22:29:31,574 INFO  L231             Difference]: Finished difference. Result has 118 places, 147 transitions, 1533 flow
[2024-06-03 22:29:31,574 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1391, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1533, PETRI_PLACES=118, PETRI_TRANSITIONS=147}
[2024-06-03 22:29:31,574 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 76 predicate places.
[2024-06-03 22:29:31,574 INFO  L495      AbstractCegarLoop]: Abstraction has has 118 places, 147 transitions, 1533 flow
[2024-06-03 22:29:31,575 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:29:31,575 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:29:31,575 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:29:31,575 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2024-06-03 22:29:31,575 INFO  L420      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:29:31,575 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:29:31,576 INFO  L85        PathProgramCache]: Analyzing trace with hash -1038834512, now seen corresponding path program 3 times
[2024-06-03 22:29:31,576 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:29:31,576 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604075957]
[2024-06-03 22:29:31,576 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:29:31,576 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:29:31,613 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:29:39,383 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:29:39,383 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:29:39,384 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604075957]
[2024-06-03 22:29:39,384 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604075957] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:29:39,384 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:29:39,384 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 22:29:39,384 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014336569]
[2024-06-03 22:29:39,384 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:29:39,385 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 22:29:39,385 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:29:39,385 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 22:29:39,385 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72
[2024-06-03 22:29:39,561 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-03 22:29:39,561 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 147 transitions, 1533 flow. Second operand  has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:29:39,561 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:29:39,561 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-03 22:29:39,561 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:29:40,890 INFO  L124   PetriNetUnfolderBase]: 2114/3130 cut-off events.
[2024-06-03 22:29:40,890 INFO  L125   PetriNetUnfolderBase]: For 40118/40121 co-relation queries the response was YES.
[2024-06-03 22:29:40,899 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 18621 conditions, 3130 events. 2114/3130 cut-off events. For 40118/40121 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 14437 event pairs, 600 based on Foata normal form. 10/3138 useless extension candidates. Maximal degree in co-relation 18565. Up to 2954 conditions per place. 
[2024-06-03 22:29:40,910 INFO  L140   encePairwiseOnDemand]: 28/41 looper letters, 148 selfloop transitions, 35 changer transitions 0/186 dead transitions.
[2024-06-03 22:29:40,910 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 186 transitions, 2091 flow
[2024-06-03 22:29:40,910 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-03 22:29:40,911 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-03 22:29:40,911 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 132 transitions.
[2024-06-03 22:29:40,911 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45993031358885017
[2024-06-03 22:29:40,911 INFO  L175             Difference]: Start difference. First operand has 118 places, 147 transitions, 1533 flow. Second operand 7 states and 132 transitions.
[2024-06-03 22:29:40,911 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 186 transitions, 2091 flow
[2024-06-03 22:29:40,956 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 186 transitions, 1977 flow, removed 12 selfloop flow, removed 9 redundant places.
[2024-06-03 22:29:40,959 INFO  L231             Difference]: Finished difference. Result has 116 places, 152 transitions, 1579 flow
[2024-06-03 22:29:40,959 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1421, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1579, PETRI_PLACES=116, PETRI_TRANSITIONS=152}
[2024-06-03 22:29:40,965 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 74 predicate places.
[2024-06-03 22:29:40,965 INFO  L495      AbstractCegarLoop]: Abstraction has has 116 places, 152 transitions, 1579 flow
[2024-06-03 22:29:40,965 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:29:40,965 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:29:40,965 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:29:40,966 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2024-06-03 22:29:40,966 INFO  L420      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:29:40,966 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:29:40,966 INFO  L85        PathProgramCache]: Analyzing trace with hash 1756919108, now seen corresponding path program 1 times
[2024-06-03 22:29:40,966 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:29:40,966 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801910059]
[2024-06-03 22:29:40,966 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:29:40,966 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:29:41,011 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:29:48,248 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:29:48,248 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:29:48,249 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801910059]
[2024-06-03 22:29:48,249 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801910059] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:29:48,249 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:29:48,249 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 22:29:48,249 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467410759]
[2024-06-03 22:29:48,249 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:29:48,249 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 22:29:48,250 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:29:48,251 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 22:29:48,251 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-03 22:29:48,391 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-03 22:29:48,392 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 152 transitions, 1579 flow. Second operand  has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:29:48,392 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:29:48,392 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-03 22:29:48,392 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:29:49,539 INFO  L124   PetriNetUnfolderBase]: 2109/3123 cut-off events.
[2024-06-03 22:29:49,539 INFO  L125   PetriNetUnfolderBase]: For 42500/42503 co-relation queries the response was YES.
[2024-06-03 22:29:49,549 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 18749 conditions, 3123 events. 2109/3123 cut-off events. For 42500/42503 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 14397 event pairs, 604 based on Foata normal form. 4/3125 useless extension candidates. Maximal degree in co-relation 18692. Up to 3055 conditions per place. 
[2024-06-03 22:29:49,561 INFO  L140   encePairwiseOnDemand]: 32/41 looper letters, 147 selfloop transitions, 18 changer transitions 0/168 dead transitions.
[2024-06-03 22:29:49,561 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 168 transitions, 1951 flow
[2024-06-03 22:29:49,563 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-03 22:29:49,563 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-03 22:29:49,563 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 99 transitions.
[2024-06-03 22:29:49,564 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4024390243902439
[2024-06-03 22:29:49,565 INFO  L175             Difference]: Start difference. First operand has 116 places, 152 transitions, 1579 flow. Second operand 6 states and 99 transitions.
[2024-06-03 22:29:49,565 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 168 transitions, 1951 flow
[2024-06-03 22:29:49,607 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 168 transitions, 1845 flow, removed 25 selfloop flow, removed 5 redundant places.
[2024-06-03 22:29:49,610 INFO  L231             Difference]: Finished difference. Result has 117 places, 152 transitions, 1521 flow
[2024-06-03 22:29:49,610 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1473, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1521, PETRI_PLACES=117, PETRI_TRANSITIONS=152}
[2024-06-03 22:29:49,611 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 75 predicate places.
[2024-06-03 22:29:49,611 INFO  L495      AbstractCegarLoop]: Abstraction has has 117 places, 152 transitions, 1521 flow
[2024-06-03 22:29:49,611 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:29:49,611 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:29:49,612 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:29:49,612 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2024-06-03 22:29:49,612 INFO  L420      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:29:49,612 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:29:49,612 INFO  L85        PathProgramCache]: Analyzing trace with hash 1756911451, now seen corresponding path program 4 times
[2024-06-03 22:29:49,612 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:29:49,612 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216545897]
[2024-06-03 22:29:49,613 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:29:49,613 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:29:49,672 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:29:56,341 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:29:56,341 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:29:56,341 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216545897]
[2024-06-03 22:29:56,342 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216545897] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:29:56,342 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:29:56,342 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 22:29:56,342 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627304566]
[2024-06-03 22:29:56,342 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:29:56,342 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 22:29:56,342 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:29:56,342 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 22:29:56,342 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-03 22:29:56,461 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-03 22:29:56,462 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 152 transitions, 1521 flow. Second operand  has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:29:56,462 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:29:56,462 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-03 22:29:56,462 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:29:57,698 INFO  L124   PetriNetUnfolderBase]: 2115/3132 cut-off events.
[2024-06-03 22:29:57,698 INFO  L125   PetriNetUnfolderBase]: For 45917/45920 co-relation queries the response was YES.
[2024-06-03 22:29:57,709 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 18856 conditions, 3132 events. 2115/3132 cut-off events. For 45917/45920 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 14492 event pairs, 602 based on Foata normal form. 6/3136 useless extension candidates. Maximal degree in co-relation 18798. Up to 3050 conditions per place. 
[2024-06-03 22:29:57,720 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 158 selfloop transitions, 19 changer transitions 0/180 dead transitions.
[2024-06-03 22:29:57,721 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 180 transitions, 1981 flow
[2024-06-03 22:29:57,722 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 22:29:57,731 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 22:29:57,731 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 127 transitions.
[2024-06-03 22:29:57,732 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3871951219512195
[2024-06-03 22:29:57,732 INFO  L175             Difference]: Start difference. First operand has 117 places, 152 transitions, 1521 flow. Second operand 8 states and 127 transitions.
[2024-06-03 22:29:57,732 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 180 transitions, 1981 flow
[2024-06-03 22:29:57,773 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 180 transitions, 1941 flow, removed 2 selfloop flow, removed 5 redundant places.
[2024-06-03 22:29:57,776 INFO  L231             Difference]: Finished difference. Result has 120 places, 155 transitions, 1573 flow
[2024-06-03 22:29:57,776 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1481, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1573, PETRI_PLACES=120, PETRI_TRANSITIONS=155}
[2024-06-03 22:29:57,776 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 78 predicate places.
[2024-06-03 22:29:57,776 INFO  L495      AbstractCegarLoop]: Abstraction has has 120 places, 155 transitions, 1573 flow
[2024-06-03 22:29:57,777 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:29:57,777 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:29:57,777 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:29:57,777 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2024-06-03 22:29:57,777 INFO  L420      AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:29:57,777 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:29:57,777 INFO  L85        PathProgramCache]: Analyzing trace with hash -436510790, now seen corresponding path program 1 times
[2024-06-03 22:29:57,778 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:29:57,778 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708080073]
[2024-06-03 22:29:57,778 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:29:57,778 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:29:57,827 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:30:04,355 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:30:04,355 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:30:04,355 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708080073]
[2024-06-03 22:30:04,355 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708080073] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:30:04,355 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:30:04,355 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 22:30:04,355 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481339603]
[2024-06-03 22:30:04,355 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:30:04,356 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 22:30:04,356 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:30:04,356 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 22:30:04,356 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2024-06-03 22:30:04,525 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-03 22:30:04,526 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 155 transitions, 1573 flow. Second operand  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:30:04,526 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:30:04,526 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-03 22:30:04,526 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:30:05,981 INFO  L124   PetriNetUnfolderBase]: 2616/3891 cut-off events.
[2024-06-03 22:30:05,981 INFO  L125   PetriNetUnfolderBase]: For 56640/56640 co-relation queries the response was YES.
[2024-06-03 22:30:05,993 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 23452 conditions, 3891 events. 2616/3891 cut-off events. For 56640/56640 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 18884 event pairs, 979 based on Foata normal form. 16/3906 useless extension candidates. Maximal degree in co-relation 23393. Up to 3318 conditions per place. 
[2024-06-03 22:30:06,007 INFO  L140   encePairwiseOnDemand]: 27/41 looper letters, 206 selfloop transitions, 61 changer transitions 0/270 dead transitions.
[2024-06-03 22:30:06,007 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 270 transitions, 3106 flow
[2024-06-03 22:30:06,008 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-03 22:30:06,008 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-03 22:30:06,008 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 189 transitions.
[2024-06-03 22:30:06,008 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4190687361419069
[2024-06-03 22:30:06,009 INFO  L175             Difference]: Start difference. First operand has 120 places, 155 transitions, 1573 flow. Second operand 11 states and 189 transitions.
[2024-06-03 22:30:06,009 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 270 transitions, 3106 flow
[2024-06-03 22:30:06,062 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 270 transitions, 3042 flow, removed 14 selfloop flow, removed 6 redundant places.
[2024-06-03 22:30:06,065 INFO  L231             Difference]: Finished difference. Result has 130 places, 208 transitions, 2402 flow
[2024-06-03 22:30:06,065 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1511, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2402, PETRI_PLACES=130, PETRI_TRANSITIONS=208}
[2024-06-03 22:30:06,066 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 88 predicate places.
[2024-06-03 22:30:06,066 INFO  L495      AbstractCegarLoop]: Abstraction has has 130 places, 208 transitions, 2402 flow
[2024-06-03 22:30:06,066 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:30:06,066 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:30:06,066 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:30:06,066 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2024-06-03 22:30:06,067 INFO  L420      AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:30:06,068 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:30:06,068 INFO  L85        PathProgramCache]: Analyzing trace with hash -734297062, now seen corresponding path program 2 times
[2024-06-03 22:30:06,068 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:30:06,068 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102790293]
[2024-06-03 22:30:06,068 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:30:06,068 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:30:06,097 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:30:16,148 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:30:16,148 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:30:16,149 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102790293]
[2024-06-03 22:30:16,149 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102790293] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:30:16,149 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:30:16,149 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 22:30:16,151 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125568805]
[2024-06-03 22:30:16,151 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:30:16,151 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 22:30:16,152 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:30:16,154 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 22:30:16,154 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2024-06-03 22:30:16,387 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-03 22:30:16,387 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 208 transitions, 2402 flow. Second operand  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:30:16,387 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:30:16,387 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-03 22:30:16,388 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:30:18,337 INFO  L124   PetriNetUnfolderBase]: 3364/5005 cut-off events.
[2024-06-03 22:30:18,337 INFO  L125   PetriNetUnfolderBase]: For 80226/80236 co-relation queries the response was YES.
[2024-06-03 22:30:18,352 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 32403 conditions, 5005 events. 3364/5005 cut-off events. For 80226/80236 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 25650 event pairs, 764 based on Foata normal form. 26/5030 useless extension candidates. Maximal degree in co-relation 32338. Up to 4157 conditions per place. 
[2024-06-03 22:30:18,370 INFO  L140   encePairwiseOnDemand]: 26/41 looper letters, 253 selfloop transitions, 88 changer transitions 0/344 dead transitions.
[2024-06-03 22:30:18,370 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 344 transitions, 4379 flow
[2024-06-03 22:30:18,371 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-03 22:30:18,371 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-03 22:30:18,371 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 198 transitions.
[2024-06-03 22:30:18,372 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43902439024390244
[2024-06-03 22:30:18,372 INFO  L175             Difference]: Start difference. First operand has 130 places, 208 transitions, 2402 flow. Second operand 11 states and 198 transitions.
[2024-06-03 22:30:18,372 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 344 transitions, 4379 flow
[2024-06-03 22:30:18,466 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 344 transitions, 4308 flow, removed 30 selfloop flow, removed 3 redundant places.
[2024-06-03 22:30:18,470 INFO  L231             Difference]: Finished difference. Result has 143 places, 283 transitions, 3713 flow
[2024-06-03 22:30:18,470 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2361, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3713, PETRI_PLACES=143, PETRI_TRANSITIONS=283}
[2024-06-03 22:30:18,471 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 101 predicate places.
[2024-06-03 22:30:18,471 INFO  L495      AbstractCegarLoop]: Abstraction has has 143 places, 283 transitions, 3713 flow
[2024-06-03 22:30:18,471 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:30:18,471 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:30:18,471 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:30:18,471 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2024-06-03 22:30:18,471 INFO  L420      AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:30:18,472 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:30:18,472 INFO  L85        PathProgramCache]: Analyzing trace with hash -914504954, now seen corresponding path program 3 times
[2024-06-03 22:30:18,472 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:30:18,472 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112196214]
[2024-06-03 22:30:18,472 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:30:18,472 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:30:18,499 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:30:28,564 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:30:28,564 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:30:28,564 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112196214]
[2024-06-03 22:30:28,568 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112196214] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:30:28,568 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:30:28,568 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 22:30:28,568 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865107685]
[2024-06-03 22:30:28,568 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:30:28,568 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 22:30:28,569 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:30:28,569 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 22:30:28,569 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-03 22:30:28,710 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-03 22:30:28,710 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 283 transitions, 3713 flow. Second operand  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:30:28,710 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:30:28,710 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-03 22:30:28,710 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:30:31,254 INFO  L124   PetriNetUnfolderBase]: 4495/6708 cut-off events.
[2024-06-03 22:30:31,254 INFO  L125   PetriNetUnfolderBase]: For 124747/124755 co-relation queries the response was YES.
[2024-06-03 22:30:31,277 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 46918 conditions, 6708 events. 4495/6708 cut-off events. For 124747/124755 co-relation queries the response was YES. Maximal size of possible extension queue 314. Compared 36715 event pairs, 1099 based on Foata normal form. 26/6733 useless extension candidates. Maximal degree in co-relation 46846. Up to 5179 conditions per place. 
[2024-06-03 22:30:31,302 INFO  L140   encePairwiseOnDemand]: 26/41 looper letters, 294 selfloop transitions, 175 changer transitions 0/472 dead transitions.
[2024-06-03 22:30:31,302 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 472 transitions, 6939 flow
[2024-06-03 22:30:31,303 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2024-06-03 22:30:31,303 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 12 states.
[2024-06-03 22:30:31,303 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 221 transitions.
[2024-06-03 22:30:31,304 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4491869918699187
[2024-06-03 22:30:31,304 INFO  L175             Difference]: Start difference. First operand has 143 places, 283 transitions, 3713 flow. Second operand 12 states and 221 transitions.
[2024-06-03 22:30:31,304 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 472 transitions, 6939 flow
[2024-06-03 22:30:31,467 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 472 transitions, 6856 flow, removed 33 selfloop flow, removed 3 redundant places.
[2024-06-03 22:30:31,473 INFO  L231             Difference]: Finished difference. Result has 159 places, 400 transitions, 6211 flow
[2024-06-03 22:30:31,473 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3666, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=6211, PETRI_PLACES=159, PETRI_TRANSITIONS=400}
[2024-06-03 22:30:31,473 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 117 predicate places.
[2024-06-03 22:30:31,473 INFO  L495      AbstractCegarLoop]: Abstraction has has 159 places, 400 transitions, 6211 flow
[2024-06-03 22:30:31,474 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:30:31,474 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:30:31,474 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:30:31,474 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2024-06-03 22:30:31,474 INFO  L420      AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:30:31,474 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:30:31,474 INFO  L85        PathProgramCache]: Analyzing trace with hash 464083680, now seen corresponding path program 4 times
[2024-06-03 22:30:31,475 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:30:31,475 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584285015]
[2024-06-03 22:30:31,475 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:30:31,475 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:30:31,501 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:30:39,532 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:30:39,533 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:30:39,533 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584285015]
[2024-06-03 22:30:39,533 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584285015] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:30:39,533 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:30:39,533 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 22:30:39,533 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978976464]
[2024-06-03 22:30:39,533 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:30:39,533 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 22:30:39,533 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:30:39,534 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 22:30:39,534 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2024-06-03 22:30:39,710 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-03 22:30:39,710 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 400 transitions, 6211 flow. Second operand  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:30:39,710 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:30:39,710 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-03 22:30:39,710 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:30:42,111 INFO  L124   PetriNetUnfolderBase]: 4596/6885 cut-off events.
[2024-06-03 22:30:42,111 INFO  L125   PetriNetUnfolderBase]: For 145766/145786 co-relation queries the response was YES.
[2024-06-03 22:30:42,138 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 51559 conditions, 6885 events. 4596/6885 cut-off events. For 145766/145786 co-relation queries the response was YES. Maximal size of possible extension queue 315. Compared 38242 event pairs, 1356 based on Foata normal form. 20/6904 useless extension candidates. Maximal degree in co-relation 51478. Up to 6494 conditions per place. 
[2024-06-03 22:30:42,172 INFO  L140   encePairwiseOnDemand]: 28/41 looper letters, 379 selfloop transitions, 75 changer transitions 0/457 dead transitions.
[2024-06-03 22:30:42,172 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 457 transitions, 7490 flow
[2024-06-03 22:30:42,174 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-03 22:30:42,174 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-03 22:30:42,181 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 162 transitions.
[2024-06-03 22:30:42,182 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3951219512195122
[2024-06-03 22:30:42,182 INFO  L175             Difference]: Start difference. First operand has 159 places, 400 transitions, 6211 flow. Second operand 10 states and 162 transitions.
[2024-06-03 22:30:42,182 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 457 transitions, 7490 flow
[2024-06-03 22:30:42,427 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 457 transitions, 7415 flow, removed 34 selfloop flow, removed 2 redundant places.
[2024-06-03 22:30:42,435 INFO  L231             Difference]: Finished difference. Result has 168 places, 418 transitions, 6590 flow
[2024-06-03 22:30:42,436 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6148, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=400, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=333, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6590, PETRI_PLACES=168, PETRI_TRANSITIONS=418}
[2024-06-03 22:30:42,437 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 126 predicate places.
[2024-06-03 22:30:42,437 INFO  L495      AbstractCegarLoop]: Abstraction has has 168 places, 418 transitions, 6590 flow
[2024-06-03 22:30:42,437 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:30:42,437 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:30:42,437 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:30:42,437 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2024-06-03 22:30:42,438 INFO  L420      AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:30:42,438 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:30:42,438 INFO  L85        PathProgramCache]: Analyzing trace with hash 1795737858, now seen corresponding path program 5 times
[2024-06-03 22:30:42,438 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:30:42,438 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840374343]
[2024-06-03 22:30:42,438 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:30:42,439 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:30:42,471 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:30:51,686 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:30:51,686 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:30:51,686 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840374343]
[2024-06-03 22:30:51,686 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840374343] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:30:51,686 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:30:51,686 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 22:30:51,687 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507225900]
[2024-06-03 22:30:51,687 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:30:51,687 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 22:30:51,688 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:30:51,688 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 22:30:51,688 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2024-06-03 22:30:51,841 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-03 22:30:51,841 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 418 transitions, 6590 flow. Second operand  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:30:51,842 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:30:51,842 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-03 22:30:51,842 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:30:54,428 INFO  L124   PetriNetUnfolderBase]: 4791/7187 cut-off events.
[2024-06-03 22:30:54,428 INFO  L125   PetriNetUnfolderBase]: For 159583/159603 co-relation queries the response was YES.
[2024-06-03 22:30:54,458 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 54997 conditions, 7187 events. 4791/7187 cut-off events. For 159583/159603 co-relation queries the response was YES. Maximal size of possible extension queue 315. Compared 40336 event pairs, 1533 based on Foata normal form. 20/7206 useless extension candidates. Maximal degree in co-relation 54913. Up to 6787 conditions per place. 
[2024-06-03 22:30:54,490 INFO  L140   encePairwiseOnDemand]: 28/41 looper letters, 412 selfloop transitions, 93 changer transitions 0/508 dead transitions.
[2024-06-03 22:30:54,490 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 508 transitions, 8671 flow
[2024-06-03 22:30:54,492 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-03 22:30:54,492 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-03 22:30:54,493 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 180 transitions.
[2024-06-03 22:30:54,493 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3991130820399113
[2024-06-03 22:30:54,493 INFO  L175             Difference]: Start difference. First operand has 168 places, 418 transitions, 6590 flow. Second operand 11 states and 180 transitions.
[2024-06-03 22:30:54,493 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 508 transitions, 8671 flow
[2024-06-03 22:30:54,750 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 508 transitions, 8406 flow, removed 49 selfloop flow, removed 7 redundant places.
[2024-06-03 22:30:54,756 INFO  L231             Difference]: Finished difference. Result has 175 places, 462 transitions, 7478 flow
[2024-06-03 22:30:54,757 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6386, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=418, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=335, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=7478, PETRI_PLACES=175, PETRI_TRANSITIONS=462}
[2024-06-03 22:30:54,757 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 133 predicate places.
[2024-06-03 22:30:54,757 INFO  L495      AbstractCegarLoop]: Abstraction has has 175 places, 462 transitions, 7478 flow
[2024-06-03 22:30:54,758 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:30:54,758 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:30:54,758 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:30:54,758 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2024-06-03 22:30:54,758 INFO  L420      AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:30:54,760 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:30:54,760 INFO  L85        PathProgramCache]: Analyzing trace with hash 1796602758, now seen corresponding path program 6 times
[2024-06-03 22:30:54,760 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:30:54,760 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935379928]
[2024-06-03 22:30:54,760 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:30:54,761 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:30:54,790 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:31:04,350 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:31:04,350 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:31:04,350 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935379928]
[2024-06-03 22:31:04,350 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935379928] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:31:04,350 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:31:04,350 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 22:31:04,351 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489161082]
[2024-06-03 22:31:04,351 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:31:04,351 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 22:31:04,351 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:31:04,351 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 22:31:04,351 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-03 22:31:04,477 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41
[2024-06-03 22:31:04,477 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 462 transitions, 7478 flow. Second operand  has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:31:04,477 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:31:04,477 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41
[2024-06-03 22:31:04,478 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:31:06,916 INFO  L124   PetriNetUnfolderBase]: 4630/7099 cut-off events.
[2024-06-03 22:31:06,916 INFO  L125   PetriNetUnfolderBase]: For 179032/179128 co-relation queries the response was YES.
[2024-06-03 22:31:06,953 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 53077 conditions, 7099 events. 4630/7099 cut-off events. For 179032/179128 co-relation queries the response was YES. Maximal size of possible extension queue 319. Compared 41617 event pairs, 1532 based on Foata normal form. 48/7135 useless extension candidates. Maximal degree in co-relation 52989. Up to 5753 conditions per place. 
[2024-06-03 22:31:06,987 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 334 selfloop transitions, 84 changer transitions 0/512 dead transitions.
[2024-06-03 22:31:06,987 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 512 transitions, 8653 flow
[2024-06-03 22:31:06,989 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 22:31:06,989 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 22:31:06,990 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 163 transitions.
[2024-06-03 22:31:06,990 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44173441734417346
[2024-06-03 22:31:06,990 INFO  L175             Difference]: Start difference. First operand has 175 places, 462 transitions, 7478 flow. Second operand 9 states and 163 transitions.
[2024-06-03 22:31:06,990 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 512 transitions, 8653 flow
[2024-06-03 22:31:07,344 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 512 transitions, 8440 flow, removed 77 selfloop flow, removed 5 redundant places.
[2024-06-03 22:31:07,351 INFO  L231             Difference]: Finished difference. Result has 181 places, 471 transitions, 7636 flow
[2024-06-03 22:31:07,352 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7272, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=462, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=379, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=7636, PETRI_PLACES=181, PETRI_TRANSITIONS=471}
[2024-06-03 22:31:07,352 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 139 predicate places.
[2024-06-03 22:31:07,352 INFO  L495      AbstractCegarLoop]: Abstraction has has 181 places, 471 transitions, 7636 flow
[2024-06-03 22:31:07,353 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:31:07,353 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:31:07,353 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:31:07,353 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2024-06-03 22:31:07,353 INFO  L420      AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:31:07,353 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:31:07,353 INFO  L85        PathProgramCache]: Analyzing trace with hash -197173094, now seen corresponding path program 1 times
[2024-06-03 22:31:07,354 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:31:07,354 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914902220]
[2024-06-03 22:31:07,354 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:31:07,354 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:31:07,380 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:31:17,044 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:31:17,045 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:31:17,045 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914902220]
[2024-06-03 22:31:17,045 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914902220] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:31:17,045 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:31:17,045 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 22:31:17,045 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709462724]
[2024-06-03 22:31:17,045 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:31:17,046 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 22:31:17,046 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:31:17,047 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 22:31:17,047 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-03 22:31:17,224 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-03 22:31:17,224 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 471 transitions, 7636 flow. Second operand  has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 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-03 22:31:17,224 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:31:17,224 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-03 22:31:17,224 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:31:19,844 INFO  L124   PetriNetUnfolderBase]: 4966/7460 cut-off events.
[2024-06-03 22:31:19,845 INFO  L125   PetriNetUnfolderBase]: For 192414/192434 co-relation queries the response was YES.
[2024-06-03 22:31:19,878 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 57973 conditions, 7460 events. 4966/7460 cut-off events. For 192414/192434 co-relation queries the response was YES. Maximal size of possible extension queue 322. Compared 42338 event pairs, 1471 based on Foata normal form. 30/7489 useless extension candidates. Maximal degree in co-relation 57882. Up to 6419 conditions per place. 
[2024-06-03 22:31:19,911 INFO  L140   encePairwiseOnDemand]: 28/41 looper letters, 410 selfloop transitions, 121 changer transitions 0/534 dead transitions.
[2024-06-03 22:31:19,911 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 534 transitions, 9132 flow
[2024-06-03 22:31:19,913 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-03 22:31:19,913 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-03 22:31:19,914 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 187 transitions.
[2024-06-03 22:31:19,914 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4146341463414634
[2024-06-03 22:31:19,914 INFO  L175             Difference]: Start difference. First operand has 181 places, 471 transitions, 7636 flow. Second operand 11 states and 187 transitions.
[2024-06-03 22:31:19,914 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 534 transitions, 9132 flow
[2024-06-03 22:31:20,292 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 534 transitions, 8999 flow, removed 31 selfloop flow, removed 4 redundant places.
[2024-06-03 22:31:20,299 INFO  L231             Difference]: Finished difference. Result has 189 places, 475 transitions, 7879 flow
[2024-06-03 22:31:20,299 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7503, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=471, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=117, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=350, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=7879, PETRI_PLACES=189, PETRI_TRANSITIONS=475}
[2024-06-03 22:31:20,300 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 147 predicate places.
[2024-06-03 22:31:20,300 INFO  L495      AbstractCegarLoop]: Abstraction has has 189 places, 475 transitions, 7879 flow
[2024-06-03 22:31:20,300 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 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-03 22:31:20,300 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:31:20,300 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:31:20,300 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2024-06-03 22:31:20,300 INFO  L420      AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:31:20,301 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:31:20,301 INFO  L85        PathProgramCache]: Analyzing trace with hash 568632774, now seen corresponding path program 7 times
[2024-06-03 22:31:20,301 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:31:20,301 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661067863]
[2024-06-03 22:31:20,301 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:31:20,301 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:31:20,327 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:31:30,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-03 22:31:30,608 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:31:30,608 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661067863]
[2024-06-03 22:31:30,608 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661067863] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:31:30,608 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:31:30,608 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 22:31:30,608 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715758484]
[2024-06-03 22:31:30,608 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:31:30,608 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 22:31:30,608 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:31:30,609 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 22:31:30,609 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2024-06-03 22:31:30,737 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-03 22:31:30,737 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 475 transitions, 7879 flow. Second operand  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:31:30,737 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:31:30,737 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-03 22:31:30,737 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:31:33,673 INFO  L124   PetriNetUnfolderBase]: 5137/7735 cut-off events.
[2024-06-03 22:31:33,673 INFO  L125   PetriNetUnfolderBase]: For 213838/213842 co-relation queries the response was YES.
[2024-06-03 22:31:33,705 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 60459 conditions, 7735 events. 5137/7735 cut-off events. For 213838/213842 co-relation queries the response was YES. Maximal size of possible extension queue 337. Compared 44152 event pairs, 1474 based on Foata normal form. 46/7780 useless extension candidates. Maximal degree in co-relation 60366. Up to 6959 conditions per place. 
[2024-06-03 22:31:33,735 INFO  L140   encePairwiseOnDemand]: 26/41 looper letters, 380 selfloop transitions, 168 changer transitions 0/551 dead transitions.
[2024-06-03 22:31:33,736 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 551 transitions, 9647 flow
[2024-06-03 22:31:33,736 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2024-06-03 22:31:33,736 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 12 states.
[2024-06-03 22:31:33,737 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 213 transitions.
[2024-06-03 22:31:33,737 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4329268292682927
[2024-06-03 22:31:33,737 INFO  L175             Difference]: Start difference. First operand has 189 places, 475 transitions, 7879 flow. Second operand 12 states and 213 transitions.
[2024-06-03 22:31:33,737 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 551 transitions, 9647 flow
[2024-06-03 22:31:34,126 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 551 transitions, 9416 flow, removed 29 selfloop flow, removed 7 redundant places.
[2024-06-03 22:31:34,134 INFO  L231             Difference]: Finished difference. Result has 195 places, 488 transitions, 8355 flow
[2024-06-03 22:31:34,134 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7663, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=475, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=155, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=307, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=8355, PETRI_PLACES=195, PETRI_TRANSITIONS=488}
[2024-06-03 22:31:34,135 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 153 predicate places.
[2024-06-03 22:31:34,135 INFO  L495      AbstractCegarLoop]: Abstraction has has 195 places, 488 transitions, 8355 flow
[2024-06-03 22:31:34,135 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:31:34,135 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:31:34,135 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:31:34,135 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26
[2024-06-03 22:31:34,135 INFO  L420      AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:31:34,136 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:31:34,136 INFO  L85        PathProgramCache]: Analyzing trace with hash 571434058, now seen corresponding path program 1 times
[2024-06-03 22:31:34,136 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:31:34,136 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038833626]
[2024-06-03 22:31:34,136 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:31:34,136 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:31:34,163 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:31:42,146 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:31:42,146 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:31:42,146 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038833626]
[2024-06-03 22:31:42,148 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038833626] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:31:42,148 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:31:42,148 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 22:31:42,149 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122217519]
[2024-06-03 22:31:42,149 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:31:42,149 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 22:31:42,150 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:31:42,150 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 22:31:42,150 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-03 22:31:42,265 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-03 22:31:42,265 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 488 transitions, 8355 flow. Second operand  has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:31:42,265 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:31:42,265 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-03 22:31:42,265 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:31:45,314 INFO  L124   PetriNetUnfolderBase]: 5625/8427 cut-off events.
[2024-06-03 22:31:45,315 INFO  L125   PetriNetUnfolderBase]: For 230580/230587 co-relation queries the response was YES.
[2024-06-03 22:31:45,357 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 66359 conditions, 8427 events. 5625/8427 cut-off events. For 230580/230587 co-relation queries the response was YES. Maximal size of possible extension queue 360. Compared 48528 event pairs, 1524 based on Foata normal form. 16/8441 useless extension candidates. Maximal degree in co-relation 66264. Up to 7472 conditions per place. 
[2024-06-03 22:31:45,396 INFO  L140   encePairwiseOnDemand]: 25/41 looper letters, 447 selfloop transitions, 171 changer transitions 0/621 dead transitions.
[2024-06-03 22:31:45,396 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 621 transitions, 11035 flow
[2024-06-03 22:31:45,397 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2024-06-03 22:31:45,397 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 12 states.
[2024-06-03 22:31:45,398 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 221 transitions.
[2024-06-03 22:31:45,398 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4491869918699187
[2024-06-03 22:31:45,398 INFO  L175             Difference]: Start difference. First operand has 195 places, 488 transitions, 8355 flow. Second operand 12 states and 221 transitions.
[2024-06-03 22:31:45,399 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 621 transitions, 11035 flow
[2024-06-03 22:31:45,928 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 621 transitions, 10715 flow, removed 15 selfloop flow, removed 8 redundant places.
[2024-06-03 22:31:45,937 INFO  L231             Difference]: Finished difference. Result has 204 places, 556 transitions, 9503 flow
[2024-06-03 22:31:45,937 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=8035, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=488, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=118, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=346, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=9503, PETRI_PLACES=204, PETRI_TRANSITIONS=556}
[2024-06-03 22:31:45,941 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 162 predicate places.
[2024-06-03 22:31:45,942 INFO  L495      AbstractCegarLoop]: Abstraction has has 204 places, 556 transitions, 9503 flow
[2024-06-03 22:31:45,942 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:31:45,942 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:31:45,942 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:31:45,942 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27
[2024-06-03 22:31:45,942 INFO  L420      AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:31:45,943 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:31:45,943 INFO  L85        PathProgramCache]: Analyzing trace with hash -911705654, now seen corresponding path program 8 times
[2024-06-03 22:31:45,943 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:31:45,943 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861445989]
[2024-06-03 22:31:45,943 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:31:45,943 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:31:45,970 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:31:55,690 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:31:55,690 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:31:55,690 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861445989]
[2024-06-03 22:31:55,691 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861445989] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:31:55,691 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:31:55,691 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 22:31:55,697 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160746595]
[2024-06-03 22:31:55,697 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:31:55,697 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 22:31:55,698 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:31:55,698 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 22:31:55,698 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-03 22:31:55,804 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-03 22:31:55,804 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 556 transitions, 9503 flow. Second operand  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:31:55,804 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:31:55,804 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-03 22:31:55,804 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:31:58,967 INFO  L124   PetriNetUnfolderBase]: 5721/8574 cut-off events.
[2024-06-03 22:31:58,968 INFO  L125   PetriNetUnfolderBase]: For 263267/263271 co-relation queries the response was YES.
[2024-06-03 22:31:59,010 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 70156 conditions, 8574 events. 5721/8574 cut-off events. For 263267/263271 co-relation queries the response was YES. Maximal size of possible extension queue 371. Compared 49401 event pairs, 1604 based on Foata normal form. 48/8621 useless extension candidates. Maximal degree in co-relation 70055. Up to 7944 conditions per place. 
[2024-06-03 22:31:59,049 INFO  L140   encePairwiseOnDemand]: 26/41 looper letters, 510 selfloop transitions, 113 changer transitions 0/626 dead transitions.
[2024-06-03 22:31:59,050 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 626 transitions, 11405 flow
[2024-06-03 22:31:59,050 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2024-06-03 22:31:59,050 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 12 states.
[2024-06-03 22:31:59,051 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 212 transitions.
[2024-06-03 22:31:59,051 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43089430894308944
[2024-06-03 22:31:59,052 INFO  L175             Difference]: Start difference. First operand has 204 places, 556 transitions, 9503 flow. Second operand 12 states and 212 transitions.
[2024-06-03 22:31:59,052 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 626 transitions, 11405 flow
[2024-06-03 22:31:59,628 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 626 transitions, 11240 flow, removed 78 selfloop flow, removed 2 redundant places.
[2024-06-03 22:31:59,648 INFO  L231             Difference]: Finished difference. Result has 214 places, 563 transitions, 9748 flow
[2024-06-03 22:31:59,649 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=9338, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=556, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=106, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=443, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=9748, PETRI_PLACES=214, PETRI_TRANSITIONS=563}
[2024-06-03 22:31:59,650 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 172 predicate places.
[2024-06-03 22:31:59,650 INFO  L495      AbstractCegarLoop]: Abstraction has has 214 places, 563 transitions, 9748 flow
[2024-06-03 22:31:59,650 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:31:59,650 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:31:59,650 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:31:59,650 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28
[2024-06-03 22:31:59,650 INFO  L420      AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:31:59,651 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:31:59,651 INFO  L85        PathProgramCache]: Analyzing trace with hash -1035191128, now seen corresponding path program 9 times
[2024-06-03 22:31:59,651 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:31:59,651 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720261773]
[2024-06-03 22:31:59,651 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:31:59,651 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:31:59,677 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:32:09,697 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:32:09,697 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:32:09,698 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720261773]
[2024-06-03 22:32:09,698 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720261773] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:32:09,698 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:32:09,698 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 22:32:09,698 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539326983]
[2024-06-03 22:32:09,698 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:32:09,698 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 22:32:09,699 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:32:09,699 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 22:32:09,699 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90
[2024-06-03 22:32:09,905 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-03 22:32:09,905 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 563 transitions, 9748 flow. Second operand  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:32:09,905 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:32:09,905 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-03 22:32:09,906 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:32:12,914 INFO  L124   PetriNetUnfolderBase]: 5670/8524 cut-off events.
[2024-06-03 22:32:12,915 INFO  L125   PetriNetUnfolderBase]: For 274492/274497 co-relation queries the response was YES.
[2024-06-03 22:32:12,961 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 68872 conditions, 8524 events. 5670/8524 cut-off events. For 274492/274497 co-relation queries the response was YES. Maximal size of possible extension queue 364. Compared 49697 event pairs, 1720 based on Foata normal form. 84/8606 useless extension candidates. Maximal degree in co-relation 68769. Up to 7721 conditions per place. 
[2024-06-03 22:32:13,001 INFO  L140   encePairwiseOnDemand]: 26/41 looper letters, 496 selfloop transitions, 122 changer transitions 0/621 dead transitions.
[2024-06-03 22:32:13,002 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 621 transitions, 11507 flow
[2024-06-03 22:32:13,002 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 22:32:13,002 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 22:32:13,002 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 165 transitions.
[2024-06-03 22:32:13,003 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44715447154471544
[2024-06-03 22:32:13,003 INFO  L175             Difference]: Start difference. First operand has 214 places, 563 transitions, 9748 flow. Second operand 9 states and 165 transitions.
[2024-06-03 22:32:13,003 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 621 transitions, 11507 flow
[2024-06-03 22:32:13,523 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 621 transitions, 11270 flow, removed 26 selfloop flow, removed 8 redundant places.
[2024-06-03 22:32:13,532 INFO  L231             Difference]: Finished difference. Result has 217 places, 576 transitions, 10103 flow
[2024-06-03 22:32:13,533 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=9511, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=563, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=109, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=441, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=10103, PETRI_PLACES=217, PETRI_TRANSITIONS=576}
[2024-06-03 22:32:13,534 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 175 predicate places.
[2024-06-03 22:32:13,534 INFO  L495      AbstractCegarLoop]: Abstraction has has 217 places, 576 transitions, 10103 flow
[2024-06-03 22:32:13,534 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:32:13,534 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:32:13,534 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:32:13,534 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29
[2024-06-03 22:32:13,534 INFO  L420      AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:32:13,535 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:32:13,535 INFO  L85        PathProgramCache]: Analyzing trace with hash -93194934, now seen corresponding path program 2 times
[2024-06-03 22:32:13,535 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:32:13,535 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302669859]
[2024-06-03 22:32:13,535 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:32:13,535 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:32:13,573 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:32:22,140 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:32:22,141 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:32:22,141 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302669859]
[2024-06-03 22:32:22,141 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302669859] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:32:22,141 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:32:22,141 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 22:32:22,141 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083065320]
[2024-06-03 22:32:22,141 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:32:22,142 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 22:32:22,142 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:32:22,142 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 22:32:22,142 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72
[2024-06-03 22:32:22,294 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-03 22:32:22,294 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 576 transitions, 10103 flow. Second operand  has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:32:22,294 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:32:22,294 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-03 22:32:22,294 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:32:25,551 INFO  L124   PetriNetUnfolderBase]: 5932/8881 cut-off events.
[2024-06-03 22:32:25,551 INFO  L125   PetriNetUnfolderBase]: For 263282/263287 co-relation queries the response was YES.
[2024-06-03 22:32:25,590 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 72673 conditions, 8881 events. 5932/8881 cut-off events. For 263282/263287 co-relation queries the response was YES. Maximal size of possible extension queue 383. Compared 51580 event pairs, 1838 based on Foata normal form. 14/8893 useless extension candidates. Maximal degree in co-relation 72567. Up to 8355 conditions per place. 
[2024-06-03 22:32:25,627 INFO  L140   encePairwiseOnDemand]: 25/41 looper letters, 575 selfloop transitions, 91 changer transitions 0/669 dead transitions.
[2024-06-03 22:32:25,628 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 669 transitions, 12595 flow
[2024-06-03 22:32:25,628 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-03 22:32:25,628 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-03 22:32:25,629 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 198 transitions.
[2024-06-03 22:32:25,629 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43902439024390244
[2024-06-03 22:32:25,629 INFO  L175             Difference]: Start difference. First operand has 217 places, 576 transitions, 10103 flow. Second operand 11 states and 198 transitions.
[2024-06-03 22:32:25,629 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 669 transitions, 12595 flow
[2024-06-03 22:32:26,195 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 669 transitions, 12345 flow, removed 39 selfloop flow, removed 5 redundant places.
[2024-06-03 22:32:26,204 INFO  L231             Difference]: Finished difference. Result has 224 places, 617 transitions, 10817 flow
[2024-06-03 22:32:26,204 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=9867, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=576, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=494, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=10817, PETRI_PLACES=224, PETRI_TRANSITIONS=617}
[2024-06-03 22:32:26,205 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 182 predicate places.
[2024-06-03 22:32:26,205 INFO  L495      AbstractCegarLoop]: Abstraction has has 224 places, 617 transitions, 10817 flow
[2024-06-03 22:32:26,205 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:32:26,205 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:32:26,205 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:32:26,205 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30
[2024-06-03 22:32:26,205 INFO  L420      AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:32:26,206 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:32:26,206 INFO  L85        PathProgramCache]: Analyzing trace with hash 686905152, now seen corresponding path program 1 times
[2024-06-03 22:32:26,206 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:32:26,206 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613269690]
[2024-06-03 22:32:26,206 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:32:26,206 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:32:26,234 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:32:34,793 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:32:34,793 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:32:34,793 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613269690]
[2024-06-03 22:32:34,793 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613269690] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:32:34,793 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:32:34,793 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 22:32:34,793 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644771888]
[2024-06-03 22:32:34,793 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:32:34,794 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 22:32:34,794 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:32:34,794 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 22:32:34,794 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-03 22:32:35,017 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-03 22:32:35,018 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 617 transitions, 10817 flow. Second operand  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:32:35,018 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:32:35,018 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-03 22:32:35,018 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:32:38,007 INFO  L124   PetriNetUnfolderBase]: 5965/8942 cut-off events.
[2024-06-03 22:32:38,007 INFO  L125   PetriNetUnfolderBase]: For 281935/281940 co-relation queries the response was YES.
[2024-06-03 22:32:38,063 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 73868 conditions, 8942 events. 5965/8942 cut-off events. For 281935/281940 co-relation queries the response was YES. Maximal size of possible extension queue 383. Compared 52075 event pairs, 1844 based on Foata normal form. 34/8974 useless extension candidates. Maximal degree in co-relation 73760. Up to 8592 conditions per place. 
[2024-06-03 22:32:38,106 INFO  L140   encePairwiseOnDemand]: 28/41 looper letters, 596 selfloop transitions, 55 changer transitions 0/654 dead transitions.
[2024-06-03 22:32:38,107 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 654 transitions, 12393 flow
[2024-06-03 22:32:38,107 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 22:32:38,108 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 22:32:38,108 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 145 transitions.
[2024-06-03 22:32:38,108 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4420731707317073
[2024-06-03 22:32:38,109 INFO  L175             Difference]: Start difference. First operand has 224 places, 617 transitions, 10817 flow. Second operand 8 states and 145 transitions.
[2024-06-03 22:32:38,109 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 654 transitions, 12393 flow
[2024-06-03 22:32:38,986 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 654 transitions, 12160 flow, removed 83 selfloop flow, removed 5 redundant places.
[2024-06-03 22:32:38,995 INFO  L231             Difference]: Finished difference. Result has 228 places, 620 transitions, 10811 flow
[2024-06-03 22:32:38,995 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=10584, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=617, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=562, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=10811, PETRI_PLACES=228, PETRI_TRANSITIONS=620}
[2024-06-03 22:32:38,995 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 186 predicate places.
[2024-06-03 22:32:38,996 INFO  L495      AbstractCegarLoop]: Abstraction has has 228 places, 620 transitions, 10811 flow
[2024-06-03 22:32:38,996 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:32:38,996 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:32:38,996 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:32:38,996 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31
[2024-06-03 22:32:38,996 INFO  L420      AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:32:38,997 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:32:38,997 INFO  L85        PathProgramCache]: Analyzing trace with hash 1199891374, now seen corresponding path program 10 times
[2024-06-03 22:32:38,997 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:32:38,997 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812735416]
[2024-06-03 22:32:38,997 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:32:38,997 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:32:39,030 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:32:47,343 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:32:47,344 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:32:47,344 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812735416]
[2024-06-03 22:32:47,344 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812735416] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:32:47,344 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:32:47,344 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 22:32:47,344 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749730143]
[2024-06-03 22:32:47,344 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:32:47,345 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 22:32:47,345 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:32:47,345 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 22:32:47,345 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2024-06-03 22:32:47,508 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-03 22:32:47,509 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 620 transitions, 10811 flow. Second operand  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:32:47,509 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:32:47,509 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-03 22:32:47,509 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:32:50,762 INFO  L124   PetriNetUnfolderBase]: 6142/9217 cut-off events.
[2024-06-03 22:32:50,762 INFO  L125   PetriNetUnfolderBase]: For 310854/310858 co-relation queries the response was YES.
[2024-06-03 22:32:50,822 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 76519 conditions, 9217 events. 6142/9217 cut-off events. For 310854/310858 co-relation queries the response was YES. Maximal size of possible extension queue 397. Compared 53722 event pairs, 1589 based on Foata normal form. 44/9260 useless extension candidates. Maximal degree in co-relation 76409. Up to 7744 conditions per place. 
[2024-06-03 22:32:50,869 INFO  L140   encePairwiseOnDemand]: 28/41 looper letters, 368 selfloop transitions, 308 changer transitions 0/679 dead transitions.
[2024-06-03 22:32:50,869 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 679 transitions, 12681 flow
[2024-06-03 22:32:50,870 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-03 22:32:50,870 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-03 22:32:50,870 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 181 transitions.
[2024-06-03 22:32:50,870 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44146341463414634
[2024-06-03 22:32:50,870 INFO  L175             Difference]: Start difference. First operand has 228 places, 620 transitions, 10811 flow. Second operand 10 states and 181 transitions.
[2024-06-03 22:32:50,870 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 679 transitions, 12681 flow
[2024-06-03 22:32:51,707 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 679 transitions, 12524 flow, removed 28 selfloop flow, removed 6 redundant places.
[2024-06-03 22:32:51,717 INFO  L231             Difference]: Finished difference. Result has 232 places, 629 transitions, 11500 flow
[2024-06-03 22:32:51,717 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=10654, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=620, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=299, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=312, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=11500, PETRI_PLACES=232, PETRI_TRANSITIONS=629}
[2024-06-03 22:32:51,718 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 190 predicate places.
[2024-06-03 22:32:51,718 INFO  L495      AbstractCegarLoop]: Abstraction has has 232 places, 629 transitions, 11500 flow
[2024-06-03 22:32:51,718 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:32:51,718 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:32:51,718 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:32:51,718 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32
[2024-06-03 22:32:51,719 INFO  L420      AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:32:51,719 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:32:51,719 INFO  L85        PathProgramCache]: Analyzing trace with hash 2040583442, now seen corresponding path program 3 times
[2024-06-03 22:32:51,719 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:32:51,719 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915278796]
[2024-06-03 22:32:51,719 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:32:51,719 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:32:51,753 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:32:59,331 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:32:59,332 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:32:59,332 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915278796]
[2024-06-03 22:32:59,332 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915278796] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:32:59,332 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:32:59,332 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 22:32:59,332 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914263220]
[2024-06-03 22:32:59,332 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:32:59,333 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 22:32:59,333 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:32:59,334 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 22:32:59,334 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-03 22:32:59,479 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-03 22:32:59,480 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 629 transitions, 11500 flow. Second operand  has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:32:59,480 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:32:59,480 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-03 22:32:59,480 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:33:02,443 INFO  L124   PetriNetUnfolderBase]: 6132/9196 cut-off events.
[2024-06-03 22:33:02,443 INFO  L125   PetriNetUnfolderBase]: For 306070/306074 co-relation queries the response was YES.
[2024-06-03 22:33:02,504 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 78178 conditions, 9196 events. 6132/9196 cut-off events. For 306070/306074 co-relation queries the response was YES. Maximal size of possible extension queue 396. Compared 53836 event pairs, 1783 based on Foata normal form. 8/9203 useless extension candidates. Maximal degree in co-relation 78067. Up to 8507 conditions per place. 
[2024-06-03 22:33:02,549 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 541 selfloop transitions, 142 changer transitions 0/686 dead transitions.
[2024-06-03 22:33:02,549 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 686 transitions, 13570 flow
[2024-06-03 22:33:02,551 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 22:33:02,551 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 22:33:02,551 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 158 transitions.
[2024-06-03 22:33:02,551 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4281842818428184
[2024-06-03 22:33:02,551 INFO  L175             Difference]: Start difference. First operand has 232 places, 629 transitions, 11500 flow. Second operand 9 states and 158 transitions.
[2024-06-03 22:33:02,552 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 686 transitions, 13570 flow
[2024-06-03 22:33:03,475 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 686 transitions, 13002 flow, removed 21 selfloop flow, removed 7 redundant places.
[2024-06-03 22:33:03,485 INFO  L231             Difference]: Finished difference. Result has 236 places, 649 transitions, 11785 flow
[2024-06-03 22:33:03,485 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=10958, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=629, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=122, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=489, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=11785, PETRI_PLACES=236, PETRI_TRANSITIONS=649}
[2024-06-03 22:33:03,485 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 194 predicate places.
[2024-06-03 22:33:03,485 INFO  L495      AbstractCegarLoop]: Abstraction has has 236 places, 649 transitions, 11785 flow
[2024-06-03 22:33:03,486 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:33:03,486 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:33:03,486 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:33:03,486 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33
[2024-06-03 22:33:03,486 INFO  L420      AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:33:03,487 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:33:03,487 INFO  L85        PathProgramCache]: Analyzing trace with hash 2040578668, now seen corresponding path program 11 times
[2024-06-03 22:33:03,487 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:33:03,487 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909780999]
[2024-06-03 22:33:03,487 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:33:03,487 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:33:03,521 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:33:12,311 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:33:12,312 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:33:12,312 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909780999]
[2024-06-03 22:33:12,312 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909780999] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:33:12,312 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:33:12,312 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 22:33:12,312 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196090877]
[2024-06-03 22:33:12,312 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:33:12,313 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 22:33:12,313 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:33:12,313 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 22:33:12,313 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-03 22:33:12,468 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-03 22:33:12,468 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 649 transitions, 11785 flow. Second operand  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:33:12,468 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:33:12,469 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-03 22:33:12,469 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:33:15,787 INFO  L124   PetriNetUnfolderBase]: 6157/9241 cut-off events.
[2024-06-03 22:33:15,787 INFO  L125   PetriNetUnfolderBase]: For 326734/326738 co-relation queries the response was YES.
[2024-06-03 22:33:15,846 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 78044 conditions, 9241 events. 6157/9241 cut-off events. For 326734/326738 co-relation queries the response was YES. Maximal size of possible extension queue 400. Compared 54152 event pairs, 1710 based on Foata normal form. 44/9284 useless extension candidates. Maximal degree in co-relation 77930. Up to 8189 conditions per place. 
[2024-06-03 22:33:15,893 INFO  L140   encePairwiseOnDemand]: 28/41 looper letters, 509 selfloop transitions, 190 changer transitions 0/702 dead transitions.
[2024-06-03 22:33:15,893 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 702 transitions, 13646 flow
[2024-06-03 22:33:15,894 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-03 22:33:15,894 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-03 22:33:15,894 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 177 transitions.
[2024-06-03 22:33:15,894 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4317073170731707
[2024-06-03 22:33:15,894 INFO  L175             Difference]: Start difference. First operand has 236 places, 649 transitions, 11785 flow. Second operand 10 states and 177 transitions.
[2024-06-03 22:33:15,894 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 702 transitions, 13646 flow
[2024-06-03 22:33:16,772 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 702 transitions, 13471 flow, removed 10 selfloop flow, removed 5 redundant places.
[2024-06-03 22:33:16,782 INFO  L231             Difference]: Finished difference. Result has 241 places, 655 transitions, 12163 flow
[2024-06-03 22:33:16,783 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=11610, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=649, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=184, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=459, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=12163, PETRI_PLACES=241, PETRI_TRANSITIONS=655}
[2024-06-03 22:33:16,783 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 199 predicate places.
[2024-06-03 22:33:16,783 INFO  L495      AbstractCegarLoop]: Abstraction has has 241 places, 655 transitions, 12163 flow
[2024-06-03 22:33:16,783 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:33:16,783 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:33:16,783 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:33:16,784 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34
[2024-06-03 22:33:16,784 INFO  L420      AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:33:16,784 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:33:16,784 INFO  L85        PathProgramCache]: Analyzing trace with hash -2139092684, now seen corresponding path program 4 times
[2024-06-03 22:33:16,784 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:33:16,784 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678205211]
[2024-06-03 22:33:16,784 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:33:16,785 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:33:16,816 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:33:25,012 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:33:25,013 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:33:25,013 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678205211]
[2024-06-03 22:33:25,013 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678205211] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:33:25,013 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:33:25,013 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 22:33:25,013 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989157550]
[2024-06-03 22:33:25,013 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:33:25,013 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 22:33:25,014 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:33:25,014 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 22:33:25,014 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72
[2024-06-03 22:33:25,154 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-03 22:33:25,154 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 655 transitions, 12163 flow. Second operand  has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:33:25,154 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:33:25,154 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-03 22:33:25,154 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:33:28,282 INFO  L124   PetriNetUnfolderBase]: 6147/9224 cut-off events.
[2024-06-03 22:33:28,283 INFO  L125   PetriNetUnfolderBase]: For 321028/321045 co-relation queries the response was YES.
[2024-06-03 22:33:28,349 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 78878 conditions, 9224 events. 6147/9224 cut-off events. For 321028/321045 co-relation queries the response was YES. Maximal size of possible extension queue 400. Compared 54228 event pairs, 1712 based on Foata normal form. 16/9238 useless extension candidates. Maximal degree in co-relation 78763. Up to 8653 conditions per place. 
[2024-06-03 22:33:28,397 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 561 selfloop transitions, 128 changer transitions 0/692 dead transitions.
[2024-06-03 22:33:28,397 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 692 transitions, 13713 flow
[2024-06-03 22:33:28,399 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 22:33:28,399 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 22:33:28,399 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 159 transitions.
[2024-06-03 22:33:28,399 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43089430894308944
[2024-06-03 22:33:28,399 INFO  L175             Difference]: Start difference. First operand has 241 places, 655 transitions, 12163 flow. Second operand 9 states and 159 transitions.
[2024-06-03 22:33:28,399 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 692 transitions, 13713 flow
[2024-06-03 22:33:29,411 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 692 transitions, 13347 flow, removed 39 selfloop flow, removed 7 redundant places.
[2024-06-03 22:33:29,421 INFO  L231             Difference]: Finished difference. Result has 243 places, 655 transitions, 12121 flow
[2024-06-03 22:33:29,422 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=11797, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=655, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=128, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=527, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=12121, PETRI_PLACES=243, PETRI_TRANSITIONS=655}
[2024-06-03 22:33:29,422 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 201 predicate places.
[2024-06-03 22:33:29,422 INFO  L495      AbstractCegarLoop]: Abstraction has has 243 places, 655 transitions, 12121 flow
[2024-06-03 22:33:29,422 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:33:29,423 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:33:29,423 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:33:29,423 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35
[2024-06-03 22:33:29,423 INFO  L420      AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:33:29,423 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:33:29,423 INFO  L85        PathProgramCache]: Analyzing trace with hash -2139097458, now seen corresponding path program 12 times
[2024-06-03 22:33:29,423 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:33:29,423 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448935167]
[2024-06-03 22:33:29,424 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:33:29,424 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:33:29,458 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:33:37,986 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:33:37,986 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:33:37,986 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448935167]
[2024-06-03 22:33:37,986 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448935167] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:33:37,986 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:33:37,986 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 22:33:37,986 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010504585]
[2024-06-03 22:33:37,986 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:33:37,986 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 22:33:37,987 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:33:37,987 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 22:33:37,987 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90
[2024-06-03 22:33:38,130 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-03 22:33:38,130 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 655 transitions, 12121 flow. Second operand  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:33:38,130 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:33:38,130 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-03 22:33:38,130 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:33:41,205 INFO  L124   PetriNetUnfolderBase]: 5979/8983 cut-off events.
[2024-06-03 22:33:41,205 INFO  L125   PetriNetUnfolderBase]: For 322512/322529 co-relation queries the response was YES.
[2024-06-03 22:33:41,267 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 75192 conditions, 8983 events. 5979/8983 cut-off events. For 322512/322529 co-relation queries the response was YES. Maximal size of possible extension queue 383. Compared 52785 event pairs, 1198 based on Foata normal form. 64/9045 useless extension candidates. Maximal degree in co-relation 75076. Up to 7567 conditions per place. 
[2024-06-03 22:33:41,313 INFO  L140   encePairwiseOnDemand]: 28/41 looper letters, 472 selfloop transitions, 219 changer transitions 0/694 dead transitions.
[2024-06-03 22:33:41,313 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 694 transitions, 13769 flow
[2024-06-03 22:33:41,314 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 22:33:41,314 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 22:33:41,314 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 152 transitions.
[2024-06-03 22:33:41,314 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4634146341463415
[2024-06-03 22:33:41,314 INFO  L175             Difference]: Start difference. First operand has 243 places, 655 transitions, 12121 flow. Second operand 8 states and 152 transitions.
[2024-06-03 22:33:41,314 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 694 transitions, 13769 flow
[2024-06-03 22:33:42,364 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 694 transitions, 13611 flow, removed 10 selfloop flow, removed 6 redundant places.
[2024-06-03 22:33:42,374 INFO  L231             Difference]: Finished difference. Result has 245 places, 655 transitions, 12489 flow
[2024-06-03 22:33:42,375 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=11963, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=655, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=219, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=436, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=12489, PETRI_PLACES=245, PETRI_TRANSITIONS=655}
[2024-06-03 22:33:42,375 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 203 predicate places.
[2024-06-03 22:33:42,375 INFO  L495      AbstractCegarLoop]: Abstraction has has 245 places, 655 transitions, 12489 flow
[2024-06-03 22:33:42,376 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:33:42,376 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:33:42,376 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:33:42,376 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36
[2024-06-03 22:33:42,376 INFO  L420      AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:33:42,377 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:33:42,377 INFO  L85        PathProgramCache]: Analyzing trace with hash -2138912760, now seen corresponding path program 2 times
[2024-06-03 22:33:42,377 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:33:42,377 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042067404]
[2024-06-03 22:33:42,378 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:33:42,378 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:33:42,417 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:33:50,858 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:33:50,858 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:33:50,858 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042067404]
[2024-06-03 22:33:50,859 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042067404] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:33:50,859 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:33:50,859 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 22:33:50,859 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15688280]
[2024-06-03 22:33:50,859 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:33:50,859 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 22:33:50,859 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:33:50,860 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 22:33:50,860 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-03 22:33:51,032 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-03 22:33:51,032 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 655 transitions, 12489 flow. Second operand  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:33:51,032 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:33:51,032 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-03 22:33:51,032 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:33:54,034 INFO  L124   PetriNetUnfolderBase]: 5996/9007 cut-off events.
[2024-06-03 22:33:54,034 INFO  L125   PetriNetUnfolderBase]: For 306621/306626 co-relation queries the response was YES.
[2024-06-03 22:33:54,087 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 76942 conditions, 9007 events. 5996/9007 cut-off events. For 306621/306626 co-relation queries the response was YES. Maximal size of possible extension queue 382. Compared 52740 event pairs, 1826 based on Foata normal form. 8/9013 useless extension candidates. Maximal degree in co-relation 76825. Up to 8751 conditions per place. 
[2024-06-03 22:33:54,129 INFO  L140   encePairwiseOnDemand]: 32/41 looper letters, 638 selfloop transitions, 48 changer transitions 0/689 dead transitions.
[2024-06-03 22:33:54,129 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 689 transitions, 14057 flow
[2024-06-03 22:33:54,131 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 22:33:54,131 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 22:33:54,131 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 146 transitions.
[2024-06-03 22:33:54,131 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3956639566395664
[2024-06-03 22:33:54,132 INFO  L175             Difference]: Start difference. First operand has 245 places, 655 transitions, 12489 flow. Second operand 9 states and 146 transitions.
[2024-06-03 22:33:54,132 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 689 transitions, 14057 flow
[2024-06-03 22:33:55,056 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 689 transitions, 13683 flow, removed 10 selfloop flow, removed 6 redundant places.
[2024-06-03 22:33:55,066 INFO  L231             Difference]: Finished difference. Result has 248 places, 658 transitions, 12282 flow
[2024-06-03 22:33:55,067 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=12115, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=655, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=607, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=12282, PETRI_PLACES=248, PETRI_TRANSITIONS=658}
[2024-06-03 22:33:55,067 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 206 predicate places.
[2024-06-03 22:33:55,067 INFO  L495      AbstractCegarLoop]: Abstraction has has 248 places, 658 transitions, 12282 flow
[2024-06-03 22:33:55,067 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:33:55,067 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:33:55,067 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:33:55,068 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37
[2024-06-03 22:33:55,068 INFO  L420      AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:33:55,068 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:33:55,068 INFO  L85        PathProgramCache]: Analyzing trace with hash -1370318556, now seen corresponding path program 5 times
[2024-06-03 22:33:55,068 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:33:55,068 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853393439]
[2024-06-03 22:33:55,068 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:33:55,069 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:33:55,100 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:34:03,096 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:34:03,097 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:34:03,097 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853393439]
[2024-06-03 22:34:03,097 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853393439] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:34:03,097 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:34:03,097 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 22:34:03,097 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784609408]
[2024-06-03 22:34:03,097 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:34:03,098 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 22:34:03,098 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:34:03,098 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 22:34:03,098 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72
[2024-06-03 22:34:03,176 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-03 22:34:03,177 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 658 transitions, 12282 flow. Second operand  has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:34:03,177 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:34:03,177 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-03 22:34:03,177 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:34:06,241 INFO  L124   PetriNetUnfolderBase]: 6194/9277 cut-off events.
[2024-06-03 22:34:06,242 INFO  L125   PetriNetUnfolderBase]: For 309118/309135 co-relation queries the response was YES.
[2024-06-03 22:34:06,303 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 78634 conditions, 9277 events. 6194/9277 cut-off events. For 309118/309135 co-relation queries the response was YES. Maximal size of possible extension queue 389. Compared 54218 event pairs, 1707 based on Foata normal form. 16/9291 useless extension candidates. Maximal degree in co-relation 78516. Up to 8792 conditions per place. 
[2024-06-03 22:34:06,349 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 618 selfloop transitions, 116 changer transitions 0/737 dead transitions.
[2024-06-03 22:34:06,349 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 737 transitions, 14875 flow
[2024-06-03 22:34:06,351 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 22:34:06,351 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 22:34:06,351 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 146 transitions.
[2024-06-03 22:34:06,352 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4451219512195122
[2024-06-03 22:34:06,352 INFO  L175             Difference]: Start difference. First operand has 248 places, 658 transitions, 12282 flow. Second operand 8 states and 146 transitions.
[2024-06-03 22:34:06,352 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 737 transitions, 14875 flow
[2024-06-03 22:34:07,477 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 737 transitions, 14741 flow, removed 24 selfloop flow, removed 6 redundant places.
[2024-06-03 22:34:07,488 INFO  L231             Difference]: Finished difference. Result has 252 places, 697 transitions, 13305 flow
[2024-06-03 22:34:07,488 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=12164, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=658, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=542, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=13305, PETRI_PLACES=252, PETRI_TRANSITIONS=697}
[2024-06-03 22:34:07,489 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 210 predicate places.
[2024-06-03 22:34:07,489 INFO  L495      AbstractCegarLoop]: Abstraction has has 252 places, 697 transitions, 13305 flow
[2024-06-03 22:34:07,490 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:34:07,490 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:34:07,490 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:34:07,490 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38
[2024-06-03 22:34:07,490 INFO  L420      AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:34:07,490 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:34:07,490 INFO  L85        PathProgramCache]: Analyzing trace with hash -1361740732, now seen corresponding path program 3 times
[2024-06-03 22:34:07,491 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:34:07,491 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973620539]
[2024-06-03 22:34:07,491 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:34:07,491 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:34:07,528 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:34:14,438 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:34:14,439 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:34:14,439 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973620539]
[2024-06-03 22:34:14,439 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973620539] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:34:14,439 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:34:14,439 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 22:34:14,439 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897003326]
[2024-06-03 22:34:14,439 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:34:14,440 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 22:34:14,440 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:34:14,440 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 22:34:14,440 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-03 22:34:14,590 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-03 22:34:14,591 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 697 transitions, 13305 flow. Second operand  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:34:14,591 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:34:14,591 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-03 22:34:14,591 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:34:17,598 INFO  L124   PetriNetUnfolderBase]: 6211/9329 cut-off events.
[2024-06-03 22:34:17,598 INFO  L125   PetriNetUnfolderBase]: For 328318/328321 co-relation queries the response was YES.
[2024-06-03 22:34:17,659 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 79912 conditions, 9329 events. 6211/9329 cut-off events. For 328318/328321 co-relation queries the response was YES. Maximal size of possible extension queue 397. Compared 54872 event pairs, 2407 based on Foata normal form. 6/9333 useless extension candidates. Maximal degree in co-relation 79791. Up to 9191 conditions per place. 
[2024-06-03 22:34:17,704 INFO  L140   encePairwiseOnDemand]: 32/41 looper letters, 700 selfloop transitions, 17 changer transitions 0/720 dead transitions.
[2024-06-03 22:34:17,705 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 720 transitions, 14887 flow
[2024-06-03 22:34:17,707 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-03 22:34:17,707 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-03 22:34:17,707 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 112 transitions.
[2024-06-03 22:34:17,707 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3902439024390244
[2024-06-03 22:34:17,707 INFO  L175             Difference]: Start difference. First operand has 252 places, 697 transitions, 13305 flow. Second operand 7 states and 112 transitions.
[2024-06-03 22:34:17,708 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 720 transitions, 14887 flow
[2024-06-03 22:34:18,693 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 720 transitions, 14555 flow, removed 19 selfloop flow, removed 6 redundant places.
[2024-06-03 22:34:18,704 INFO  L231             Difference]: Finished difference. Result has 254 places, 700 transitions, 13081 flow
[2024-06-03 22:34:18,704 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=12973, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=697, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=680, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=13081, PETRI_PLACES=254, PETRI_TRANSITIONS=700}
[2024-06-03 22:34:18,704 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 212 predicate places.
[2024-06-03 22:34:18,705 INFO  L495      AbstractCegarLoop]: Abstraction has has 254 places, 700 transitions, 13081 flow
[2024-06-03 22:34:18,705 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:34:18,705 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:34:18,705 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:34:18,705 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39
[2024-06-03 22:34:18,705 INFO  L420      AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:34:18,706 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:34:18,706 INFO  L85        PathProgramCache]: Analyzing trace with hash -1362037402, now seen corresponding path program 4 times
[2024-06-03 22:34:18,706 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:34:18,707 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732419077]
[2024-06-03 22:34:18,707 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:34:18,707 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:34:18,745 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:34:27,022 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:34:27,022 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:34:27,022 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732419077]
[2024-06-03 22:34:27,022 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732419077] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:34:27,022 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:34:27,022 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 22:34:27,022 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025091507]
[2024-06-03 22:34:27,022 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:34:27,023 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 22:34:27,023 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:34:27,023 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 22:34:27,023 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-03 22:34:27,128 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-03 22:34:27,128 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 700 transitions, 13081 flow. Second operand  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:34:27,128 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:34:27,128 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-03 22:34:27,128 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:34:30,210 INFO  L124   PetriNetUnfolderBase]: 6203/9317 cut-off events.
[2024-06-03 22:34:30,210 INFO  L125   PetriNetUnfolderBase]: For 332551/332554 co-relation queries the response was YES.
[2024-06-03 22:34:30,276 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 79543 conditions, 9317 events. 6203/9317 cut-off events. For 332551/332554 co-relation queries the response was YES. Maximal size of possible extension queue 396. Compared 54735 event pairs, 2420 based on Foata normal form. 6/9321 useless extension candidates. Maximal degree in co-relation 79420. Up to 9170 conditions per place. 
[2024-06-03 22:34:30,323 INFO  L140   encePairwiseOnDemand]: 32/41 looper letters, 698 selfloop transitions, 21 changer transitions 0/722 dead transitions.
[2024-06-03 22:34:30,324 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 722 transitions, 14665 flow
[2024-06-03 22:34:30,325 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-03 22:34:30,326 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-03 22:34:30,326 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 113 transitions.
[2024-06-03 22:34:30,326 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.39372822299651566
[2024-06-03 22:34:30,326 INFO  L175             Difference]: Start difference. First operand has 254 places, 700 transitions, 13081 flow. Second operand 7 states and 113 transitions.
[2024-06-03 22:34:30,326 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 722 transitions, 14665 flow
[2024-06-03 22:34:31,358 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 256 places, 722 transitions, 14583 flow, removed 27 selfloop flow, removed 4 redundant places.
[2024-06-03 22:34:31,368 INFO  L231             Difference]: Finished difference. Result has 257 places, 702 transitions, 13107 flow
[2024-06-03 22:34:31,369 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=12999, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=700, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=679, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=13107, PETRI_PLACES=257, PETRI_TRANSITIONS=702}
[2024-06-03 22:34:31,369 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 215 predicate places.
[2024-06-03 22:34:31,369 INFO  L495      AbstractCegarLoop]: Abstraction has has 257 places, 702 transitions, 13107 flow
[2024-06-03 22:34:31,369 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:34:31,369 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:34:31,370 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:34:31,370 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40
[2024-06-03 22:34:31,370 INFO  L420      AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:34:31,370 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:34:31,370 INFO  L85        PathProgramCache]: Analyzing trace with hash -1362037650, now seen corresponding path program 1 times
[2024-06-03 22:34:31,370 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:34:31,370 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34948515]
[2024-06-03 22:34:31,371 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:34:31,371 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:34:31,402 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:34:39,291 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:34:39,292 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:34:39,292 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34948515]
[2024-06-03 22:34:39,292 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34948515] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:34:39,292 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:34:39,292 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 22:34:39,292 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511440430]
[2024-06-03 22:34:39,292 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:34:39,292 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 22:34:39,292 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:34:39,292 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 22:34:39,293 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-03 22:34:39,441 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-03 22:34:39,441 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 702 transitions, 13107 flow. Second operand  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:34:39,441 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:34:39,441 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-03 22:34:39,441 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:34:42,591 INFO  L124   PetriNetUnfolderBase]: 6195/9305 cut-off events.
[2024-06-03 22:34:42,592 INFO  L125   PetriNetUnfolderBase]: For 339098/339101 co-relation queries the response was YES.
[2024-06-03 22:34:42,664 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 79620 conditions, 9305 events. 6195/9305 cut-off events. For 339098/339101 co-relation queries the response was YES. Maximal size of possible extension queue 395. Compared 54680 event pairs, 2420 based on Foata normal form. 4/9307 useless extension candidates. Maximal degree in co-relation 79496. Up to 9149 conditions per place. 
[2024-06-03 22:34:42,715 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 694 selfloop transitions, 25 changer transitions 0/722 dead transitions.
[2024-06-03 22:34:42,715 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 722 transitions, 14639 flow
[2024-06-03 22:34:42,717 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-03 22:34:42,717 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-03 22:34:42,717 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 114 transitions.
[2024-06-03 22:34:42,717 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.397212543554007
[2024-06-03 22:34:42,718 INFO  L175             Difference]: Start difference. First operand has 257 places, 702 transitions, 13107 flow. Second operand 7 states and 114 transitions.
[2024-06-03 22:34:42,718 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 722 transitions, 14639 flow
[2024-06-03 22:34:43,973 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 722 transitions, 14539 flow, removed 31 selfloop flow, removed 5 redundant places.
[2024-06-03 22:34:43,983 INFO  L231             Difference]: Finished difference. Result has 259 places, 702 transitions, 13069 flow
[2024-06-03 22:34:43,984 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=13007, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=702, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=677, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=13069, PETRI_PLACES=259, PETRI_TRANSITIONS=702}
[2024-06-03 22:34:43,984 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 217 predicate places.
[2024-06-03 22:34:43,984 INFO  L495      AbstractCegarLoop]: Abstraction has has 259 places, 702 transitions, 13069 flow
[2024-06-03 22:34:43,989 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:34:43,989 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:34:43,989 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:34:43,990 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41
[2024-06-03 22:34:43,990 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-03 22:34:43,990 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:34:43,990 INFO  L85        PathProgramCache]: Analyzing trace with hash -94013436, now seen corresponding path program 1 times
[2024-06-03 22:34:43,990 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:34:43,991 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118435283]
[2024-06-03 22:34:43,991 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:34:43,991 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:34:44,036 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:34:52,829 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:34:52,830 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:34:52,830 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118435283]
[2024-06-03 22:34:52,830 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118435283] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:34:52,830 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:34:52,830 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-03 22:34:52,830 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329352592]
[2024-06-03 22:34:52,830 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:34:52,830 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-03 22:34:52,830 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:34:52,830 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-03 22:34:52,831 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2024-06-03 22:34:52,949 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41
[2024-06-03 22:34:52,950 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 702 transitions, 13069 flow. Second operand  has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:34:52,950 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:34:52,950 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41
[2024-06-03 22:34:52,950 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:34:55,653 INFO  L124   PetriNetUnfolderBase]: 5710/8679 cut-off events.
[2024-06-03 22:34:55,653 INFO  L125   PetriNetUnfolderBase]: For 349935/350285 co-relation queries the response was YES.
[2024-06-03 22:34:55,716 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 75385 conditions, 8679 events. 5710/8679 cut-off events. For 349935/350285 co-relation queries the response was YES. Maximal size of possible extension queue 362. Compared 51572 event pairs, 1515 based on Foata normal form. 247/8699 useless extension candidates. Maximal degree in co-relation 75260. Up to 8186 conditions per place. 
[2024-06-03 22:34:55,759 INFO  L140   encePairwiseOnDemand]: 34/41 looper letters, 621 selfloop transitions, 50 changer transitions 0/720 dead transitions.
[2024-06-03 22:34:55,759 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 720 transitions, 14597 flow
[2024-06-03 22:34:55,760 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-03 22:34:55,760 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-03 22:34:55,760 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 94 transitions.
[2024-06-03 22:34:55,760 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4585365853658537
[2024-06-03 22:34:55,761 INFO  L175             Difference]: Start difference. First operand has 259 places, 702 transitions, 13069 flow. Second operand 5 states and 94 transitions.
[2024-06-03 22:34:55,761 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 720 transitions, 14597 flow
[2024-06-03 22:34:56,805 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 720 transitions, 14533 flow, removed 11 selfloop flow, removed 5 redundant places.
[2024-06-03 22:34:56,816 INFO  L231             Difference]: Finished difference. Result has 259 places, 705 transitions, 13213 flow
[2024-06-03 22:34:56,816 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=13005, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=702, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=652, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=13213, PETRI_PLACES=259, PETRI_TRANSITIONS=705}
[2024-06-03 22:34:56,817 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 217 predicate places.
[2024-06-03 22:34:56,817 INFO  L495      AbstractCegarLoop]: Abstraction has has 259 places, 705 transitions, 13213 flow
[2024-06-03 22:34:56,817 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:34:56,817 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:34:56,817 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:34:56,817 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42
[2024-06-03 22:34:56,817 INFO  L420      AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:34:56,818 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:34:56,818 INFO  L85        PathProgramCache]: Analyzing trace with hash 1501726208, now seen corresponding path program 2 times
[2024-06-03 22:34:56,818 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:34:56,818 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771823666]
[2024-06-03 22:34:56,818 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:34:56,818 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:34:56,846 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:35:02,784 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:35:02,784 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:35:02,784 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771823666]
[2024-06-03 22:35:02,784 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771823666] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:35:02,784 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:35:02,784 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 22:35:02,784 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885495704]
[2024-06-03 22:35:02,785 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:35:02,785 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 22:35:02,785 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:35:02,785 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 22:35:02,785 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-03 22:35:02,960 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-03 22:35:02,960 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 705 transitions, 13213 flow. Second operand  has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 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-03 22:35:02,960 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:35:02,960 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-03 22:35:02,960 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:35:06,229 INFO  L124   PetriNetUnfolderBase]: 6267/9430 cut-off events.
[2024-06-03 22:35:06,229 INFO  L125   PetriNetUnfolderBase]: For 368957/368981 co-relation queries the response was YES.
[2024-06-03 22:35:06,282 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 80886 conditions, 9430 events. 6267/9430 cut-off events. For 368957/368981 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 55662 event pairs, 1526 based on Foata normal form. 34/9463 useless extension candidates. Maximal degree in co-relation 80760. Up to 8801 conditions per place. 
[2024-06-03 22:35:06,324 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 653 selfloop transitions, 92 changer transitions 0/748 dead transitions.
[2024-06-03 22:35:06,325 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 748 transitions, 14929 flow
[2024-06-03 22:35:06,326 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-03 22:35:06,326 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-03 22:35:06,326 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 162 transitions.
[2024-06-03 22:35:06,326 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3951219512195122
[2024-06-03 22:35:06,326 INFO  L175             Difference]: Start difference. First operand has 259 places, 705 transitions, 13213 flow. Second operand 10 states and 162 transitions.
[2024-06-03 22:35:06,327 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 748 transitions, 14929 flow
[2024-06-03 22:35:07,380 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 748 transitions, 14857 flow, removed 8 selfloop flow, removed 3 redundant places.
[2024-06-03 22:35:07,391 INFO  L231             Difference]: Finished difference. Result has 266 places, 707 transitions, 13390 flow
[2024-06-03 22:35:07,392 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=13141, PETRI_DIFFERENCE_MINUEND_PLACES=256, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=705, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=90, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=613, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=13390, PETRI_PLACES=266, PETRI_TRANSITIONS=707}
[2024-06-03 22:35:07,392 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 224 predicate places.
[2024-06-03 22:35:07,392 INFO  L495      AbstractCegarLoop]: Abstraction has has 266 places, 707 transitions, 13390 flow
[2024-06-03 22:35:07,392 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 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-03 22:35:07,392 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:35:07,393 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:35:07,393 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43
[2024-06-03 22:35:07,393 INFO  L420      AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:35:07,393 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:35:07,393 INFO  L85        PathProgramCache]: Analyzing trace with hash 1713331504, now seen corresponding path program 3 times
[2024-06-03 22:35:07,393 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:35:07,393 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743221795]
[2024-06-03 22:35:07,393 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:35:07,394 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:35:07,418 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:35:17,993 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:35:17,993 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:35:17,994 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743221795]
[2024-06-03 22:35:17,994 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743221795] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:35:17,994 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:35:17,994 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-03 22:35:17,994 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579640520]
[2024-06-03 22:35:17,994 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:35:17,994 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-03 22:35:17,995 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:35:17,995 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-03 22:35:17,995 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110
[2024-06-03 22:35:18,225 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-03 22:35:18,226 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 707 transitions, 13390 flow. Second operand  has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:35:18,226 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:35:18,226 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-03 22:35:18,226 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:35:22,596 INFO  L124   PetriNetUnfolderBase]: 7565/11446 cut-off events.
[2024-06-03 22:35:22,597 INFO  L125   PetriNetUnfolderBase]: For 585233/585237 co-relation queries the response was YES.
[2024-06-03 22:35:22,670 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 98453 conditions, 11446 events. 7565/11446 cut-off events. For 585233/585237 co-relation queries the response was YES. Maximal size of possible extension queue 454. Compared 69348 event pairs, 1654 based on Foata normal form. 76/11521 useless extension candidates. Maximal degree in co-relation 98326. Up to 7027 conditions per place. 
[2024-06-03 22:35:22,722 INFO  L140   encePairwiseOnDemand]: 25/41 looper letters, 576 selfloop transitions, 251 changer transitions 5/835 dead transitions.
[2024-06-03 22:35:22,722 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 835 transitions, 16709 flow
[2024-06-03 22:35:22,724 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2024-06-03 22:35:22,724 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 13 states.
[2024-06-03 22:35:22,725 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 254 transitions.
[2024-06-03 22:35:22,725 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.47654784240150094
[2024-06-03 22:35:22,725 INFO  L175             Difference]: Start difference. First operand has 266 places, 707 transitions, 13390 flow. Second operand 13 states and 254 transitions.
[2024-06-03 22:35:22,725 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 835 transitions, 16709 flow
[2024-06-03 22:35:24,094 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 835 transitions, 16467 flow, removed 30 selfloop flow, removed 8 redundant places.
[2024-06-03 22:35:24,106 INFO  L231             Difference]: Finished difference. Result has 273 places, 740 transitions, 14535 flow
[2024-06-03 22:35:24,106 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=13183, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=707, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=218, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=459, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=14535, PETRI_PLACES=273, PETRI_TRANSITIONS=740}
[2024-06-03 22:35:24,106 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 231 predicate places.
[2024-06-03 22:35:24,107 INFO  L495      AbstractCegarLoop]: Abstraction has has 273 places, 740 transitions, 14535 flow
[2024-06-03 22:35:24,107 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:35:24,107 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:35:24,107 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:35:24,107 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44
[2024-06-03 22:35:24,107 INFO  L420      AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:35:24,107 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:35:24,107 INFO  L85        PathProgramCache]: Analyzing trace with hash 1715209174, now seen corresponding path program 4 times
[2024-06-03 22:35:24,108 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:35:24,108 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194285095]
[2024-06-03 22:35:24,108 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:35:24,108 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:35:24,134 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:35:31,820 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:35:31,821 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:35:31,821 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194285095]
[2024-06-03 22:35:31,821 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194285095] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:35:31,821 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:35:31,821 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 22:35:31,821 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527642788]
[2024-06-03 22:35:31,821 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:35:31,821 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 22:35:31,821 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:35:31,821 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 22:35:31,822 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2024-06-03 22:35:31,985 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-03 22:35:31,985 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 740 transitions, 14535 flow. Second operand  has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 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-03 22:35:31,985 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:35:31,985 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-03 22:35:31,985 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:35:36,700 INFO  L124   PetriNetUnfolderBase]: 8045/12190 cut-off events.
[2024-06-03 22:35:36,701 INFO  L125   PetriNetUnfolderBase]: For 587760/587787 co-relation queries the response was YES.
[2024-06-03 22:35:36,769 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 107150 conditions, 12190 events. 8045/12190 cut-off events. For 587760/587787 co-relation queries the response was YES. Maximal size of possible extension queue 513. Compared 74925 event pairs, 2086 based on Foata normal form. 42/12229 useless extension candidates. Maximal degree in co-relation 107020. Up to 10368 conditions per place. 
[2024-06-03 22:35:36,822 INFO  L140   encePairwiseOnDemand]: 27/41 looper letters, 572 selfloop transitions, 305 changer transitions 0/880 dead transitions.
[2024-06-03 22:35:36,822 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 880 transitions, 17910 flow
[2024-06-03 22:35:36,824 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-03 22:35:36,824 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-03 22:35:36,826 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 183 transitions.
[2024-06-03 22:35:36,826 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44634146341463415
[2024-06-03 22:35:36,826 INFO  L175             Difference]: Start difference. First operand has 273 places, 740 transitions, 14535 flow. Second operand 10 states and 183 transitions.
[2024-06-03 22:35:36,826 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 880 transitions, 17910 flow
[2024-06-03 22:35:38,528 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 880 transitions, 17669 flow, removed 50 selfloop flow, removed 8 redundant places.
[2024-06-03 22:35:38,541 INFO  L231             Difference]: Finished difference. Result has 277 places, 822 transitions, 16320 flow
[2024-06-03 22:35:38,548 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=14298, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=740, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=223, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=508, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=16320, PETRI_PLACES=277, PETRI_TRANSITIONS=822}
[2024-06-03 22:35:38,548 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 235 predicate places.
[2024-06-03 22:35:38,549 INFO  L495      AbstractCegarLoop]: Abstraction has has 277 places, 822 transitions, 16320 flow
[2024-06-03 22:35:38,549 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 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-03 22:35:38,549 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:35:38,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-03 22:35:38,549 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45
[2024-06-03 22:35:38,549 INFO  L420      AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:35:38,549 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:35:38,550 INFO  L85        PathProgramCache]: Analyzing trace with hash 530865166, now seen corresponding path program 5 times
[2024-06-03 22:35:38,550 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:35:38,550 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346688787]
[2024-06-03 22:35:38,550 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:35:38,550 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:35:38,575 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:35:48,107 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:35:48,108 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:35:48,108 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346688787]
[2024-06-03 22:35:48,108 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346688787] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:35:48,108 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:35:48,108 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-03 22:35:48,108 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946805581]
[2024-06-03 22:35:48,108 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:35:48,109 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-03 22:35:48,109 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:35:48,109 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-03 22:35:48,109 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110
[2024-06-03 22:35:48,319 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-03 22:35:48,319 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 822 transitions, 16320 flow. Second operand  has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:35:48,319 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:35:48,320 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-03 22:35:48,320 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:35:53,748 INFO  L124   PetriNetUnfolderBase]: 8856/13468 cut-off events.
[2024-06-03 22:35:53,748 INFO  L125   PetriNetUnfolderBase]: For 774746/774750 co-relation queries the response was YES.
[2024-06-03 22:35:53,841 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 120538 conditions, 13468 events. 8856/13468 cut-off events. For 774746/774750 co-relation queries the response was YES. Maximal size of possible extension queue 539. Compared 84064 event pairs, 2421 based on Foata normal form. 76/13543 useless extension candidates. Maximal degree in co-relation 120404. Up to 10198 conditions per place. 
[2024-06-03 22:35:53,904 INFO  L140   encePairwiseOnDemand]: 25/41 looper letters, 678 selfloop transitions, 229 changer transitions 9/919 dead transitions.
[2024-06-03 22:35:53,904 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 919 transitions, 19514 flow
[2024-06-03 22:35:53,904 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2024-06-03 22:35:53,905 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 14 states.
[2024-06-03 22:35:53,905 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 266 transitions.
[2024-06-03 22:35:53,905 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4634146341463415
[2024-06-03 22:35:53,905 INFO  L175             Difference]: Start difference. First operand has 277 places, 822 transitions, 16320 flow. Second operand 14 states and 266 transitions.
[2024-06-03 22:35:53,905 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 290 places, 919 transitions, 19514 flow
[2024-06-03 22:35:56,034 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 287 places, 919 transitions, 19105 flow, removed 70 selfloop flow, removed 3 redundant places.
[2024-06-03 22:35:56,048 INFO  L231             Difference]: Finished difference. Result has 288 places, 826 transitions, 16516 flow
[2024-06-03 22:35:56,049 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=15922, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=822, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=221, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=600, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=16516, PETRI_PLACES=288, PETRI_TRANSITIONS=826}
[2024-06-03 22:35:56,049 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 246 predicate places.
[2024-06-03 22:35:56,050 INFO  L495      AbstractCegarLoop]: Abstraction has has 288 places, 826 transitions, 16516 flow
[2024-06-03 22:35:56,050 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:35:56,050 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:35:56,050 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:35:56,050 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46
[2024-06-03 22:35:56,050 INFO  L420      AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:35:56,050 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:35:56,051 INFO  L85        PathProgramCache]: Analyzing trace with hash 534587956, now seen corresponding path program 6 times
[2024-06-03 22:35:56,051 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:35:56,051 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156851505]
[2024-06-03 22:35:56,051 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:35:56,051 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:35:56,077 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:36:05,942 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:36:05,943 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:36:05,943 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156851505]
[2024-06-03 22:36:05,943 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156851505] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:36:05,943 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:36:05,943 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 22:36:05,943 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566921733]
[2024-06-03 22:36:05,943 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:36:05,944 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 22:36:05,944 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:36:05,944 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 22:36:05,944 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-03 22:36:06,142 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-03 22:36:06,143 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 826 transitions, 16516 flow. Second operand  has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 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-03 22:36:06,143 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:36:06,143 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-03 22:36:06,143 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:36:11,737 INFO  L124   PetriNetUnfolderBase]: 9631/14653 cut-off events.
[2024-06-03 22:36:11,738 INFO  L125   PetriNetUnfolderBase]: For 842670/842674 co-relation queries the response was YES.
[2024-06-03 22:36:12,205 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 130619 conditions, 14653 events. 9631/14653 cut-off events. For 842670/842674 co-relation queries the response was YES. Maximal size of possible extension queue 582. Compared 92845 event pairs, 3000 based on Foata normal form. 78/14730 useless extension candidates. Maximal degree in co-relation 130484. Up to 13105 conditions per place. 
[2024-06-03 22:36:12,269 INFO  L140   encePairwiseOnDemand]: 25/41 looper letters, 803 selfloop transitions, 156 changer transitions 0/962 dead transitions.
[2024-06-03 22:36:12,269 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 299 places, 962 transitions, 20807 flow
[2024-06-03 22:36:12,270 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2024-06-03 22:36:12,270 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 12 states.
[2024-06-03 22:36:12,270 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 225 transitions.
[2024-06-03 22:36:12,270 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4573170731707317
[2024-06-03 22:36:12,270 INFO  L175             Difference]: Start difference. First operand has 288 places, 826 transitions, 16516 flow. Second operand 12 states and 225 transitions.
[2024-06-03 22:36:12,271 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 299 places, 962 transitions, 20807 flow
[2024-06-03 22:36:14,599 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 962 transitions, 20466 flow, removed 43 selfloop flow, removed 7 redundant places.
[2024-06-03 22:36:14,614 INFO  L231             Difference]: Finished difference. Result has 297 places, 890 transitions, 18252 flow
[2024-06-03 22:36:14,614 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=16222, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=826, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=92, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=671, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=18252, PETRI_PLACES=297, PETRI_TRANSITIONS=890}
[2024-06-03 22:36:14,615 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 255 predicate places.
[2024-06-03 22:36:14,615 INFO  L495      AbstractCegarLoop]: Abstraction has has 297 places, 890 transitions, 18252 flow
[2024-06-03 22:36:14,615 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 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-03 22:36:14,615 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:36:14,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-03 22:36:14,615 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47
[2024-06-03 22:36:14,615 INFO  L420      AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:36:14,616 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:36:14,616 INFO  L85        PathProgramCache]: Analyzing trace with hash -180782928, now seen corresponding path program 1 times
[2024-06-03 22:36:14,616 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:36:14,616 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305786827]
[2024-06-03 22:36:14,616 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:36:14,616 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:36:14,644 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:36:24,580 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:36:24,581 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:36:24,581 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305786827]
[2024-06-03 22:36:24,581 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305786827] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:36:24,581 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:36:24,581 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 22:36:24,581 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746427398]
[2024-06-03 22:36:24,581 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:36:24,581 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 22:36:24,581 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:36:24,582 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 22:36:24,582 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-03 22:36:24,716 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-03 22:36:24,717 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 890 transitions, 18252 flow. Second operand  has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 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-03 22:36:24,717 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:36:24,717 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-03 22:36:24,717 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:36:30,517 INFO  L124   PetriNetUnfolderBase]: 9992/15186 cut-off events.
[2024-06-03 22:36:30,518 INFO  L125   PetriNetUnfolderBase]: For 858663/858668 co-relation queries the response was YES.
[2024-06-03 22:36:30,656 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 137816 conditions, 15186 events. 9992/15186 cut-off events. For 858663/858668 co-relation queries the response was YES. Maximal size of possible extension queue 600. Compared 96974 event pairs, 3402 based on Foata normal form. 40/15224 useless extension candidates. Maximal degree in co-relation 137675. Up to 13868 conditions per place. 
[2024-06-03 22:36:30,728 INFO  L140   encePairwiseOnDemand]: 25/41 looper letters, 781 selfloop transitions, 212 changer transitions 2/998 dead transitions.
[2024-06-03 22:36:30,729 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 998 transitions, 21994 flow
[2024-06-03 22:36:30,729 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-03 22:36:30,729 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-03 22:36:30,730 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 206 transitions.
[2024-06-03 22:36:30,730 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4567627494456763
[2024-06-03 22:36:30,730 INFO  L175             Difference]: Start difference. First operand has 297 places, 890 transitions, 18252 flow. Second operand 11 states and 206 transitions.
[2024-06-03 22:36:30,730 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 998 transitions, 21994 flow
[2024-06-03 22:36:33,879 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 998 transitions, 21745 flow, removed 46 selfloop flow, removed 5 redundant places.
[2024-06-03 22:36:33,894 INFO  L231             Difference]: Finished difference. Result has 306 places, 938 transitions, 19811 flow
[2024-06-03 22:36:33,895 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=18030, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=890, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=171, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=689, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=19811, PETRI_PLACES=306, PETRI_TRANSITIONS=938}
[2024-06-03 22:36:33,895 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 264 predicate places.
[2024-06-03 22:36:33,895 INFO  L495      AbstractCegarLoop]: Abstraction has has 306 places, 938 transitions, 19811 flow
[2024-06-03 22:36:33,895 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 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-03 22:36:33,895 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:36:33,895 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:36:33,896 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48
[2024-06-03 22:36:33,896 INFO  L420      AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:36:33,896 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:36:33,896 INFO  L85        PathProgramCache]: Analyzing trace with hash 1411288064, now seen corresponding path program 7 times
[2024-06-03 22:36:33,896 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:36:33,896 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078906210]
[2024-06-03 22:36:33,896 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:36:33,897 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:36:33,921 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:36:44,125 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:36:44,126 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:36:44,126 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078906210]
[2024-06-03 22:36:44,126 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078906210] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:36:44,126 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:36:44,126 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 22:36:44,126 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299286675]
[2024-06-03 22:36:44,126 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:36:44,126 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 22:36:44,127 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:36:44,127 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 22:36:44,127 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90
[2024-06-03 22:36:44,226 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-03 22:36:44,227 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 938 transitions, 19811 flow. Second operand  has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 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-03 22:36:44,227 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:36:44,227 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-03 22:36:44,227 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:36:51,577 INFO  L124   PetriNetUnfolderBase]: 10810/16542 cut-off events.
[2024-06-03 22:36:51,577 INFO  L125   PetriNetUnfolderBase]: For 1100890/1100895 co-relation queries the response was YES.
[2024-06-03 22:36:51,715 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 150921 conditions, 16542 events. 10810/16542 cut-off events. For 1100890/1100895 co-relation queries the response was YES. Maximal size of possible extension queue 632. Compared 108123 event pairs, 3583 based on Foata normal form. 158/16698 useless extension candidates. Maximal degree in co-relation 150776. Up to 14032 conditions per place. 
[2024-06-03 22:36:51,786 INFO  L140   encePairwiseOnDemand]: 25/41 looper letters, 775 selfloop transitions, 228 changer transitions 1/1007 dead transitions.
[2024-06-03 22:36:51,786 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 1007 transitions, 22706 flow
[2024-06-03 22:36:51,788 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-03 22:36:51,788 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-03 22:36:51,788 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 192 transitions.
[2024-06-03 22:36:51,789 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4682926829268293
[2024-06-03 22:36:51,789 INFO  L175             Difference]: Start difference. First operand has 306 places, 938 transitions, 19811 flow. Second operand 10 states and 192 transitions.
[2024-06-03 22:36:51,789 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 1007 transitions, 22706 flow
[2024-06-03 22:36:55,065 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 311 places, 1007 transitions, 22286 flow, removed 185 selfloop flow, removed 4 redundant places.
[2024-06-03 22:36:55,081 INFO  L231             Difference]: Finished difference. Result has 314 places, 953 transitions, 20582 flow
[2024-06-03 22:36:55,082 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=19425, PETRI_DIFFERENCE_MINUEND_PLACES=302, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=938, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=212, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=711, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=20582, PETRI_PLACES=314, PETRI_TRANSITIONS=953}
[2024-06-03 22:36:55,082 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 272 predicate places.
[2024-06-03 22:36:55,082 INFO  L495      AbstractCegarLoop]: Abstraction has has 314 places, 953 transitions, 20582 flow
[2024-06-03 22:36:55,082 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 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-03 22:36:55,083 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:36:55,083 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:36:55,083 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49
[2024-06-03 22:36:55,083 INFO  L420      AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:36:55,083 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:36:55,083 INFO  L85        PathProgramCache]: Analyzing trace with hash 1411503266, now seen corresponding path program 2 times
[2024-06-03 22:36:55,083 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:36:55,083 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947113994]
[2024-06-03 22:36:55,084 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:36:55,084 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:36:55,111 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:37:05,128 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:37:05,129 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:37:05,129 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947113994]
[2024-06-03 22:37:05,129 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947113994] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:37:05,129 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:37:05,129 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-03 22:37:05,129 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41506477]
[2024-06-03 22:37:05,129 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:37:05,129 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-03 22:37:05,130 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:37:05,130 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-03 22:37:05,130 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110
[2024-06-03 22:37:05,276 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-03 22:37:05,276 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 314 places, 953 transitions, 20582 flow. Second operand  has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:37:05,276 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:37:05,277 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-03 22:37:05,277 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand