./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe021_power.opt_pso.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/safe021_power.opt_pso.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/safe021_power.opt_pso.opt.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/safe021_power.opt_pso.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:37:22,608 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-06-03 22:37:22,686 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-06-03 22:37:22,690 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-06-03 22:37:22,690 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-06-03 22:37:22,738 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-06-03 22:37:22,740 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-06-03 22:37:22,740 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-06-03 22:37:22,740 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-06-03 22:37:22,743 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-06-03 22:37:22,743 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-06-03 22:37:22,743 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-06-03 22:37:22,744 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-06-03 22:37:22,745 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-06-03 22:37:22,745 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-06-03 22:37:22,745 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-06-03 22:37:22,746 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-06-03 22:37:22,746 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-06-03 22:37:22,746 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-06-03 22:37:22,746 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-06-03 22:37:22,746 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-06-03 22:37:22,746 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-06-03 22:37:22,747 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-06-03 22:37:22,747 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-06-03 22:37:22,747 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-06-03 22:37:22,747 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-06-03 22:37:22,747 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-06-03 22:37:22,747 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-06-03 22:37:22,748 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-06-03 22:37:22,748 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-06-03 22:37:22,749 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-06-03 22:37:22,749 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-06-03 22:37:22,749 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-06-03 22:37:22,749 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-06-03 22:37:22,749 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-06-03 22:37:22,749 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-06-03 22:37:22,749 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-06-03 22:37:22,749 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-06-03 22:37:22,749 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-06-03 22:37:22,749 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-06-03 22:37:22,750 INFO  L153        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-06-03 22:37:22,750 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-06-03 22:37:22,750 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-06-03 22:37:22,750 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:37:22,920 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-06-03 22:37:22,940 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-06-03 22:37:22,942 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-06-03 22:37:22,943 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-06-03 22:37:22,943 INFO  L274        PluginConnector]: CDTParser initialized
[2024-06-03 22:37:22,944 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe021_power.opt_pso.opt.i
[2024-06-03 22:37:24,058 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-06-03 22:37:24,376 INFO  L384              CDTParser]: Found 1 translation units.
[2024-06-03 22:37:24,376 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe021_power.opt_pso.opt.i
[2024-06-03 22:37:24,393 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b1dc119f/1f020884a3af48618801ccd8749f9b78/FLAGd6cab32b9
[2024-06-03 22:37:24,404 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b1dc119f/1f020884a3af48618801ccd8749f9b78
[2024-06-03 22:37:24,412 INFO  L270        PluginConnector]: Initializing Witness Parser...
[2024-06-03 22:37:24,422 INFO  L274        PluginConnector]: Witness Parser initialized
[2024-06-03 22:37:24,424 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/safe021_power.opt_pso.opt.yml/witness.yml
[2024-06-03 22:37:24,655 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-06-03 22:37:24,657 INFO  L133        ToolchainWalker]: Walking toolchain with 5 elements.
[2024-06-03 22:37:24,657 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-06-03 22:37:24,658 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-06-03 22:37:24,661 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-06-03 22:37:24,662 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.06 10:37:24" (1/2) ...
[2024-06-03 22:37:24,662 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a95b11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:37:24, skipping insertion in model container
[2024-06-03 22:37:24,662 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.06 10:37:24" (1/2) ...
[2024-06-03 22:37:24,664 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@1f7fe7cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:37:24, skipping insertion in model container
[2024-06-03 22:37:24,664 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 10:37:24" (2/2) ...
[2024-06-03 22:37:24,664 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a95b11 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:37:24, skipping insertion in model container
[2024-06-03 22:37:24,664 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 10:37:24" (2/2) ...
[2024-06-03 22:37:24,664 INFO  L83    nessWitnessExtractor]: Extracting all invariants from correctness witness
[2024-06-03 22:37:24,731 INFO  L95    edCorrectnessWitness]: Found the following entries in the witness:
[2024-06-03 22:37:24,733 INFO  L97    edCorrectnessWitness]: Location invariant before [L825-L825] ((((((((((((((((((! multithreaded || x$r_buff1_thd3 == (_Bool)0) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p2_EBX) + (long long )z >= 0LL && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )z >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )y >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )x$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )x$flush_delayed >= 0LL) && (long long )x + (long long )x$mem_tmp >= 0LL) && (long long )x + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x + (long long )x$read_delayed >= 0LL) && (long long )x + (long long )x$w_buff0 >= 0LL) && (long long )x + (long long )x$w_buff1 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )x$flush_delayed + (long long )x$mem_tmp >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$flush_delayed + (long long )y >= 0LL) && (long long )x$flush_delayed + (long long )z >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff0 >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff1 >= 0LL) && (long long )x$mem_tmp + (long long )y >= 0LL) && (long long )x$mem_tmp + (long long )z >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )y >= 0LL) && (long long )x$r_buff0_thd0 + (long long )z >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )y >= 0LL) && (long long )x$r_buff0_thd1 + (long long )z >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )y >= 0LL) && (long long )x$r_buff0_thd2 + (long long )z >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )y >= 0LL) && (long long )x$r_buff0_thd3 + (long long )z >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )y >= 0LL) && (long long )x$r_buff1_thd0 + (long long )z >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )y >= 0LL) && (long long )x$r_buff1_thd1 + (long long )z >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )y >= 0LL) && (long long )x$r_buff1_thd2 + (long long )z >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )y >= 0LL) && (long long )x$r_buff1_thd3 + (long long )z >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$read_delayed + (long long )y >= 0LL) && (long long )x$read_delayed + (long long )z >= 0LL) && (long long )x$w_buff0 + (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 + (long long )y >= 0LL) && (long long )x$w_buff0 + (long long )z >= 0LL) && (long long )x$w_buff1 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )z >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )z >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z >= 0LL) && (1LL + (long long )x) - (long long )z >= 0LL) && (1LL + (long long )x$flush_delayed) - (long long )z >= 0LL) && (1LL + (long long )x$mem_tmp) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd0) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd2) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd3) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd2) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd3) - (long long )z >= 0LL) && (1LL + (long long )x$read_delayed) - (long long )z >= 0LL) && (1LL + (long long )x$w_buff0) - (long long )z >= 0LL) && (1LL + (long long )x$w_buff1) - (long long )z >= 0LL) && (1LL + (long long )y) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )x$r_buff0_thd0) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff0_thd3) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd3) - (long long )z >= 0LL) && (1LL - (long long )x$read_delayed) - (long long )z >= 0LL) && (2LL - (long long )__unbuffered_p2_EBX) - (long long )z >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$read_delayed >= 0LL) && (long long )x - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x - (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$read_delayed >= 0LL))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && 0 <= z) && __unbuffered_p2_EAX <= 1) && __unbuffered_p2_EBX <= 1) && x$w_buff0 <= 127) && x$w_buff1 <= 127) && y <= 1) && z <= 1) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff0_thd3 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$r_buff1_thd3 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && x$w_buff0 % 2 == 0) && x$w_buff1 % 2 == 0) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 2)) && (x$w_buff1 == 0 || x$w_buff1 == 2)) && (y == 0 || y == 1)) && (z == 0 || z == 1)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || (0 <= x$mem_tmp && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || (((0 <= x$w_buff0 && x$w_buff0 <= 127) && x$w_buff0 % 2 == 0) && (x$w_buff0 == 0 || x$w_buff0 == 2)))) && (! multithreaded || (0 <= x && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || (((0 <= x$w_buff1 && x$w_buff1 <= 127) && x$w_buff1 % 2 == 0) && (x$w_buff1 == 0 || x$w_buff1 == 2)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))
[2024-06-03 22:37:24,733 INFO  L97    edCorrectnessWitness]: Location invariant before [L823-L823] ((((((((((((((((((! multithreaded || x$r_buff1_thd3 == (_Bool)0) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p2_EBX) + (long long )z >= 0LL && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )z >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )y >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )x$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )x$flush_delayed >= 0LL) && (long long )x + (long long )x$mem_tmp >= 0LL) && (long long )x + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x + (long long )x$read_delayed >= 0LL) && (long long )x + (long long )x$w_buff0 >= 0LL) && (long long )x + (long long )x$w_buff1 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )x$flush_delayed + (long long )x$mem_tmp >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$flush_delayed + (long long )y >= 0LL) && (long long )x$flush_delayed + (long long )z >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff0 >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff1 >= 0LL) && (long long )x$mem_tmp + (long long )y >= 0LL) && (long long )x$mem_tmp + (long long )z >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )y >= 0LL) && (long long )x$r_buff0_thd0 + (long long )z >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )y >= 0LL) && (long long )x$r_buff0_thd1 + (long long )z >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )y >= 0LL) && (long long )x$r_buff0_thd2 + (long long )z >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )y >= 0LL) && (long long )x$r_buff0_thd3 + (long long )z >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )y >= 0LL) && (long long )x$r_buff1_thd0 + (long long )z >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )y >= 0LL) && (long long )x$r_buff1_thd1 + (long long )z >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )y >= 0LL) && (long long )x$r_buff1_thd2 + (long long )z >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )y >= 0LL) && (long long )x$r_buff1_thd3 + (long long )z >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$read_delayed + (long long )y >= 0LL) && (long long )x$read_delayed + (long long )z >= 0LL) && (long long )x$w_buff0 + (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 + (long long )y >= 0LL) && (long long )x$w_buff0 + (long long )z >= 0LL) && (long long )x$w_buff1 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )z >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )z >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z >= 0LL) && (1LL + (long long )x) - (long long )z >= 0LL) && (1LL + (long long )x$flush_delayed) - (long long )z >= 0LL) && (1LL + (long long )x$mem_tmp) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd0) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd2) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd3) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd2) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd3) - (long long )z >= 0LL) && (1LL + (long long )x$read_delayed) - (long long )z >= 0LL) && (1LL + (long long )x$w_buff0) - (long long )z >= 0LL) && (1LL + (long long )x$w_buff1) - (long long )z >= 0LL) && (1LL + (long long )y) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )x$r_buff0_thd0) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff0_thd3) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd3) - (long long )z >= 0LL) && (1LL - (long long )x$read_delayed) - (long long )z >= 0LL) && (2LL - (long long )__unbuffered_p2_EBX) - (long long )z >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$read_delayed >= 0LL) && (long long )x - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x - (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$read_delayed >= 0LL))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && 0 <= z) && __unbuffered_p2_EAX <= 1) && __unbuffered_p2_EBX <= 1) && x$w_buff0 <= 127) && x$w_buff1 <= 127) && y <= 1) && z <= 1) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff0_thd3 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$r_buff1_thd3 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && x$w_buff0 % 2 == 0) && x$w_buff1 % 2 == 0) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 2)) && (x$w_buff1 == 0 || x$w_buff1 == 2)) && (y == 0 || y == 1)) && (z == 0 || z == 1)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || (0 <= x$mem_tmp && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || (((0 <= x$w_buff0 && x$w_buff0 <= 127) && x$w_buff0 % 2 == 0) && (x$w_buff0 == 0 || x$w_buff0 == 2)))) && (! multithreaded || (0 <= x && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || (((0 <= x$w_buff1 && x$w_buff1 <= 127) && x$w_buff1 % 2 == 0) && (x$w_buff1 == 0 || x$w_buff1 == 2)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))
[2024-06-03 22:37:24,734 INFO  L97    edCorrectnessWitness]: Location invariant before [L826-L826] ((((((((((((((((((! multithreaded || x$r_buff1_thd3 == (_Bool)0) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p2_EBX) + (long long )z >= 0LL && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )z >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )y >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )x$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )x$flush_delayed >= 0LL) && (long long )x + (long long )x$mem_tmp >= 0LL) && (long long )x + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x + (long long )x$read_delayed >= 0LL) && (long long )x + (long long )x$w_buff0 >= 0LL) && (long long )x + (long long )x$w_buff1 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )x$flush_delayed + (long long )x$mem_tmp >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$flush_delayed + (long long )y >= 0LL) && (long long )x$flush_delayed + (long long )z >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff0 >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff1 >= 0LL) && (long long )x$mem_tmp + (long long )y >= 0LL) && (long long )x$mem_tmp + (long long )z >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )y >= 0LL) && (long long )x$r_buff0_thd0 + (long long )z >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )y >= 0LL) && (long long )x$r_buff0_thd1 + (long long )z >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )y >= 0LL) && (long long )x$r_buff0_thd2 + (long long )z >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )y >= 0LL) && (long long )x$r_buff0_thd3 + (long long )z >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )y >= 0LL) && (long long )x$r_buff1_thd0 + (long long )z >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )y >= 0LL) && (long long )x$r_buff1_thd1 + (long long )z >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )y >= 0LL) && (long long )x$r_buff1_thd2 + (long long )z >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )y >= 0LL) && (long long )x$r_buff1_thd3 + (long long )z >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$read_delayed + (long long )y >= 0LL) && (long long )x$read_delayed + (long long )z >= 0LL) && (long long )x$w_buff0 + (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 + (long long )y >= 0LL) && (long long )x$w_buff0 + (long long )z >= 0LL) && (long long )x$w_buff1 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )z >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )z >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z >= 0LL) && (1LL + (long long )x) - (long long )z >= 0LL) && (1LL + (long long )x$flush_delayed) - (long long )z >= 0LL) && (1LL + (long long )x$mem_tmp) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd0) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd2) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff0_thd3) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd2) - (long long )z >= 0LL) && (1LL + (long long )x$r_buff1_thd3) - (long long )z >= 0LL) && (1LL + (long long )x$read_delayed) - (long long )z >= 0LL) && (1LL + (long long )x$w_buff0) - (long long )z >= 0LL) && (1LL + (long long )x$w_buff1) - (long long )z >= 0LL) && (1LL + (long long )y) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )x$r_buff0_thd0) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff0_thd1) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff0_thd3) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd0) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd1) - (long long )z >= 0LL) && (1LL - (long long )x$r_buff1_thd3) - (long long )z >= 0LL) && (1LL - (long long )x$read_delayed) - (long long )z >= 0LL) && (2LL - (long long )__unbuffered_p2_EBX) - (long long )z >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$read_delayed >= 0LL) && (long long )x - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x - (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$read_delayed >= 0LL))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && 0 <= z) && __unbuffered_p2_EAX <= 1) && __unbuffered_p2_EBX <= 1) && x$w_buff0 <= 127) && x$w_buff1 <= 127) && y <= 1) && z <= 1) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff0_thd3 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$r_buff1_thd3 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && x$w_buff0 % 2 == 0) && x$w_buff1 % 2 == 0) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 2)) && (x$w_buff1 == 0 || x$w_buff1 == 2)) && (y == 0 || y == 1)) && (z == 0 || z == 1)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || (0 <= x$mem_tmp && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || (((0 <= x$w_buff0 && x$w_buff0 <= 127) && x$w_buff0 % 2 == 0) && (x$w_buff0 == 0 || x$w_buff0 == 2)))) && (! multithreaded || (0 <= x && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || (((0 <= x$w_buff1 && x$w_buff1 <= 127) && x$w_buff1 % 2 == 0) && (x$w_buff1 == 0 || x$w_buff1 == 2)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))
[2024-06-03 22:37:24,734 INFO  L103   edCorrectnessWitness]: ghost_variable multithreaded = 0
[2024-06-03 22:37:24,735 INFO  L106   edCorrectnessWitness]: ghost_update [L821-L821] multithreaded = 1;
[2024-06-03 22:37:24,774 INFO  L177         MainTranslator]: Built tables and reachable declarations
[2024-06-03 22:37:25,087 INFO  L207          PostProcessor]: Analyzing one entry point: main
[2024-06-03 22:37:25,096 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:37:25,427 INFO  L207          PostProcessor]: Analyzing one entry point: main
[2024-06-03 22:37:25,454 INFO  L206         MainTranslator]: Completed translation
[2024-06-03 22:37:25,454 INFO  L201        PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:37:25 WrapperNode
[2024-06-03 22:37:25,454 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-06-03 22:37:25,455 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-06-03 22:37:25,455 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-06-03 22:37:25,455 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-06-03 22:37:25,460 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:37:25" (1/1) ...
[2024-06-03 22:37:25,500 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:37:25" (1/1) ...
[2024-06-03 22:37:25,581 INFO  L138                Inliner]: procedures = 175, calls = 43, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 144
[2024-06-03 22:37:25,582 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-06-03 22:37:25,583 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-06-03 22:37:25,583 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-06-03 22:37:25,583 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-06-03 22:37:25,591 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:37:25" (1/1) ...
[2024-06-03 22:37:25,592 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:37:25" (1/1) ...
[2024-06-03 22:37:25,623 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:37:25" (1/1) ...
[2024-06-03 22:37:25,667 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:37:25,668 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:37:25" (1/1) ...
[2024-06-03 22:37:25,668 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:37:25" (1/1) ...
[2024-06-03 22:37:25,697 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:37:25" (1/1) ...
[2024-06-03 22:37:25,699 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:37:25" (1/1) ...
[2024-06-03 22:37:25,710 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:37:25" (1/1) ...
[2024-06-03 22:37:25,716 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:37:25" (1/1) ...
[2024-06-03 22:37:25,732 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-06-03 22:37:25,732 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-06-03 22:37:25,733 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-06-03 22:37:25,733 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-06-03 22:37:25,734 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:37:25" (1/1) ...
[2024-06-03 22:37:25,738 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-06-03 22:37:25,745 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-06-03 22:37:25,758 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:37:25,776 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:37:25,792 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2024-06-03 22:37:25,792 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-06-03 22:37:25,793 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2024-06-03 22:37:25,793 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2024-06-03 22:37:25,793 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2024-06-03 22:37:25,794 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2024-06-03 22:37:25,794 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2024-06-03 22:37:25,794 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2024-06-03 22:37:25,794 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-06-03 22:37:25,794 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2024-06-03 22:37:25,794 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-06-03 22:37:25,795 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-06-03 22:37:25,796 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:37:25,915 INFO  L244             CfgBuilder]: Building ICFG
[2024-06-03 22:37:25,918 INFO  L270             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-06-03 22:37:27,365 INFO  L289             CfgBuilder]: Ommited future-live optimization because the input is a concurrent program.
[2024-06-03 22:37:27,367 INFO  L293             CfgBuilder]: Performing block encoding
[2024-06-03 22:37:27,614 INFO  L315             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-06-03 22:37:27,614 INFO  L320             CfgBuilder]: Removed 0 assume(true) statements.
[2024-06-03 22:37:27,615 INFO  L201        PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.06 10:37:27 BoogieIcfgContainer
[2024-06-03 22:37:27,615 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-06-03 22:37:27,617 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-06-03 22:37:27,618 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-06-03 22:37:27,620 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-06-03 22:37:27,620 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.06 10:37:24" (1/4) ...
[2024-06-03 22:37:27,621 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@294d1034 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.06 10:37:27, skipping insertion in model container
[2024-06-03 22:37:27,621 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 10:37:24" (2/4) ...
[2024-06-03 22:37:27,622 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@294d1034 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 03.06 10:37:27, skipping insertion in model container
[2024-06-03 22:37:27,622 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:37:25" (3/4) ...
[2024-06-03 22:37:27,622 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@294d1034 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 03.06 10:37:27, skipping insertion in model container
[2024-06-03 22:37:27,622 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.06 10:37:27" (4/4) ...
[2024-06-03 22:37:27,623 INFO  L112   eAbstractionObserver]: Analyzing ICFG safe021_power.opt_pso.opt.i
[2024-06-03 22:37:27,636 INFO  L204   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-06-03 22:37:27,637 INFO  L163   ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations.
[2024-06-03 22:37:27,637 INFO  L522   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-06-03 22:37:27,739 INFO  L144    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-06-03 22:37:27,766 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 51 places, 41 transitions, 94 flow
[2024-06-03 22:37:27,831 INFO  L124   PetriNetUnfolderBase]: 0/38 cut-off events.
[2024-06-03 22:37:27,832 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-06-03 22:37:27,833 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 64 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:37:27,833 INFO  L82        GeneralOperation]: Start removeDead. Operand has 51 places, 41 transitions, 94 flow
[2024-06-03 22:37:27,870 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 42 places, 32 transitions, 73 flow
[2024-06-03 22:37:27,882 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-06-03 22:37:27,902 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;@3b0cf30d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-06-03 22:37:27,903 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2024-06-03 22:37:27,911 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-06-03 22:37:27,911 INFO  L124   PetriNetUnfolderBase]: 0/6 cut-off events.
[2024-06-03 22:37:27,911 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-06-03 22:37:27,912 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:37:27,912 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1]
[2024-06-03 22:37:27,920 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:37:27,924 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:37:27,925 INFO  L85        PathProgramCache]: Analyzing trace with hash -1322398027, now seen corresponding path program 1 times
[2024-06-03 22:37:27,931 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:37:27,931 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958583512]
[2024-06-03 22:37:27,932 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:37:27,932 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:37:28,331 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:37:33,292 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:33,293 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:37:33,293 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958583512]
[2024-06-03 22:37:33,294 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958583512] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:37:33,294 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:37:33,294 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-06-03 22:37:33,295 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620884140]
[2024-06-03 22:37:33,296 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:37:33,303 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-06-03 22:37:33,306 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:37:33,330 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-06-03 22:37:33,330 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-06-03 22:37:33,395 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41
[2024-06-03 22:37:33,397 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 73 flow. Second operand  has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states 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:33,398 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:37:33,398 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41
[2024-06-03 22:37:33,399 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:37:34,231 INFO  L124   PetriNetUnfolderBase]: 1152/1756 cut-off events.
[2024-06-03 22:37:34,231 INFO  L125   PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES.
[2024-06-03 22:37:34,236 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 3598 conditions, 1756 events. 1152/1756 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 8215 event pairs, 693 based on Foata normal form. 2/1710 useless extension candidates. Maximal degree in co-relation 3583. Up to 1738 conditions per place. 
[2024-06-03 22:37:34,243 INFO  L140   encePairwiseOnDemand]: 34/41 looper letters, 34 selfloop transitions, 4 changer transitions 0/43 dead transitions.
[2024-06-03 22:37:34,243 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 43 transitions, 177 flow
[2024-06-03 22:37:34,244 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-06-03 22:37:34,246 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-06-03 22:37:34,251 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions.
[2024-06-03 22:37:34,252 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5772357723577236
[2024-06-03 22:37:34,254 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:37:34,254 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 43 transitions, 177 flow
[2024-06-03 22:37:34,256 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 43 transitions, 172 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-06-03 22:37:34,258 INFO  L231             Difference]: Finished difference. Result has 42 places, 35 transitions, 100 flow
[2024-06-03 22:37:34,259 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:37:34,261 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 0 predicate places.
[2024-06-03 22:37:34,262 INFO  L495      AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 100 flow
[2024-06-03 22:37:34,262 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states 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:34,262 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:37:34,262 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:37:34,262 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-06-03 22:37:34,263 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:37:34,263 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:37:34,263 INFO  L85        PathProgramCache]: Analyzing trace with hash 485861844, now seen corresponding path program 1 times
[2024-06-03 22:37:34,264 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:37:34,264 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628190633]
[2024-06-03 22:37:34,264 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:37:34,264 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:37:34,317 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:37:38,340 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:38,340 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:37:38,341 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628190633]
[2024-06-03 22:37:38,341 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628190633] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:37:38,341 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:37:38,341 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-06-03 22:37:38,341 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84641791]
[2024-06-03 22:37:38,342 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:37:38,343 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-06-03 22:37:38,343 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:37:38,344 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-06-03 22:37:38,344 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-06-03 22:37:38,425 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41
[2024-06-03 22:37:38,425 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:37:38,425 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:37:38,425 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41
[2024-06-03 22:37:38,425 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:37:39,250 INFO  L124   PetriNetUnfolderBase]: 1395/2102 cut-off events.
[2024-06-03 22:37:39,250 INFO  L125   PetriNetUnfolderBase]: For 316/316 co-relation queries the response was YES.
[2024-06-03 22:37:39,253 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4856 conditions, 2102 events. 1395/2102 cut-off events. For 316/316 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 9499 event pairs, 862 based on Foata normal form. 3/2102 useless extension candidates. Maximal degree in co-relation 4841. Up to 2073 conditions per place. 
[2024-06-03 22:37:39,259 INFO  L140   encePairwiseOnDemand]: 33/41 looper letters, 44 selfloop transitions, 7 changer transitions 0/55 dead transitions.
[2024-06-03 22:37:39,259 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 55 transitions, 258 flow
[2024-06-03 22:37:39,260 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-06-03 22:37:39,260 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-06-03 22:37:39,261 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions.
[2024-06-03 22:37:39,261 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5304878048780488
[2024-06-03 22:37:39,261 INFO  L175             Difference]: Start difference. First operand has 42 places, 35 transitions, 100 flow. Second operand 4 states and 87 transitions.
[2024-06-03 22:37:39,261 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 55 transitions, 258 flow
[2024-06-03 22:37:39,262 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 55 transitions, 252 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-06-03 22:37:39,263 INFO  L231             Difference]: Finished difference. Result has 46 places, 41 transitions, 152 flow
[2024-06-03 22:37:39,264 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=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=152, PETRI_PLACES=46, PETRI_TRANSITIONS=41}
[2024-06-03 22:37:39,264 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 4 predicate places.
[2024-06-03 22:37:39,264 INFO  L495      AbstractCegarLoop]: Abstraction has has 46 places, 41 transitions, 152 flow
[2024-06-03 22:37:39,264 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:37:39,265 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:37:39,265 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:37:39,265 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-06-03 22:37:39,265 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:37:39,265 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:37:39,266 INFO  L85        PathProgramCache]: Analyzing trace with hash -2118150516, now seen corresponding path program 1 times
[2024-06-03 22:37:39,266 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:37:39,266 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917856511]
[2024-06-03 22:37:39,266 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:37:39,266 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:37:39,329 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:37:42,846 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:42,846 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:37:42,846 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917856511]
[2024-06-03 22:37:42,847 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917856511] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:37:42,847 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:37:42,847 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-06-03 22:37:42,847 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739712426]
[2024-06-03 22:37:42,848 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:37:42,848 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-06-03 22:37:42,848 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:37:42,849 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-06-03 22:37:42,849 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20
[2024-06-03 22:37:42,967 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41
[2024-06-03 22:37:42,967 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 41 transitions, 152 flow. Second operand  has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states 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:42,967 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:37:42,967 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41
[2024-06-03 22:37:42,967 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:37:43,766 INFO  L124   PetriNetUnfolderBase]: 1383/2084 cut-off events.
[2024-06-03 22:37:43,767 INFO  L125   PetriNetUnfolderBase]: For 1050/1058 co-relation queries the response was YES.
[2024-06-03 22:37:43,769 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5363 conditions, 2084 events. 1383/2084 cut-off events. For 1050/1058 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 9456 event pairs, 612 based on Foata normal form. 12/2093 useless extension candidates. Maximal degree in co-relation 5345. Up to 2025 conditions per place. 
[2024-06-03 22:37:43,777 INFO  L140   encePairwiseOnDemand]: 32/41 looper letters, 52 selfloop transitions, 10 changer transitions 0/66 dead transitions.
[2024-06-03 22:37:43,777 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 66 transitions, 344 flow
[2024-06-03 22:37:43,778 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-03 22:37:43,778 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-03 22:37:43,781 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 107 transitions.
[2024-06-03 22:37:43,782 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5219512195121951
[2024-06-03 22:37:43,782 INFO  L175             Difference]: Start difference. First operand has 46 places, 41 transitions, 152 flow. Second operand 5 states and 107 transitions.
[2024-06-03 22:37:43,783 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 66 transitions, 344 flow
[2024-06-03 22:37:43,785 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 66 transitions, 342 flow, removed 1 selfloop flow, removed 0 redundant places.
[2024-06-03 22:37:43,786 INFO  L231             Difference]: Finished difference. Result has 51 places, 44 transitions, 198 flow
[2024-06-03 22:37:43,786 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=198, PETRI_PLACES=51, PETRI_TRANSITIONS=44}
[2024-06-03 22:37:43,787 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 9 predicate places.
[2024-06-03 22:37:43,788 INFO  L495      AbstractCegarLoop]: Abstraction has has 51 places, 44 transitions, 198 flow
[2024-06-03 22:37:43,788 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states 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:43,788 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:37:43,788 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:37:43,788 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-06-03 22:37:43,788 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:37:43,789 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:37:43,789 INFO  L85        PathProgramCache]: Analyzing trace with hash 271901579, now seen corresponding path program 1 times
[2024-06-03 22:37:43,789 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:37:43,789 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533374244]
[2024-06-03 22:37:43,790 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:37:43,790 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:37:43,867 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:37:48,277 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:48,277 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:37:48,277 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533374244]
[2024-06-03 22:37:48,277 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533374244] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:37:48,277 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:37:48,278 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-03 22:37:48,278 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559373848]
[2024-06-03 22:37:48,278 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:37:48,278 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-03 22:37:48,278 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:37:48,279 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-03 22:37:48,279 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-06-03 22:37:48,368 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41
[2024-06-03 22:37:48,369 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 44 transitions, 198 flow. Second operand  has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 0 states 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:48,369 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:37:48,369 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41
[2024-06-03 22:37:48,369 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:37:49,296 INFO  L124   PetriNetUnfolderBase]: 1374/2069 cut-off events.
[2024-06-03 22:37:49,296 INFO  L125   PetriNetUnfolderBase]: For 1912/1920 co-relation queries the response was YES.
[2024-06-03 22:37:49,300 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5862 conditions, 2069 events. 1374/2069 cut-off events. For 1912/1920 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 9306 event pairs, 472 based on Foata normal form. 12/2078 useless extension candidates. Maximal degree in co-relation 5841. Up to 1980 conditions per place. 
[2024-06-03 22:37:49,307 INFO  L140   encePairwiseOnDemand]: 32/41 looper letters, 56 selfloop transitions, 12 changer transitions 0/72 dead transitions.
[2024-06-03 22:37:49,308 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 72 transitions, 408 flow
[2024-06-03 22:37:49,310 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-03 22:37:49,310 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-03 22:37:49,310 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 122 transitions.
[2024-06-03 22:37:49,310 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4959349593495935
[2024-06-03 22:37:49,311 INFO  L175             Difference]: Start difference. First operand has 51 places, 44 transitions, 198 flow. Second operand 6 states and 122 transitions.
[2024-06-03 22:37:49,311 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 72 transitions, 408 flow
[2024-06-03 22:37:49,313 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 72 transitions, 386 flow, removed 3 selfloop flow, removed 3 redundant places.
[2024-06-03 22:37:49,314 INFO  L231             Difference]: Finished difference. Result has 53 places, 45 transitions, 217 flow
[2024-06-03 22:37:49,314 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=217, PETRI_PLACES=53, PETRI_TRANSITIONS=45}
[2024-06-03 22:37:49,315 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 11 predicate places.
[2024-06-03 22:37:49,315 INFO  L495      AbstractCegarLoop]: Abstraction has has 53 places, 45 transitions, 217 flow
[2024-06-03 22:37:49,315 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 0 states 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:49,316 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:37:49,316 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:37:49,316 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-06-03 22:37:49,316 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:37:49,316 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:37:49,317 INFO  L85        PathProgramCache]: Analyzing trace with hash -713409677, now seen corresponding path program 1 times
[2024-06-03 22:37:49,317 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:37:49,317 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600290077]
[2024-06-03 22:37:49,317 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:37:49,317 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:37:49,354 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:37:56,108 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:56,108 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:37:56,108 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600290077]
[2024-06-03 22:37:56,109 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600290077] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:37:56,109 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:37:56,109 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-06-03 22:37:56,109 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749717838]
[2024-06-03 22:37:56,109 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:37:56,109 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-06-03 22:37:56,110 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:37:56,110 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-06-03 22:37:56,110 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2024-06-03 22:37:56,195 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41
[2024-06-03 22:37:56,196 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 45 transitions, 217 flow. Second operand  has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states 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:56,196 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:37:56,196 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41
[2024-06-03 22:37:56,196 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:37:57,025 INFO  L124   PetriNetUnfolderBase]: 1237/1891 cut-off events.
[2024-06-03 22:37:57,025 INFO  L125   PetriNetUnfolderBase]: For 2911/2935 co-relation queries the response was YES.
[2024-06-03 22:37:57,030 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5650 conditions, 1891 events. 1237/1891 cut-off events. For 2911/2935 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 8755 event pairs, 586 based on Foata normal form. 4/1825 useless extension candidates. Maximal degree in co-relation 5628. Up to 1810 conditions per place. 
[2024-06-03 22:37:57,037 INFO  L140   encePairwiseOnDemand]: 33/41 looper letters, 42 selfloop transitions, 10 changer transitions 0/61 dead transitions.
[2024-06-03 22:37:57,037 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 61 transitions, 363 flow
[2024-06-03 22:37:57,037 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-03 22:37:57,038 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-03 22:37:57,038 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 92 transitions.
[2024-06-03 22:37:57,038 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44878048780487806
[2024-06-03 22:37:57,038 INFO  L175             Difference]: Start difference. First operand has 53 places, 45 transitions, 217 flow. Second operand 5 states and 92 transitions.
[2024-06-03 22:37:57,038 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 61 transitions, 363 flow
[2024-06-03 22:37:57,041 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 61 transitions, 332 flow, removed 5 selfloop flow, removed 4 redundant places.
[2024-06-03 22:37:57,042 INFO  L231             Difference]: Finished difference. Result has 54 places, 48 transitions, 231 flow
[2024-06-03 22:37:57,043 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=231, PETRI_PLACES=54, PETRI_TRANSITIONS=48}
[2024-06-03 22:37:57,043 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 12 predicate places.
[2024-06-03 22:37:57,043 INFO  L495      AbstractCegarLoop]: Abstraction has has 54 places, 48 transitions, 231 flow
[2024-06-03 22:37:57,043 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states 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:57,044 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:37:57,044 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:37:57,044 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-06-03 22:37:57,044 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:37:57,044 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:37:57,044 INFO  L85        PathProgramCache]: Analyzing trace with hash -674824427, now seen corresponding path program 1 times
[2024-06-03 22:37:57,045 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:37:57,045 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822794663]
[2024-06-03 22:37:57,045 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:37:57,045 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:37:57,094 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:38:03,151 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:38:03,151 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:38:03,151 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822794663]
[2024-06-03 22:38:03,152 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822794663] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:38:03,152 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:38:03,152 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-03 22:38:03,152 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885025594]
[2024-06-03 22:38:03,153 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:38:03,154 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-03 22:38:03,154 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:38:03,154 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-03 22:38:03,154 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2024-06-03 22:38:03,296 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41
[2024-06-03 22:38:03,296 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 48 transitions, 231 flow. Second operand  has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states 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:38:03,296 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:38:03,296 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41
[2024-06-03 22:38:03,297 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:38:04,279 INFO  L124   PetriNetUnfolderBase]: 1468/2237 cut-off events.
[2024-06-03 22:38:04,280 INFO  L125   PetriNetUnfolderBase]: For 4395/4415 co-relation queries the response was YES.
[2024-06-03 22:38:04,283 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7066 conditions, 2237 events. 1468/2237 cut-off events. For 4395/4415 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 10539 event pairs, 721 based on Foata normal form. 2/2202 useless extension candidates. Maximal degree in co-relation 7042. Up to 2137 conditions per place. 
[2024-06-03 22:38:04,291 INFO  L140   encePairwiseOnDemand]: 32/41 looper letters, 53 selfloop transitions, 11 changer transitions 0/72 dead transitions.
[2024-06-03 22:38:04,291 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 72 transitions, 443 flow
[2024-06-03 22:38:04,291 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-03 22:38:04,291 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-03 22:38:04,292 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 101 transitions.
[2024-06-03 22:38:04,292 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4105691056910569
[2024-06-03 22:38:04,292 INFO  L175             Difference]: Start difference. First operand has 54 places, 48 transitions, 231 flow. Second operand 6 states and 101 transitions.
[2024-06-03 22:38:04,292 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 72 transitions, 443 flow
[2024-06-03 22:38:04,294 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 72 transitions, 417 flow, removed 3 selfloop flow, removed 3 redundant places.
[2024-06-03 22:38:04,295 INFO  L231             Difference]: Finished difference. Result has 59 places, 57 transitions, 303 flow
[2024-06-03 22:38:04,295 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=303, PETRI_PLACES=59, PETRI_TRANSITIONS=57}
[2024-06-03 22:38:04,296 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 17 predicate places.
[2024-06-03 22:38:04,296 INFO  L495      AbstractCegarLoop]: Abstraction has has 59 places, 57 transitions, 303 flow
[2024-06-03 22:38:04,296 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states 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:38:04,296 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:38:04,296 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:38:04,297 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-06-03 22:38:04,297 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:38:04,297 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:38:04,297 INFO  L85        PathProgramCache]: Analyzing trace with hash 549558238, now seen corresponding path program 1 times
[2024-06-03 22:38:04,297 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:38:04,297 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035798092]
[2024-06-03 22:38:04,298 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:38:04,298 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:38:04,374 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:38:10,828 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:38:10,828 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:38:10,829 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035798092]
[2024-06-03 22:38:10,831 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035798092] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:38:10,832 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:38:10,832 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-03 22:38:10,832 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643574369]
[2024-06-03 22:38:10,832 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:38:10,832 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-03 22:38:10,833 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:38:10,833 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-03 22:38:10,833 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-06-03 22:38:10,972 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41
[2024-06-03 22:38:10,973 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 57 transitions, 303 flow. Second operand  has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states 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:38:10,973 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:38:10,973 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41
[2024-06-03 22:38:10,973 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:38:11,854 INFO  L124   PetriNetUnfolderBase]: 1571/2361 cut-off events.
[2024-06-03 22:38:11,854 INFO  L125   PetriNetUnfolderBase]: For 5858/5898 co-relation queries the response was YES.
[2024-06-03 22:38:11,860 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 8208 conditions, 2361 events. 1571/2361 cut-off events. For 5858/5898 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 10757 event pairs, 719 based on Foata normal form. 9/2358 useless extension candidates. Maximal degree in co-relation 8181. Up to 2305 conditions per place. 
[2024-06-03 22:38:11,870 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 56 selfloop transitions, 18 changer transitions 0/81 dead transitions.
[2024-06-03 22:38:11,870 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 81 transitions, 544 flow
[2024-06-03 22:38:11,871 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-03 22:38:11,871 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-03 22:38:11,871 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 113 transitions.
[2024-06-03 22:38:11,871 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.39372822299651566
[2024-06-03 22:38:11,872 INFO  L175             Difference]: Start difference. First operand has 59 places, 57 transitions, 303 flow. Second operand 7 states and 113 transitions.
[2024-06-03 22:38:11,872 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 81 transitions, 544 flow
[2024-06-03 22:38:11,875 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 81 transitions, 538 flow, removed 2 selfloop flow, removed 1 redundant places.
[2024-06-03 22:38:11,876 INFO  L231             Difference]: Finished difference. Result has 67 places, 66 transitions, 416 flow
[2024-06-03 22:38:11,876 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=297, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=416, PETRI_PLACES=67, PETRI_TRANSITIONS=66}
[2024-06-03 22:38:11,877 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 25 predicate places.
[2024-06-03 22:38:11,877 INFO  L495      AbstractCegarLoop]: Abstraction has has 67 places, 66 transitions, 416 flow
[2024-06-03 22:38:11,877 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states 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:38:11,877 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:38:11,877 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:38:11,877 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-06-03 22:38:11,878 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:38:11,878 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:38:11,878 INFO  L85        PathProgramCache]: Analyzing trace with hash -213902382, now seen corresponding path program 2 times
[2024-06-03 22:38:11,878 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:38:11,878 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695294038]
[2024-06-03 22:38:11,878 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:38:11,879 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:38:11,912 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:38:18,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:38:18,686 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:38:18,686 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695294038]
[2024-06-03 22:38:18,686 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695294038] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:38:18,686 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:38:18,686 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-03 22:38:18,687 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044737623]
[2024-06-03 22:38:18,687 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:38:18,687 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-03 22:38:18,687 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:38:18,687 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-03 22:38:18,687 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2024-06-03 22:38:18,835 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41
[2024-06-03 22:38:18,835 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 66 transitions, 416 flow. Second operand  has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states 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:38:18,835 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:38:18,835 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41
[2024-06-03 22:38:18,835 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:38:19,720 INFO  L124   PetriNetUnfolderBase]: 1559/2349 cut-off events.
[2024-06-03 22:38:19,736 INFO  L125   PetriNetUnfolderBase]: For 7721/7785 co-relation queries the response was YES.
[2024-06-03 22:38:19,757 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 8871 conditions, 2349 events. 1559/2349 cut-off events. For 7721/7785 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 10629 event pairs, 699 based on Foata normal form. 18/2354 useless extension candidates. Maximal degree in co-relation 8839. Up to 2282 conditions per place. 
[2024-06-03 22:38:19,768 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 64 selfloop transitions, 26 changer transitions 0/97 dead transitions.
[2024-06-03 22:38:19,769 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 97 transitions, 729 flow
[2024-06-03 22:38:19,770 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-03 22:38:19,770 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-03 22:38:19,771 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 120 transitions.
[2024-06-03 22:38:19,771 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4181184668989547
[2024-06-03 22:38:19,771 INFO  L175             Difference]: Start difference. First operand has 67 places, 66 transitions, 416 flow. Second operand 7 states and 120 transitions.
[2024-06-03 22:38:19,776 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 97 transitions, 729 flow
[2024-06-03 22:38:19,782 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 97 transitions, 689 flow, removed 10 selfloop flow, removed 2 redundant places.
[2024-06-03 22:38:19,783 INFO  L231             Difference]: Finished difference. Result has 73 places, 77 transitions, 544 flow
[2024-06-03 22:38:19,785 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=391, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=544, PETRI_PLACES=73, PETRI_TRANSITIONS=77}
[2024-06-03 22:38:19,787 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 31 predicate places.
[2024-06-03 22:38:19,787 INFO  L495      AbstractCegarLoop]: Abstraction has has 73 places, 77 transitions, 544 flow
[2024-06-03 22:38:19,788 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states 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:38:19,788 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:38:19,788 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:38:19,788 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-06-03 22:38:19,788 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:38:19,788 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:38:19,789 INFO  L85        PathProgramCache]: Analyzing trace with hash 1608086098, now seen corresponding path program 3 times
[2024-06-03 22:38:19,789 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:38:19,789 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312794359]
[2024-06-03 22:38:19,789 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:38:19,789 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:38:19,839 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:38:25,719 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:38:25,720 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:38:25,720 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312794359]
[2024-06-03 22:38:25,720 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312794359] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:38:25,720 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:38:25,720 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-03 22:38:25,720 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611246143]
[2024-06-03 22:38:25,720 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:38:25,721 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-03 22:38:25,722 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:38:25,722 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-03 22:38:25,722 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2024-06-03 22:38:25,824 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41
[2024-06-03 22:38:25,824 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 77 transitions, 544 flow. Second operand  has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states 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:38:25,824 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:38:25,824 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41
[2024-06-03 22:38:25,824 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:38:26,773 INFO  L124   PetriNetUnfolderBase]: 1583/2385 cut-off events.
[2024-06-03 22:38:26,773 INFO  L125   PetriNetUnfolderBase]: For 10352/10418 co-relation queries the response was YES.
[2024-06-03 22:38:26,778 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 9709 conditions, 2385 events. 1583/2385 cut-off events. For 10352/10418 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 10832 event pairs, 700 based on Foata normal form. 23/2394 useless extension candidates. Maximal degree in co-relation 9674. Up to 2286 conditions per place. 
[2024-06-03 22:38:26,783 INFO  L140   encePairwiseOnDemand]: 32/41 looper letters, 58 selfloop transitions, 32 changer transitions 0/97 dead transitions.
[2024-06-03 22:38:26,783 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 97 transitions, 818 flow
[2024-06-03 22:38:26,784 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-03 22:38:26,784 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-03 22:38:26,784 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 103 transitions.
[2024-06-03 22:38:26,784 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4186991869918699
[2024-06-03 22:38:26,785 INFO  L175             Difference]: Start difference. First operand has 73 places, 77 transitions, 544 flow. Second operand 6 states and 103 transitions.
[2024-06-03 22:38:26,785 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 97 transitions, 818 flow
[2024-06-03 22:38:26,789 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 97 transitions, 768 flow, removed 5 selfloop flow, removed 4 redundant places.
[2024-06-03 22:38:26,790 INFO  L231             Difference]: Finished difference. Result has 76 places, 83 transitions, 648 flow
[2024-06-03 22:38:26,790 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=494, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=648, PETRI_PLACES=76, PETRI_TRANSITIONS=83}
[2024-06-03 22:38:26,791 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 34 predicate places.
[2024-06-03 22:38:26,791 INFO  L495      AbstractCegarLoop]: Abstraction has has 76 places, 83 transitions, 648 flow
[2024-06-03 22:38:26,791 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states 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:38:26,791 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:38:26,791 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:38:26,791 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-06-03 22:38:26,791 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:38:26,792 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:38:26,792 INFO  L85        PathProgramCache]: Analyzing trace with hash 555280094, now seen corresponding path program 1 times
[2024-06-03 22:38:26,792 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:38:26,792 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010899570]
[2024-06-03 22:38:26,792 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:38:26,792 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:38:26,831 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:38:34,590 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:38:34,590 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:38:34,590 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010899570]
[2024-06-03 22:38:34,590 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010899570] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:38:34,590 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:38:34,590 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-03 22:38:34,590 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967205808]
[2024-06-03 22:38:34,590 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:38:34,591 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-03 22:38:34,591 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:38:34,593 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-03 22:38:34,593 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2024-06-03 22:38:34,756 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41
[2024-06-03 22:38:34,757 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 83 transitions, 648 flow. Second operand  has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 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:38:34,757 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:38:34,757 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41
[2024-06-03 22:38:34,757 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:38:35,754 INFO  L124   PetriNetUnfolderBase]: 1583/2395 cut-off events.
[2024-06-03 22:38:35,755 INFO  L125   PetriNetUnfolderBase]: For 13182/13260 co-relation queries the response was YES.
[2024-06-03 22:38:35,760 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 10032 conditions, 2395 events. 1583/2395 cut-off events. For 13182/13260 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 11253 event pairs, 720 based on Foata normal form. 2/2354 useless extension candidates. Maximal degree in co-relation 9995. Up to 2277 conditions per place. 
[2024-06-03 22:38:35,767 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 74 selfloop transitions, 15 changer transitions 0/104 dead transitions.
[2024-06-03 22:38:35,767 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 104 transitions, 894 flow
[2024-06-03 22:38:35,784 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-03 22:38:35,784 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-03 22:38:35,785 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 116 transitions.
[2024-06-03 22:38:35,785 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.40418118466898956
[2024-06-03 22:38:35,785 INFO  L175             Difference]: Start difference. First operand has 76 places, 83 transitions, 648 flow. Second operand 7 states and 116 transitions.
[2024-06-03 22:38:35,785 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 104 transitions, 894 flow
[2024-06-03 22:38:35,793 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 104 transitions, 830 flow, removed 17 selfloop flow, removed 3 redundant places.
[2024-06-03 22:38:35,794 INFO  L231             Difference]: Finished difference. Result has 80 places, 86 transitions, 642 flow
[2024-06-03 22:38:35,794 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=584, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=642, PETRI_PLACES=80, PETRI_TRANSITIONS=86}
[2024-06-03 22:38:35,795 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 38 predicate places.
[2024-06-03 22:38:35,795 INFO  L495      AbstractCegarLoop]: Abstraction has has 80 places, 86 transitions, 642 flow
[2024-06-03 22:38:35,795 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 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:38:35,795 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:38:35,795 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:38:35,795 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-06-03 22:38:35,796 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:38:35,796 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:38:35,796 INFO  L85        PathProgramCache]: Analyzing trace with hash -143683142, now seen corresponding path program 1 times
[2024-06-03 22:38:35,796 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:38:35,796 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504334917]
[2024-06-03 22:38:35,796 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:38:35,797 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:38:35,841 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:38:42,058 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:38:42,059 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:38:42,059 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504334917]
[2024-06-03 22:38:42,059 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504334917] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:38:42,059 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:38:42,059 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-03 22:38:42,059 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890002103]
[2024-06-03 22:38:42,059 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:38:42,060 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-03 22:38:42,060 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:38:42,060 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-03 22:38:42,060 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-03 22:38:42,183 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41
[2024-06-03 22:38:42,183 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 86 transitions, 642 flow. Second operand  has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 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:38:42,183 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:38:42,183 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41
[2024-06-03 22:38:42,183 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:38:43,259 INFO  L124   PetriNetUnfolderBase]: 1575/2377 cut-off events.
[2024-06-03 22:38:43,260 INFO  L125   PetriNetUnfolderBase]: For 15640/15704 co-relation queries the response was YES.
[2024-06-03 22:38:43,267 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 10616 conditions, 2377 events. 1575/2377 cut-off events. For 15640/15704 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 10963 event pairs, 553 based on Foata normal form. 45/2371 useless extension candidates. Maximal degree in co-relation 10578. Up to 2229 conditions per place. 
[2024-06-03 22:38:43,306 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 82 selfloop transitions, 27 changer transitions 0/117 dead transitions.
[2024-06-03 22:38:43,306 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 117 transitions, 972 flow
[2024-06-03 22:38:43,308 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-03 22:38:43,308 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-03 22:38:43,309 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 124 transitions.
[2024-06-03 22:38:43,309 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43205574912891986
[2024-06-03 22:38:43,309 INFO  L175             Difference]: Start difference. First operand has 80 places, 86 transitions, 642 flow. Second operand 7 states and 124 transitions.
[2024-06-03 22:38:43,309 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 117 transitions, 972 flow
[2024-06-03 22:38:43,315 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 117 transitions, 938 flow, removed 4 selfloop flow, removed 5 redundant places.
[2024-06-03 22:38:43,317 INFO  L231             Difference]: Finished difference. Result has 83 places, 92 transitions, 721 flow
[2024-06-03 22:38:43,317 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=608, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=721, PETRI_PLACES=83, PETRI_TRANSITIONS=92}
[2024-06-03 22:38:43,317 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 41 predicate places.
[2024-06-03 22:38:43,317 INFO  L495      AbstractCegarLoop]: Abstraction has has 83 places, 92 transitions, 721 flow
[2024-06-03 22:38:43,317 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 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:38:43,318 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:38:43,318 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:38:43,318 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-06-03 22:38:43,318 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:38:43,318 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:38:43,318 INFO  L85        PathProgramCache]: Analyzing trace with hash -808786624, now seen corresponding path program 1 times
[2024-06-03 22:38:43,318 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:38:43,318 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680818965]
[2024-06-03 22:38:43,318 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:38:43,318 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:38:43,366 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:38:50,378 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:38:50,388 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:38:50,388 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680818965]
[2024-06-03 22:38:50,389 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680818965] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:38:50,389 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:38:50,389 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-03 22:38:50,389 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079979587]
[2024-06-03 22:38:50,389 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:38:50,389 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-03 22:38:50,390 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:38:50,390 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-03 22:38:50,390 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-03 22:38:50,498 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-03 22:38:50,499 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 92 transitions, 721 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:38:50,499 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:38:50,499 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-03 22:38:50,499 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:38:51,549 INFO  L124   PetriNetUnfolderBase]: 1693/2531 cut-off events.
[2024-06-03 22:38:51,549 INFO  L125   PetriNetUnfolderBase]: For 17480/17480 co-relation queries the response was YES.
[2024-06-03 22:38:51,556 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 11802 conditions, 2531 events. 1693/2531 cut-off events. For 17480/17480 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 11387 event pairs, 602 based on Foata normal form. 2/2530 useless extension candidates. Maximal degree in co-relation 11762. Up to 2453 conditions per place. 
[2024-06-03 22:38:51,564 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 102 selfloop transitions, 24 changer transitions 0/129 dead transitions.
[2024-06-03 22:38:51,564 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 129 transitions, 1191 flow
[2024-06-03 22:38:51,566 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-03 22:38:51,566 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-03 22:38:51,567 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 113 transitions.
[2024-06-03 22:38:51,567 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.39372822299651566
[2024-06-03 22:38:51,567 INFO  L175             Difference]: Start difference. First operand has 83 places, 92 transitions, 721 flow. Second operand 7 states and 113 transitions.
[2024-06-03 22:38:51,567 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 129 transitions, 1191 flow
[2024-06-03 22:38:51,575 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 129 transitions, 1142 flow, removed 10 selfloop flow, removed 3 redundant places.
[2024-06-03 22:38:51,577 INFO  L231             Difference]: Finished difference. Result has 89 places, 109 transitions, 938 flow
[2024-06-03 22:38:51,577 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=675, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=938, PETRI_PLACES=89, PETRI_TRANSITIONS=109}
[2024-06-03 22:38:51,578 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 47 predicate places.
[2024-06-03 22:38:51,578 INFO  L495      AbstractCegarLoop]: Abstraction has has 89 places, 109 transitions, 938 flow
[2024-06-03 22:38:51,578 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:38:51,578 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:38:51,578 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:38:51,579 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-06-03 22:38:51,579 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:38:51,579 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:38:51,579 INFO  L85        PathProgramCache]: Analyzing trace with hash -143563172, now seen corresponding path program 2 times
[2024-06-03 22:38:51,579 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:38:51,579 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667497943]
[2024-06-03 22:38:51,579 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:38:51,580 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:38:51,612 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:38:58,764 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:38:58,764 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:38:58,765 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667497943]
[2024-06-03 22:38:58,765 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667497943] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:38:58,765 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:38:58,765 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-03 22:38:58,765 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206159351]
[2024-06-03 22:38:58,765 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:38:58,766 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-03 22:38:58,766 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:38:58,767 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-03 22:38:58,767 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-03 22:38:58,906 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41
[2024-06-03 22:38:58,912 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 109 transitions, 938 flow. Second operand  has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 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:38:58,913 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:38:58,913 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41
[2024-06-03 22:38:58,913 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:39:00,027 INFO  L124   PetriNetUnfolderBase]: 1644/2479 cut-off events.
[2024-06-03 22:39:00,027 INFO  L125   PetriNetUnfolderBase]: For 23463/23521 co-relation queries the response was YES.
[2024-06-03 22:39:00,034 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 12457 conditions, 2479 events. 1644/2479 cut-off events. For 23463/23521 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 11441 event pairs, 532 based on Foata normal form. 30/2456 useless extension candidates. Maximal degree in co-relation 12414. Up to 2237 conditions per place. 
[2024-06-03 22:39:00,042 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 83 selfloop transitions, 46 changer transitions 0/140 dead transitions.
[2024-06-03 22:39:00,043 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 140 transitions, 1384 flow
[2024-06-03 22:39:00,043 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-03 22:39:00,043 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-03 22:39:00,044 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 126 transitions.
[2024-06-03 22:39:00,045 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43902439024390244
[2024-06-03 22:39:00,045 INFO  L175             Difference]: Start difference. First operand has 89 places, 109 transitions, 938 flow. Second operand 7 states and 126 transitions.
[2024-06-03 22:39:00,045 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 140 transitions, 1384 flow
[2024-06-03 22:39:00,068 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 140 transitions, 1355 flow, removed 11 selfloop flow, removed 2 redundant places.
[2024-06-03 22:39:00,070 INFO  L231             Difference]: Finished difference. Result has 94 places, 115 transitions, 1084 flow
[2024-06-03 22:39:00,070 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=909, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1084, PETRI_PLACES=94, PETRI_TRANSITIONS=115}
[2024-06-03 22:39:00,071 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 52 predicate places.
[2024-06-03 22:39:00,071 INFO  L495      AbstractCegarLoop]: Abstraction has has 94 places, 115 transitions, 1084 flow
[2024-06-03 22:39:00,071 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 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:39:00,071 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:39:00,071 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:39:00,071 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2024-06-03 22:39:00,071 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:39:00,072 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:39:00,072 INFO  L85        PathProgramCache]: Analyzing trace with hash 33568348, now seen corresponding path program 3 times
[2024-06-03 22:39:00,072 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:39:00,072 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043461821]
[2024-06-03 22:39:00,072 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:39:00,072 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:39:00,103 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:39:07,706 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:39:07,706 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:39:07,706 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043461821]
[2024-06-03 22:39:07,706 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043461821] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:39:07,707 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:39:07,707 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-03 22:39:07,707 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851293790]
[2024-06-03 22:39:07,707 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:39:07,707 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-03 22:39:07,708 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:39:07,708 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-03 22:39:07,708 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-03 22:39:07,857 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41
[2024-06-03 22:39:07,858 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 115 transitions, 1084 flow. Second operand  has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 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:39:07,858 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:39:07,858 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41
[2024-06-03 22:39:07,858 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:39:08,842 INFO  L124   PetriNetUnfolderBase]: 1650/2491 cut-off events.
[2024-06-03 22:39:08,842 INFO  L125   PetriNetUnfolderBase]: For 28215/28285 co-relation queries the response was YES.
[2024-06-03 22:39:08,849 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 13180 conditions, 2491 events. 1650/2491 cut-off events. For 28215/28285 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 11553 event pairs, 545 based on Foata normal form. 30/2461 useless extension candidates. Maximal degree in co-relation 13135. Up to 2202 conditions per place. 
[2024-06-03 22:39:08,855 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 82 selfloop transitions, 48 changer transitions 0/141 dead transitions.
[2024-06-03 22:39:08,856 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 141 transitions, 1504 flow
[2024-06-03 22:39:08,856 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-03 22:39:08,856 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-03 22:39:08,857 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 125 transitions.
[2024-06-03 22:39:08,857 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4355400696864111
[2024-06-03 22:39:08,857 INFO  L175             Difference]: Start difference. First operand has 94 places, 115 transitions, 1084 flow. Second operand 7 states and 125 transitions.
[2024-06-03 22:39:08,857 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 141 transitions, 1504 flow
[2024-06-03 22:39:08,870 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 141 transitions, 1452 flow, removed 13 selfloop flow, removed 3 redundant places.
[2024-06-03 22:39:08,871 INFO  L231             Difference]: Finished difference. Result has 98 places, 118 transitions, 1180 flow
[2024-06-03 22:39:08,872 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1032, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1180, PETRI_PLACES=98, PETRI_TRANSITIONS=118}
[2024-06-03 22:39:08,872 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 56 predicate places.
[2024-06-03 22:39:08,872 INFO  L495      AbstractCegarLoop]: Abstraction has has 98 places, 118 transitions, 1180 flow
[2024-06-03 22:39:08,872 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 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:39:08,872 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:39:08,873 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:39:08,873 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2024-06-03 22:39:08,873 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:39:08,873 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:39:08,873 INFO  L85        PathProgramCache]: Analyzing trace with hash -1688937694, now seen corresponding path program 2 times
[2024-06-03 22:39:08,873 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:39:08,874 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9080919]
[2024-06-03 22:39:08,874 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:39:08,874 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:39:08,918 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:39:15,323 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:39:15,324 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:39:15,324 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9080919]
[2024-06-03 22:39:15,324 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9080919] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:39:15,324 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:39:15,324 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-03 22:39:15,324 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114482362]
[2024-06-03 22:39:15,325 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:39:15,325 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-03 22:39:15,325 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:39:15,325 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-03 22:39:15,325 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-03 22:39:15,404 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-03 22:39:15,404 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 118 transitions, 1180 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:39:15,404 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:39:15,404 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-03 22:39:15,404 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:39:16,405 INFO  L124   PetriNetUnfolderBase]: 1744/2606 cut-off events.
[2024-06-03 22:39:16,406 INFO  L125   PetriNetUnfolderBase]: For 28464/28467 co-relation queries the response was YES.
[2024-06-03 22:39:16,412 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 14023 conditions, 2606 events. 1744/2606 cut-off events. For 28464/28467 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 11773 event pairs, 598 based on Foata normal form. 4/2603 useless extension candidates. Maximal degree in co-relation 13976. Up to 2480 conditions per place. 
[2024-06-03 22:39:16,419 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 109 selfloop transitions, 34 changer transitions 0/146 dead transitions.
[2024-06-03 22:39:16,419 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 146 transitions, 1647 flow
[2024-06-03 22:39:16,421 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 22:39:16,421 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 22:39:16,422 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 125 transitions.
[2024-06-03 22:39:16,423 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.38109756097560976
[2024-06-03 22:39:16,423 INFO  L175             Difference]: Start difference. First operand has 98 places, 118 transitions, 1180 flow. Second operand 8 states and 125 transitions.
[2024-06-03 22:39:16,423 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 146 transitions, 1647 flow
[2024-06-03 22:39:16,465 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 146 transitions, 1520 flow, removed 16 selfloop flow, removed 5 redundant places.
[2024-06-03 22:39:16,467 INFO  L231             Difference]: Finished difference. Result has 102 places, 126 transitions, 1213 flow
[2024-06-03 22:39:16,468 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1056, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1213, PETRI_PLACES=102, PETRI_TRANSITIONS=126}
[2024-06-03 22:39:16,468 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 60 predicate places.
[2024-06-03 22:39:16,468 INFO  L495      AbstractCegarLoop]: Abstraction has has 102 places, 126 transitions, 1213 flow
[2024-06-03 22:39:16,468 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:39:16,469 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:39:16,469 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:39:16,469 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2024-06-03 22:39:16,469 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:39:16,469 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:39:16,469 INFO  L85        PathProgramCache]: Analyzing trace with hash 643153654, now seen corresponding path program 3 times
[2024-06-03 22:39:16,469 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:39:16,470 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195215696]
[2024-06-03 22:39:16,470 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:39:16,470 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:39:16,517 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:39:23,878 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:39:23,878 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:39:23,878 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195215696]
[2024-06-03 22:39:23,878 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195215696] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:39:23,878 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:39:23,879 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-03 22:39:23,879 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774289123]
[2024-06-03 22:39:23,879 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:39:23,879 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-03 22:39:23,879 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:39:23,880 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-03 22:39:23,880 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-03 22:39:24,078 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-03 22:39:24,078 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 126 transitions, 1213 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:39:24,078 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:39:24,078 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-03 22:39:24,078 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:39:25,108 INFO  L124   PetriNetUnfolderBase]: 1739/2599 cut-off events.
[2024-06-03 22:39:25,108 INFO  L125   PetriNetUnfolderBase]: For 31475/31478 co-relation queries the response was YES.
[2024-06-03 22:39:25,116 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 14324 conditions, 2599 events. 1739/2599 cut-off events. For 31475/31478 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 11773 event pairs, 598 based on Foata normal form. 4/2596 useless extension candidates. Maximal degree in co-relation 14275. Up to 2475 conditions per place. 
[2024-06-03 22:39:25,132 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 106 selfloop transitions, 36 changer transitions 0/145 dead transitions.
[2024-06-03 22:39:25,132 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 145 transitions, 1562 flow
[2024-06-03 22:39:25,134 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-03 22:39:25,134 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-03 22:39:25,134 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 113 transitions.
[2024-06-03 22:39:25,135 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.39372822299651566
[2024-06-03 22:39:25,135 INFO  L175             Difference]: Start difference. First operand has 102 places, 126 transitions, 1213 flow. Second operand 7 states and 113 transitions.
[2024-06-03 22:39:25,136 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 145 transitions, 1562 flow
[2024-06-03 22:39:25,155 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 145 transitions, 1468 flow, removed 24 selfloop flow, removed 5 redundant places.
[2024-06-03 22:39:25,157 INFO  L231             Difference]: Finished difference. Result has 104 places, 127 transitions, 1210 flow
[2024-06-03 22:39:25,157 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1125, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1210, PETRI_PLACES=104, PETRI_TRANSITIONS=127}
[2024-06-03 22:39:25,158 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 62 predicate places.
[2024-06-03 22:39:25,158 INFO  L495      AbstractCegarLoop]: Abstraction has has 104 places, 127 transitions, 1210 flow
[2024-06-03 22:39:25,159 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:39:25,159 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:39:25,159 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:39:25,159 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2024-06-03 22:39:25,160 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:39:25,160 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:39:25,161 INFO  L85        PathProgramCache]: Analyzing trace with hash -1688691616, now seen corresponding path program 1 times
[2024-06-03 22:39:25,161 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:39:25,161 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034338047]
[2024-06-03 22:39:25,161 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:39:25,161 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:39:25,197 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:39:33,745 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:39:33,745 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:39:33,745 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034338047]
[2024-06-03 22:39:33,745 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034338047] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:39:33,745 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:39:33,745 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 22:39:33,746 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130803831]
[2024-06-03 22:39:33,746 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:39:33,746 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 22:39:33,746 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:39:33,747 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 22:39:33,747 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72
[2024-06-03 22:39:33,910 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41
[2024-06-03 22:39:33,912 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 127 transitions, 1210 flow. Second operand  has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 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:39:33,912 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:39:33,912 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41
[2024-06-03 22:39:33,912 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:39:34,925 INFO  L124   PetriNetUnfolderBase]: 1669/2521 cut-off events.
[2024-06-03 22:39:34,926 INFO  L125   PetriNetUnfolderBase]: For 35765/35901 co-relation queries the response was YES.
[2024-06-03 22:39:34,934 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 13887 conditions, 2521 events. 1669/2521 cut-off events. For 35765/35901 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 11816 event pairs, 548 based on Foata normal form. 4/2488 useless extension candidates. Maximal degree in co-relation 13838. Up to 2371 conditions per place. 
[2024-06-03 22:39:34,943 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 115 selfloop transitions, 17 changer transitions 0/152 dead transitions.
[2024-06-03 22:39:34,944 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 152 transitions, 1558 flow
[2024-06-03 22:39:34,945 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 22:39:34,945 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 22:39:34,947 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 131 transitions.
[2024-06-03 22:39:34,947 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.39939024390243905
[2024-06-03 22:39:34,947 INFO  L175             Difference]: Start difference. First operand has 104 places, 127 transitions, 1210 flow. Second operand 8 states and 131 transitions.
[2024-06-03 22:39:34,947 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 152 transitions, 1558 flow
[2024-06-03 22:39:34,967 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 152 transitions, 1504 flow, removed 1 selfloop flow, removed 4 redundant places.
[2024-06-03 22:39:34,969 INFO  L231             Difference]: Finished difference. Result has 108 places, 129 transitions, 1217 flow
[2024-06-03 22:39:34,969 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1156, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1217, PETRI_PLACES=108, PETRI_TRANSITIONS=129}
[2024-06-03 22:39:34,970 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 66 predicate places.
[2024-06-03 22:39:34,970 INFO  L495      AbstractCegarLoop]: Abstraction has has 108 places, 129 transitions, 1217 flow
[2024-06-03 22:39:34,970 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 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:39:34,970 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:39:34,970 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:39:34,970 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2024-06-03 22:39:34,971 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:39:34,971 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:39:34,971 INFO  L85        PathProgramCache]: Analyzing trace with hash 37612791, now seen corresponding path program 1 times
[2024-06-03 22:39:34,972 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:39:34,972 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050486064]
[2024-06-03 22:39:34,972 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:39:34,972 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:39:35,020 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:39:42,613 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:39:42,613 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:39:42,613 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050486064]
[2024-06-03 22:39:42,613 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050486064] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:39:42,613 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:39:42,613 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 22:39:42,613 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141305091]
[2024-06-03 22:39:42,614 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:39:42,614 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 22:39:42,614 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:39:42,614 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 22:39:42,614 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72
[2024-06-03 22:39:42,698 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41
[2024-06-03 22:39:42,699 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 129 transitions, 1217 flow. Second operand  has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 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:39:42,699 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:39:42,699 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41
[2024-06-03 22:39:42,699 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:39:43,763 INFO  L124   PetriNetUnfolderBase]: 1631/2458 cut-off events.
[2024-06-03 22:39:43,763 INFO  L125   PetriNetUnfolderBase]: For 38332/38396 co-relation queries the response was YES.
[2024-06-03 22:39:43,770 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 14006 conditions, 2458 events. 1631/2458 cut-off events. For 38332/38396 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 11199 event pairs, 534 based on Foata normal form. 33/2457 useless extension candidates. Maximal degree in co-relation 13956. Up to 2272 conditions per place. 
[2024-06-03 22:39:43,777 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 103 selfloop transitions, 35 changer transitions 0/153 dead transitions.
[2024-06-03 22:39:43,778 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 153 transitions, 1567 flow
[2024-06-03 22:39:43,779 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-03 22:39:43,779 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-03 22:39:43,780 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 124 transitions.
[2024-06-03 22:39:43,781 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43205574912891986
[2024-06-03 22:39:43,781 INFO  L175             Difference]: Start difference. First operand has 108 places, 129 transitions, 1217 flow. Second operand 7 states and 124 transitions.
[2024-06-03 22:39:43,781 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 153 transitions, 1567 flow
[2024-06-03 22:39:43,801 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 153 transitions, 1514 flow, removed 11 selfloop flow, removed 6 redundant places.
[2024-06-03 22:39:43,805 INFO  L231             Difference]: Finished difference. Result has 109 places, 129 transitions, 1246 flow
[2024-06-03 22:39:43,806 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1164, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1246, PETRI_PLACES=109, PETRI_TRANSITIONS=129}
[2024-06-03 22:39:43,806 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 67 predicate places.
[2024-06-03 22:39:43,806 INFO  L495      AbstractCegarLoop]: Abstraction has has 109 places, 129 transitions, 1246 flow
[2024-06-03 22:39:43,806 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 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:39:43,806 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:39:43,807 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:39:43,807 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2024-06-03 22:39:43,807 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:39:43,807 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:39:43,807 INFO  L85        PathProgramCache]: Analyzing trace with hash 37616666, now seen corresponding path program 1 times
[2024-06-03 22:39:43,807 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:39:43,808 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489376629]
[2024-06-03 22:39:43,808 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:39:43,808 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:39:43,839 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:39:51,179 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:39:51,179 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:39:51,180 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489376629]
[2024-06-03 22:39:51,180 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489376629] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:39:51,180 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:39:51,180 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 22:39:51,180 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285454025]
[2024-06-03 22:39:51,180 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:39:51,180 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 22:39:51,181 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:39:51,181 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 22:39:51,181 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-03 22:39:51,300 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-03 22:39:51,300 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 129 transitions, 1246 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:39:51,300 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:39:51,300 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-03 22:39:51,300 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:39:52,442 INFO  L124   PetriNetUnfolderBase]: 1745/2607 cut-off events.
[2024-06-03 22:39:52,443 INFO  L125   PetriNetUnfolderBase]: For 40300/40300 co-relation queries the response was YES.
[2024-06-03 22:39:52,451 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 14814 conditions, 2607 events. 1745/2607 cut-off events. For 40300/40300 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 11657 event pairs, 554 based on Foata normal form. 4/2608 useless extension candidates. Maximal degree in co-relation 14763. Up to 2489 conditions per place. 
[2024-06-03 22:39:52,459 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 142 selfloop transitions, 26 changer transitions 0/171 dead transitions.
[2024-06-03 22:39:52,459 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 171 transitions, 1780 flow
[2024-06-03 22:39:52,461 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 22:39:52,463 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 22:39:52,464 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 133 transitions.
[2024-06-03 22:39:52,465 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4054878048780488
[2024-06-03 22:39:52,465 INFO  L175             Difference]: Start difference. First operand has 109 places, 129 transitions, 1246 flow. Second operand 8 states and 133 transitions.
[2024-06-03 22:39:52,465 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 171 transitions, 1780 flow
[2024-06-03 22:39:52,486 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 171 transitions, 1669 flow, removed 5 selfloop flow, removed 6 redundant places.
[2024-06-03 22:39:52,488 INFO  L231             Difference]: Finished difference. Result has 114 places, 141 transitions, 1342 flow
[2024-06-03 22:39:52,489 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1145, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1342, PETRI_PLACES=114, PETRI_TRANSITIONS=141}
[2024-06-03 22:39:52,489 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 72 predicate places.
[2024-06-03 22:39:52,489 INFO  L495      AbstractCegarLoop]: Abstraction has has 114 places, 141 transitions, 1342 flow
[2024-06-03 22:39:52,489 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:39:52,489 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:39:52,490 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:39:52,490 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2024-06-03 22:39:52,490 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:39:52,490 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:39:52,490 INFO  L85        PathProgramCache]: Analyzing trace with hash 41341533, now seen corresponding path program 1 times
[2024-06-03 22:39:52,490 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:39:52,491 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955917927]
[2024-06-03 22:39:52,491 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:39:52,491 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:39:52,531 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:40:00,734 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:40:00,735 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:40:00,735 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955917927]
[2024-06-03 22:40:00,735 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955917927] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:40:00,735 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:40:00,735 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 22:40:00,735 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505945903]
[2024-06-03 22:40:00,735 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:40:00,735 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 22:40:00,736 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:40:00,736 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 22:40:00,736 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-03 22:40:00,881 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-03 22:40:00,882 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 141 transitions, 1342 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:40:00,882 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:40:00,882 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-03 22:40:00,882 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:40:01,955 INFO  L124   PetriNetUnfolderBase]: 1756/2623 cut-off events.
[2024-06-03 22:40:01,956 INFO  L125   PetriNetUnfolderBase]: For 44535/44535 co-relation queries the response was YES.
[2024-06-03 22:40:01,965 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 15473 conditions, 2623 events. 1756/2623 cut-off events. For 44535/44535 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 11777 event pairs, 543 based on Foata normal form. 2/2622 useless extension candidates. Maximal degree in co-relation 15418. Up to 2536 conditions per place. 
[2024-06-03 22:40:01,973 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 138 selfloop transitions, 27 changer transitions 0/168 dead transitions.
[2024-06-03 22:40:01,974 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 168 transitions, 1772 flow
[2024-06-03 22:40:01,976 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 22:40:01,977 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 22:40:01,977 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 127 transitions.
[2024-06-03 22:40:01,977 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3871951219512195
[2024-06-03 22:40:01,977 INFO  L175             Difference]: Start difference. First operand has 114 places, 141 transitions, 1342 flow. Second operand 8 states and 127 transitions.
[2024-06-03 22:40:01,977 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 168 transitions, 1772 flow
[2024-06-03 22:40:02,005 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 168 transitions, 1729 flow, removed 18 selfloop flow, removed 2 redundant places.
[2024-06-03 22:40:02,007 INFO  L231             Difference]: Finished difference. Result has 120 places, 144 transitions, 1395 flow
[2024-06-03 22:40:02,007 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1299, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1395, PETRI_PLACES=120, PETRI_TRANSITIONS=144}
[2024-06-03 22:40:02,007 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 78 predicate places.
[2024-06-03 22:40:02,007 INFO  L495      AbstractCegarLoop]: Abstraction has has 120 places, 144 transitions, 1395 flow
[2024-06-03 22:40:02,008 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:40:02,008 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:40:02,008 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:40:02,008 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2024-06-03 22:40:02,008 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:40:02,008 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:40:02,008 INFO  L85        PathProgramCache]: Analyzing trace with hash -1016762118, now seen corresponding path program 2 times
[2024-06-03 22:40:02,009 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:40:02,009 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342714025]
[2024-06-03 22:40:02,009 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:40:02,009 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:40:02,047 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:40:09,252 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:40:09,252 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:40:09,252 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342714025]
[2024-06-03 22:40:09,252 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342714025] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:40:09,253 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:40:09,253 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 22:40:09,253 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895391072]
[2024-06-03 22:40:09,253 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:40:09,253 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 22:40:09,253 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:40:09,254 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 22:40:09,254 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-03 22:40:09,434 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-03 22:40:09,434 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 144 transitions, 1395 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:40:09,447 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:40:09,447 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-03 22:40:09,447 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:40:10,666 INFO  L124   PetriNetUnfolderBase]: 1864/2779 cut-off events.
[2024-06-03 22:40:10,666 INFO  L125   PetriNetUnfolderBase]: For 52168/52168 co-relation queries the response was YES.
[2024-06-03 22:40:10,676 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 16909 conditions, 2779 events. 1864/2779 cut-off events. For 52168/52168 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 12509 event pairs, 509 based on Foata normal form. 8/2784 useless extension candidates. Maximal degree in co-relation 16852. Up to 2454 conditions per place. 
[2024-06-03 22:40:10,686 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 143 selfloop transitions, 41 changer transitions 0/187 dead transitions.
[2024-06-03 22:40:10,686 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 187 transitions, 2051 flow
[2024-06-03 22:40:10,688 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 22:40:10,688 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 22:40:10,688 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 138 transitions.
[2024-06-03 22:40:10,688 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42073170731707316
[2024-06-03 22:40:10,689 INFO  L175             Difference]: Start difference. First operand has 120 places, 144 transitions, 1395 flow. Second operand 8 states and 138 transitions.
[2024-06-03 22:40:10,689 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 187 transitions, 2051 flow
[2024-06-03 22:40:10,717 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 187 transitions, 1979 flow, removed 11 selfloop flow, removed 6 redundant places.
[2024-06-03 22:40:10,719 INFO  L231             Difference]: Finished difference. Result has 123 places, 156 transitions, 1554 flow
[2024-06-03 22:40:10,720 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1323, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1554, PETRI_PLACES=123, PETRI_TRANSITIONS=156}
[2024-06-03 22:40:10,720 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 81 predicate places.
[2024-06-03 22:40:10,720 INFO  L495      AbstractCegarLoop]: Abstraction has has 123 places, 156 transitions, 1554 flow
[2024-06-03 22:40:10,720 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:40:10,721 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:40:10,721 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:40:10,721 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2024-06-03 22:40:10,721 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:40:10,721 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:40:10,721 INFO  L85        PathProgramCache]: Analyzing trace with hash -155490216, now seen corresponding path program 3 times
[2024-06-03 22:40:10,721 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:40:10,722 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785443232]
[2024-06-03 22:40:10,722 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:40:10,722 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:40:10,765 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:40:17,998 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:40:17,998 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:40:17,998 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785443232]
[2024-06-03 22:40:17,998 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785443232] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:40:17,998 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:40:17,998 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 22:40:17,999 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072737197]
[2024-06-03 22:40:17,999 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:40:17,999 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 22:40:17,999 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:40:18,000 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 22:40:18,000 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-03 22:40:18,150 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-03 22:40:18,150 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 156 transitions, 1554 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:40:18,150 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:40:18,150 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-03 22:40:18,151 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:40:19,322 INFO  L124   PetriNetUnfolderBase]: 1870/2788 cut-off events.
[2024-06-03 22:40:19,322 INFO  L125   PetriNetUnfolderBase]: For 57183/57183 co-relation queries the response was YES.
[2024-06-03 22:40:19,332 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 17798 conditions, 2788 events. 1870/2788 cut-off events. For 57183/57183 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 12597 event pairs, 529 based on Foata normal form. 4/2789 useless extension candidates. Maximal degree in co-relation 17739. Up to 2460 conditions per place. 
[2024-06-03 22:40:19,340 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 145 selfloop transitions, 43 changer transitions 0/191 dead transitions.
[2024-06-03 22:40:19,340 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 191 transitions, 2173 flow
[2024-06-03 22:40:19,342 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 22:40:19,342 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 22:40:19,342 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 139 transitions.
[2024-06-03 22:40:19,342 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42378048780487804
[2024-06-03 22:40:19,342 INFO  L175             Difference]: Start difference. First operand has 123 places, 156 transitions, 1554 flow. Second operand 8 states and 139 transitions.
[2024-06-03 22:40:19,343 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 191 transitions, 2173 flow
[2024-06-03 22:40:19,372 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 191 transitions, 2105 flow, removed 25 selfloop flow, removed 3 redundant places.
[2024-06-03 22:40:19,385 INFO  L231             Difference]: Finished difference. Result has 128 places, 160 transitions, 1637 flow
[2024-06-03 22:40:19,386 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1494, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1637, PETRI_PLACES=128, PETRI_TRANSITIONS=160}
[2024-06-03 22:40:19,386 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 86 predicate places.
[2024-06-03 22:40:19,386 INFO  L495      AbstractCegarLoop]: Abstraction has has 128 places, 160 transitions, 1637 flow
[2024-06-03 22:40:19,386 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:40:19,387 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:40:19,387 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:40:19,387 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2024-06-03 22:40:19,387 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:40:19,387 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:40:19,387 INFO  L85        PathProgramCache]: Analyzing trace with hash 1040625188, now seen corresponding path program 4 times
[2024-06-03 22:40:19,387 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:40:19,388 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424943760]
[2024-06-03 22:40:19,388 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:40:19,388 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:40:19,425 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:40:26,773 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:40:26,774 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:40:26,774 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424943760]
[2024-06-03 22:40:26,774 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424943760] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:40:26,774 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:40:26,774 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 22:40:26,774 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881026517]
[2024-06-03 22:40:26,774 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:40:26,775 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 22:40:26,775 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:40:26,775 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 22:40:26,775 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-06-03 22:40:26,932 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-03 22:40:26,932 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 160 transitions, 1637 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:40:26,932 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:40:26,933 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-03 22:40:26,933 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:40:28,105 INFO  L124   PetriNetUnfolderBase]: 2000/2980 cut-off events.
[2024-06-03 22:40:28,106 INFO  L125   PetriNetUnfolderBase]: For 66566/66569 co-relation queries the response was YES.
[2024-06-03 22:40:28,118 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 19357 conditions, 2980 events. 2000/2980 cut-off events. For 66566/66569 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 13676 event pairs, 511 based on Foata normal form. 10/2981 useless extension candidates. Maximal degree in co-relation 19296. Up to 2374 conditions per place. 
[2024-06-03 22:40:28,128 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 149 selfloop transitions, 58 changer transitions 0/210 dead transitions.
[2024-06-03 22:40:28,128 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 210 transitions, 2611 flow
[2024-06-03 22:40:28,130 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 22:40:28,130 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 22:40:28,131 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 147 transitions.
[2024-06-03 22:40:28,131 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4481707317073171
[2024-06-03 22:40:28,131 INFO  L175             Difference]: Start difference. First operand has 128 places, 160 transitions, 1637 flow. Second operand 8 states and 147 transitions.
[2024-06-03 22:40:28,131 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 210 transitions, 2611 flow
[2024-06-03 22:40:28,165 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 210 transitions, 2534 flow, removed 16 selfloop flow, removed 4 redundant places.
[2024-06-03 22:40:28,168 INFO  L231             Difference]: Finished difference. Result has 134 places, 173 transitions, 1860 flow
[2024-06-03 22:40:28,168 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1560, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1860, PETRI_PLACES=134, PETRI_TRANSITIONS=173}
[2024-06-03 22:40:28,169 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 92 predicate places.
[2024-06-03 22:40:28,169 INFO  L495      AbstractCegarLoop]: Abstraction has has 134 places, 173 transitions, 1860 flow
[2024-06-03 22:40:28,169 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:40:28,169 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:40:28,169 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:40:28,169 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2024-06-03 22:40:28,170 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:40:28,170 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:40:28,170 INFO  L85        PathProgramCache]: Analyzing trace with hash -817460111, now seen corresponding path program 2 times
[2024-06-03 22:40:28,170 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:40:28,170 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65847529]
[2024-06-03 22:40:28,170 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:40:28,170 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:40:28,207 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:40:36,819 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:40:36,819 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:40:36,819 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65847529]
[2024-06-03 22:40:36,819 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65847529] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:40:36,819 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:40:36,819 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 22:40:36,819 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269246699]
[2024-06-03 22:40:36,819 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:40:36,820 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 22:40:36,820 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:40:36,820 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 22:40:36,820 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-03 22:40:36,935 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-03 22:40:36,935 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 173 transitions, 1860 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:40:36,935 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:40:36,935 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-03 22:40:36,935 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:40:38,183 INFO  L124   PetriNetUnfolderBase]: 1989/2961 cut-off events.
[2024-06-03 22:40:38,184 INFO  L125   PetriNetUnfolderBase]: For 72475/72481 co-relation queries the response was YES.
[2024-06-03 22:40:38,194 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 20238 conditions, 2961 events. 1989/2961 cut-off events. For 72475/72481 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 13581 event pairs, 541 based on Foata normal form. 6/2960 useless extension candidates. Maximal degree in co-relation 20174. Up to 2828 conditions per place. 
[2024-06-03 22:40:38,202 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 158 selfloop transitions, 36 changer transitions 0/197 dead transitions.
[2024-06-03 22:40:38,203 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 197 transitions, 2340 flow
[2024-06-03 22:40:38,204 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 22:40:38,205 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 22:40:38,205 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 128 transitions.
[2024-06-03 22:40:38,205 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3902439024390244
[2024-06-03 22:40:38,205 INFO  L175             Difference]: Start difference. First operand has 134 places, 173 transitions, 1860 flow. Second operand 8 states and 128 transitions.
[2024-06-03 22:40:38,205 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 197 transitions, 2340 flow
[2024-06-03 22:40:38,247 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 197 transitions, 2200 flow, removed 33 selfloop flow, removed 4 redundant places.
[2024-06-03 22:40:38,249 INFO  L231             Difference]: Finished difference. Result has 138 places, 175 transitions, 1830 flow
[2024-06-03 22:40:38,250 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1724, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1830, PETRI_PLACES=138, PETRI_TRANSITIONS=175}
[2024-06-03 22:40:38,250 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 96 predicate places.
[2024-06-03 22:40:38,250 INFO  L495      AbstractCegarLoop]: Abstraction has has 138 places, 175 transitions, 1830 flow
[2024-06-03 22:40:38,250 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:40:38,251 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:40:38,251 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:40:38,251 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2024-06-03 22:40:38,251 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:40:38,251 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:40:38,251 INFO  L85        PathProgramCache]: Analyzing trace with hash -817465908, now seen corresponding path program 5 times
[2024-06-03 22:40:38,252 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:40:38,252 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102612440]
[2024-06-03 22:40:38,252 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:40:38,252 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:40:38,287 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:40:45,396 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:40:45,397 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:40:45,397 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102612440]
[2024-06-03 22:40:45,397 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102612440] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:40:45,397 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:40:45,397 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 22:40:45,397 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346961721]
[2024-06-03 22:40:45,398 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:40:45,398 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 22:40:45,398 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:40:45,398 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 22:40:45,398 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-06-03 22:40:45,562 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-03 22:40:45,563 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 175 transitions, 1830 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:40:45,563 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:40:45,563 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-03 22:40:45,563 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:40:46,760 INFO  L124   PetriNetUnfolderBase]: 2011/2995 cut-off events.
[2024-06-03 22:40:46,760 INFO  L125   PetriNetUnfolderBase]: For 75750/75753 co-relation queries the response was YES.
[2024-06-03 22:40:46,772 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 20048 conditions, 2995 events. 2011/2995 cut-off events. For 75750/75753 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 13758 event pairs, 509 based on Foata normal form. 6/2992 useless extension candidates. Maximal degree in co-relation 19983. Up to 2386 conditions per place. 
[2024-06-03 22:40:46,782 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 145 selfloop transitions, 69 changer transitions 0/217 dead transitions.
[2024-06-03 22:40:46,782 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 217 transitions, 2773 flow
[2024-06-03 22:40:46,784 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 22:40:46,784 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 22:40:46,785 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 146 transitions.
[2024-06-03 22:40:46,785 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4451219512195122
[2024-06-03 22:40:46,785 INFO  L175             Difference]: Start difference. First operand has 138 places, 175 transitions, 1830 flow. Second operand 8 states and 146 transitions.
[2024-06-03 22:40:46,785 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 217 transitions, 2773 flow
[2024-06-03 22:40:46,825 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 217 transitions, 2679 flow, removed 13 selfloop flow, removed 6 redundant places.
[2024-06-03 22:40:46,828 INFO  L231             Difference]: Finished difference. Result has 142 places, 183 transitions, 2038 flow
[2024-06-03 22:40:46,828 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1736, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2038, PETRI_PLACES=142, PETRI_TRANSITIONS=183}
[2024-06-03 22:40:46,828 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 100 predicate places.
[2024-06-03 22:40:46,829 INFO  L495      AbstractCegarLoop]: Abstraction has has 142 places, 183 transitions, 2038 flow
[2024-06-03 22:40:46,829 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:40:46,829 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:40:46,829 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:40:46,829 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2024-06-03 22:40:46,829 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:40:46,830 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:40:46,830 INFO  L85        PathProgramCache]: Analyzing trace with hash 1047976838, now seen corresponding path program 6 times
[2024-06-03 22:40:46,830 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:40:46,830 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658243916]
[2024-06-03 22:40:46,830 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:40:46,830 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:40:46,866 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:40:54,221 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:40:54,221 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:40:54,221 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658243916]
[2024-06-03 22:40:54,221 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658243916] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:40:54,221 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:40:54,221 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 22:40:54,221 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130211507]
[2024-06-03 22:40:54,221 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:40:54,222 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 22:40:54,222 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:40:54,222 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 22:40:54,222 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-06-03 22:40:54,343 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-03 22:40:54,344 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 183 transitions, 2038 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:40:54,344 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:40:54,345 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-03 22:40:54,345 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:40:55,552 INFO  L124   PetriNetUnfolderBase]: 1997/2977 cut-off events.
[2024-06-03 22:40:55,553 INFO  L125   PetriNetUnfolderBase]: For 82039/82042 co-relation queries the response was YES.
[2024-06-03 22:40:55,567 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 20763 conditions, 2977 events. 1997/2977 cut-off events. For 82039/82042 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 13675 event pairs, 495 based on Foata normal form. 10/2978 useless extension candidates. Maximal degree in co-relation 20695. Up to 2382 conditions per place. 
[2024-06-03 22:40:55,579 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 141 selfloop transitions, 72 changer transitions 0/216 dead transitions.
[2024-06-03 22:40:55,579 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 216 transitions, 2794 flow
[2024-06-03 22:40:55,581 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 22:40:55,581 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 22:40:55,582 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 143 transitions.
[2024-06-03 22:40:55,583 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43597560975609756
[2024-06-03 22:40:55,583 INFO  L175             Difference]: Start difference. First operand has 142 places, 183 transitions, 2038 flow. Second operand 8 states and 143 transitions.
[2024-06-03 22:40:55,583 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 216 transitions, 2794 flow
[2024-06-03 22:40:55,646 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 216 transitions, 2626 flow, removed 35 selfloop flow, removed 4 redundant places.
[2024-06-03 22:40:55,651 INFO  L231             Difference]: Finished difference. Result has 146 places, 184 transitions, 2040 flow
[2024-06-03 22:40:55,651 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1879, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2040, PETRI_PLACES=146, PETRI_TRANSITIONS=184}
[2024-06-03 22:40:55,652 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 104 predicate places.
[2024-06-03 22:40:55,652 INFO  L495      AbstractCegarLoop]: Abstraction has has 146 places, 184 transitions, 2040 flow
[2024-06-03 22:40:55,652 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:40:55,652 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:40:55,665 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:40:55,665 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2024-06-03 22:40:55,665 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:40:55,666 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:40:55,666 INFO  L85        PathProgramCache]: Analyzing trace with hash 1040834655, now seen corresponding path program 3 times
[2024-06-03 22:40:55,666 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:40:55,666 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539352695]
[2024-06-03 22:40:55,666 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:40:55,666 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:40:55,741 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:41:04,376 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:41:04,377 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:41:04,377 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539352695]
[2024-06-03 22:41:04,377 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539352695] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:41:04,377 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:41:04,377 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 22:41:04,377 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565094847]
[2024-06-03 22:41:04,377 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:41:04,379 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 22:41:04,379 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:41:04,380 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 22:41:04,381 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-03 22:41:04,556 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-03 22:41:04,557 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 184 transitions, 2040 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:41:04,557 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:41:04,557 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-03 22:41:04,557 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:41:05,754 INFO  L124   PetriNetUnfolderBase]: 1986/2958 cut-off events.
[2024-06-03 22:41:05,755 INFO  L125   PetriNetUnfolderBase]: For 85504/85510 co-relation queries the response was YES.
[2024-06-03 22:41:05,766 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 20650 conditions, 2958 events. 1986/2958 cut-off events. For 85504/85510 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 13574 event pairs, 540 based on Foata normal form. 6/2957 useless extension candidates. Maximal degree in co-relation 20581. Up to 2793 conditions per place. 
[2024-06-03 22:41:05,775 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 161 selfloop transitions, 48 changer transitions 0/212 dead transitions.
[2024-06-03 22:41:05,775 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 212 transitions, 2566 flow
[2024-06-03 22:41:05,777 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 22:41:05,777 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 22:41:05,778 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 142 transitions.
[2024-06-03 22:41:05,778 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.38482384823848237
[2024-06-03 22:41:05,778 INFO  L175             Difference]: Start difference. First operand has 146 places, 184 transitions, 2040 flow. Second operand 9 states and 142 transitions.
[2024-06-03 22:41:05,778 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 212 transitions, 2566 flow
[2024-06-03 22:41:05,832 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 212 transitions, 2455 flow, removed 3 selfloop flow, removed 4 redundant places.
[2024-06-03 22:41:05,835 INFO  L231             Difference]: Finished difference. Result has 151 places, 186 transitions, 2068 flow
[2024-06-03 22:41:05,835 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1931, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2068, PETRI_PLACES=151, PETRI_TRANSITIONS=186}
[2024-06-03 22:41:05,836 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 109 predicate places.
[2024-06-03 22:41:05,836 INFO  L495      AbstractCegarLoop]: Abstraction has has 151 places, 186 transitions, 2068 flow
[2024-06-03 22:41:05,836 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:41:05,836 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:41:05,836 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:41:05,836 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26
[2024-06-03 22:41:05,837 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:41:05,837 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:41:05,837 INFO  L85        PathProgramCache]: Analyzing trace with hash -127389673, now seen corresponding path program 1 times
[2024-06-03 22:41:05,837 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:41:05,837 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188339223]
[2024-06-03 22:41:05,837 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:41:05,837 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:41:05,902 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:41:12,809 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:41:12,809 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:41:12,809 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188339223]
[2024-06-03 22:41:12,810 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188339223] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:41:12,810 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:41:12,810 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 22:41:12,810 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025890074]
[2024-06-03 22:41:12,810 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:41:12,811 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 22:41:12,811 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:41:12,811 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 22:41:12,811 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90
[2024-06-03 22:41:12,993 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41
[2024-06-03 22:41:12,993 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 186 transitions, 2068 flow. Second operand  has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:41:12,994 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:41:12,994 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41
[2024-06-03 22:41:12,994 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:41:14,241 INFO  L124   PetriNetUnfolderBase]: 1977/2977 cut-off events.
[2024-06-03 22:41:14,241 INFO  L125   PetriNetUnfolderBase]: For 97755/97781 co-relation queries the response was YES.
[2024-06-03 22:41:14,253 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 21023 conditions, 2977 events. 1977/2977 cut-off events. For 97755/97781 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 14050 event pairs, 455 based on Foata normal form. 10/2924 useless extension candidates. Maximal degree in co-relation 20953. Up to 2694 conditions per place. 
[2024-06-03 22:41:14,263 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 152 selfloop transitions, 44 changer transitions 0/229 dead transitions.
[2024-06-03 22:41:14,263 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 229 transitions, 2709 flow
[2024-06-03 22:41:14,265 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 22:41:14,265 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 22:41:14,266 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 150 transitions.
[2024-06-03 22:41:14,266 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4065040650406504
[2024-06-03 22:41:14,266 INFO  L175             Difference]: Start difference. First operand has 151 places, 186 transitions, 2068 flow. Second operand 9 states and 150 transitions.
[2024-06-03 22:41:14,266 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 229 transitions, 2709 flow
[2024-06-03 22:41:14,329 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 229 transitions, 2592 flow, removed 13 selfloop flow, removed 7 redundant places.
[2024-06-03 22:41:14,332 INFO  L231             Difference]: Finished difference. Result has 155 places, 200 transitions, 2211 flow
[2024-06-03 22:41:14,332 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1951, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2211, PETRI_PLACES=155, PETRI_TRANSITIONS=200}
[2024-06-03 22:41:14,333 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 113 predicate places.
[2024-06-03 22:41:14,333 INFO  L495      AbstractCegarLoop]: Abstraction has has 155 places, 200 transitions, 2211 flow
[2024-06-03 22:41:14,333 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:41:14,333 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:41:14,333 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:41:14,333 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27
[2024-06-03 22:41:14,334 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:41:14,334 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:41:14,334 INFO  L85        PathProgramCache]: Analyzing trace with hash -640639999, now seen corresponding path program 2 times
[2024-06-03 22:41:14,334 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:41:14,334 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102818652]
[2024-06-03 22:41:14,334 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:41:14,334 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:41:14,388 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:41:22,415 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:41:22,416 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:41:22,416 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102818652]
[2024-06-03 22:41:22,416 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102818652] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:41:22,416 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:41:22,416 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 22:41:22,416 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511201766]
[2024-06-03 22:41:22,416 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:41:22,416 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 22:41:22,416 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:41:22,417 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 22:41:22,417 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90
[2024-06-03 22:41:22,598 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41
[2024-06-03 22:41:22,598 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 200 transitions, 2211 flow. Second operand  has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:41:22,598 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:41:22,598 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41
[2024-06-03 22:41:22,598 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:41:23,921 INFO  L124   PetriNetUnfolderBase]: 1999/3016 cut-off events.
[2024-06-03 22:41:23,921 INFO  L125   PetriNetUnfolderBase]: For 104437/104472 co-relation queries the response was YES.
[2024-06-03 22:41:23,934 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 21637 conditions, 3016 events. 1999/3016 cut-off events. For 104437/104472 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 14265 event pairs, 471 based on Foata normal form. 10/2964 useless extension candidates. Maximal degree in co-relation 21564. Up to 2702 conditions per place. 
[2024-06-03 22:41:23,944 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 144 selfloop transitions, 53 changer transitions 0/230 dead transitions.
[2024-06-03 22:41:23,944 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 230 transitions, 2727 flow
[2024-06-03 22:41:23,945 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 22:41:23,945 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 22:41:23,945 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 139 transitions.
[2024-06-03 22:41:23,945 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42378048780487804
[2024-06-03 22:41:23,945 INFO  L175             Difference]: Start difference. First operand has 155 places, 200 transitions, 2211 flow. Second operand 8 states and 139 transitions.
[2024-06-03 22:41:23,945 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 230 transitions, 2727 flow
[2024-06-03 22:41:24,006 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 230 transitions, 2650 flow, removed 16 selfloop flow, removed 3 redundant places.
[2024-06-03 22:41:24,008 INFO  L231             Difference]: Finished difference. Result has 160 places, 202 transitions, 2292 flow
[2024-06-03 22:41:24,009 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2134, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2292, PETRI_PLACES=160, PETRI_TRANSITIONS=202}
[2024-06-03 22:41:24,009 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 118 predicate places.
[2024-06-03 22:41:24,010 INFO  L495      AbstractCegarLoop]: Abstraction has has 160 places, 202 transitions, 2292 flow
[2024-06-03 22:41:24,010 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:41:24,010 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:41:24,010 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:41:24,010 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28
[2024-06-03 22:41:24,010 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:41:24,011 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:41:24,011 INFO  L85        PathProgramCache]: Analyzing trace with hash 1171896451, now seen corresponding path program 1 times
[2024-06-03 22:41:24,011 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:41:24,011 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875183906]
[2024-06-03 22:41:24,011 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:41:24,011 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:41:24,055 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:41:31,805 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:41:31,806 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:41:31,806 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875183906]
[2024-06-03 22:41:31,806 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875183906] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:41:31,806 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:41:31,806 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 22:41:31,806 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849585239]
[2024-06-03 22:41:31,807 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:41:31,807 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 22:41:31,807 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:41:31,807 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 22:41:31,807 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90
[2024-06-03 22:41:31,973 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-03 22:41:31,974 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 202 transitions, 2292 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:41:31,974 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:41:31,975 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-03 22:41:31,975 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:41:33,215 INFO  L124   PetriNetUnfolderBase]: 2091/3126 cut-off events.
[2024-06-03 22:41:33,215 INFO  L125   PetriNetUnfolderBase]: For 104774/104774 co-relation queries the response was YES.
[2024-06-03 22:41:33,227 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 22212 conditions, 3126 events. 2091/3126 cut-off events. For 104774/104774 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 14576 event pairs, 496 based on Foata normal form. 2/3125 useless extension candidates. Maximal degree in co-relation 22137. Up to 2958 conditions per place. 
[2024-06-03 22:41:33,236 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 195 selfloop transitions, 35 changer transitions 0/233 dead transitions.
[2024-06-03 22:41:33,236 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 233 transitions, 2886 flow
[2024-06-03 22:41:33,238 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 22:41:33,238 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 22:41:33,238 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 133 transitions.
[2024-06-03 22:41:33,239 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4054878048780488
[2024-06-03 22:41:33,239 INFO  L175             Difference]: Start difference. First operand has 160 places, 202 transitions, 2292 flow. Second operand 8 states and 133 transitions.
[2024-06-03 22:41:33,239 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 233 transitions, 2886 flow
[2024-06-03 22:41:33,305 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 233 transitions, 2752 flow, removed 17 selfloop flow, removed 6 redundant places.
[2024-06-03 22:41:33,309 INFO  L231             Difference]: Finished difference. Result has 162 places, 205 transitions, 2294 flow
[2024-06-03 22:41:33,309 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2158, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2294, PETRI_PLACES=162, PETRI_TRANSITIONS=205}
[2024-06-03 22:41:33,310 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 120 predicate places.
[2024-06-03 22:41:33,310 INFO  L495      AbstractCegarLoop]: Abstraction has has 162 places, 205 transitions, 2294 flow
[2024-06-03 22:41:33,310 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:41:33,310 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:41:33,310 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:41:33,310 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29
[2024-06-03 22:41:33,311 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:41:33,311 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:41:33,311 INFO  L85        PathProgramCache]: Analyzing trace with hash -640519719, now seen corresponding path program 1 times
[2024-06-03 22:41:33,311 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:41:33,311 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092852939]
[2024-06-03 22:41:33,311 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:41:33,311 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:41:33,368 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:41:41,568 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:41:41,568 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:41:41,568 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092852939]
[2024-06-03 22:41:41,568 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092852939] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:41:41,568 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:41:41,568 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 22:41:41,569 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838929252]
[2024-06-03 22:41:41,569 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:41:41,569 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 22:41:41,569 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:41:41,569 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 22:41:41,569 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-03 22:41:41,684 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-03 22:41:41,685 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 205 transitions, 2294 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:41:41,685 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:41:41,685 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-03 22:41:41,685 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:41:43,146 INFO  L124   PetriNetUnfolderBase]: 2113/3156 cut-off events.
[2024-06-03 22:41:43,146 INFO  L125   PetriNetUnfolderBase]: For 111182/111184 co-relation queries the response was YES.
[2024-06-03 22:41:43,160 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 22573 conditions, 3156 events. 2113/3156 cut-off events. For 111182/111184 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 14727 event pairs, 487 based on Foata normal form. 6/3159 useless extension candidates. Maximal degree in co-relation 22497. Up to 2990 conditions per place. 
[2024-06-03 22:41:43,171 INFO  L140   encePairwiseOnDemand]: 28/41 looper letters, 212 selfloop transitions, 33 changer transitions 0/248 dead transitions.
[2024-06-03 22:41:43,171 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 248 transitions, 2952 flow
[2024-06-03 22:41:43,172 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-03 22:41:43,172 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-03 22:41:43,172 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 164 transitions.
[2024-06-03 22:41:43,172 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4
[2024-06-03 22:41:43,172 INFO  L175             Difference]: Start difference. First operand has 162 places, 205 transitions, 2294 flow. Second operand 10 states and 164 transitions.
[2024-06-03 22:41:43,173 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 248 transitions, 2952 flow
[2024-06-03 22:41:43,247 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 248 transitions, 2879 flow, removed 17 selfloop flow, removed 4 redundant places.
[2024-06-03 22:41:43,250 INFO  L231             Difference]: Finished difference. Result has 168 places, 208 transitions, 2342 flow
[2024-06-03 22:41:43,250 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2221, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2342, PETRI_PLACES=168, PETRI_TRANSITIONS=208}
[2024-06-03 22:41:43,251 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 126 predicate places.
[2024-06-03 22:41:43,251 INFO  L495      AbstractCegarLoop]: Abstraction has has 168 places, 208 transitions, 2342 flow
[2024-06-03 22:41:43,251 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:41:43,251 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:41:43,251 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:41:43,251 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30
[2024-06-03 22:41:43,251 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:41:43,252 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:41:43,252 INFO  L85        PathProgramCache]: Analyzing trace with hash -525233509, now seen corresponding path program 3 times
[2024-06-03 22:41:43,252 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:41:43,252 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671149623]
[2024-06-03 22:41:43,252 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:41:43,252 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:41:43,302 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:41:51,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:41:51,565 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:41:51,565 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671149623]
[2024-06-03 22:41:51,565 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671149623] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:41:51,565 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:41:51,565 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 22:41:51,565 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785195476]
[2024-06-03 22:41:51,565 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:41:51,566 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 22:41:51,566 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:41:51,566 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 22:41:51,566 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-03 22:41:51,783 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41
[2024-06-03 22:41:51,783 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 208 transitions, 2342 flow. Second operand  has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:41:51,783 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:41:51,784 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41
[2024-06-03 22:41:51,784 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:41:53,105 INFO  L124   PetriNetUnfolderBase]: 2029/3061 cut-off events.
[2024-06-03 22:41:53,105 INFO  L125   PetriNetUnfolderBase]: For 125931/125966 co-relation queries the response was YES.
[2024-06-03 22:41:53,118 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 22681 conditions, 3061 events. 2029/3061 cut-off events. For 125931/125966 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 14585 event pairs, 441 based on Foata normal form. 10/3007 useless extension candidates. Maximal degree in co-relation 22604. Up to 2690 conditions per place. 
[2024-06-03 22:41:53,130 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 136 selfloop transitions, 66 changer transitions 0/237 dead transitions.
[2024-06-03 22:41:53,130 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 237 transitions, 2870 flow
[2024-06-03 22:41:53,131 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 22:41:53,131 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 22:41:53,131 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 139 transitions.
[2024-06-03 22:41:53,131 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42378048780487804
[2024-06-03 22:41:53,131 INFO  L175             Difference]: Start difference. First operand has 168 places, 208 transitions, 2342 flow. Second operand 8 states and 139 transitions.
[2024-06-03 22:41:53,132 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 237 transitions, 2870 flow
[2024-06-03 22:41:53,194 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 237 transitions, 2759 flow, removed 13 selfloop flow, removed 9 redundant places.
[2024-06-03 22:41:53,197 INFO  L231             Difference]: Finished difference. Result has 167 places, 210 transitions, 2417 flow
[2024-06-03 22:41:53,197 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2231, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2417, PETRI_PLACES=167, PETRI_TRANSITIONS=210}
[2024-06-03 22:41:53,197 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 125 predicate places.
[2024-06-03 22:41:53,198 INFO  L495      AbstractCegarLoop]: Abstraction has has 167 places, 210 transitions, 2417 flow
[2024-06-03 22:41:53,198 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:41:53,198 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:41:53,198 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:41:53,198 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31
[2024-06-03 22:41:53,198 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:41:53,198 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:41:53,199 INFO  L85        PathProgramCache]: Analyzing trace with hash -525228549, now seen corresponding path program 2 times
[2024-06-03 22:41:53,199 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:41:53,199 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506180892]
[2024-06-03 22:41:53,199 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:41:53,199 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:41:53,235 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:42:00,968 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:42:00,969 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:42:00,969 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506180892]
[2024-06-03 22:42:00,969 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506180892] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:42:00,969 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:42:00,969 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 22:42:00,969 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741775381]
[2024-06-03 22:42:00,969 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:42:00,969 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 22:42:00,969 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:42:00,970 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 22:42:00,970 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-03 22:42:01,146 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-03 22:42:01,147 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 210 transitions, 2417 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:42:01,147 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:42:01,147 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-03 22:42:01,147 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:42:02,413 INFO  L124   PetriNetUnfolderBase]: 2128/3181 cut-off events.
[2024-06-03 22:42:02,414 INFO  L125   PetriNetUnfolderBase]: For 124058/124060 co-relation queries the response was YES.
[2024-06-03 22:42:02,427 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 23259 conditions, 3181 events. 2128/3181 cut-off events. For 124058/124060 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 14923 event pairs, 479 based on Foata normal form. 6/3184 useless extension candidates. Maximal degree in co-relation 23181. Up to 2838 conditions per place. 
[2024-06-03 22:42:02,438 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 181 selfloop transitions, 55 changer transitions 0/239 dead transitions.
[2024-06-03 22:42:02,438 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 239 transitions, 2985 flow
[2024-06-03 22:42:02,440 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 22:42:02,440 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 22:42:02,441 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 135 transitions.
[2024-06-03 22:42:02,441 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4115853658536585
[2024-06-03 22:42:02,441 INFO  L175             Difference]: Start difference. First operand has 167 places, 210 transitions, 2417 flow. Second operand 8 states and 135 transitions.
[2024-06-03 22:42:02,441 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 239 transitions, 2985 flow
[2024-06-03 22:42:02,510 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 239 transitions, 2807 flow, removed 25 selfloop flow, removed 6 redundant places.
[2024-06-03 22:42:02,513 INFO  L231             Difference]: Finished difference. Result has 170 places, 212 transitions, 2403 flow
[2024-06-03 22:42:02,513 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2239, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2403, PETRI_PLACES=170, PETRI_TRANSITIONS=212}
[2024-06-03 22:42:02,514 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 128 predicate places.
[2024-06-03 22:42:02,514 INFO  L495      AbstractCegarLoop]: Abstraction has has 170 places, 212 transitions, 2403 flow
[2024-06-03 22:42:02,514 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:42:02,514 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:42:02,514 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:42:02,514 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32
[2024-06-03 22:42:02,514 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:42:02,515 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:42:02,515 INFO  L85        PathProgramCache]: Analyzing trace with hash -525048811, now seen corresponding path program 1 times
[2024-06-03 22:42:02,515 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:42:02,515 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113352568]
[2024-06-03 22:42:02,515 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:42:02,515 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:42:02,554 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:42:11,237 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:42:11,238 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:42:11,238 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113352568]
[2024-06-03 22:42:11,238 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113352568] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:42:11,238 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:42:11,238 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 22:42:11,238 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908724565]
[2024-06-03 22:42:11,238 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:42:11,238 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 22:42:11,238 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:42:11,239 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 22:42:11,239 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2024-06-03 22:42:11,508 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-03 22:42:11,509 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 212 transitions, 2403 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:42:11,509 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:42:11,509 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-03 22:42:11,509 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:42:12,986 INFO  L124   PetriNetUnfolderBase]: 2220/3333 cut-off events.
[2024-06-03 22:42:12,987 INFO  L125   PetriNetUnfolderBase]: For 141174/141176 co-relation queries the response was YES.
[2024-06-03 22:42:13,002 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 24105 conditions, 3333 events. 2220/3333 cut-off events. For 141174/141176 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 15883 event pairs, 491 based on Foata normal form. 26/3356 useless extension candidates. Maximal degree in co-relation 24025. Up to 2837 conditions per place. 
[2024-06-03 22:42:13,014 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 190 selfloop transitions, 57 changer transitions 0/250 dead transitions.
[2024-06-03 22:42:13,014 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 250 transitions, 3055 flow
[2024-06-03 22:42:13,016 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 22:42:13,016 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 22:42:13,017 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 153 transitions.
[2024-06-03 22:42:13,018 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4146341463414634
[2024-06-03 22:42:13,018 INFO  L175             Difference]: Start difference. First operand has 170 places, 212 transitions, 2403 flow. Second operand 9 states and 153 transitions.
[2024-06-03 22:42:13,018 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 250 transitions, 3055 flow
[2024-06-03 22:42:13,101 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 250 transitions, 2909 flow, removed 7 selfloop flow, removed 7 redundant places.
[2024-06-03 22:42:13,104 INFO  L231             Difference]: Finished difference. Result has 172 places, 214 transitions, 2418 flow
[2024-06-03 22:42:13,104 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2257, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2418, PETRI_PLACES=172, PETRI_TRANSITIONS=214}
[2024-06-03 22:42:13,104 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 130 predicate places.
[2024-06-03 22:42:13,105 INFO  L495      AbstractCegarLoop]: Abstraction has has 172 places, 214 transitions, 2418 flow
[2024-06-03 22:42:13,105 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:42:13,105 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:42:13,105 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:42:13,105 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33
[2024-06-03 22:42:13,105 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:42:13,106 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:42:13,106 INFO  L85        PathProgramCache]: Analyzing trace with hash -2094093821, now seen corresponding path program 2 times
[2024-06-03 22:42:13,106 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:42:13,106 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516571477]
[2024-06-03 22:42:13,106 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:42:13,106 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:42:13,143 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:42:21,381 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:42:21,381 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:42:21,381 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516571477]
[2024-06-03 22:42:21,381 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516571477] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:42:21,381 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:42:21,381 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 22:42:21,382 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358843346]
[2024-06-03 22:42:21,382 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:42:21,382 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 22:42:21,382 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:42:21,382 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 22:42:21,382 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-03 22:42:21,504 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-03 22:42:21,505 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 214 transitions, 2418 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:42:21,505 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:42:21,505 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-03 22:42:21,505 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:42:22,836 INFO  L124   PetriNetUnfolderBase]: 2248/3374 cut-off events.
[2024-06-03 22:42:22,836 INFO  L125   PetriNetUnfolderBase]: For 131932/131938 co-relation queries the response was YES.
[2024-06-03 22:42:22,853 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 24560 conditions, 3374 events. 2248/3374 cut-off events. For 131932/131938 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 16109 event pairs, 521 based on Foata normal form. 8/3374 useless extension candidates. Maximal degree in co-relation 24479. Up to 3222 conditions per place. 
[2024-06-03 22:42:22,865 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 202 selfloop transitions, 41 changer transitions 0/246 dead transitions.
[2024-06-03 22:42:22,866 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 246 transitions, 3051 flow
[2024-06-03 22:42:22,868 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 22:42:22,868 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 22:42:22,868 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 141 transitions.
[2024-06-03 22:42:22,868 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3821138211382114
[2024-06-03 22:42:22,868 INFO  L175             Difference]: Start difference. First operand has 172 places, 214 transitions, 2418 flow. Second operand 9 states and 141 transitions.
[2024-06-03 22:42:22,868 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 246 transitions, 3051 flow
[2024-06-03 22:42:22,961 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 246 transitions, 2924 flow, removed 10 selfloop flow, removed 7 redundant places.
[2024-06-03 22:42:22,964 INFO  L231             Difference]: Finished difference. Result has 175 places, 219 transitions, 2461 flow
[2024-06-03 22:42:22,965 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2291, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2461, PETRI_PLACES=175, PETRI_TRANSITIONS=219}
[2024-06-03 22:42:22,965 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 133 predicate places.
[2024-06-03 22:42:22,965 INFO  L495      AbstractCegarLoop]: Abstraction has has 175 places, 219 transitions, 2461 flow
[2024-06-03 22:42:22,965 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:42:22,965 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:42:22,966 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:42:22,966 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34
[2024-06-03 22:42:22,966 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:42:22,966 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:42:22,966 INFO  L85        PathProgramCache]: Analyzing trace with hash 1453476891, now seen corresponding path program 3 times
[2024-06-03 22:42:22,966 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:42:22,966 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473200559]
[2024-06-03 22:42:22,966 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:42:22,967 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:42:23,003 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:42:31,127 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:42:31,127 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:42:31,127 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473200559]
[2024-06-03 22:42:31,127 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473200559] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:42:31,127 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:42:31,127 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 22:42:31,128 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122369673]
[2024-06-03 22:42:31,128 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:42:31,128 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 22:42:31,129 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:42:31,129 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 22:42:31,129 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-03 22:42:31,317 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-03 22:42:31,318 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 219 transitions, 2461 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:42:31,318 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:42:31,318 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-03 22:42:31,318 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:42:32,649 INFO  L124   PetriNetUnfolderBase]: 2238/3365 cut-off events.
[2024-06-03 22:42:32,650 INFO  L125   PetriNetUnfolderBase]: For 137228/137234 co-relation queries the response was YES.
[2024-06-03 22:42:32,667 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 24527 conditions, 3365 events. 2238/3365 cut-off events. For 137228/137234 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 16120 event pairs, 498 based on Foata normal form. 8/3360 useless extension candidates. Maximal degree in co-relation 24444. Up to 2935 conditions per place. 
[2024-06-03 22:42:32,680 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 173 selfloop transitions, 73 changer transitions 0/249 dead transitions.
[2024-06-03 22:42:32,681 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 249 transitions, 3067 flow
[2024-06-03 22:42:32,682 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 22:42:32,683 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 22:42:32,683 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 137 transitions.
[2024-06-03 22:42:32,683 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4176829268292683
[2024-06-03 22:42:32,683 INFO  L175             Difference]: Start difference. First operand has 175 places, 219 transitions, 2461 flow. Second operand 8 states and 137 transitions.
[2024-06-03 22:42:32,683 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 249 transitions, 3067 flow
[2024-06-03 22:42:32,793 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 249 transitions, 2942 flow, removed 25 selfloop flow, removed 6 redundant places.
[2024-06-03 22:42:32,796 INFO  L231             Difference]: Finished difference. Result has 179 places, 223 transitions, 2574 flow
[2024-06-03 22:42:32,796 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2336, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2574, PETRI_PLACES=179, PETRI_TRANSITIONS=223}
[2024-06-03 22:42:32,797 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 137 predicate places.
[2024-06-03 22:42:32,797 INFO  L495      AbstractCegarLoop]: Abstraction has has 179 places, 223 transitions, 2574 flow
[2024-06-03 22:42:32,797 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:42:32,797 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:42:32,797 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:42:32,797 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35
[2024-06-03 22:42:32,797 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:42:32,798 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:42:32,798 INFO  L85        PathProgramCache]: Analyzing trace with hash -2093854811, now seen corresponding path program 3 times
[2024-06-03 22:42:32,798 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:42:32,798 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964682410]
[2024-06-03 22:42:32,798 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:42:32,798 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:42:32,835 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:42:41,138 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:42:41,138 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:42:41,138 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964682410]
[2024-06-03 22:42:41,138 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964682410] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:42:41,139 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:42:41,139 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 22:42:41,139 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355835116]
[2024-06-03 22:42:41,139 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:42:41,140 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 22:42:41,141 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:42:41,141 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 22:42:41,141 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2024-06-03 22:42:41,351 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-03 22:42:41,352 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 223 transitions, 2574 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:42:41,352 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:42:41,352 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-03 22:42:41,352 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:42:42,912 INFO  L124   PetriNetUnfolderBase]: 2366/3573 cut-off events.
[2024-06-03 22:42:42,913 INFO  L125   PetriNetUnfolderBase]: For 157270/157276 co-relation queries the response was YES.
[2024-06-03 22:42:42,930 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 26606 conditions, 3573 events. 2366/3573 cut-off events. For 157270/157276 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 17371 event pairs, 452 based on Foata normal form. 8/3568 useless extension candidates. Maximal degree in co-relation 26520. Up to 2579 conditions per place. 
[2024-06-03 22:42:42,942 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 161 selfloop transitions, 102 changer transitions 0/266 dead transitions.
[2024-06-03 22:42:42,942 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 266 transitions, 3590 flow
[2024-06-03 22:42:42,944 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 22:42:42,945 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 22:42:42,945 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 159 transitions.
[2024-06-03 22:42:42,945 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43089430894308944
[2024-06-03 22:42:42,945 INFO  L175             Difference]: Start difference. First operand has 179 places, 223 transitions, 2574 flow. Second operand 9 states and 159 transitions.
[2024-06-03 22:42:42,945 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 266 transitions, 3590 flow
[2024-06-03 22:42:43,049 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 266 transitions, 3476 flow, removed 1 selfloop flow, removed 5 redundant places.
[2024-06-03 22:42:43,052 INFO  L231             Difference]: Finished difference. Result has 183 places, 227 transitions, 2755 flow
[2024-06-03 22:42:43,052 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2460, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=100, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2755, PETRI_PLACES=183, PETRI_TRANSITIONS=227}
[2024-06-03 22:42:43,053 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 141 predicate places.
[2024-06-03 22:42:43,053 INFO  L495      AbstractCegarLoop]: Abstraction has has 183 places, 227 transitions, 2755 flow
[2024-06-03 22:42:43,053 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:42:43,053 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:42:43,053 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:42:43,053 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36
[2024-06-03 22:42:43,053 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:42:43,054 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:42:43,054 INFO  L85        PathProgramCache]: Analyzing trace with hash -1872218141, now seen corresponding path program 4 times
[2024-06-03 22:42:43,054 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:42:43,054 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224855197]
[2024-06-03 22:42:43,054 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:42:43,054 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:42:43,090 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:42:51,134 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:42:51,134 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:42:51,135 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224855197]
[2024-06-03 22:42:51,135 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224855197] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:42:51,135 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:42:51,135 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 22:42:51,135 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651998325]
[2024-06-03 22:42:51,135 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:42:51,135 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 22:42:51,135 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:42:51,135 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 22:42:51,136 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2024-06-03 22:42:51,299 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-03 22:42:51,300 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 227 transitions, 2755 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:42:51,300 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:42:51,300 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-03 22:42:51,300 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:42:52,893 INFO  L124   PetriNetUnfolderBase]: 2383/3600 cut-off events.
[2024-06-03 22:42:52,893 INFO  L125   PetriNetUnfolderBase]: For 167830/167836 co-relation queries the response was YES.
[2024-06-03 22:42:52,911 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 27484 conditions, 3600 events. 2383/3600 cut-off events. For 167830/167836 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 17649 event pairs, 526 based on Foata normal form. 8/3595 useless extension candidates. Maximal degree in co-relation 27397. Up to 3016 conditions per place. 
[2024-06-03 22:42:52,924 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 163 selfloop transitions, 95 changer transitions 0/261 dead transitions.
[2024-06-03 22:42:52,925 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 261 transitions, 3555 flow
[2024-06-03 22:42:52,927 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 22:42:52,927 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 22:42:52,927 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 152 transitions.
[2024-06-03 22:42:52,927 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41192411924119243
[2024-06-03 22:42:52,927 INFO  L175             Difference]: Start difference. First operand has 183 places, 227 transitions, 2755 flow. Second operand 9 states and 152 transitions.
[2024-06-03 22:42:52,927 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 261 transitions, 3555 flow
[2024-06-03 22:42:53,052 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 261 transitions, 3373 flow, removed 29 selfloop flow, removed 6 redundant places.
[2024-06-03 22:42:53,056 INFO  L231             Difference]: Finished difference. Result has 186 places, 229 transitions, 2818 flow
[2024-06-03 22:42:53,056 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2581, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=93, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2818, PETRI_PLACES=186, PETRI_TRANSITIONS=229}
[2024-06-03 22:42:53,057 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 144 predicate places.
[2024-06-03 22:42:53,057 INFO  L495      AbstractCegarLoop]: Abstraction has has 186 places, 229 transitions, 2818 flow
[2024-06-03 22:42:53,057 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:42:53,057 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:42:53,057 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:42:53,057 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37
[2024-06-03 22:42:53,058 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:42:53,058 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:42:53,058 INFO  L85        PathProgramCache]: Analyzing trace with hash -2100534629, now seen corresponding path program 4 times
[2024-06-03 22:42:53,058 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:42:53,058 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467275359]
[2024-06-03 22:42:53,058 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:42:53,058 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:42:53,122 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:43:01,905 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:43:01,906 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:43:01,906 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467275359]
[2024-06-03 22:43:01,906 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467275359] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:43:01,906 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:43:01,906 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 22:43:01,906 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432993114]
[2024-06-03 22:43:01,906 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:43:01,907 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 22:43:01,907 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:43:01,907 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 22:43:01,907 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-03 22:43:02,026 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41
[2024-06-03 22:43:02,026 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 229 transitions, 2818 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:43:02,026 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:43:02,026 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41
[2024-06-03 22:43:02,027 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:43:03,467 INFO  L124   PetriNetUnfolderBase]: 2267/3469 cut-off events.
[2024-06-03 22:43:03,467 INFO  L125   PetriNetUnfolderBase]: For 182430/182495 co-relation queries the response was YES.
[2024-06-03 22:43:03,487 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 27055 conditions, 3469 events. 2267/3469 cut-off events. For 182430/182495 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 17349 event pairs, 519 based on Foata normal form. 10/3403 useless extension candidates. Maximal degree in co-relation 26968. Up to 3015 conditions per place. 
[2024-06-03 22:43:03,502 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 140 selfloop transitions, 72 changer transitions 0/256 dead transitions.
[2024-06-03 22:43:03,502 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 256 transitions, 3364 flow
[2024-06-03 22:43:03,503 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 22:43:03,503 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 22:43:03,503 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 138 transitions.
[2024-06-03 22:43:03,503 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42073170731707316
[2024-06-03 22:43:03,503 INFO  L175             Difference]: Start difference. First operand has 186 places, 229 transitions, 2818 flow. Second operand 8 states and 138 transitions.
[2024-06-03 22:43:03,503 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 256 transitions, 3364 flow
[2024-06-03 22:43:03,636 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 256 transitions, 3133 flow, removed 17 selfloop flow, removed 8 redundant places.
[2024-06-03 22:43:03,639 INFO  L231             Difference]: Finished difference. Result has 186 places, 231 transitions, 2789 flow
[2024-06-03 22:43:03,640 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2587, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2789, PETRI_PLACES=186, PETRI_TRANSITIONS=231}
[2024-06-03 22:43:03,640 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 144 predicate places.
[2024-06-03 22:43:03,640 INFO  L495      AbstractCegarLoop]: Abstraction has has 186 places, 231 transitions, 2789 flow
[2024-06-03 22:43:03,640 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:43:03,641 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:43:03,641 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:43:03,641 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38
[2024-06-03 22:43:03,641 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:43:03,641 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:43:03,641 INFO  L85        PathProgramCache]: Analyzing trace with hash -2100349931, now seen corresponding path program 5 times
[2024-06-03 22:43:03,641 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:43:03,642 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164203221]
[2024-06-03 22:43:03,642 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:43:03,642 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:43:03,679 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:43:12,001 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:43:12,001 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:43:12,001 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164203221]
[2024-06-03 22:43:12,002 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164203221] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:43:12,002 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:43:12,002 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 22:43:12,002 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801915149]
[2024-06-03 22:43:12,002 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:43:12,002 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 22:43:12,002 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:43:12,002 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 22:43:12,002 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-03 22:43:12,103 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-03 22:43:12,103 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 231 transitions, 2789 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:43:12,103 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:43:12,103 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-03 22:43:12,103 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:43:13,598 INFO  L124   PetriNetUnfolderBase]: 2400/3621 cut-off events.
[2024-06-03 22:43:13,599 INFO  L125   PetriNetUnfolderBase]: For 178134/178140 co-relation queries the response was YES.
[2024-06-03 22:43:13,619 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 27684 conditions, 3621 events. 2400/3621 cut-off events. For 178134/178140 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 17740 event pairs, 576 based on Foata normal form. 8/3622 useless extension candidates. Maximal degree in co-relation 27597. Up to 3470 conditions per place. 
[2024-06-03 22:43:13,633 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 218 selfloop transitions, 38 changer transitions 0/259 dead transitions.
[2024-06-03 22:43:13,633 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 259 transitions, 3399 flow
[2024-06-03 22:43:13,635 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 22:43:13,635 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 22:43:13,635 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 142 transitions.
[2024-06-03 22:43:13,636 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.38482384823848237
[2024-06-03 22:43:13,636 INFO  L175             Difference]: Start difference. First operand has 186 places, 231 transitions, 2789 flow. Second operand 9 states and 142 transitions.
[2024-06-03 22:43:13,636 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 259 transitions, 3399 flow
[2024-06-03 22:43:13,814 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 259 transitions, 3217 flow, removed 21 selfloop flow, removed 6 redundant places.
[2024-06-03 22:43:13,818 INFO  L231             Difference]: Finished difference. Result has 189 places, 232 transitions, 2710 flow
[2024-06-03 22:43:13,818 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2607, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2710, PETRI_PLACES=189, PETRI_TRANSITIONS=232}
[2024-06-03 22:43:13,818 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 147 predicate places.
[2024-06-03 22:43:13,818 INFO  L495      AbstractCegarLoop]: Abstraction has has 189 places, 232 transitions, 2710 flow
[2024-06-03 22:43:13,818 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:43:13,819 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:43:13,819 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:43:13,819 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39
[2024-06-03 22:43:13,819 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:43:13,819 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:43:13,820 INFO  L85        PathProgramCache]: Analyzing trace with hash -2100529669, now seen corresponding path program 4 times
[2024-06-03 22:43:13,820 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:43:13,820 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061423318]
[2024-06-03 22:43:13,820 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:43:13,820 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:43:13,866 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:43:21,069 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:43:21,069 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:43:21,070 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061423318]
[2024-06-03 22:43:21,070 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061423318] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:43:21,070 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:43:21,070 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 22:43:21,070 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619211789]
[2024-06-03 22:43:21,070 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:43:21,070 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 22:43:21,071 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:43:21,071 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 22:43:21,071 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-03 22:43:21,201 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-03 22:43:21,201 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 232 transitions, 2710 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:43:21,201 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:43:21,201 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-03 22:43:21,202 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:43:22,642 INFO  L124   PetriNetUnfolderBase]: 2390/3613 cut-off events.
[2024-06-03 22:43:22,642 INFO  L125   PetriNetUnfolderBase]: For 182454/182460 co-relation queries the response was YES.
[2024-06-03 22:43:22,661 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 27447 conditions, 3613 events. 2390/3613 cut-off events. For 182454/182460 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 17709 event pairs, 545 based on Foata normal form. 8/3608 useless extension candidates. Maximal degree in co-relation 27359. Up to 3173 conditions per place. 
[2024-06-03 22:43:22,673 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 188 selfloop transitions, 67 changer transitions 0/258 dead transitions.
[2024-06-03 22:43:22,673 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 258 transitions, 3302 flow
[2024-06-03 22:43:22,674 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 22:43:22,674 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 22:43:22,674 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 138 transitions.
[2024-06-03 22:43:22,674 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42073170731707316
[2024-06-03 22:43:22,675 INFO  L175             Difference]: Start difference. First operand has 189 places, 232 transitions, 2710 flow. Second operand 8 states and 138 transitions.
[2024-06-03 22:43:22,675 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 258 transitions, 3302 flow
[2024-06-03 22:43:22,813 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 258 transitions, 3179 flow, removed 25 selfloop flow, removed 7 redundant places.
[2024-06-03 22:43:22,817 INFO  L231             Difference]: Finished difference. Result has 190 places, 232 transitions, 2734 flow
[2024-06-03 22:43:22,817 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2587, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2734, PETRI_PLACES=190, PETRI_TRANSITIONS=232}
[2024-06-03 22:43:22,817 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 148 predicate places.
[2024-06-03 22:43:22,817 INFO  L495      AbstractCegarLoop]: Abstraction has has 190 places, 232 transitions, 2734 flow
[2024-06-03 22:43:22,818 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:43:22,818 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:43:22,818 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:43:22,818 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40
[2024-06-03 22:43:22,818 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:43:22,818 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:43:22,818 INFO  L85        PathProgramCache]: Analyzing trace with hash 490955095, now seen corresponding path program 5 times
[2024-06-03 22:43:22,819 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:43:22,819 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889583642]
[2024-06-03 22:43:22,819 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:43:22,819 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:43:22,856 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:43:30,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:43:30,690 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:43:30,690 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889583642]
[2024-06-03 22:43:30,690 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889583642] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:43:30,690 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:43:30,690 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 22:43:30,690 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063372124]
[2024-06-03 22:43:30,690 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:43:30,690 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 22:43:30,691 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:43:30,691 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 22:43:30,691 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2024-06-03 22:43:30,836 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41
[2024-06-03 22:43:30,837 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 232 transitions, 2734 flow. Second operand  has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:43:30,837 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:43:30,837 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41
[2024-06-03 22:43:30,837 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:43:32,291 INFO  L124   PetriNetUnfolderBase]: 2363/3628 cut-off events.
[2024-06-03 22:43:32,291 INFO  L125   PetriNetUnfolderBase]: For 206945/207035 co-relation queries the response was YES.
[2024-06-03 22:43:32,312 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 28107 conditions, 3628 events. 2363/3628 cut-off events. For 206945/207035 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 18459 event pairs, 528 based on Foata normal form. 29/3579 useless extension candidates. Maximal degree in co-relation 28018. Up to 3233 conditions per place. 
[2024-06-03 22:43:32,338 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 180 selfloop transitions, 67 changer transitions 0/292 dead transitions.
[2024-06-03 22:43:32,338 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 292 transitions, 3640 flow
[2024-06-03 22:43:32,340 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 22:43:32,340 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 22:43:32,343 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 156 transitions.
[2024-06-03 22:43:32,344 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42276422764227645
[2024-06-03 22:43:32,344 INFO  L175             Difference]: Start difference. First operand has 190 places, 232 transitions, 2734 flow. Second operand 9 states and 156 transitions.
[2024-06-03 22:43:32,344 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 292 transitions, 3640 flow
[2024-06-03 22:43:32,487 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 292 transitions, 3391 flow, removed 2 selfloop flow, removed 9 redundant places.
[2024-06-03 22:43:32,490 INFO  L231             Difference]: Finished difference. Result has 192 places, 257 transitions, 2979 flow
[2024-06-03 22:43:32,492 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2497, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2979, PETRI_PLACES=192, PETRI_TRANSITIONS=257}
[2024-06-03 22:43:32,492 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 150 predicate places.
[2024-06-03 22:43:32,492 INFO  L495      AbstractCegarLoop]: Abstraction has has 192 places, 257 transitions, 2979 flow
[2024-06-03 22:43:32,492 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:43:32,493 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:43:32,493 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:43:32,493 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41
[2024-06-03 22:43:32,493 INFO  L420      AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:43:32,493 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:43:32,493 INFO  L85        PathProgramCache]: Analyzing trace with hash 1357728267, now seen corresponding path program 6 times
[2024-06-03 22:43:32,494 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:43:32,494 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276794766]
[2024-06-03 22:43:32,494 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:43:32,494 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:43:32,532 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:43:40,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:43:40,321 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:43:40,322 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276794766]
[2024-06-03 22:43:40,323 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276794766] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:43:40,324 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:43:40,324 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 22:43:40,324 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42127389]
[2024-06-03 22:43:40,324 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:43:40,324 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 22:43:40,325 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:43:40,326 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 22:43:40,326 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2024-06-03 22:43:40,527 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41
[2024-06-03 22:43:40,527 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 257 transitions, 2979 flow. Second operand  has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:43:40,528 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:43:40,528 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41
[2024-06-03 22:43:40,528 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:43:42,035 INFO  L124   PetriNetUnfolderBase]: 2433/3756 cut-off events.
[2024-06-03 22:43:42,035 INFO  L125   PetriNetUnfolderBase]: For 214254/214441 co-relation queries the response was YES.
[2024-06-03 22:43:42,062 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 28885 conditions, 3756 events. 2433/3756 cut-off events. For 214254/214441 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 19433 event pairs, 402 based on Foata normal form. 63/3735 useless extension candidates. Maximal degree in co-relation 28793. Up to 3248 conditions per place. 
[2024-06-03 22:43:42,079 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 179 selfloop transitions, 79 changer transitions 0/303 dead transitions.
[2024-06-03 22:43:42,079 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 303 transitions, 3782 flow
[2024-06-03 22:43:42,081 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 22:43:42,081 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 22:43:42,082 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 154 transitions.
[2024-06-03 22:43:42,082 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4173441734417344
[2024-06-03 22:43:42,082 INFO  L175             Difference]: Start difference. First operand has 192 places, 257 transitions, 2979 flow. Second operand 9 states and 154 transitions.
[2024-06-03 22:43:42,082 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 303 transitions, 3782 flow
[2024-06-03 22:43:42,265 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 303 transitions, 3571 flow, removed 44 selfloop flow, removed 6 redundant places.
[2024-06-03 22:43:42,269 INFO  L231             Difference]: Finished difference. Result has 196 places, 270 transitions, 3153 flow
[2024-06-03 22:43:42,280 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2813, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=257, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3153, PETRI_PLACES=196, PETRI_TRANSITIONS=270}
[2024-06-03 22:43:42,281 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 154 predicate places.
[2024-06-03 22:43:42,281 INFO  L495      AbstractCegarLoop]: Abstraction has has 196 places, 270 transitions, 3153 flow
[2024-06-03 22:43:42,282 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:43:42,282 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:43:42,282 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:43:42,282 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42
[2024-06-03 22:43:42,282 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:43:42,282 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:43:42,283 INFO  L85        PathProgramCache]: Analyzing trace with hash 788309719, now seen corresponding path program 7 times
[2024-06-03 22:43:42,283 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:43:42,283 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363077459]
[2024-06-03 22:43:42,283 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:43:42,283 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:43:42,346 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:43:50,696 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:43:50,696 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:43:50,696 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363077459]
[2024-06-03 22:43:50,696 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363077459] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:43:50,696 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:43:50,696 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 22:43:50,696 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971075195]
[2024-06-03 22:43:50,696 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:43:50,696 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 22:43:50,697 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:43:50,697 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 22:43:50,697 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2024-06-03 22:43:50,905 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41
[2024-06-03 22:43:50,905 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 270 transitions, 3153 flow. Second operand  has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:43:50,905 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:43:50,905 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41
[2024-06-03 22:43:50,905 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:43:52,480 INFO  L124   PetriNetUnfolderBase]: 2535/3913 cut-off events.
[2024-06-03 22:43:52,481 INFO  L125   PetriNetUnfolderBase]: For 226099/226440 co-relation queries the response was YES.
[2024-06-03 22:43:52,503 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 30073 conditions, 3913 events. 2535/3913 cut-off events. For 226099/226440 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 20504 event pairs, 556 based on Foata normal form. 93/3913 useless extension candidates. Maximal degree in co-relation 29980. Up to 3432 conditions per place. 
[2024-06-03 22:43:52,519 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 201 selfloop transitions, 90 changer transitions 0/336 dead transitions.
[2024-06-03 22:43:52,520 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 336 transitions, 4346 flow
[2024-06-03 22:43:52,521 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 22:43:52,522 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 22:43:52,522 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 157 transitions.
[2024-06-03 22:43:52,522 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4254742547425474
[2024-06-03 22:43:52,522 INFO  L175             Difference]: Start difference. First operand has 196 places, 270 transitions, 3153 flow. Second operand 9 states and 157 transitions.
[2024-06-03 22:43:52,522 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 336 transitions, 4346 flow
[2024-06-03 22:43:52,690 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 336 transitions, 4057 flow, removed 47 selfloop flow, removed 7 redundant places.
[2024-06-03 22:43:52,694 INFO  L231             Difference]: Finished difference. Result has 200 places, 301 transitions, 3597 flow
[2024-06-03 22:43:52,694 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2955, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3597, PETRI_PLACES=200, PETRI_TRANSITIONS=301}
[2024-06-03 22:43:52,694 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 158 predicate places.
[2024-06-03 22:43:52,694 INFO  L495      AbstractCegarLoop]: Abstraction has has 200 places, 301 transitions, 3597 flow
[2024-06-03 22:43:52,695 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:43:52,695 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:43:52,695 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:43:52,695 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43
[2024-06-03 22:43:52,695 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:43:52,695 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:43:52,695 INFO  L85        PathProgramCache]: Analyzing trace with hash 1996469591, now seen corresponding path program 1 times
[2024-06-03 22:43:52,696 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:43:52,696 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570469258]
[2024-06-03 22:43:52,696 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:43:52,696 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:43:52,734 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:44:01,218 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:44:01,218 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:44:01,218 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570469258]
[2024-06-03 22:44:01,219 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570469258] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:44:01,219 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:44:01,219 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-03 22:44:01,219 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253790128]
[2024-06-03 22:44:01,219 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:44:01,219 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-03 22:44:01,222 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:44:01,222 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-03 22:44:01,222 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110
[2024-06-03 22:44:01,494 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-03 22:44:01,495 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 301 transitions, 3597 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:44:01,495 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:44:01,495 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-03 22:44:01,495 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:44:03,139 INFO  L124   PetriNetUnfolderBase]: 2830/4294 cut-off events.
[2024-06-03 22:44:03,139 INFO  L125   PetriNetUnfolderBase]: For 210498/210502 co-relation queries the response was YES.
[2024-06-03 22:44:03,166 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 32353 conditions, 4294 events. 2830/4294 cut-off events. For 210498/210502 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 22241 event pairs, 413 based on Foata normal form. 8/4299 useless extension candidates. Maximal degree in co-relation 32258. Up to 3746 conditions per place. 
[2024-06-03 22:44:03,184 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 296 selfloop transitions, 59 changer transitions 0/358 dead transitions.
[2024-06-03 22:44:03,184 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 358 transitions, 4751 flow
[2024-06-03 22:44:03,186 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 22:44:03,187 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 22:44:03,187 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 145 transitions.
[2024-06-03 22:44:03,187 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.39295392953929537
[2024-06-03 22:44:03,187 INFO  L175             Difference]: Start difference. First operand has 200 places, 301 transitions, 3597 flow. Second operand 9 states and 145 transitions.
[2024-06-03 22:44:03,187 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 358 transitions, 4751 flow
[2024-06-03 22:44:03,400 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 358 transitions, 4608 flow, removed 31 selfloop flow, removed 3 redundant places.
[2024-06-03 22:44:03,404 INFO  L231             Difference]: Finished difference. Result has 208 places, 325 transitions, 3995 flow
[2024-06-03 22:44:03,404 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3478, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3995, PETRI_PLACES=208, PETRI_TRANSITIONS=325}
[2024-06-03 22:44:03,405 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 166 predicate places.
[2024-06-03 22:44:03,405 INFO  L495      AbstractCegarLoop]: Abstraction has has 208 places, 325 transitions, 3995 flow
[2024-06-03 22:44:03,405 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:44:03,405 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:44:03,405 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:44:03,405 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44
[2024-06-03 22:44:03,406 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:44:03,406 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:44:03,406 INFO  L85        PathProgramCache]: Analyzing trace with hash 1703059289, now seen corresponding path program 2 times
[2024-06-03 22:44:03,406 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:44:03,406 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664249543]
[2024-06-03 22:44:03,406 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:44:03,406 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:44:03,450 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:44:11,749 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:44:11,750 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:44:11,750 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664249543]
[2024-06-03 22:44:11,750 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664249543] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:44:11,750 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:44:11,750 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-03 22:44:11,750 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079080485]
[2024-06-03 22:44:11,751 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:44:11,751 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-03 22:44:11,751 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:44:11,751 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-03 22:44:11,751 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110
[2024-06-03 22:44:11,925 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-03 22:44:11,925 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 325 transitions, 3995 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:44:11,925 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:44:11,925 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-03 22:44:11,925 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:44:13,707 INFO  L124   PetriNetUnfolderBase]: 2872/4370 cut-off events.
[2024-06-03 22:44:13,708 INFO  L125   PetriNetUnfolderBase]: For 226902/226904 co-relation queries the response was YES.
[2024-06-03 22:44:13,731 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 33715 conditions, 4370 events. 2872/4370 cut-off events. For 226902/226904 co-relation queries the response was YES. Maximal size of possible extension queue 225. Compared 22833 event pairs, 654 based on Foata normal form. 6/4373 useless extension candidates. Maximal degree in co-relation 33617. Up to 4040 conditions per place. 
[2024-06-03 22:44:13,748 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 312 selfloop transitions, 50 changer transitions 0/365 dead transitions.
[2024-06-03 22:44:13,748 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 365 transitions, 5109 flow
[2024-06-03 22:44:13,750 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 22:44:13,751 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 22:44:13,751 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 150 transitions.
[2024-06-03 22:44:13,751 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4065040650406504
[2024-06-03 22:44:13,751 INFO  L175             Difference]: Start difference. First operand has 208 places, 325 transitions, 3995 flow. Second operand 9 states and 150 transitions.
[2024-06-03 22:44:13,751 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 365 transitions, 5109 flow
[2024-06-03 22:44:14,016 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 365 transitions, 4999 flow, removed 34 selfloop flow, removed 4 redundant places.
[2024-06-03 22:44:14,021 INFO  L231             Difference]: Finished difference. Result has 214 places, 330 transitions, 4097 flow
[2024-06-03 22:44:14,021 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3885, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=325, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=277, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4097, PETRI_PLACES=214, PETRI_TRANSITIONS=330}
[2024-06-03 22:44:14,031 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 172 predicate places.
[2024-06-03 22:44:14,031 INFO  L495      AbstractCegarLoop]: Abstraction has has 214 places, 330 transitions, 4097 flow
[2024-06-03 22:44:14,031 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:44:14,031 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:44:14,032 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:44:14,032 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45
[2024-06-03 22:44:14,032 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:44:14,032 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:44:14,032 INFO  L85        PathProgramCache]: Analyzing trace with hash 926710723, now seen corresponding path program 3 times
[2024-06-03 22:44:14,032 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:44:14,033 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439462623]
[2024-06-03 22:44:14,033 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:44:14,033 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:44:14,078 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:44:22,925 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:44:22,926 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:44:22,926 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439462623]
[2024-06-03 22:44:22,926 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439462623] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:44:22,926 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:44:22,926 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-03 22:44:22,926 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069218869]
[2024-06-03 22:44:22,926 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:44:22,927 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-03 22:44:22,927 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:44:22,928 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-03 22:44:22,928 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110
[2024-06-03 22:44:23,105 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-03 22:44:23,105 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 330 transitions, 4097 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:44:23,105 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:44:23,105 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-03 22:44:23,105 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:44:24,722 INFO  L124   PetriNetUnfolderBase]: 2864/4358 cut-off events.
[2024-06-03 22:44:24,723 INFO  L125   PetriNetUnfolderBase]: For 231715/231717 co-relation queries the response was YES.
[2024-06-03 22:44:24,752 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 33306 conditions, 4358 events. 2864/4358 cut-off events. For 231715/231717 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 22732 event pairs, 654 based on Foata normal form. 6/4361 useless extension candidates. Maximal degree in co-relation 33205. Up to 4080 conditions per place. 
[2024-06-03 22:44:24,770 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 312 selfloop transitions, 49 changer transitions 0/364 dead transitions.
[2024-06-03 22:44:24,770 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 364 transitions, 4966 flow
[2024-06-03 22:44:24,772 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 22:44:24,772 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 22:44:24,772 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 147 transitions.
[2024-06-03 22:44:24,772 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3983739837398374
[2024-06-03 22:44:24,773 INFO  L175             Difference]: Start difference. First operand has 214 places, 330 transitions, 4097 flow. Second operand 9 states and 147 transitions.
[2024-06-03 22:44:24,773 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 364 transitions, 4966 flow
[2024-06-03 22:44:25,185 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 364 transitions, 4804 flow, removed 49 selfloop flow, removed 5 redundant places.
[2024-06-03 22:44:25,189 INFO  L231             Difference]: Finished difference. Result has 218 places, 331 transitions, 4066 flow
[2024-06-03 22:44:25,190 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3953, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=330, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=281, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4066, PETRI_PLACES=218, PETRI_TRANSITIONS=331}
[2024-06-03 22:44:25,190 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 176 predicate places.
[2024-06-03 22:44:25,190 INFO  L495      AbstractCegarLoop]: Abstraction has has 218 places, 331 transitions, 4066 flow
[2024-06-03 22:44:25,190 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:44:25,191 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:44:25,191 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:44:25,191 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46
[2024-06-03 22:44:25,191 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:44:25,191 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:44:25,192 INFO  L85        PathProgramCache]: Analyzing trace with hash 897634945, now seen corresponding path program 4 times
[2024-06-03 22:44:25,192 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:44:25,192 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855945949]
[2024-06-03 22:44:25,192 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:44:25,192 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:44:25,231 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:44:34,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:44:34,249 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:44:34,249 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855945949]
[2024-06-03 22:44:34,249 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855945949] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:44:34,249 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:44:34,249 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-03 22:44:34,249 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583817611]
[2024-06-03 22:44:34,249 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:44:34,249 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-03 22:44:34,249 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:44:34,249 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-03 22:44:34,250 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110
[2024-06-03 22:44:34,505 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-03 22:44:34,506 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 331 transitions, 4066 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:44:34,506 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:44:34,506 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-03 22:44:34,506 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:44:36,328 INFO  L124   PetriNetUnfolderBase]: 2881/4379 cut-off events.
[2024-06-03 22:44:36,329 INFO  L125   PetriNetUnfolderBase]: For 239955/239959 co-relation queries the response was YES.
[2024-06-03 22:44:36,359 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 33579 conditions, 4379 events. 2881/4379 cut-off events. For 239955/239959 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 22777 event pairs, 640 based on Foata normal form. 8/4384 useless extension candidates. Maximal degree in co-relation 33476. Up to 4005 conditions per place. 
[2024-06-03 22:44:36,379 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 303 selfloop transitions, 59 changer transitions 0/365 dead transitions.
[2024-06-03 22:44:36,379 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 365 transitions, 4960 flow
[2024-06-03 22:44:36,381 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 22:44:36,381 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 22:44:36,382 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 149 transitions.
[2024-06-03 22:44:36,382 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4037940379403794
[2024-06-03 22:44:36,382 INFO  L175             Difference]: Start difference. First operand has 218 places, 331 transitions, 4066 flow. Second operand 9 states and 149 transitions.
[2024-06-03 22:44:36,382 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 365 transitions, 4960 flow
[2024-06-03 22:44:36,740 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 365 transitions, 4866 flow, removed 0 selfloop flow, removed 7 redundant places.
[2024-06-03 22:44:36,745 INFO  L231             Difference]: Finished difference. Result has 220 places, 333 transitions, 4149 flow
[2024-06-03 22:44:36,745 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3972, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=331, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=272, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4149, PETRI_PLACES=220, PETRI_TRANSITIONS=333}
[2024-06-03 22:44:36,745 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 178 predicate places.
[2024-06-03 22:44:36,746 INFO  L495      AbstractCegarLoop]: Abstraction has has 220 places, 333 transitions, 4149 flow
[2024-06-03 22:44:36,746 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:44:36,746 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:44:36,746 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:44:36,746 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47
[2024-06-03 22:44:36,746 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:44:36,747 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:44:36,747 INFO  L85        PathProgramCache]: Analyzing trace with hash 1068810073, now seen corresponding path program 5 times
[2024-06-03 22:44:36,747 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:44:36,747 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996144445]
[2024-06-03 22:44:36,747 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:44:36,747 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:44:36,831 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:44:44,693 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:44:44,693 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:44:44,693 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996144445]
[2024-06-03 22:44:44,693 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996144445] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:44:44,693 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:44:44,693 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-03 22:44:44,693 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142191102]
[2024-06-03 22:44:44,693 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:44:44,693 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-03 22:44:44,694 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:44:44,694 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-03 22:44:44,694 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110
[2024-06-03 22:44:45,013 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-03 22:44:45,013 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 333 transitions, 4149 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:44:45,013 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:44:45,013 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-03 22:44:45,014 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:44:46,998 INFO  L124   PetriNetUnfolderBase]: 3034/4626 cut-off events.
[2024-06-03 22:44:46,999 INFO  L125   PetriNetUnfolderBase]: For 278962/278966 co-relation queries the response was YES.
[2024-06-03 22:44:47,025 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 36576 conditions, 4626 events. 3034/4626 cut-off events. For 278962/278966 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 24490 event pairs, 673 based on Foata normal form. 8/4631 useless extension candidates. Maximal degree in co-relation 36472. Up to 3933 conditions per place. 
[2024-06-03 22:44:47,042 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 301 selfloop transitions, 72 changer transitions 0/376 dead transitions.
[2024-06-03 22:44:47,042 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 376 transitions, 5339 flow
[2024-06-03 22:44:47,044 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 22:44:47,044 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 22:44:47,045 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 157 transitions.
[2024-06-03 22:44:47,045 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4254742547425474
[2024-06-03 22:44:47,045 INFO  L175             Difference]: Start difference. First operand has 220 places, 333 transitions, 4149 flow. Second operand 9 states and 157 transitions.
[2024-06-03 22:44:47,045 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 376 transitions, 5339 flow
[2024-06-03 22:44:47,356 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 376 transitions, 5176 flow, removed 22 selfloop flow, removed 7 redundant places.
[2024-06-03 22:44:47,361 INFO  L231             Difference]: Finished difference. Result has 223 places, 338 transitions, 4261 flow
[2024-06-03 22:44:47,361 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3986, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=333, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=263, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4261, PETRI_PLACES=223, PETRI_TRANSITIONS=338}
[2024-06-03 22:44:47,362 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 181 predicate places.
[2024-06-03 22:44:47,362 INFO  L495      AbstractCegarLoop]: Abstraction has has 223 places, 338 transitions, 4261 flow
[2024-06-03 22:44:47,362 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:44:47,362 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:44:47,362 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:44:47,362 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48
[2024-06-03 22:44:47,362 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:44:47,363 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:44:47,363 INFO  L85        PathProgramCache]: Analyzing trace with hash 1074320323, now seen corresponding path program 6 times
[2024-06-03 22:44:47,363 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:44:47,363 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093037523]
[2024-06-03 22:44:47,363 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:44:47,363 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:44:47,434 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:44:56,186 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:44:56,187 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:44:56,187 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093037523]
[2024-06-03 22:44:56,187 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093037523] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:44:56,187 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:44:56,187 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-03 22:44:56,187 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822093211]
[2024-06-03 22:44:56,187 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:44:56,187 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-03 22:44:56,187 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:44:56,188 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-03 22:44:56,188 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110
[2024-06-03 22:44:56,316 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-03 22:44:56,316 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 338 transitions, 4261 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:44:56,316 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:44:56,316 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-03 22:44:56,316 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:44:58,203 INFO  L124   PetriNetUnfolderBase]: 2990/4558 cut-off events.
[2024-06-03 22:44:58,203 INFO  L125   PetriNetUnfolderBase]: For 285951/285955 co-relation queries the response was YES.
[2024-06-03 22:44:58,234 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 35487 conditions, 4558 events. 2990/4558 cut-off events. For 285951/285955 co-relation queries the response was YES. Maximal size of possible extension queue 239. Compared 24061 event pairs, 645 based on Foata normal form. 28/4583 useless extension candidates. Maximal degree in co-relation 35381. Up to 3976 conditions per place. 
[2024-06-03 22:44:58,252 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 303 selfloop transitions, 69 changer transitions 0/375 dead transitions.
[2024-06-03 22:44:58,253 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 375 transitions, 5182 flow
[2024-06-03 22:44:58,254 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 22:44:58,254 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 22:44:58,257 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 154 transitions.
[2024-06-03 22:44:58,259 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4173441734417344
[2024-06-03 22:44:58,259 INFO  L175             Difference]: Start difference. First operand has 223 places, 338 transitions, 4261 flow. Second operand 9 states and 154 transitions.
[2024-06-03 22:44:58,259 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 375 transitions, 5182 flow
[2024-06-03 22:44:58,590 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 375 transitions, 4994 flow, removed 49 selfloop flow, removed 5 redundant places.
[2024-06-03 22:44:58,596 INFO  L231             Difference]: Finished difference. Result has 227 places, 339 transitions, 4249 flow
[2024-06-03 22:44:58,596 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4087, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=338, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=269, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4249, PETRI_PLACES=227, PETRI_TRANSITIONS=339}
[2024-06-03 22:44:58,596 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 185 predicate places.
[2024-06-03 22:44:58,597 INFO  L495      AbstractCegarLoop]: Abstraction has has 227 places, 339 transitions, 4249 flow
[2024-06-03 22:44:58,597 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:44:58,597 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:44:58,597 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:44:58,597 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49
[2024-06-03 22:44:58,597 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:44:58,598 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:44:58,598 INFO  L85        PathProgramCache]: Analyzing trace with hash 903356677, now seen corresponding path program 1 times
[2024-06-03 22:44:58,598 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:44:58,598 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270426022]
[2024-06-03 22:44:58,598 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:44:58,598 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:44:58,646 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:45:06,911 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:45:06,911 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:45:06,911 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270426022]
[2024-06-03 22:45:06,911 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270426022] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:45:06,911 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:45:06,912 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 22:45:06,912 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203959773]
[2024-06-03 22:45:06,912 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:45:06,912 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 22:45:06,912 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:45:06,913 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 22:45:06,913 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-03 22:45:07,074 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-03 22:45:07,074 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 339 transitions, 4249 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:45:07,074 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:45:07,074 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-03 22:45:07,075 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:45:09,022 INFO  L124   PetriNetUnfolderBase]: 3109/4759 cut-off events.
[2024-06-03 22:45:09,022 INFO  L125   PetriNetUnfolderBase]: For 300538/300542 co-relation queries the response was YES.
[2024-06-03 22:45:09,052 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 37069 conditions, 4759 events. 3109/4759 cut-off events. For 300538/300542 co-relation queries the response was YES. Maximal size of possible extension queue 252. Compared 25451 event pairs, 668 based on Foata normal form. 20/4776 useless extension candidates. Maximal degree in co-relation 36961. Up to 3776 conditions per place. 
[2024-06-03 22:45:09,070 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 308 selfloop transitions, 71 changer transitions 0/382 dead transitions.
[2024-06-03 22:45:09,070 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 382 transitions, 5423 flow
[2024-06-03 22:45:09,072 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 22:45:09,072 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 22:45:09,072 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 157 transitions.
[2024-06-03 22:45:09,072 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4254742547425474
[2024-06-03 22:45:09,073 INFO  L175             Difference]: Start difference. First operand has 227 places, 339 transitions, 4249 flow. Second operand 9 states and 157 transitions.
[2024-06-03 22:45:09,073 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 382 transitions, 5423 flow
[2024-06-03 22:45:09,361 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 382 transitions, 5286 flow, removed 2 selfloop flow, removed 7 redundant places.
[2024-06-03 22:45:09,365 INFO  L231             Difference]: Finished difference. Result has 229 places, 341 transitions, 4314 flow
[2024-06-03 22:45:09,365 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4112, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=339, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=269, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4314, PETRI_PLACES=229, PETRI_TRANSITIONS=341}
[2024-06-03 22:45:09,366 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 187 predicate places.
[2024-06-03 22:45:09,366 INFO  L495      AbstractCegarLoop]: Abstraction has has 229 places, 341 transitions, 4314 flow
[2024-06-03 22:45:09,366 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:45:09,366 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:45:09,366 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:45:09,366 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50
[2024-06-03 22:45:09,366 INFO  L420      AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:45:09,367 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:45:09,367 INFO  L85        PathProgramCache]: Analyzing trace with hash -940125740, now seen corresponding path program 1 times
[2024-06-03 22:45:09,367 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:45:09,367 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032594153]
[2024-06-03 22:45:09,367 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:45:09,367 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:45:09,395 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:45:22,662 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:45:22,663 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:45:22,663 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032594153]
[2024-06-03 22:45:22,663 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032594153] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:45:22,663 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:45:22,663 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 22:45:22,663 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125623041]
[2024-06-03 22:45:22,663 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:45:22,664 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 22:45:22,664 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:45:22,666 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 22:45:22,667 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72
[2024-06-03 22:45:22,809 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-03 22:45:22,809 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 341 transitions, 4314 flow. Second operand  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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:45:22,809 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:45:22,809 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-03 22:45:22,810 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:45:24,737 INFO  L124   PetriNetUnfolderBase]: 3124/4782 cut-off events.
[2024-06-03 22:45:24,737 INFO  L125   PetriNetUnfolderBase]: For 295551/295553 co-relation queries the response was YES.
[2024-06-03 22:45:24,765 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 37518 conditions, 4782 events. 3124/4782 cut-off events. For 295551/295553 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 25673 event pairs, 763 based on Foata normal form. 4/4783 useless extension candidates. Maximal degree in co-relation 37409. Up to 4676 conditions per place. 
[2024-06-03 22:45:24,782 INFO  L140   encePairwiseOnDemand]: 32/41 looper letters, 330 selfloop transitions, 35 changer transitions 0/368 dead transitions.
[2024-06-03 22:45:24,782 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 368 transitions, 5316 flow
[2024-06-03 22:45:24,784 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-03 22:45:24,784 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-03 22:45:24,784 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 114 transitions.
[2024-06-03 22:45:24,785 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.397212543554007
[2024-06-03 22:45:24,785 INFO  L175             Difference]: Start difference. First operand has 229 places, 341 transitions, 4314 flow. Second operand 7 states and 114 transitions.
[2024-06-03 22:45:24,785 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 368 transitions, 5316 flow
[2024-06-03 22:45:25,137 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 368 transitions, 5202 flow, removed 13 selfloop flow, removed 5 redundant places.
[2024-06-03 22:45:25,141 INFO  L231             Difference]: Finished difference. Result has 232 places, 350 transitions, 4414 flow
[2024-06-03 22:45:25,142 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4200, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=341, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=311, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4414, PETRI_PLACES=232, PETRI_TRANSITIONS=350}
[2024-06-03 22:45:25,142 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 190 predicate places.
[2024-06-03 22:45:25,142 INFO  L495      AbstractCegarLoop]: Abstraction has has 232 places, 350 transitions, 4414 flow
[2024-06-03 22:45:25,142 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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:45:25,143 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:45:25,143 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:45:25,143 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51
[2024-06-03 22:45:25,143 INFO  L420      AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:45:25,143 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:45:25,143 INFO  L85        PathProgramCache]: Analyzing trace with hash 399661271, now seen corresponding path program 7 times
[2024-06-03 22:45:25,143 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:45:25,144 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029647892]
[2024-06-03 22:45:25,144 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:45:25,144 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:45:25,190 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:45:34,402 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:45:34,402 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:45:34,402 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029647892]
[2024-06-03 22:45:34,402 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029647892] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:45:34,402 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:45:34,402 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-03 22:45:34,402 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176084730]
[2024-06-03 22:45:34,403 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:45:34,403 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-03 22:45:34,403 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:45:34,403 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-03 22:45:34,403 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110
[2024-06-03 22:45:34,511 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-03 22:45:34,511 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 350 transitions, 4414 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:45:34,511 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:45:34,511 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-03 22:45:34,512 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:45:36,511 INFO  L124   PetriNetUnfolderBase]: 3216/4935 cut-off events.
[2024-06-03 22:45:36,512 INFO  L125   PetriNetUnfolderBase]: For 333268/333277 co-relation queries the response was YES.
[2024-06-03 22:45:36,544 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 38688 conditions, 4935 events. 3216/4935 cut-off events. For 333268/333277 co-relation queries the response was YES. Maximal size of possible extension queue 264. Compared 26712 event pairs, 707 based on Foata normal form. 30/4946 useless extension candidates. Maximal degree in co-relation 38576. Up to 4095 conditions per place. 
[2024-06-03 22:45:36,562 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 285 selfloop transitions, 99 changer transitions 0/387 dead transitions.
[2024-06-03 22:45:36,562 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 387 transitions, 5388 flow
[2024-06-03 22:45:36,564 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 22:45:36,564 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 22:45:36,564 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 159 transitions.
[2024-06-03 22:45:36,564 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43089430894308944
[2024-06-03 22:45:36,565 INFO  L175             Difference]: Start difference. First operand has 232 places, 350 transitions, 4414 flow. Second operand 9 states and 159 transitions.
[2024-06-03 22:45:36,565 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 387 transitions, 5388 flow
[2024-06-03 22:45:36,910 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 387 transitions, 5333 flow, removed 22 selfloop flow, removed 2 redundant places.
[2024-06-03 22:45:36,914 INFO  L231             Difference]: Finished difference. Result has 239 places, 352 transitions, 4628 flow
[2024-06-03 22:45:36,915 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4359, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=350, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=97, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=251, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4628, PETRI_PLACES=239, PETRI_TRANSITIONS=352}
[2024-06-03 22:45:36,915 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 197 predicate places.
[2024-06-03 22:45:36,915 INFO  L495      AbstractCegarLoop]: Abstraction has has 239 places, 352 transitions, 4628 flow
[2024-06-03 22:45:36,915 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:45:36,915 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:45:36,916 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:45:36,916 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52
[2024-06-03 22:45:36,916 INFO  L420      AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:45:36,916 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:45:36,916 INFO  L85        PathProgramCache]: Analyzing trace with hash -686547037, now seen corresponding path program 2 times
[2024-06-03 22:45:36,916 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:45:36,916 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176353636]
[2024-06-03 22:45:36,917 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:45:36,917 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:45:36,963 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:45:44,585 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:45:44,586 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:45:44,586 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176353636]
[2024-06-03 22:45:44,586 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176353636] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:45:44,586 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:45:44,586 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-03 22:45:44,586 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985983027]
[2024-06-03 22:45:44,587 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:45:44,587 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-03 22:45:44,587 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:45:44,587 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-03 22:45:44,587 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110
[2024-06-03 22:45:44,814 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-03 22:45:44,815 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 352 transitions, 4628 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:45:44,815 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:45:44,815 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-03 22:45:44,815 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:45:46,831 INFO  L124   PetriNetUnfolderBase]: 3291/5060 cut-off events.
[2024-06-03 22:45:46,832 INFO  L125   PetriNetUnfolderBase]: For 343752/343761 co-relation queries the response was YES.
[2024-06-03 22:45:46,867 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 40088 conditions, 5060 events. 3291/5060 cut-off events. For 343752/343761 co-relation queries the response was YES. Maximal size of possible extension queue 273. Compared 27618 event pairs, 727 based on Foata normal form. 26/5067 useless extension candidates. Maximal degree in co-relation 39974. Up to 4399 conditions per place. 
[2024-06-03 22:45:46,886 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 307 selfloop transitions, 83 changer transitions 0/393 dead transitions.
[2024-06-03 22:45:46,886 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 393 transitions, 5596 flow
[2024-06-03 22:45:46,888 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-03 22:45:46,888 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-03 22:45:46,889 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 171 transitions.
[2024-06-03 22:45:46,889 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4170731707317073
[2024-06-03 22:45:46,889 INFO  L175             Difference]: Start difference. First operand has 239 places, 352 transitions, 4628 flow. Second operand 10 states and 171 transitions.
[2024-06-03 22:45:46,889 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 393 transitions, 5596 flow
[2024-06-03 22:45:47,353 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 393 transitions, 5357 flow, removed 23 selfloop flow, removed 7 redundant places.
[2024-06-03 22:45:47,358 INFO  L231             Difference]: Finished difference. Result has 242 places, 353 transitions, 4587 flow
[2024-06-03 22:45:47,358 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4389, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=352, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=269, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4587, PETRI_PLACES=242, PETRI_TRANSITIONS=353}
[2024-06-03 22:45:47,358 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 200 predicate places.
[2024-06-03 22:45:47,359 INFO  L495      AbstractCegarLoop]: Abstraction has has 242 places, 353 transitions, 4587 flow
[2024-06-03 22:45:47,359 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:45:47,359 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:45:47,359 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:45:47,359 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53
[2024-06-03 22:45:47,359 INFO  L420      AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:45:47,360 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:45:47,360 INFO  L85        PathProgramCache]: Analyzing trace with hash 2108320793, now seen corresponding path program 3 times
[2024-06-03 22:45:47,360 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:45:47,360 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763943470]
[2024-06-03 22:45:47,360 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:45:47,360 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:45:47,393 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:45:56,361 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:45:56,361 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:45:56,361 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763943470]
[2024-06-03 22:45:56,361 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763943470] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:45:56,361 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:45:56,361 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 22:45:56,361 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203916259]
[2024-06-03 22:45:56,361 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:45:56,361 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 22:45:56,361 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:45:56,362 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 22:45:56,362 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-03 22:45:56,535 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-03 22:45:56,535 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 353 transitions, 4587 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:45:56,535 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:45:56,535 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-03 22:45:56,536 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:45:58,687 INFO  L124   PetriNetUnfolderBase]: 3485/5378 cut-off events.
[2024-06-03 22:45:58,687 INFO  L125   PetriNetUnfolderBase]: For 384448/384457 co-relation queries the response was YES.
[2024-06-03 22:45:58,722 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 43071 conditions, 5378 events. 3485/5378 cut-off events. For 384448/384457 co-relation queries the response was YES. Maximal size of possible extension queue 295. Compared 29913 event pairs, 737 based on Foata normal form. 22/5381 useless extension candidates. Maximal degree in co-relation 42956. Up to 4168 conditions per place. 
[2024-06-03 22:45:58,742 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 286 selfloop transitions, 107 changer transitions 0/396 dead transitions.
[2024-06-03 22:45:58,742 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 396 transitions, 5841 flow
[2024-06-03 22:45:58,743 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 22:45:58,743 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 22:45:58,743 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 160 transitions.
[2024-06-03 22:45:58,744 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43360433604336046
[2024-06-03 22:45:58,744 INFO  L175             Difference]: Start difference. First operand has 242 places, 353 transitions, 4587 flow. Second operand 9 states and 160 transitions.
[2024-06-03 22:45:58,744 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 396 transitions, 5841 flow
[2024-06-03 22:45:59,198 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 396 transitions, 5657 flow, removed 9 selfloop flow, removed 8 redundant places.
[2024-06-03 22:45:59,203 INFO  L231             Difference]: Finished difference. Result has 243 places, 355 transitions, 4690 flow
[2024-06-03 22:45:59,203 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4407, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=353, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=106, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=247, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4690, PETRI_PLACES=243, PETRI_TRANSITIONS=355}
[2024-06-03 22:45:59,203 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 201 predicate places.
[2024-06-03 22:45:59,204 INFO  L495      AbstractCegarLoop]: Abstraction has has 243 places, 355 transitions, 4690 flow
[2024-06-03 22:45:59,204 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:45:59,204 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:45:59,204 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:45:59,204 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54
[2024-06-03 22:45:59,204 INFO  L420      AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:45:59,205 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:45:59,205 INFO  L85        PathProgramCache]: Analyzing trace with hash -686337787, now seen corresponding path program 4 times
[2024-06-03 22:45:59,205 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:45:59,205 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309518297]
[2024-06-03 22:45:59,205 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:45:59,206 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:45:59,242 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:46:07,846 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:46:07,846 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:46:07,846 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309518297]
[2024-06-03 22:46:07,846 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309518297] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:46:07,846 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:46:07,846 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 22:46:07,847 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067599151]
[2024-06-03 22:46:07,847 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:46:07,847 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 22:46:07,847 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:46:07,847 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 22:46:07,847 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-03 22:46:08,064 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-03 22:46:08,065 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 355 transitions, 4690 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:46:08,065 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:46:08,065 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-03 22:46:08,065 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:46:10,294 INFO  L124   PetriNetUnfolderBase]: 3629/5618 cut-off events.
[2024-06-03 22:46:10,295 INFO  L125   PetriNetUnfolderBase]: For 411137/411146 co-relation queries the response was YES.
[2024-06-03 22:46:10,330 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 45500 conditions, 5618 events. 3629/5618 cut-off events. For 411137/411146 co-relation queries the response was YES. Maximal size of possible extension queue 311. Compared 31705 event pairs, 808 based on Foata normal form. 22/5621 useless extension candidates. Maximal degree in co-relation 45384. Up to 4415 conditions per place. 
[2024-06-03 22:46:10,351 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 295 selfloop transitions, 100 changer transitions 0/398 dead transitions.
[2024-06-03 22:46:10,351 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 398 transitions, 5952 flow
[2024-06-03 22:46:10,353 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 22:46:10,354 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 22:46:10,354 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 162 transitions.
[2024-06-03 22:46:10,354 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43902439024390244
[2024-06-03 22:46:10,354 INFO  L175             Difference]: Start difference. First operand has 243 places, 355 transitions, 4690 flow. Second operand 9 states and 162 transitions.
[2024-06-03 22:46:10,354 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 398 transitions, 5952 flow
[2024-06-03 22:46:10,860 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 398 transitions, 5794 flow, removed 15 selfloop flow, removed 5 redundant places.
[2024-06-03 22:46:10,865 INFO  L231             Difference]: Finished difference. Result has 247 places, 357 transitions, 4804 flow
[2024-06-03 22:46:10,865 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4532, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=355, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=99, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=256, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4804, PETRI_PLACES=247, PETRI_TRANSITIONS=357}
[2024-06-03 22:46:10,866 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 205 predicate places.
[2024-06-03 22:46:10,866 INFO  L495      AbstractCegarLoop]: Abstraction has has 247 places, 357 transitions, 4804 flow
[2024-06-03 22:46:10,866 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:46:10,866 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:46:10,866 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:46:10,866 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55
[2024-06-03 22:46:10,866 INFO  L420      AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:46:10,867 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:46:10,867 INFO  L85        PathProgramCache]: Analyzing trace with hash -692059519, now seen corresponding path program 8 times
[2024-06-03 22:46:10,867 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:46:10,867 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628268140]
[2024-06-03 22:46:10,867 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:46:10,867 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:46:10,910 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:46:19,422 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:46:19,422 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:46:19,422 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628268140]
[2024-06-03 22:46:19,422 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628268140] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:46:19,423 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:46:19,423 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 22:46:19,423 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314873827]
[2024-06-03 22:46:19,423 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:46:19,423 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 22:46:19,423 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:46:19,423 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 22:46:19,423 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2024-06-03 22:46:19,552 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-03 22:46:19,552 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 357 transitions, 4804 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:46:19,552 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:46:19,552 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-03 22:46:19,552 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:46:21,890 INFO  L124   PetriNetUnfolderBase]: 3621/5606 cut-off events.
[2024-06-03 22:46:21,890 INFO  L125   PetriNetUnfolderBase]: For 402129/402138 co-relation queries the response was YES.
[2024-06-03 22:46:21,927 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 45614 conditions, 5606 events. 3621/5606 cut-off events. For 402129/402138 co-relation queries the response was YES. Maximal size of possible extension queue 310. Compared 31717 event pairs, 816 based on Foata normal form. 10/5597 useless extension candidates. Maximal degree in co-relation 45496. Up to 4886 conditions per place. 
[2024-06-03 22:46:21,947 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 283 selfloop transitions, 104 changer transitions 0/390 dead transitions.
[2024-06-03 22:46:21,948 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 390 transitions, 5764 flow
[2024-06-03 22:46:21,950 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 22:46:21,950 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 22:46:21,950 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 154 transitions.
[2024-06-03 22:46:21,950 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4173441734417344
[2024-06-03 22:46:21,951 INFO  L175             Difference]: Start difference. First operand has 247 places, 357 transitions, 4804 flow. Second operand 9 states and 154 transitions.
[2024-06-03 22:46:21,951 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 390 transitions, 5764 flow
[2024-06-03 22:46:22,399 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 390 transitions, 5608 flow, removed 20 selfloop flow, removed 5 redundant places.
[2024-06-03 22:46:22,404 INFO  L231             Difference]: Finished difference. Result has 251 places, 359 transitions, 4933 flow
[2024-06-03 22:46:22,404 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4654, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=357, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=102, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=253, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4933, PETRI_PLACES=251, PETRI_TRANSITIONS=359}
[2024-06-03 22:46:22,404 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 209 predicate places.
[2024-06-03 22:46:22,404 INFO  L495      AbstractCegarLoop]: Abstraction has has 251 places, 359 transitions, 4933 flow
[2024-06-03 22:46:22,405 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:46:22,405 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:46:22,405 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:46:22,405 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56
[2024-06-03 22:46:22,405 INFO  L420      AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:46:22,405 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:46:22,405 INFO  L85        PathProgramCache]: Analyzing trace with hash 2083623127, now seen corresponding path program 5 times
[2024-06-03 22:46:22,406 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:46:22,406 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412005736]
[2024-06-03 22:46:22,406 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:46:22,406 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:46:22,441 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:46:31,826 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:46:31,826 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:46:31,826 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412005736]
[2024-06-03 22:46:31,826 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412005736] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:46:31,826 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:46:31,826 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 22:46:31,827 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982705139]
[2024-06-03 22:46:31,827 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:46:31,827 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 22:46:31,827 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:46:31,827 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 22:46:31,827 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2024-06-03 22:46:32,047 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-03 22:46:32,047 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 359 transitions, 4933 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:46:32,047 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:46:32,047 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-03 22:46:32,047 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:46:34,299 INFO  L124   PetriNetUnfolderBase]: 3638/5641 cut-off events.
[2024-06-03 22:46:34,300 INFO  L125   PetriNetUnfolderBase]: For 423323/423332 co-relation queries the response was YES.
[2024-06-03 22:46:34,341 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 45617 conditions, 5641 events. 3638/5641 cut-off events. For 423323/423332 co-relation queries the response was YES. Maximal size of possible extension queue 312. Compared 32037 event pairs, 805 based on Foata normal form. 30/5652 useless extension candidates. Maximal degree in co-relation 45497. Up to 4801 conditions per place. 
[2024-06-03 22:46:34,363 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 287 selfloop transitions, 106 changer transitions 0/396 dead transitions.
[2024-06-03 22:46:34,363 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 396 transitions, 5929 flow
[2024-06-03 22:46:34,365 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 22:46:34,365 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 22:46:34,366 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 157 transitions.
[2024-06-03 22:46:34,366 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4254742547425474
[2024-06-03 22:46:34,366 INFO  L175             Difference]: Start difference. First operand has 251 places, 359 transitions, 4933 flow. Second operand 9 states and 157 transitions.
[2024-06-03 22:46:34,366 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 396 transitions, 5929 flow
[2024-06-03 22:46:34,910 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 396 transitions, 5670 flow, removed 27 selfloop flow, removed 7 redundant places.
[2024-06-03 22:46:34,914 INFO  L231             Difference]: Finished difference. Result has 253 places, 361 transitions, 4961 flow
[2024-06-03 22:46:34,915 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4674, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=359, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=104, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=253, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4961, PETRI_PLACES=253, PETRI_TRANSITIONS=361}
[2024-06-03 22:46:34,915 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 211 predicate places.
[2024-06-03 22:46:34,915 INFO  L495      AbstractCegarLoop]: Abstraction has has 253 places, 361 transitions, 4961 flow
[2024-06-03 22:46:34,915 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:46:34,916 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:46:34,916 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:46:34,916 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57
[2024-06-03 22:46:34,916 INFO  L420      AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:46:34,918 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:46:34,918 INFO  L85        PathProgramCache]: Analyzing trace with hash 2083421317, now seen corresponding path program 6 times
[2024-06-03 22:46:34,918 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:46:34,919 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545210060]
[2024-06-03 22:46:34,919 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:46:34,919 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:46:34,983 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:46:42,628 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:46:42,629 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:46:42,629 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545210060]
[2024-06-03 22:46:42,629 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545210060] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:46:42,629 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:46:42,629 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-03 22:46:42,629 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514032736]
[2024-06-03 22:46:42,629 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:46:42,630 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-03 22:46:42,630 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:46:42,630 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-03 22:46:42,630 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110
[2024-06-03 22:46:42,781 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-03 22:46:42,781 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 361 transitions, 4961 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:46:42,781 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:46:42,782 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-03 22:46:42,782 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:46:45,007 INFO  L124   PetriNetUnfolderBase]: 3602/5585 cut-off events.
[2024-06-03 22:46:45,008 INFO  L125   PetriNetUnfolderBase]: For 403358/403367 co-relation queries the response was YES.
[2024-06-03 22:46:45,053 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 44511 conditions, 5585 events. 3602/5585 cut-off events. For 403358/403367 co-relation queries the response was YES. Maximal size of possible extension queue 309. Compared 31664 event pairs, 817 based on Foata normal form. 26/5592 useless extension candidates. Maximal degree in co-relation 44390. Up to 4934 conditions per place. 
[2024-06-03 22:46:45,076 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 308 selfloop transitions, 89 changer transitions 0/400 dead transitions.
[2024-06-03 22:46:45,076 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 400 transitions, 5919 flow
[2024-06-03 22:46:45,078 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-03 22:46:45,079 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-03 22:46:45,079 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 168 transitions.
[2024-06-03 22:46:45,079 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4097560975609756
[2024-06-03 22:46:45,079 INFO  L175             Difference]: Start difference. First operand has 253 places, 361 transitions, 4961 flow. Second operand 10 states and 168 transitions.
[2024-06-03 22:46:45,079 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 400 transitions, 5919 flow
[2024-06-03 22:46:45,724 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 400 transitions, 5658 flow, removed 27 selfloop flow, removed 7 redundant places.
[2024-06-03 22:46:45,729 INFO  L231             Difference]: Finished difference. Result has 256 places, 361 transitions, 4888 flow
[2024-06-03 22:46:45,729 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4700, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=361, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=89, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=272, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4888, PETRI_PLACES=256, PETRI_TRANSITIONS=361}
[2024-06-03 22:46:45,729 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 214 predicate places.
[2024-06-03 22:46:45,730 INFO  L495      AbstractCegarLoop]: Abstraction has has 256 places, 361 transitions, 4888 flow
[2024-06-03 22:46:45,730 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:46:45,730 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:46:45,730 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:46:45,730 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58
[2024-06-03 22:46:45,730 INFO  L420      AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:46:45,730 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:46:45,731 INFO  L85        PathProgramCache]: Analyzing trace with hash -1945639449, now seen corresponding path program 7 times
[2024-06-03 22:46:45,731 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:46:45,731 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916659547]
[2024-06-03 22:46:45,731 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:46:45,732 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:46:45,765 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:46:54,477 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:46:54,477 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:46:54,477 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916659547]
[2024-06-03 22:46:54,477 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916659547] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:46:54,477 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:46:54,477 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 22:46:54,478 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829954109]
[2024-06-03 22:46:54,478 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:46:54,478 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 22:46:54,478 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:46:54,478 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 22:46:54,478 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-03 22:46:54,660 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-03 22:46:54,660 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 361 transitions, 4888 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:46:54,660 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:46:54,660 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-03 22:46:54,660 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:46:56,908 INFO  L124   PetriNetUnfolderBase]: 3610/5605 cut-off events.
[2024-06-03 22:46:56,908 INFO  L125   PetriNetUnfolderBase]: For 397667/397676 co-relation queries the response was YES.
[2024-06-03 22:46:56,946 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 43945 conditions, 5605 events. 3610/5605 cut-off events. For 397667/397676 co-relation queries the response was YES. Maximal size of possible extension queue 309. Compared 31721 event pairs, 719 based on Foata normal form. 22/5608 useless extension candidates. Maximal degree in co-relation 43823. Up to 3249 conditions per place. 
[2024-06-03 22:46:56,982 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 278 selfloop transitions, 121 changer transitions 0/402 dead transitions.
[2024-06-03 22:46:56,982 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 402 transitions, 6110 flow
[2024-06-03 22:46:56,984 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 22:46:56,984 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 22:46:56,984 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 158 transitions.
[2024-06-03 22:46:56,984 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4281842818428184
[2024-06-03 22:46:56,985 INFO  L175             Difference]: Start difference. First operand has 256 places, 361 transitions, 4888 flow. Second operand 9 states and 158 transitions.
[2024-06-03 22:46:56,985 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 264 places, 402 transitions, 6110 flow
[2024-06-03 22:46:57,574 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 402 transitions, 5897 flow, removed 7 selfloop flow, removed 9 redundant places.
[2024-06-03 22:46:57,579 INFO  L231             Difference]: Finished difference. Result has 256 places, 362 transitions, 4959 flow
[2024-06-03 22:46:57,580 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4675, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=361, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=120, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4959, PETRI_PLACES=256, PETRI_TRANSITIONS=362}
[2024-06-03 22:46:57,581 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 214 predicate places.
[2024-06-03 22:46:57,581 INFO  L495      AbstractCegarLoop]: Abstraction has has 256 places, 362 transitions, 4959 flow
[2024-06-03 22:46:57,582 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:46:57,582 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:46:57,582 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:46:57,582 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59
[2024-06-03 22:46:57,582 INFO  L420      AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:46:57,582 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:46:57,582 INFO  L85        PathProgramCache]: Analyzing trace with hash -692063239, now seen corresponding path program 9 times
[2024-06-03 22:46:57,583 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:46:57,583 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176378218]
[2024-06-03 22:46:57,583 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:46:57,583 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:46:57,626 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:47:06,526 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:47:06,527 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:47:06,527 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176378218]
[2024-06-03 22:47:06,527 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176378218] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:47:06,527 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:47:06,527 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 22:47:06,527 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366691941]
[2024-06-03 22:47:06,527 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:47:06,528 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 22:47:06,528 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:47:06,528 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 22:47:06,528 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-03 22:47:06,730 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-03 22:47:06,731 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 362 transitions, 4959 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:47:06,731 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:47:06,731 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-03 22:47:06,731 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:47:08,945 INFO  L124   PetriNetUnfolderBase]: 3602/5593 cut-off events.
[2024-06-03 22:47:08,945 INFO  L125   PetriNetUnfolderBase]: For 385775/385784 co-relation queries the response was YES.
[2024-06-03 22:47:08,983 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 43969 conditions, 5593 events. 3602/5593 cut-off events. For 385775/385784 co-relation queries the response was YES. Maximal size of possible extension queue 309. Compared 31738 event pairs, 795 based on Foata normal form. 10/5584 useless extension candidates. Maximal degree in co-relation 43846. Up to 4556 conditions per place. 
[2024-06-03 22:47:09,003 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 287 selfloop transitions, 111 changer transitions 0/401 dead transitions.
[2024-06-03 22:47:09,004 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 401 transitions, 6013 flow
[2024-06-03 22:47:09,005 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 22:47:09,006 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 22:47:09,017 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 158 transitions.
[2024-06-03 22:47:09,018 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4281842818428184
[2024-06-03 22:47:09,018 INFO  L175             Difference]: Start difference. First operand has 256 places, 362 transitions, 4959 flow. Second operand 9 states and 158 transitions.
[2024-06-03 22:47:09,018 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 264 places, 401 transitions, 6013 flow
[2024-06-03 22:47:09,545 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 401 transitions, 5743 flow, removed 15 selfloop flow, removed 7 redundant places.
[2024-06-03 22:47:09,550 INFO  L231             Difference]: Finished difference. Result has 259 places, 366 transitions, 5052 flow
[2024-06-03 22:47:09,551 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4689, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=362, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=108, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5052, PETRI_PLACES=259, PETRI_TRANSITIONS=366}
[2024-06-03 22:47:09,552 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 217 predicate places.
[2024-06-03 22:47:09,552 INFO  L495      AbstractCegarLoop]: Abstraction has has 259 places, 366 transitions, 5052 flow
[2024-06-03 22:47:09,552 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:47:09,552 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:47:09,552 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:47:09,552 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60
[2024-06-03 22:47:09,552 INFO  L420      AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:47:09,553 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:47:09,553 INFO  L85        PathProgramCache]: Analyzing trace with hash -1016512910, now seen corresponding path program 2 times
[2024-06-03 22:47:09,553 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:47:09,553 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601226183]
[2024-06-03 22:47:09,553 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:47:09,553 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:47:09,583 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:47:21,376 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:47:21,376 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:47:21,377 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601226183]
[2024-06-03 22:47:21,377 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601226183] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:47:21,377 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:47:21,377 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 22:47:21,377 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778348413]
[2024-06-03 22:47:21,377 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:47:21,377 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 22:47:21,378 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:47:21,378 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 22:47:21,378 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72
[2024-06-03 22:47:21,463 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-03 22:47:21,463 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 366 transitions, 5052 flow. Second operand  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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:47:21,463 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:47:21,463 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-03 22:47:21,463 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:47:23,635 INFO  L124   PetriNetUnfolderBase]: 3612/5606 cut-off events.
[2024-06-03 22:47:23,635 INFO  L125   PetriNetUnfolderBase]: For 392341/392343 co-relation queries the response was YES.
[2024-06-03 22:47:23,677 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 44093 conditions, 5606 events. 3612/5606 cut-off events. For 392341/392343 co-relation queries the response was YES. Maximal size of possible extension queue 310. Compared 31917 event pairs, 905 based on Foata normal form. 4/5607 useless extension candidates. Maximal degree in co-relation 43968. Up to 5496 conditions per place. 
[2024-06-03 22:47:23,698 INFO  L140   encePairwiseOnDemand]: 33/41 looper letters, 345 selfloop transitions, 38 changer transitions 0/386 dead transitions.
[2024-06-03 22:47:23,698 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 386 transitions, 6032 flow
[2024-06-03 22:47:23,700 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-03 22:47:23,700 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-03 22:47:23,700 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 103 transitions.
[2024-06-03 22:47:23,701 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4186991869918699
[2024-06-03 22:47:23,701 INFO  L175             Difference]: Start difference. First operand has 259 places, 366 transitions, 5052 flow. Second operand 6 states and 103 transitions.
[2024-06-03 22:47:23,701 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 264 places, 386 transitions, 6032 flow
[2024-06-03 22:47:24,451 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 386 transitions, 5812 flow, removed 45 selfloop flow, removed 5 redundant places.
[2024-06-03 22:47:24,455 INFO  L231             Difference]: Finished difference. Result has 260 places, 369 transitions, 4964 flow
[2024-06-03 22:47:24,456 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4832, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=366, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=331, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4964, PETRI_PLACES=260, PETRI_TRANSITIONS=369}
[2024-06-03 22:47:24,456 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 218 predicate places.
[2024-06-03 22:47:24,456 INFO  L495      AbstractCegarLoop]: Abstraction has has 260 places, 369 transitions, 4964 flow
[2024-06-03 22:47:24,456 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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:47:24,456 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:47:24,456 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:47:24,457 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61
[2024-06-03 22:47:24,457 INFO  L420      AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:47:24,457 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:47:24,457 INFO  L85        PathProgramCache]: Analyzing trace with hash -268045190, now seen corresponding path program 3 times
[2024-06-03 22:47:24,457 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:47:24,457 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433144656]
[2024-06-03 22:47:24,457 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:47:24,458 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:47:24,488 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:47:33,055 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:47:33,055 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:47:33,056 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433144656]
[2024-06-03 22:47:33,056 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433144656] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:47:33,056 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:47:33,056 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 22:47:33,056 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029869726]
[2024-06-03 22:47:33,056 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:47:33,056 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 22:47:33,057 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:47:33,057 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 22:47:33,057 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-03 22:47:33,160 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-03 22:47:33,160 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 369 transitions, 4964 flow. Second operand  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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:47:33,160 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:47:33,160 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-03 22:47:33,160 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:47:35,245 INFO  L124   PetriNetUnfolderBase]: 3606/5598 cut-off events.
[2024-06-03 22:47:35,246 INFO  L125   PetriNetUnfolderBase]: For 396295/396297 co-relation queries the response was YES.
[2024-06-03 22:47:35,284 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 43822 conditions, 5598 events. 3606/5598 cut-off events. For 396295/396297 co-relation queries the response was YES. Maximal size of possible extension queue 308. Compared 31834 event pairs, 905 based on Foata normal form. 4/5599 useless extension candidates. Maximal degree in co-relation 43695. Up to 5507 conditions per place. 
[2024-06-03 22:47:35,305 INFO  L140   encePairwiseOnDemand]: 33/41 looper letters, 348 selfloop transitions, 32 changer transitions 0/383 dead transitions.
[2024-06-03 22:47:35,305 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 383 transitions, 5772 flow
[2024-06-03 22:47:35,307 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-03 22:47:35,307 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-03 22:47:35,307 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 90 transitions.
[2024-06-03 22:47:35,307 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43902439024390244
[2024-06-03 22:47:35,308 INFO  L175             Difference]: Start difference. First operand has 260 places, 369 transitions, 4964 flow. Second operand 5 states and 90 transitions.
[2024-06-03 22:47:35,308 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 264 places, 383 transitions, 5772 flow
[2024-06-03 22:47:35,913 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 383 transitions, 5668 flow, removed 29 selfloop flow, removed 4 redundant places.
[2024-06-03 22:47:35,918 INFO  L231             Difference]: Finished difference. Result has 261 places, 369 transitions, 4952 flow
[2024-06-03 22:47:35,918 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4860, PETRI_DIFFERENCE_MINUEND_PLACES=256, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=369, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=337, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=4952, PETRI_PLACES=261, PETRI_TRANSITIONS=369}
[2024-06-03 22:47:35,918 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 219 predicate places.
[2024-06-03 22:47:35,919 INFO  L495      AbstractCegarLoop]: Abstraction has has 261 places, 369 transitions, 4952 flow
[2024-06-03 22:47:35,919 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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:47:35,919 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:47:35,919 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:47:35,919 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62
[2024-06-03 22:47:35,919 INFO  L420      AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:47:35,919 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:47:35,920 INFO  L85        PathProgramCache]: Analyzing trace with hash -2049481374, now seen corresponding path program 1 times
[2024-06-03 22:47:35,920 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:47:35,920 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338444948]
[2024-06-03 22:47:35,920 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:47:35,920 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:47:35,964 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:47:45,163 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:47:45,163 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:47:45,163 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338444948]
[2024-06-03 22:47:45,163 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338444948] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:47:45,163 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:47:45,163 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 22:47:45,163 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804140919]
[2024-06-03 22:47:45,163 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:47:45,163 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 22:47:45,164 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:47:45,164 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 22:47:45,164 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-06-03 22:47:45,292 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41
[2024-06-03 22:47:45,292 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 369 transitions, 4952 flow. Second operand  has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:47:45,292 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:47:45,292 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41
[2024-06-03 22:47:45,293 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:47:47,229 INFO  L124   PetriNetUnfolderBase]: 3490/5499 cut-off events.
[2024-06-03 22:47:47,230 INFO  L125   PetriNetUnfolderBase]: For 400555/400555 co-relation queries the response was YES.
[2024-06-03 22:47:47,280 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 43222 conditions, 5499 events. 3490/5499 cut-off events. For 400555/400555 co-relation queries the response was YES. Maximal size of possible extension queue 310. Compared 32019 event pairs, 923 based on Foata normal form. 3/5496 useless extension candidates. Maximal degree in co-relation 43095. Up to 5207 conditions per place. 
[2024-06-03 22:47:47,305 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 320 selfloop transitions, 27 changer transitions 0/400 dead transitions.
[2024-06-03 22:47:47,306 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 400 transitions, 5984 flow
[2024-06-03 22:47:47,306 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 22:47:47,306 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 22:47:47,307 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 128 transitions.
[2024-06-03 22:47:47,307 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3902439024390244
[2024-06-03 22:47:47,307 INFO  L175             Difference]: Start difference. First operand has 261 places, 369 transitions, 4952 flow. Second operand 8 states and 128 transitions.
[2024-06-03 22:47:47,307 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 400 transitions, 5984 flow
[2024-06-03 22:47:48,153 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 400 transitions, 5916 flow, removed 0 selfloop flow, removed 4 redundant places.
[2024-06-03 22:47:48,158 INFO  L231             Difference]: Finished difference. Result has 267 places, 381 transitions, 5136 flow
[2024-06-03 22:47:48,158 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4888, PETRI_DIFFERENCE_MINUEND_PLACES=257, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=369, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=345, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5136, PETRI_PLACES=267, PETRI_TRANSITIONS=381}
[2024-06-03 22:47:48,159 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 225 predicate places.
[2024-06-03 22:47:48,159 INFO  L495      AbstractCegarLoop]: Abstraction has has 267 places, 381 transitions, 5136 flow
[2024-06-03 22:47:48,159 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:47:48,159 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:47:48,159 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:47:48,159 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63
[2024-06-03 22:47:48,159 INFO  L420      AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:47:48,160 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:47:48,160 INFO  L85        PathProgramCache]: Analyzing trace with hash -2049361404, now seen corresponding path program 2 times
[2024-06-03 22:47:48,160 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:47:48,160 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475737371]
[2024-06-03 22:47:48,160 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:47:48,161 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:47:48,208 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:47:57,786 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:47:57,786 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:47:57,786 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475737371]
[2024-06-03 22:47:57,786 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475737371] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:47:57,786 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:47:57,786 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 22:47:57,786 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242307852]
[2024-06-03 22:47:57,787 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:47:57,787 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 22:47:57,787 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:47:57,787 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 22:47:57,787 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-03 22:47:57,984 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41
[2024-06-03 22:47:57,984 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 381 transitions, 5136 flow. Second operand  has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:47:57,984 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:47:57,984 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41
[2024-06-03 22:47:57,985 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:48:00,066 INFO  L124   PetriNetUnfolderBase]: 3519/5540 cut-off events.
[2024-06-03 22:48:00,067 INFO  L125   PetriNetUnfolderBase]: For 414466/414466 co-relation queries the response was YES.
[2024-06-03 22:48:00,106 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 44157 conditions, 5540 events. 3519/5540 cut-off events. For 414466/414466 co-relation queries the response was YES. Maximal size of possible extension queue 311. Compared 32290 event pairs, 923 based on Foata normal form. 3/5537 useless extension candidates. Maximal degree in co-relation 44027. Up to 5253 conditions per place. 
[2024-06-03 22:48:00,127 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 319 selfloop transitions, 32 changer transitions 0/404 dead transitions.
[2024-06-03 22:48:00,128 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 404 transitions, 6006 flow
[2024-06-03 22:48:00,128 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 22:48:00,128 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 22:48:00,128 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 124 transitions.
[2024-06-03 22:48:00,130 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3780487804878049
[2024-06-03 22:48:00,130 INFO  L175             Difference]: Start difference. First operand has 267 places, 381 transitions, 5136 flow. Second operand 8 states and 124 transitions.
[2024-06-03 22:48:00,130 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 404 transitions, 6006 flow
[2024-06-03 22:48:00,688 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 404 transitions, 5920 flow, removed 36 selfloop flow, removed 2 redundant places.
[2024-06-03 22:48:00,693 INFO  L231             Difference]: Finished difference. Result has 273 places, 389 transitions, 5241 flow
[2024-06-03 22:48:00,693 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5058, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=381, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=354, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5241, PETRI_PLACES=273, PETRI_TRANSITIONS=389}
[2024-06-03 22:48:00,694 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 231 predicate places.
[2024-06-03 22:48:00,694 INFO  L495      AbstractCegarLoop]: Abstraction has has 273 places, 389 transitions, 5241 flow
[2024-06-03 22:48:00,694 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:48:00,694 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:48:00,694 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:48:00,694 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64
[2024-06-03 22:48:00,695 INFO  L420      AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:48:00,695 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:48:00,695 INFO  L85        PathProgramCache]: Analyzing trace with hash -268276574, now seen corresponding path program 3 times
[2024-06-03 22:48:00,695 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:48:00,695 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990305175]
[2024-06-03 22:48:00,695 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:48:00,695 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:48:00,733 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:48:11,050 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:48:11,050 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:48:11,050 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990305175]
[2024-06-03 22:48:11,050 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990305175] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:48:11,050 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:48:11,050 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 22:48:11,050 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43454006]
[2024-06-03 22:48:11,050 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:48:11,050 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 22:48:11,051 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:48:11,051 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 22:48:11,051 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-03 22:48:11,137 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41
[2024-06-03 22:48:11,137 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 389 transitions, 5241 flow. Second operand  has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:48:11,137 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:48:11,137 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41
[2024-06-03 22:48:11,137 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:48:13,252 INFO  L124   PetriNetUnfolderBase]: 3512/5529 cut-off events.
[2024-06-03 22:48:13,252 INFO  L125   PetriNetUnfolderBase]: For 419886/419886 co-relation queries the response was YES.
[2024-06-03 22:48:13,302 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 43950 conditions, 5529 events. 3512/5529 cut-off events. For 419886/419886 co-relation queries the response was YES. Maximal size of possible extension queue 310. Compared 32186 event pairs, 924 based on Foata normal form. 4/5527 useless extension candidates. Maximal degree in co-relation 43818. Up to 5236 conditions per place. 
[2024-06-03 22:48:13,326 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 322 selfloop transitions, 33 changer transitions 0/408 dead transitions.
[2024-06-03 22:48:13,327 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 408 transitions, 6077 flow
[2024-06-03 22:48:13,327 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-03 22:48:13,327 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-03 22:48:13,328 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 115 transitions.
[2024-06-03 22:48:13,328 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.40069686411149824
[2024-06-03 22:48:13,328 INFO  L175             Difference]: Start difference. First operand has 273 places, 389 transitions, 5241 flow. Second operand 7 states and 115 transitions.
[2024-06-03 22:48:13,328 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 408 transitions, 6077 flow
[2024-06-03 22:48:14,132 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 408 transitions, 5933 flow, removed 43 selfloop flow, removed 5 redundant places.
[2024-06-03 22:48:14,137 INFO  L231             Difference]: Finished difference. Result has 275 places, 392 transitions, 5248 flow
[2024-06-03 22:48:14,137 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5097, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=389, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=356, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=5248, PETRI_PLACES=275, PETRI_TRANSITIONS=392}
[2024-06-03 22:48:14,137 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 233 predicate places.
[2024-06-03 22:48:14,137 INFO  L495      AbstractCegarLoop]: Abstraction has has 275 places, 392 transitions, 5248 flow
[2024-06-03 22:48:14,138 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:48:14,138 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:48:14,138 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:48:14,138 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65
[2024-06-03 22:48:14,138 INFO  L420      AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:48:14,139 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:48:14,140 INFO  L85        PathProgramCache]: Analyzing trace with hash -242169800, now seen corresponding path program 1 times
[2024-06-03 22:48:14,140 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:48:14,140 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823270476]
[2024-06-03 22:48:14,140 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:48:14,140 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:48:14,187 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:48:25,600 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:48:25,601 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:48:25,601 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823270476]
[2024-06-03 22:48:25,601 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823270476] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:48:25,601 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:48:25,601 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 22:48:25,601 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096295635]
[2024-06-03 22:48:25,601 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:48:25,601 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 22:48:25,601 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:48:25,602 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 22:48:25,602 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90
[2024-06-03 22:48:25,738 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-03 22:48:25,738 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 392 transitions, 5248 flow. Second operand  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 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:48:25,738 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:48:25,738 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-03 22:48:25,738 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:48:27,773 INFO  L124   PetriNetUnfolderBase]: 3647/5663 cut-off events.
[2024-06-03 22:48:27,773 INFO  L125   PetriNetUnfolderBase]: For 422207/422207 co-relation queries the response was YES.
[2024-06-03 22:48:27,823 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 44903 conditions, 5663 events. 3647/5663 cut-off events. For 422207/422207 co-relation queries the response was YES. Maximal size of possible extension queue 311. Compared 32210 event pairs, 961 based on Foata normal form. 2/5662 useless extension candidates. Maximal degree in co-relation 44771. Up to 5601 conditions per place. 
[2024-06-03 22:48:27,848 INFO  L140   encePairwiseOnDemand]: 35/41 looper letters, 385 selfloop transitions, 14 changer transitions 0/402 dead transitions.
[2024-06-03 22:48:27,848 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 402 transitions, 6100 flow
[2024-06-03 22:48:27,849 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-03 22:48:27,849 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-03 22:48:27,849 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 81 transitions.
[2024-06-03 22:48:27,849 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3951219512195122
[2024-06-03 22:48:27,849 INFO  L175             Difference]: Start difference. First operand has 275 places, 392 transitions, 5248 flow. Second operand 5 states and 81 transitions.
[2024-06-03 22:48:27,849 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 402 transitions, 6100 flow
[2024-06-03 22:48:28,579 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 402 transitions, 5995 flow, removed 26 selfloop flow, removed 5 redundant places.
[2024-06-03 22:48:28,584 INFO  L231             Difference]: Finished difference. Result has 275 places, 394 transitions, 5208 flow
[2024-06-03 22:48:28,584 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5143, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=392, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=378, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=5208, PETRI_PLACES=275, PETRI_TRANSITIONS=394}
[2024-06-03 22:48:28,584 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 233 predicate places.
[2024-06-03 22:48:28,584 INFO  L495      AbstractCegarLoop]: Abstraction has has 275 places, 394 transitions, 5208 flow
[2024-06-03 22:48:28,585 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 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:48:28,585 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:48:28,585 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:48:28,585 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66
[2024-06-03 22:48:28,585 INFO  L420      AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:48:28,585 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:48:28,585 INFO  L85        PathProgramCache]: Analyzing trace with hash 185561816, now seen corresponding path program 1 times
[2024-06-03 22:48:28,586 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:48:28,586 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115968317]
[2024-06-03 22:48:28,586 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:48:28,586 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:48:28,632 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:48:38,674 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:48:38,674 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:48:38,674 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115968317]
[2024-06-03 22:48:38,674 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115968317] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:48:38,675 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:48:38,675 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2024-06-03 22:48:38,675 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485362862]
[2024-06-03 22:48:38,675 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:48:38,675 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2024-06-03 22:48:38,675 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:48:38,675 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2024-06-03 22:48:38,675 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132
[2024-06-03 22:48:38,900 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-03 22:48:38,901 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 394 transitions, 5208 flow. Second operand  has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:48:38,901 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:48:38,901 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-03 22:48:38,901 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:48:41,443 INFO  L124   PetriNetUnfolderBase]: 3688/5721 cut-off events.
[2024-06-03 22:48:41,443 INFO  L125   PetriNetUnfolderBase]: For 451337/451341 co-relation queries the response was YES.
[2024-06-03 22:48:41,483 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 45505 conditions, 5721 events. 3688/5721 cut-off events. For 451337/451341 co-relation queries the response was YES. Maximal size of possible extension queue 317. Compared 32524 event pairs, 607 based on Foata normal form. 16/5734 useless extension candidates. Maximal degree in co-relation 45372. Up to 5104 conditions per place. 
[2024-06-03 22:48:41,503 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 372 selfloop transitions, 60 changer transitions 0/435 dead transitions.
[2024-06-03 22:48:41,503 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 435 transitions, 6258 flow
[2024-06-03 22:48:41,505 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-03 22:48:41,505 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-03 22:48:41,505 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 160 transitions.
[2024-06-03 22:48:41,506 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3902439024390244
[2024-06-03 22:48:41,506 INFO  L175             Difference]: Start difference. First operand has 275 places, 394 transitions, 5208 flow. Second operand 10 states and 160 transitions.
[2024-06-03 22:48:41,506 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 435 transitions, 6258 flow
[2024-06-03 22:48:42,031 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 435 transitions, 6209 flow, removed 12 selfloop flow, removed 3 redundant places.
[2024-06-03 22:48:42,037 INFO  L231             Difference]: Finished difference. Result has 282 places, 395 transitions, 5325 flow
[2024-06-03 22:48:42,037 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5159, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=394, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=334, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5325, PETRI_PLACES=282, PETRI_TRANSITIONS=395}
[2024-06-03 22:48:42,037 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 240 predicate places.
[2024-06-03 22:48:42,037 INFO  L495      AbstractCegarLoop]: Abstraction has has 282 places, 395 transitions, 5325 flow
[2024-06-03 22:48:42,038 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:48:42,038 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:48:42,038 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:48:42,038 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67
[2024-06-03 22:48:42,038 INFO  L420      AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:48:42,038 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:48:42,038 INFO  L85        PathProgramCache]: Analyzing trace with hash 243654266, now seen corresponding path program 2 times
[2024-06-03 22:48:42,039 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:48:42,039 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620059502]
[2024-06-03 22:48:42,039 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:48:42,039 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:48:42,083 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:48:51,748 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:48:51,748 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:48:51,748 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620059502]
[2024-06-03 22:48:51,748 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620059502] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:48:51,748 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:48:51,748 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2024-06-03 22:48:51,748 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572635202]
[2024-06-03 22:48:51,749 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:48:51,749 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2024-06-03 22:48:51,749 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:48:51,749 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2024-06-03 22:48:51,749 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132
[2024-06-03 22:48:51,979 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-03 22:48:51,979 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 395 transitions, 5325 flow. Second operand  has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:48:51,979 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:48:51,979 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-03 22:48:51,980 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:48:54,302 INFO  L124   PetriNetUnfolderBase]: 3729/5802 cut-off events.
[2024-06-03 22:48:54,303 INFO  L125   PetriNetUnfolderBase]: For 467210/467212 co-relation queries the response was YES.
[2024-06-03 22:48:54,350 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 46510 conditions, 5802 events. 3729/5802 cut-off events. For 467210/467212 co-relation queries the response was YES. Maximal size of possible extension queue 322. Compared 33374 event pairs, 869 based on Foata normal form. 14/5813 useless extension candidates. Maximal degree in co-relation 46376. Up to 5409 conditions per place. 
[2024-06-03 22:48:54,371 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 381 selfloop transitions, 52 changer transitions 0/436 dead transitions.
[2024-06-03 22:48:54,372 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 436 transitions, 6381 flow
[2024-06-03 22:48:54,372 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-03 22:48:54,372 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-03 22:48:54,373 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 163 transitions.
[2024-06-03 22:48:54,373 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3975609756097561
[2024-06-03 22:48:54,373 INFO  L175             Difference]: Start difference. First operand has 282 places, 395 transitions, 5325 flow. Second operand 10 states and 163 transitions.
[2024-06-03 22:48:54,373 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 291 places, 436 transitions, 6381 flow
[2024-06-03 22:48:55,193 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 436 transitions, 6238 flow, removed 15 selfloop flow, removed 7 redundant places.
[2024-06-03 22:48:55,199 INFO  L231             Difference]: Finished difference. Result has 285 places, 396 transitions, 5334 flow
[2024-06-03 22:48:55,199 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5182, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=395, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=343, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5334, PETRI_PLACES=285, PETRI_TRANSITIONS=396}
[2024-06-03 22:48:55,199 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 243 predicate places.
[2024-06-03 22:48:55,199 INFO  L495      AbstractCegarLoop]: Abstraction has has 285 places, 396 transitions, 5334 flow
[2024-06-03 22:48:55,200 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:48:55,200 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:48:55,200 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:48:55,200 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68
[2024-06-03 22:48:55,200 INFO  L420      AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:48:55,200 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:48:55,200 INFO  L85        PathProgramCache]: Analyzing trace with hash -1474574120, now seen corresponding path program 3 times
[2024-06-03 22:48:55,201 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:48:55,201 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465795271]
[2024-06-03 22:48:55,201 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:48:55,201 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:48:55,248 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:49:03,666 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:49:03,666 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:49:03,666 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465795271]
[2024-06-03 22:49:03,666 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465795271] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:49:03,667 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:49:03,667 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 22:49:03,667 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148004813]
[2024-06-03 22:49:03,667 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:49:03,667 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 22:49:03,667 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:49:03,668 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 22:49:03,668 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-03 22:49:03,944 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-03 22:49:03,945 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 396 transitions, 5334 flow. Second operand  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 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:49:03,945 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:49:03,945 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-03 22:49:03,945 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:49:06,251 INFO  L124   PetriNetUnfolderBase]: 3709/5764 cut-off events.
[2024-06-03 22:49:06,251 INFO  L125   PetriNetUnfolderBase]: For 457875/457879 co-relation queries the response was YES.
[2024-06-03 22:49:06,294 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 45528 conditions, 5764 events. 3709/5764 cut-off events. For 457875/457879 co-relation queries the response was YES. Maximal size of possible extension queue 319. Compared 32957 event pairs, 838 based on Foata normal form. 16/5777 useless extension candidates. Maximal degree in co-relation 45392. Up to 5260 conditions per place. 
[2024-06-03 22:49:06,315 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 363 selfloop transitions, 65 changer transitions 0/431 dead transitions.
[2024-06-03 22:49:06,315 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 431 transitions, 6335 flow
[2024-06-03 22:49:06,317 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 22:49:06,317 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 22:49:06,318 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 148 transitions.
[2024-06-03 22:49:06,318 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4010840108401084
[2024-06-03 22:49:06,318 INFO  L175             Difference]: Start difference. First operand has 285 places, 396 transitions, 5334 flow. Second operand 9 states and 148 transitions.
[2024-06-03 22:49:06,318 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 293 places, 431 transitions, 6335 flow
[2024-06-03 22:49:07,076 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 431 transitions, 6197 flow, removed 18 selfloop flow, removed 8 redundant places.
[2024-06-03 22:49:07,081 INFO  L231             Difference]: Finished difference. Result has 287 places, 397 transitions, 5361 flow
[2024-06-03 22:49:07,082 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5196, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=396, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=331, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5361, PETRI_PLACES=287, PETRI_TRANSITIONS=397}
[2024-06-03 22:49:07,082 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 245 predicate places.
[2024-06-03 22:49:07,082 INFO  L495      AbstractCegarLoop]: Abstraction has has 287 places, 397 transitions, 5361 flow
[2024-06-03 22:49:07,082 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 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:49:07,082 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:49:07,082 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:49:07,083 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69
[2024-06-03 22:49:07,083 INFO  L420      AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:49:07,083 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:49:07,083 INFO  L85        PathProgramCache]: Analyzing trace with hash -1226625254, now seen corresponding path program 4 times
[2024-06-03 22:49:07,083 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:49:07,083 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603454512]
[2024-06-03 22:49:07,083 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:49:07,084 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:49:07,130 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:49:15,868 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:49:15,868 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:49:15,868 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603454512]
[2024-06-03 22:49:15,868 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603454512] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:49:15,868 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:49:15,868 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-03 22:49:15,868 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341194580]
[2024-06-03 22:49:15,868 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:49:15,869 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-03 22:49:15,869 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:49:15,869 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-03 22:49:15,869 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110
[2024-06-03 22:49:16,209 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-03 22:49:16,210 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 397 transitions, 5361 flow. Second operand  has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 0 states have call successors, (0), 0 states 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:49:16,210 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:49:16,210 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-03 22:49:16,210 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:49:18,601 INFO  L124   PetriNetUnfolderBase]: 3750/5835 cut-off events.
[2024-06-03 22:49:18,601 INFO  L125   PetriNetUnfolderBase]: For 471292/471296 co-relation queries the response was YES.
[2024-06-03 22:49:18,644 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 46114 conditions, 5835 events. 3750/5835 cut-off events. For 471292/471296 co-relation queries the response was YES. Maximal size of possible extension queue 324. Compared 33577 event pairs, 829 based on Foata normal form. 16/5848 useless extension candidates. Maximal degree in co-relation 45976. Up to 5195 conditions per place. 
[2024-06-03 22:49:18,665 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 361 selfloop transitions, 68 changer transitions 0/432 dead transitions.
[2024-06-03 22:49:18,665 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 432 transitions, 6389 flow
[2024-06-03 22:49:18,667 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 22:49:18,667 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 22:49:18,668 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 148 transitions.
[2024-06-03 22:49:18,668 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4010840108401084
[2024-06-03 22:49:18,668 INFO  L175             Difference]: Start difference. First operand has 287 places, 397 transitions, 5361 flow. Second operand 9 states and 148 transitions.
[2024-06-03 22:49:18,668 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 432 transitions, 6389 flow
[2024-06-03 22:49:19,437 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 432 transitions, 6237 flow, removed 9 selfloop flow, removed 7 redundant places.
[2024-06-03 22:49:19,442 INFO  L231             Difference]: Finished difference. Result has 289 places, 398 transitions, 5397 flow
[2024-06-03 22:49:19,442 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5209, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=397, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=329, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5397, PETRI_PLACES=289, PETRI_TRANSITIONS=398}
[2024-06-03 22:49:19,444 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 247 predicate places.
[2024-06-03 22:49:19,444 INFO  L495      AbstractCegarLoop]: Abstraction has has 289 places, 398 transitions, 5397 flow
[2024-06-03 22:49:19,444 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 0 states have call successors, (0), 0 states 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:49:19,445 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:49:19,445 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:49:19,445 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70
[2024-06-03 22:49:19,445 INFO  L420      AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:49:19,445 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:49:19,445 INFO  L85        PathProgramCache]: Analyzing trace with hash -316782640, now seen corresponding path program 1 times
[2024-06-03 22:49:19,445 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:49:19,445 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783504330]
[2024-06-03 22:49:19,446 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:49:19,446 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:49:19,475 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:49:32,298 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:49:32,299 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:49:32,299 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783504330]
[2024-06-03 22:49:32,299 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783504330] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:49:32,299 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:49:32,299 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 22:49:32,299 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973106031]
[2024-06-03 22:49:32,299 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:49:32,299 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 22:49:32,299 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:49:32,299 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 22:49:32,299 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90
[2024-06-03 22:49:32,437 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-03 22:49:32,437 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 398 transitions, 5397 flow. Second operand  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 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:49:32,437 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:49:32,437 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-03 22:49:32,437 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:49:34,736 INFO  L124   PetriNetUnfolderBase]: 3800/5911 cut-off events.
[2024-06-03 22:49:34,737 INFO  L125   PetriNetUnfolderBase]: For 469463/469465 co-relation queries the response was YES.
[2024-06-03 22:49:34,788 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 46692 conditions, 5911 events. 3800/5911 cut-off events. For 469463/469465 co-relation queries the response was YES. Maximal size of possible extension queue 328. Compared 34037 event pairs, 907 based on Foata normal form. 6/5914 useless extension candidates. Maximal degree in co-relation 46553. Up to 5560 conditions per place. 
[2024-06-03 22:49:34,811 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 341 selfloop transitions, 102 changer transitions 0/446 dead transitions.
[2024-06-03 22:49:34,811 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 446 transitions, 6789 flow
[2024-06-03 22:49:34,813 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 22:49:34,813 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 22:49:34,813 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 137 transitions.
[2024-06-03 22:49:34,813 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4176829268292683
[2024-06-03 22:49:34,813 INFO  L175             Difference]: Start difference. First operand has 289 places, 398 transitions, 5397 flow. Second operand 8 states and 137 transitions.
[2024-06-03 22:49:34,813 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 446 transitions, 6789 flow
[2024-06-03 22:49:35,711 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 446 transitions, 6628 flow, removed 23 selfloop flow, removed 6 redundant places.
[2024-06-03 22:49:35,717 INFO  L231             Difference]: Finished difference. Result has 292 places, 419 transitions, 5782 flow
[2024-06-03 22:49:35,717 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5238, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=398, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=308, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5782, PETRI_PLACES=292, PETRI_TRANSITIONS=419}
[2024-06-03 22:49:35,718 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 250 predicate places.
[2024-06-03 22:49:35,718 INFO  L495      AbstractCegarLoop]: Abstraction has has 292 places, 419 transitions, 5782 flow
[2024-06-03 22:49:35,718 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 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:49:35,718 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:49:35,718 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:49:35,719 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71
[2024-06-03 22:49:35,719 INFO  L420      AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:49:35,719 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:49:35,719 INFO  L85        PathProgramCache]: Analyzing trace with hash -307528210, now seen corresponding path program 2 times
[2024-06-03 22:49:35,719 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:49:35,719 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061268139]
[2024-06-03 22:49:35,719 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:49:35,719 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:49:35,750 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:49:48,854 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:49:48,855 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:49:48,855 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061268139]
[2024-06-03 22:49:48,855 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061268139] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:49:48,855 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:49:48,855 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 22:49:48,855 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511276912]
[2024-06-03 22:49:48,855 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:49:48,855 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 22:49:48,855 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:49:48,856 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 22:49:48,856 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90
[2024-06-03 22:49:48,976 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-03 22:49:48,977 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 292 places, 419 transitions, 5782 flow. Second operand  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 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:49:48,977 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:49:48,977 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-03 22:49:48,977 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:49:51,512 INFO  L124   PetriNetUnfolderBase]: 3862/5991 cut-off events.
[2024-06-03 22:49:51,512 INFO  L125   PetriNetUnfolderBase]: For 477437/477441 co-relation queries the response was YES.
[2024-06-03 22:49:51,561 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 47661 conditions, 5991 events. 3862/5991 cut-off events. For 477437/477441 co-relation queries the response was YES. Maximal size of possible extension queue 335. Compared 34370 event pairs, 890 based on Foata normal form. 8/5996 useless extension candidates. Maximal degree in co-relation 47520. Up to 5606 conditions per place. 
[2024-06-03 22:49:51,583 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 355 selfloop transitions, 99 changer transitions 0/457 dead transitions.
[2024-06-03 22:49:51,583 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 299 places, 457 transitions, 7227 flow
[2024-06-03 22:49:51,585 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 22:49:51,585 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 22:49:51,585 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 136 transitions.
[2024-06-03 22:49:51,585 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4146341463414634
[2024-06-03 22:49:51,585 INFO  L175             Difference]: Start difference. First operand has 292 places, 419 transitions, 5782 flow. Second operand 8 states and 136 transitions.
[2024-06-03 22:49:51,585 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 299 places, 457 transitions, 7227 flow
[2024-06-03 22:49:52,445 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 296 places, 457 transitions, 7109 flow, removed 38 selfloop flow, removed 3 redundant places.
[2024-06-03 22:49:52,450 INFO  L231             Difference]: Finished difference. Result has 298 places, 430 transitions, 6068 flow
[2024-06-03 22:49:52,451 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5676, PETRI_DIFFERENCE_MINUEND_PLACES=289, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=419, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=88, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=329, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6068, PETRI_PLACES=298, PETRI_TRANSITIONS=430}
[2024-06-03 22:49:52,451 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 256 predicate places.
[2024-06-03 22:49:52,451 INFO  L495      AbstractCegarLoop]: Abstraction has has 298 places, 430 transitions, 6068 flow
[2024-06-03 22:49:52,451 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 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:49:52,451 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:49:52,451 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:49:52,452 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72
[2024-06-03 22:49:52,452 INFO  L420      AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:49:52,452 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:49:52,452 INFO  L85        PathProgramCache]: Analyzing trace with hash -1166414052, now seen corresponding path program 3 times
[2024-06-03 22:49:52,452 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:49:52,452 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917708929]
[2024-06-03 22:49:52,452 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:49:52,453 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:49:52,485 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:50:04,122 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:50:04,123 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:50:04,123 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917708929]
[2024-06-03 22:50:04,123 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917708929] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:50:04,123 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:50:04,123 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 22:50:04,123 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801526617]
[2024-06-03 22:50:04,123 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:50:04,124 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 22:50:04,124 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:50:04,124 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 22:50:04,124 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90
[2024-06-03 22:50:04,291 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-03 22:50:04,291 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 430 transitions, 6068 flow. Second operand  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 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:50:04,291 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:50:04,291 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-03 22:50:04,291 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:50:06,598 INFO  L124   PetriNetUnfolderBase]: 3850/5975 cut-off events.
[2024-06-03 22:50:06,598 INFO  L125   PetriNetUnfolderBase]: For 481105/481109 co-relation queries the response was YES.
[2024-06-03 22:50:06,660 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 47688 conditions, 5975 events. 3850/5975 cut-off events. For 481105/481109 co-relation queries the response was YES. Maximal size of possible extension queue 334. Compared 34301 event pairs, 886 based on Foata normal form. 8/5980 useless extension candidates. Maximal degree in co-relation 47544. Up to 5598 conditions per place. 
[2024-06-03 22:50:06,684 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 337 selfloop transitions, 115 changer transitions 0/455 dead transitions.
[2024-06-03 22:50:06,685 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 455 transitions, 7195 flow
[2024-06-03 22:50:06,685 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-03 22:50:06,685 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-03 22:50:06,686 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 155 transitions.
[2024-06-03 22:50:06,686 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3780487804878049
[2024-06-03 22:50:06,686 INFO  L175             Difference]: Start difference. First operand has 298 places, 430 transitions, 6068 flow. Second operand 10 states and 155 transitions.
[2024-06-03 22:50:06,686 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 455 transitions, 7195 flow
[2024-06-03 22:50:07,608 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 455 transitions, 6995 flow, removed 37 selfloop flow, removed 4 redundant places.
[2024-06-03 22:50:07,615 INFO  L231             Difference]: Finished difference. Result has 304 places, 430 transitions, 6104 flow
[2024-06-03 22:50:07,616 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5868, PETRI_DIFFERENCE_MINUEND_PLACES=294, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=430, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=115, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=315, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6104, PETRI_PLACES=304, PETRI_TRANSITIONS=430}
[2024-06-03 22:50:07,616 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 262 predicate places.
[2024-06-03 22:50:07,616 INFO  L495      AbstractCegarLoop]: Abstraction has has 304 places, 430 transitions, 6104 flow
[2024-06-03 22:50:07,616 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 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:50:07,616 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:50:07,616 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:50:07,617 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73
[2024-06-03 22:50:07,617 INFO  L420      AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:50:07,617 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:50:07,617 INFO  L85        PathProgramCache]: Analyzing trace with hash 926764732, now seen corresponding path program 5 times
[2024-06-03 22:50:07,617 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:50:07,617 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294023507]
[2024-06-03 22:50:07,617 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:50:07,618 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:50:07,677 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:50:17,232 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:50:17,232 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:50:17,232 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294023507]
[2024-06-03 22:50:17,232 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294023507] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:50:17,232 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:50:17,233 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-03 22:50:17,233 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225608252]
[2024-06-03 22:50:17,233 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:50:17,233 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-03 22:50:17,233 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:50:17,233 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-03 22:50:17,233 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110
[2024-06-03 22:50:17,369 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-03 22:50:17,369 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 430 transitions, 6104 flow. Second operand  has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 0 states have call successors, (0), 0 states 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:50:17,369 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:50:17,369 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-03 22:50:17,369 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:50:19,667 INFO  L124   PetriNetUnfolderBase]: 3830/5946 cut-off events.
[2024-06-03 22:50:19,667 INFO  L125   PetriNetUnfolderBase]: For 484663/484672 co-relation queries the response was YES.
[2024-06-03 22:50:19,725 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 46875 conditions, 5946 events. 3830/5946 cut-off events. For 484663/484672 co-relation queries the response was YES. Maximal size of possible extension queue 332. Compared 34136 event pairs, 827 based on Foata normal form. 18/5945 useless extension candidates. Maximal degree in co-relation 46730. Up to 5378 conditions per place. 
[2024-06-03 22:50:19,749 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 379 selfloop transitions, 82 changer transitions 0/464 dead transitions.
[2024-06-03 22:50:19,749 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 464 transitions, 7169 flow
[2024-06-03 22:50:19,751 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 22:50:19,751 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 22:50:19,751 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 150 transitions.
[2024-06-03 22:50:19,752 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4065040650406504
[2024-06-03 22:50:19,752 INFO  L175             Difference]: Start difference. First operand has 304 places, 430 transitions, 6104 flow. Second operand 9 states and 150 transitions.
[2024-06-03 22:50:19,752 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 464 transitions, 7169 flow
[2024-06-03 22:50:20,639 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 464 transitions, 6892 flow, removed 18 selfloop flow, removed 10 redundant places.
[2024-06-03 22:50:20,644 INFO  L231             Difference]: Finished difference. Result has 304 places, 431 transitions, 6017 flow
[2024-06-03 22:50:20,645 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5827, PETRI_DIFFERENCE_MINUEND_PLACES=294, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=430, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=348, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6017, PETRI_PLACES=304, PETRI_TRANSITIONS=431}
[2024-06-03 22:50:20,645 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 262 predicate places.
[2024-06-03 22:50:20,645 INFO  L495      AbstractCegarLoop]: Abstraction has has 304 places, 431 transitions, 6017 flow
[2024-06-03 22:50:20,645 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 0 states have call successors, (0), 0 states 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:50:20,645 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:50:20,646 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:50:20,646 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74
[2024-06-03 22:50:20,646 INFO  L420      AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:50:20,646 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:50:20,646 INFO  L85        PathProgramCache]: Analyzing trace with hash -666104066, now seen corresponding path program 6 times
[2024-06-03 22:50:20,646 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:50:20,646 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876345117]
[2024-06-03 22:50:20,647 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:50:20,647 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:50:20,704 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:50:30,366 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:50:30,366 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:50:30,366 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876345117]
[2024-06-03 22:50:30,366 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876345117] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:50:30,366 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:50:30,367 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-03 22:50:30,367 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607146077]
[2024-06-03 22:50:30,367 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:50:30,367 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-03 22:50:30,367 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:50:30,367 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-03 22:50:30,368 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110
[2024-06-03 22:50:30,546 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-03 22:50:30,546 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 431 transitions, 6017 flow. Second operand  has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 0 states have call successors, (0), 0 states 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:50:30,546 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:50:30,546 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-03 22:50:30,546 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:50:32,921 INFO  L124   PetriNetUnfolderBase]: 3810/5914 cut-off events.
[2024-06-03 22:50:32,921 INFO  L125   PetriNetUnfolderBase]: For 471392/471401 co-relation queries the response was YES.
[2024-06-03 22:50:32,967 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 46031 conditions, 5914 events. 3810/5914 cut-off events. For 471392/471401 co-relation queries the response was YES. Maximal size of possible extension queue 331. Compared 33948 event pairs, 823 based on Foata normal form. 18/5913 useless extension candidates. Maximal degree in co-relation 45888. Up to 5318 conditions per place. 
[2024-06-03 22:50:32,988 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 384 selfloop transitions, 78 changer transitions 0/465 dead transitions.
[2024-06-03 22:50:32,988 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 465 transitions, 7084 flow
[2024-06-03 22:50:32,991 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 22:50:32,991 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 22:50:32,991 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 151 transitions.
[2024-06-03 22:50:32,991 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4092140921409214
[2024-06-03 22:50:32,991 INFO  L175             Difference]: Start difference. First operand has 304 places, 431 transitions, 6017 flow. Second operand 9 states and 151 transitions.
[2024-06-03 22:50:32,991 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 465 transitions, 7084 flow
[2024-06-03 22:50:33,760 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 465 transitions, 6888 flow, removed 11 selfloop flow, removed 7 redundant places.
[2024-06-03 22:50:33,765 INFO  L231             Difference]: Finished difference. Result has 307 places, 432 transitions, 6007 flow
[2024-06-03 22:50:33,766 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5821, PETRI_DIFFERENCE_MINUEND_PLACES=297, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=431, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=353, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6007, PETRI_PLACES=307, PETRI_TRANSITIONS=432}
[2024-06-03 22:50:33,766 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 265 predicate places.
[2024-06-03 22:50:33,766 INFO  L495      AbstractCegarLoop]: Abstraction has has 307 places, 432 transitions, 6007 flow
[2024-06-03 22:50:33,766 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 0 states have call successors, (0), 0 states 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:50:33,766 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:50:33,767 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:50:33,767 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75
[2024-06-03 22:50:33,767 INFO  L420      AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:50:33,767 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:50:33,767 INFO  L85        PathProgramCache]: Analyzing trace with hash 20876922, now seen corresponding path program 7 times
[2024-06-03 22:50:33,767 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:50:33,767 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783168104]
[2024-06-03 22:50:33,768 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:50:33,768 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:50:33,820 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:50:44,226 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:50:44,226 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:50:44,226 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783168104]
[2024-06-03 22:50:44,226 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783168104] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:50:44,226 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:50:44,226 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2024-06-03 22:50:44,227 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085985902]
[2024-06-03 22:50:44,227 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:50:44,227 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2024-06-03 22:50:44,228 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:50:44,229 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2024-06-03 22:50:44,229 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132
[2024-06-03 22:50:44,497 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-03 22:50:44,498 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 307 places, 432 transitions, 6007 flow. Second operand  has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:50:44,498 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:50:44,498 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-03 22:50:44,498 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:50:46,806 INFO  L124   PetriNetUnfolderBase]: 3790/5882 cut-off events.
[2024-06-03 22:50:46,807 INFO  L125   PetriNetUnfolderBase]: For 456796/456805 co-relation queries the response was YES.
[2024-06-03 22:50:46,862 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 45108 conditions, 5882 events. 3790/5882 cut-off events. For 456796/456805 co-relation queries the response was YES. Maximal size of possible extension queue 331. Compared 33591 event pairs, 770 based on Foata normal form. 18/5881 useless extension candidates. Maximal degree in co-relation 44963. Up to 4776 conditions per place. 
[2024-06-03 22:50:46,885 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 356 selfloop transitions, 114 changer transitions 0/473 dead transitions.
[2024-06-03 22:50:46,885 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 473 transitions, 6997 flow
[2024-06-03 22:50:46,888 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-03 22:50:46,888 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-03 22:50:46,888 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 172 transitions.
[2024-06-03 22:50:46,888 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4195121951219512
[2024-06-03 22:50:46,889 INFO  L175             Difference]: Start difference. First operand has 307 places, 432 transitions, 6007 flow. Second operand 10 states and 172 transitions.
[2024-06-03 22:50:46,889 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 473 transitions, 6997 flow
[2024-06-03 22:50:47,727 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 308 places, 473 transitions, 6816 flow, removed 10 selfloop flow, removed 7 redundant places.
[2024-06-03 22:50:47,732 INFO  L231             Difference]: Finished difference. Result has 309 places, 431 transitions, 5932 flow
[2024-06-03 22:50:47,733 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5700, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=431, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=114, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=317, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5932, PETRI_PLACES=309, PETRI_TRANSITIONS=431}
[2024-06-03 22:50:47,733 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 267 predicate places.
[2024-06-03 22:50:47,733 INFO  L495      AbstractCegarLoop]: Abstraction has has 309 places, 431 transitions, 5932 flow
[2024-06-03 22:50:47,733 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:50:47,733 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:50:47,733 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:50:47,734 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76
[2024-06-03 22:50:47,734 INFO  L420      AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:50:47,734 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:50:47,734 INFO  L85        PathProgramCache]: Analyzing trace with hash 8344430, now seen corresponding path program 4 times
[2024-06-03 22:50:47,734 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:50:47,734 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057199550]
[2024-06-03 22:50:47,734 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:50:47,735 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:50:47,772 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:51:00,533 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:51:00,533 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:51:00,534 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057199550]
[2024-06-03 22:51:00,534 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057199550] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:51:00,534 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:51:00,534 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 22:51:00,534 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608001563]
[2024-06-03 22:51:00,534 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:51:00,535 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 22:51:00,535 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:51:00,535 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 22:51:00,535 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90
[2024-06-03 22:51:00,650 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-03 22:51:00,650 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 309 places, 431 transitions, 5932 flow. Second operand  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 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:51:00,651 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:51:00,651 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-03 22:51:00,651 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:51:02,829 INFO  L124   PetriNetUnfolderBase]: 3810/5913 cut-off events.
[2024-06-03 22:51:02,830 INFO  L125   PetriNetUnfolderBase]: For 439266/439268 co-relation queries the response was YES.
[2024-06-03 22:51:02,882 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 45276 conditions, 5913 events. 3810/5913 cut-off events. For 439266/439268 co-relation queries the response was YES. Maximal size of possible extension queue 335. Compared 34016 event pairs, 883 based on Foata normal form. 6/5916 useless extension candidates. Maximal degree in co-relation 45130. Up to 5638 conditions per place. 
[2024-06-03 22:51:02,903 INFO  L140   encePairwiseOnDemand]: 32/41 looper letters, 346 selfloop transitions, 106 changer transitions 0/455 dead transitions.
[2024-06-03 22:51:02,904 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 455 transitions, 6953 flow
[2024-06-03 22:51:02,904 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-03 22:51:02,904 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-03 22:51:02,905 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 110 transitions.
[2024-06-03 22:51:02,905 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44715447154471544
[2024-06-03 22:51:02,905 INFO  L175             Difference]: Start difference. First operand has 309 places, 431 transitions, 5932 flow. Second operand 6 states and 110 transitions.
[2024-06-03 22:51:02,905 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 314 places, 455 transitions, 6953 flow
[2024-06-03 22:51:03,804 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 455 transitions, 6553 flow, removed 19 selfloop flow, removed 11 redundant places.
[2024-06-03 22:51:03,810 INFO  L231             Difference]: Finished difference. Result has 304 places, 434 transitions, 5872 flow
[2024-06-03 22:51:03,810 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5532, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=431, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=103, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=325, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=5872, PETRI_PLACES=304, PETRI_TRANSITIONS=434}
[2024-06-03 22:51:03,813 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 262 predicate places.
[2024-06-03 22:51:03,813 INFO  L495      AbstractCegarLoop]: Abstraction has has 304 places, 434 transitions, 5872 flow
[2024-06-03 22:51:03,813 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 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:51:03,814 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:51:03,814 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:51:03,814 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77
[2024-06-03 22:51:03,814 INFO  L420      AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:51:03,814 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:51:03,814 INFO  L85        PathProgramCache]: Analyzing trace with hash -1454653200, now seen corresponding path program 5 times
[2024-06-03 22:51:03,814 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:51:03,815 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272574190]
[2024-06-03 22:51:03,815 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:51:03,815 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:51:03,848 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:51:17,825 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:51:17,825 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:51:17,825 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272574190]
[2024-06-03 22:51:17,825 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272574190] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:51:17,825 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:51:17,825 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 22:51:17,825 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261096795]
[2024-06-03 22:51:17,825 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:51:17,826 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 22:51:17,826 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:51:17,826 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 22:51:17,826 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90
[2024-06-03 22:51:17,930 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-03 22:51:17,930 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 434 transitions, 5872 flow. Second operand  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 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:51:17,930 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:51:17,930 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-03 22:51:17,930 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:51:20,210 INFO  L124   PetriNetUnfolderBase]: 3830/5935 cut-off events.
[2024-06-03 22:51:20,210 INFO  L125   PetriNetUnfolderBase]: For 448708/448712 co-relation queries the response was YES.
[2024-06-03 22:51:20,260 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 44492 conditions, 5935 events. 3830/5935 cut-off events. For 448708/448712 co-relation queries the response was YES. Maximal size of possible extension queue 339. Compared 33967 event pairs, 862 based on Foata normal form. 8/5940 useless extension candidates. Maximal degree in co-relation 44348. Up to 5534 conditions per place. 
[2024-06-03 22:51:20,280 INFO  L140   encePairwiseOnDemand]: 32/41 looper letters, 337 selfloop transitions, 118 changer transitions 0/458 dead transitions.
[2024-06-03 22:51:20,281 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 310 places, 458 transitions, 7045 flow
[2024-06-03 22:51:20,282 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-03 22:51:20,282 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-03 22:51:20,283 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 119 transitions.
[2024-06-03 22:51:20,283 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4146341463414634
[2024-06-03 22:51:20,283 INFO  L175             Difference]: Start difference. First operand has 304 places, 434 transitions, 5872 flow. Second operand 7 states and 119 transitions.
[2024-06-03 22:51:20,283 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 310 places, 458 transitions, 7045 flow
[2024-06-03 22:51:21,062 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 458 transitions, 6894 flow, removed 10 selfloop flow, removed 4 redundant places.
[2024-06-03 22:51:21,067 INFO  L231             Difference]: Finished difference. Result has 307 places, 437 transitions, 6012 flow
[2024-06-03 22:51:21,068 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5721, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=434, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=115, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=319, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=6012, PETRI_PLACES=307, PETRI_TRANSITIONS=437}
[2024-06-03 22:51:21,068 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 265 predicate places.
[2024-06-03 22:51:21,068 INFO  L495      AbstractCegarLoop]: Abstraction has has 307 places, 437 transitions, 6012 flow
[2024-06-03 22:51:21,068 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 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:51:21,068 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:51:21,068 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:51:21,069 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78
[2024-06-03 22:51:21,069 INFO  L420      AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:51:21,069 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:51:21,069 INFO  L85        PathProgramCache]: Analyzing trace with hash 267636496, now seen corresponding path program 6 times
[2024-06-03 22:51:21,069 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:51:21,069 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966554025]
[2024-06-03 22:51:21,069 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:51:21,070 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:51:21,099 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
Killed by 15