./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix003_power.opt_pso.opt_rmo.opt_tso.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/mix003_power.opt_pso.opt_rmo.opt_tso.opt.yml/witness.yml --architecture 32bit


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


Checking for ERROR reachability
Using default analysis
Version cde23df1
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/mix003_power.opt_pso.opt_rmo.opt_tso.opt.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/mix003_power.opt_pso.opt_rmo.opt_tso.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-cde23df-m
[2024-06-14 14:23:00,953 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-06-14 14:23:01,016 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-06-14 14:23:01,020 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-06-14 14:23:01,020 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-06-14 14:23:01,043 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-06-14 14:23:01,044 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-06-14 14:23:01,044 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-06-14 14:23:01,045 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-06-14 14:23:01,048 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-06-14 14:23:01,048 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-06-14 14:23:01,049 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-06-14 14:23:01,049 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-06-14 14:23:01,050 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-06-14 14:23:01,051 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-06-14 14:23:01,051 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-06-14 14:23:01,051 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-06-14 14:23:01,051 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-06-14 14:23:01,052 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-06-14 14:23:01,052 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-06-14 14:23:01,052 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-06-14 14:23:01,052 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-06-14 14:23:01,053 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-06-14 14:23:01,053 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-06-14 14:23:01,053 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-06-14 14:23:01,053 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-06-14 14:23:01,054 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-06-14 14:23:01,054 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-06-14 14:23:01,054 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-06-14 14:23:01,055 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-06-14 14:23:01,055 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-06-14 14:23:01,056 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-06-14 14:23:01,056 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-06-14 14:23:01,056 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-06-14 14:23:01,056 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-06-14 14:23:01,056 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-06-14 14:23:01,057 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-06-14 14:23:01,057 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-06-14 14:23:01,057 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-06-14 14:23:01,057 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-06-14 14:23:01,057 INFO  L153        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-06-14 14:23:01,058 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-06-14 14:23:01,058 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-06-14 14:23:01,058 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-14 14:23:01,256 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-06-14 14:23:01,279 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-06-14 14:23:01,281 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-06-14 14:23:01,282 INFO  L270        PluginConnector]: Initializing Witness Parser...
[2024-06-14 14:23:01,283 INFO  L274        PluginConnector]: Witness Parser initialized
[2024-06-14 14:23:01,284 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/mix003_power.opt_pso.opt_rmo.opt_tso.opt.yml/witness.yml
[2024-06-14 14:23:01,465 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-06-14 14:23:01,466 INFO  L274        PluginConnector]: CDTParser initialized
[2024-06-14 14:23:01,466 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix003_power.opt_pso.opt_rmo.opt_tso.opt.i
[2024-06-14 14:23:02,636 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-06-14 14:23:02,867 INFO  L384              CDTParser]: Found 1 translation units.
[2024-06-14 14:23:02,868 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix003_power.opt_pso.opt_rmo.opt_tso.opt.i
[2024-06-14 14:23:02,878 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48c1ac95b/42261f4d4aeb47858590e9879e7e18b9/FLAGbb3fbb441
[2024-06-14 14:23:02,887 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48c1ac95b/42261f4d4aeb47858590e9879e7e18b9
[2024-06-14 14:23:02,888 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-06-14 14:23:02,889 INFO  L133        ToolchainWalker]: Walking toolchain with 5 elements.
[2024-06-14 14:23:02,890 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-06-14 14:23:02,890 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-06-14 14:23:02,894 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-06-14 14:23:02,894 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 02:23:01" (1/2) ...
[2024-06-14 14:23:02,895 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e1c2215 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:23:02, skipping insertion in model container
[2024-06-14 14:23:02,895 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 02:23:01" (1/2) ...
[2024-06-14 14:23:02,896 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@2fd8a038 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:23:02, skipping insertion in model container
[2024-06-14 14:23:02,896 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 02:23:02" (2/2) ...
[2024-06-14 14:23:02,896 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e1c2215 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:23:02, skipping insertion in model container
[2024-06-14 14:23:02,897 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 02:23:02" (2/2) ...
[2024-06-14 14:23:02,897 INFO  L83    nessWitnessExtractor]: Extracting all invariants from correctness witness
[2024-06-14 14:23:02,982 INFO  L95    edCorrectnessWitness]: Found the following entries in the witness:
[2024-06-14 14:23:02,983 INFO  L97    edCorrectnessWitness]: Location invariant before [L851-L851] (((((((((((((((((((((! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p2_EBX) + (long long )z >= 0LL && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )z >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )y$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )y$flush_delayed >= 0LL) && (long long )x + (long long )y$mem_tmp >= 0LL) && (long long )x + (long long )y$r_buff0_thd0 >= 0LL) && (long long )x + (long long )y$r_buff0_thd1 >= 0LL) && (long long )x + (long long )y$r_buff0_thd2 >= 0LL) && (long long )x + (long long )y$r_buff1_thd0 >= 0LL) && (long long )x + (long long )y$r_buff1_thd1 >= 0LL) && (long long )x + (long long )y$r_buff1_thd2 >= 0LL) && (long long )x + (long long )y$read_delayed >= 0LL) && (long long )x + (long long )y$w_buff0 >= 0LL) && (long long )x + (long long )y$w_buff1 >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )y + (long long )y$flush_delayed >= 0LL) && (long long )y + (long long )y$mem_tmp >= 0LL) && (long long )y + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y + (long long )y$read_delayed >= 0LL) && (long long )y + (long long )y$w_buff0 >= 0LL) && (long long )y + (long long )y$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y$flush_delayed + (long long )y$mem_tmp >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$flush_delayed + (long long )z >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff1 >= 0LL) && (long long )y$mem_tmp + (long long )z >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )z >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )z >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )z >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )z >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )z >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )z >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$read_delayed + (long long )z >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )z >= 0LL) && (long long )y$w_buff1 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (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 )y) - (long long )z >= 0LL) && (1LL + (long long )y$flush_delayed) - (long long )z >= 0LL) && (1LL + (long long )y$mem_tmp) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff0_thd0) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff0_thd1) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff0_thd2) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff1_thd0) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff1_thd1) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff1_thd2) - (long long )z >= 0LL) && (1LL + (long long )y$read_delayed) - (long long )z >= 0LL) && (1LL + (long long )y$w_buff0) - (long long )z >= 0LL) && (1LL + (long long )y$w_buff1) - (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 )y$r_buff0_thd0) - (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$r_buff0_thd0) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff0_thd1) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff0_thd2) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff1_thd0) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff1_thd1) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff1_thd2) - (long long )z >= 0LL) && (1LL - (long long )y$read_delayed) - (long long )z >= 0LL) && (2LL - (long long )__unbuffered_p2_EBX) - (long long )z >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$read_delayed >= 0LL) && (long long )x - (long long )y$r_buff0_thd0 >= 0LL) && (long long )x - (long long )y$r_buff0_thd1 >= 0LL) && (long long )x - (long long )y$r_buff0_thd2 >= 0LL) && (long long )x - (long long )y$r_buff1_thd0 >= 0LL) && (long long )x - (long long )y$r_buff1_thd1 >= 0LL) && (long long )x - (long long )y$r_buff1_thd2 >= 0LL) && (long long )x - (long long )y$read_delayed >= 0LL) && (long long )y - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y - (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && 0 <= z) && __unbuffered_p0_EAX <= 1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p1_EBX <= 1) && __unbuffered_p2_EAX <= 1) && __unbuffered_p2_EBX <= 1) && x <= 1) && y <= 1) && y$mem_tmp <= 1) && y$w_buff0 <= 1) && y$w_buff1 <= 1) && z <= 1) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd1 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd1 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (y$mem_tmp == 0 || y$mem_tmp == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 1)) && (y$w_buff1 == 0 || y$w_buff1 == 1)) && (z == 0 || z == 1)))) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || ((0 <= y$w_buff1 && y$w_buff1 <= 1) && (y$w_buff1 == 0 || y$w_buff1 == 1)))) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 1) && (y$mem_tmp == 0 || y$mem_tmp == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || y$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= y$w_buff0 && y$w_buff0 <= 1) && (y$w_buff0 == 0 || y$w_buff0 == 1)))) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)
[2024-06-14 14:23:02,984 INFO  L97    edCorrectnessWitness]: Location invariant before [L853-L853] (((((((((((((((((((((! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p2_EBX) + (long long )z >= 0LL && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )z >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )y$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )y$flush_delayed >= 0LL) && (long long )x + (long long )y$mem_tmp >= 0LL) && (long long )x + (long long )y$r_buff0_thd0 >= 0LL) && (long long )x + (long long )y$r_buff0_thd1 >= 0LL) && (long long )x + (long long )y$r_buff0_thd2 >= 0LL) && (long long )x + (long long )y$r_buff1_thd0 >= 0LL) && (long long )x + (long long )y$r_buff1_thd1 >= 0LL) && (long long )x + (long long )y$r_buff1_thd2 >= 0LL) && (long long )x + (long long )y$read_delayed >= 0LL) && (long long )x + (long long )y$w_buff0 >= 0LL) && (long long )x + (long long )y$w_buff1 >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )y + (long long )y$flush_delayed >= 0LL) && (long long )y + (long long )y$mem_tmp >= 0LL) && (long long )y + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y + (long long )y$read_delayed >= 0LL) && (long long )y + (long long )y$w_buff0 >= 0LL) && (long long )y + (long long )y$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y$flush_delayed + (long long )y$mem_tmp >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$flush_delayed + (long long )z >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff1 >= 0LL) && (long long )y$mem_tmp + (long long )z >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )z >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )z >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )z >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )z >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )z >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )z >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$read_delayed + (long long )z >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )z >= 0LL) && (long long )y$w_buff1 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (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 )y) - (long long )z >= 0LL) && (1LL + (long long )y$flush_delayed) - (long long )z >= 0LL) && (1LL + (long long )y$mem_tmp) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff0_thd0) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff0_thd1) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff0_thd2) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff1_thd0) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff1_thd1) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff1_thd2) - (long long )z >= 0LL) && (1LL + (long long )y$read_delayed) - (long long )z >= 0LL) && (1LL + (long long )y$w_buff0) - (long long )z >= 0LL) && (1LL + (long long )y$w_buff1) - (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 )y$r_buff0_thd0) - (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$r_buff0_thd0) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff0_thd1) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff0_thd2) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff1_thd0) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff1_thd1) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff1_thd2) - (long long )z >= 0LL) && (1LL - (long long )y$read_delayed) - (long long )z >= 0LL) && (2LL - (long long )__unbuffered_p2_EBX) - (long long )z >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$read_delayed >= 0LL) && (long long )x - (long long )y$r_buff0_thd0 >= 0LL) && (long long )x - (long long )y$r_buff0_thd1 >= 0LL) && (long long )x - (long long )y$r_buff0_thd2 >= 0LL) && (long long )x - (long long )y$r_buff1_thd0 >= 0LL) && (long long )x - (long long )y$r_buff1_thd1 >= 0LL) && (long long )x - (long long )y$r_buff1_thd2 >= 0LL) && (long long )x - (long long )y$read_delayed >= 0LL) && (long long )y - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y - (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && 0 <= z) && __unbuffered_p0_EAX <= 1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p1_EBX <= 1) && __unbuffered_p2_EAX <= 1) && __unbuffered_p2_EBX <= 1) && x <= 1) && y <= 1) && y$mem_tmp <= 1) && y$w_buff0 <= 1) && y$w_buff1 <= 1) && z <= 1) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd1 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd1 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (y$mem_tmp == 0 || y$mem_tmp == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 1)) && (y$w_buff1 == 0 || y$w_buff1 == 1)) && (z == 0 || z == 1)))) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || ((0 <= y$w_buff1 && y$w_buff1 <= 1) && (y$w_buff1 == 0 || y$w_buff1 == 1)))) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 1) && (y$mem_tmp == 0 || y$mem_tmp == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || y$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= y$w_buff0 && y$w_buff0 <= 1) && (y$w_buff0 == 0 || y$w_buff0 == 1)))) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)
[2024-06-14 14:23:02,984 INFO  L97    edCorrectnessWitness]: Location invariant before [L854-L854] (((((((((((((((((((((! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p2_EBX) + (long long )z >= 0LL && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )z >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )y$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )y$flush_delayed >= 0LL) && (long long )x + (long long )y$mem_tmp >= 0LL) && (long long )x + (long long )y$r_buff0_thd0 >= 0LL) && (long long )x + (long long )y$r_buff0_thd1 >= 0LL) && (long long )x + (long long )y$r_buff0_thd2 >= 0LL) && (long long )x + (long long )y$r_buff1_thd0 >= 0LL) && (long long )x + (long long )y$r_buff1_thd1 >= 0LL) && (long long )x + (long long )y$r_buff1_thd2 >= 0LL) && (long long )x + (long long )y$read_delayed >= 0LL) && (long long )x + (long long )y$w_buff0 >= 0LL) && (long long )x + (long long )y$w_buff1 >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )y + (long long )y$flush_delayed >= 0LL) && (long long )y + (long long )y$mem_tmp >= 0LL) && (long long )y + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y + (long long )y$read_delayed >= 0LL) && (long long )y + (long long )y$w_buff0 >= 0LL) && (long long )y + (long long )y$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y$flush_delayed + (long long )y$mem_tmp >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$flush_delayed + (long long )z >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff1 >= 0LL) && (long long )y$mem_tmp + (long long )z >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )z >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )z >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )z >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )z >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )z >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )z >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$read_delayed + (long long )z >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )z >= 0LL) && (long long )y$w_buff1 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (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 )y) - (long long )z >= 0LL) && (1LL + (long long )y$flush_delayed) - (long long )z >= 0LL) && (1LL + (long long )y$mem_tmp) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff0_thd0) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff0_thd1) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff0_thd2) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff1_thd0) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff1_thd1) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff1_thd2) - (long long )z >= 0LL) && (1LL + (long long )y$read_delayed) - (long long )z >= 0LL) && (1LL + (long long )y$w_buff0) - (long long )z >= 0LL) && (1LL + (long long )y$w_buff1) - (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 )y$r_buff0_thd0) - (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$r_buff0_thd0) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff0_thd1) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff0_thd2) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff1_thd0) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff1_thd1) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff1_thd2) - (long long )z >= 0LL) && (1LL - (long long )y$read_delayed) - (long long )z >= 0LL) && (2LL - (long long )__unbuffered_p2_EBX) - (long long )z >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$read_delayed >= 0LL) && (long long )x - (long long )y$r_buff0_thd0 >= 0LL) && (long long )x - (long long )y$r_buff0_thd1 >= 0LL) && (long long )x - (long long )y$r_buff0_thd2 >= 0LL) && (long long )x - (long long )y$r_buff1_thd0 >= 0LL) && (long long )x - (long long )y$r_buff1_thd1 >= 0LL) && (long long )x - (long long )y$r_buff1_thd2 >= 0LL) && (long long )x - (long long )y$read_delayed >= 0LL) && (long long )y - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y - (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && 0 <= z) && __unbuffered_p0_EAX <= 1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p1_EBX <= 1) && __unbuffered_p2_EAX <= 1) && __unbuffered_p2_EBX <= 1) && x <= 1) && y <= 1) && y$mem_tmp <= 1) && y$w_buff0 <= 1) && y$w_buff1 <= 1) && z <= 1) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd1 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd1 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (y$mem_tmp == 0 || y$mem_tmp == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 1)) && (y$w_buff1 == 0 || y$w_buff1 == 1)) && (z == 0 || z == 1)))) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || ((0 <= y$w_buff1 && y$w_buff1 <= 1) && (y$w_buff1 == 0 || y$w_buff1 == 1)))) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 1) && (y$mem_tmp == 0 || y$mem_tmp == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || y$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= y$w_buff0 && y$w_buff0 <= 1) && (y$w_buff0 == 0 || y$w_buff0 == 1)))) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)
[2024-06-14 14:23:02,985 INFO  L103   edCorrectnessWitness]: ghost_variable multithreaded = 0
[2024-06-14 14:23:02,985 INFO  L106   edCorrectnessWitness]: ghost_update [L849-L849] multithreaded = 1;
[2024-06-14 14:23:03,023 INFO  L177         MainTranslator]: Built tables and reachable declarations
[2024-06-14 14:23:03,313 INFO  L207          PostProcessor]: Analyzing one entry point: main
[2024-06-14 14:23:03,333 INFO  L202         MainTranslator]: Completed pre-run
Start Parsing Local
Start Parsing Local
Start Parsing Local
Start Parsing Local
Start Parsing Local
[2024-06-14 14:23:03,635 INFO  L207          PostProcessor]: Analyzing one entry point: main
[2024-06-14 14:23:03,671 INFO  L206         MainTranslator]: Completed translation
[2024-06-14 14:23:03,671 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:23:03 WrapperNode
[2024-06-14 14:23:03,672 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-06-14 14:23:03,672 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-06-14 14:23:03,672 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-06-14 14:23:03,673 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-06-14 14:23:03,678 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:23:03" (1/1) ...
[2024-06-14 14:23:03,717 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:23:03" (1/1) ...
[2024-06-14 14:23:03,801 INFO  L138                Inliner]: procedures = 175, calls = 47, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 150
[2024-06-14 14:23:03,802 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-06-14 14:23:03,802 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-06-14 14:23:03,803 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-06-14 14:23:03,803 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-06-14 14:23:03,812 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:23:03" (1/1) ...
[2024-06-14 14:23:03,812 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:23:03" (1/1) ...
[2024-06-14 14:23:03,918 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:23:03" (1/1) ...
[2024-06-14 14:23:03,970 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-14 14:23:03,971 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:23:03" (1/1) ...
[2024-06-14 14:23:03,971 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:23:03" (1/1) ...
[2024-06-14 14:23:04,002 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:23:03" (1/1) ...
[2024-06-14 14:23:04,004 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:23:03" (1/1) ...
[2024-06-14 14:23:04,014 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:23:03" (1/1) ...
[2024-06-14 14:23:04,019 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:23:03" (1/1) ...
[2024-06-14 14:23:04,040 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-06-14 14:23:04,041 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-06-14 14:23:04,041 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-06-14 14:23:04,041 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-06-14 14:23:04,042 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:23:03" (1/1) ...
[2024-06-14 14:23:04,046 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-06-14 14:23:04,053 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-06-14 14:23:04,083 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-14 14:23:04,109 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-14 14:23:04,177 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2024-06-14 14:23:04,178 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-06-14 14:23:04,178 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2024-06-14 14:23:04,178 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2024-06-14 14:23:04,178 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2024-06-14 14:23:04,178 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2024-06-14 14:23:04,178 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2024-06-14 14:23:04,178 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2024-06-14 14:23:04,178 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-06-14 14:23:04,178 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2024-06-14 14:23:04,178 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-06-14 14:23:04,178 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-06-14 14:23:04,179 WARN  L214             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement
[2024-06-14 14:23:04,292 INFO  L244             CfgBuilder]: Building ICFG
[2024-06-14 14:23:04,294 INFO  L270             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-06-14 14:23:05,454 INFO  L289             CfgBuilder]: Ommited future-live optimization because the input is a concurrent program.
[2024-06-14 14:23:05,455 INFO  L293             CfgBuilder]: Performing block encoding
[2024-06-14 14:23:05,776 INFO  L315             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-06-14 14:23:05,776 INFO  L320             CfgBuilder]: Removed 0 assume(true) statements.
[2024-06-14 14:23:05,777 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 02:23:05 BoogieIcfgContainer
[2024-06-14 14:23:05,777 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-06-14 14:23:05,779 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-06-14 14:23:05,779 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-06-14 14:23:05,781 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-06-14 14:23:05,782 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 02:23:01" (1/4) ...
[2024-06-14 14:23:05,783 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67c4a20c and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 14.06 02:23:05, skipping insertion in model container
[2024-06-14 14:23:05,783 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.06 02:23:02" (2/4) ...
[2024-06-14 14:23:05,783 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67c4a20c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.06 02:23:05, skipping insertion in model container
[2024-06-14 14:23:05,783 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:23:03" (3/4) ...
[2024-06-14 14:23:05,785 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67c4a20c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.06 02:23:05, skipping insertion in model container
[2024-06-14 14:23:05,785 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 02:23:05" (4/4) ...
[2024-06-14 14:23:05,786 INFO  L112   eAbstractionObserver]: Analyzing ICFG mix003_power.opt_pso.opt_rmo.opt_tso.opt.i
[2024-06-14 14:23:05,799 INFO  L204   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-06-14 14:23:05,799 INFO  L163   ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations.
[2024-06-14 14:23:05,800 INFO  L522   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-06-14 14:23:05,910 INFO  L144    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-06-14 14:23:05,939 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 53 places, 43 transitions, 98 flow
[2024-06-14 14:23:06,014 INFO  L124   PetriNetUnfolderBase]: 0/40 cut-off events.
[2024-06-14 14:23:06,015 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-06-14 14:23:06,017 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 50 conditions, 40 events. 0/40 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 65 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. 
[2024-06-14 14:23:06,017 INFO  L82        GeneralOperation]: Start removeDead. Operand has 53 places, 43 transitions, 98 flow
[2024-06-14 14:23:06,034 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 44 places, 34 transitions, 77 flow
[2024-06-14 14:23:06,044 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-06-14 14:23:06,050 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;@3d2327d1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-06-14 14:23:06,050 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2024-06-14 14:23:06,059 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-06-14 14:23:06,059 INFO  L124   PetriNetUnfolderBase]: 0/6 cut-off events.
[2024-06-14 14:23:06,059 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-06-14 14:23:06,059 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:23:06,060 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1]
[2024-06-14 14:23:06,060 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-14 14:23:06,067 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:23:06,067 INFO  L85        PathProgramCache]: Analyzing trace with hash -377810500, now seen corresponding path program 1 times
[2024-06-14 14:23:06,089 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:23:06,090 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139345957]
[2024-06-14 14:23:06,090 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:23:06,091 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:23:06,502 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:23:12,665 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:23:12,666 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:23:12,666 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139345957]
[2024-06-14 14:23:12,667 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139345957] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:23:12,667 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:23:12,667 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-06-14 14:23:12,668 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358760781]
[2024-06-14 14:23:12,669 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:23:12,675 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-06-14 14:23:12,679 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:23:12,699 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-06-14 14:23:12,699 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-06-14 14:23:12,790 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 14 out of 43
[2024-06-14 14:23:12,792 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 77 flow. Second operand  has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:23:12,792 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:23:12,792 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 43
[2024-06-14 14:23:12,793 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:23:13,540 INFO  L124   PetriNetUnfolderBase]: 869/1406 cut-off events.
[2024-06-14 14:23:13,540 INFO  L125   PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES.
[2024-06-14 14:23:13,546 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2786 conditions, 1406 events. 869/1406 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 7216 event pairs, 566 based on Foata normal form. 1/1349 useless extension candidates. Maximal degree in co-relation 2771. Up to 1315 conditions per place. 
[2024-06-14 14:23:13,554 INFO  L140   encePairwiseOnDemand]: 36/43 looper letters, 32 selfloop transitions, 4 changer transitions 0/44 dead transitions.
[2024-06-14 14:23:13,554 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 44 transitions, 175 flow
[2024-06-14 14:23:13,555 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-06-14 14:23:13,557 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-06-14 14:23:13,562 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 81 transitions.
[2024-06-14 14:23:13,563 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.627906976744186
[2024-06-14 14:23:13,565 INFO  L175             Difference]: Start difference. First operand has 44 places, 34 transitions, 77 flow. Second operand 3 states and 81 transitions.
[2024-06-14 14:23:13,565 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 44 transitions, 175 flow
[2024-06-14 14:23:13,567 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 44 transitions, 170 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-06-14 14:23:13,569 INFO  L231             Difference]: Finished difference. Result has 44 places, 37 transitions, 104 flow
[2024-06-14 14:23:13,571 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=44, PETRI_TRANSITIONS=37}
[2024-06-14 14:23:13,573 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 0 predicate places.
[2024-06-14 14:23:13,573 INFO  L495      AbstractCegarLoop]: Abstraction has has 44 places, 37 transitions, 104 flow
[2024-06-14 14:23:13,574 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:23:13,574 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:23:13,574 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:23:13,574 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-06-14 14:23:13,574 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-14 14:23:13,575 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:23:13,575 INFO  L85        PathProgramCache]: Analyzing trace with hash 1996366299, now seen corresponding path program 1 times
[2024-06-14 14:23:13,575 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:23:13,576 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668820828]
[2024-06-14 14:23:13,576 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:23:13,576 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:23:13,691 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:23:18,411 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:23:18,412 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:23:18,412 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668820828]
[2024-06-14 14:23:18,412 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668820828] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:23:18,412 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:23:18,412 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-06-14 14:23:18,413 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528243218]
[2024-06-14 14:23:18,413 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:23:18,415 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-06-14 14:23:18,415 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:23:18,416 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-06-14 14:23:18,416 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-06-14 14:23:18,560 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 43
[2024-06-14 14:23:18,560 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 37 transitions, 104 flow. Second operand  has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:23:18,561 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:23:18,561 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 43
[2024-06-14 14:23:18,561 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:23:19,219 INFO  L124   PetriNetUnfolderBase]: 996/1572 cut-off events.
[2024-06-14 14:23:19,220 INFO  L125   PetriNetUnfolderBase]: For 338/338 co-relation queries the response was YES.
[2024-06-14 14:23:19,223 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 3589 conditions, 1572 events. 996/1572 cut-off events. For 338/338 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 7871 event pairs, 519 based on Foata normal form. 3/1572 useless extension candidates. Maximal degree in co-relation 3574. Up to 1484 conditions per place. 
[2024-06-14 14:23:19,230 INFO  L140   encePairwiseOnDemand]: 35/43 looper letters, 40 selfloop transitions, 7 changer transitions 0/54 dead transitions.
[2024-06-14 14:23:19,270 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 54 transitions, 244 flow
[2024-06-14 14:23:19,271 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-06-14 14:23:19,271 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-06-14 14:23:19,273 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 102 transitions.
[2024-06-14 14:23:19,274 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5930232558139535
[2024-06-14 14:23:19,274 INFO  L175             Difference]: Start difference. First operand has 44 places, 37 transitions, 104 flow. Second operand 4 states and 102 transitions.
[2024-06-14 14:23:19,274 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 54 transitions, 244 flow
[2024-06-14 14:23:19,277 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 54 transitions, 240 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-06-14 14:23:19,279 INFO  L231             Difference]: Finished difference. Result has 47 places, 40 transitions, 140 flow
[2024-06-14 14:23:19,279 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=140, PETRI_PLACES=47, PETRI_TRANSITIONS=40}
[2024-06-14 14:23:19,280 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 3 predicate places.
[2024-06-14 14:23:19,280 INFO  L495      AbstractCegarLoop]: Abstraction has has 47 places, 40 transitions, 140 flow
[2024-06-14 14:23:19,281 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:23:19,281 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:23:19,281 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:23:19,284 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-06-14 14:23:19,284 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-14 14:23:19,284 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:23:19,285 INFO  L85        PathProgramCache]: Analyzing trace with hash 1337464378, now seen corresponding path program 1 times
[2024-06-14 14:23:19,285 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:23:19,291 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757694993]
[2024-06-14 14:23:19,291 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:23:19,291 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:23:19,343 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:23:24,490 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-14 14:23:24,491 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:23:24,491 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757694993]
[2024-06-14 14:23:24,491 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757694993] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:23:24,491 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:23:24,491 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-06-14 14:23:24,491 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634683004]
[2024-06-14 14:23:24,492 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:23:24,492 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-06-14 14:23:24,492 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:23:24,492 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-06-14 14:23:24,493 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2024-06-14 14:23:24,637 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43
[2024-06-14 14:23:24,637 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 40 transitions, 140 flow. Second operand  has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:23:24,637 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:23:24,637 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43
[2024-06-14 14:23:24,637 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:23:25,703 INFO  L124   PetriNetUnfolderBase]: 1265/1959 cut-off events.
[2024-06-14 14:23:25,704 INFO  L125   PetriNetUnfolderBase]: For 1122/1122 co-relation queries the response was YES.
[2024-06-14 14:23:25,707 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4958 conditions, 1959 events. 1265/1959 cut-off events. For 1122/1122 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 9637 event pairs, 445 based on Foata normal form. 6/1959 useless extension candidates. Maximal degree in co-relation 4941. Up to 1828 conditions per place. 
[2024-06-14 14:23:25,713 INFO  L140   encePairwiseOnDemand]: 34/43 looper letters, 52 selfloop transitions, 12 changer transitions 0/70 dead transitions.
[2024-06-14 14:23:25,713 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 70 transitions, 356 flow
[2024-06-14 14:23:25,715 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-14 14:23:25,715 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-14 14:23:25,715 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 139 transitions.
[2024-06-14 14:23:25,716 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5387596899224806
[2024-06-14 14:23:25,716 INFO  L175             Difference]: Start difference. First operand has 47 places, 40 transitions, 140 flow. Second operand 6 states and 139 transitions.
[2024-06-14 14:23:25,716 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 70 transitions, 356 flow
[2024-06-14 14:23:25,717 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 70 transitions, 336 flow, removed 4 selfloop flow, removed 2 redundant places.
[2024-06-14 14:23:25,718 INFO  L231             Difference]: Finished difference. Result has 51 places, 44 transitions, 183 flow
[2024-06-14 14:23:25,718 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=183, PETRI_PLACES=51, PETRI_TRANSITIONS=44}
[2024-06-14 14:23:25,719 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 7 predicate places.
[2024-06-14 14:23:25,719 INFO  L495      AbstractCegarLoop]: Abstraction has has 51 places, 44 transitions, 183 flow
[2024-06-14 14:23:25,719 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:23:25,719 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:23:25,719 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:23:25,719 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-06-14 14:23:25,720 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:23:25,720 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:23:25,720 INFO  L85        PathProgramCache]: Analyzing trace with hash 668599817, now seen corresponding path program 1 times
[2024-06-14 14:23:25,720 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:23:25,720 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534111185]
[2024-06-14 14:23:25,720 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:23:25,721 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:23:25,746 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:23:35,642 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:23:35,643 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:23:35,646 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534111185]
[2024-06-14 14:23:35,646 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534111185] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:23:35,646 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:23:35,649 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-06-14 14:23:35,649 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874261259]
[2024-06-14 14:23:35,649 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:23:35,650 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-06-14 14:23:35,650 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:23:35,651 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-06-14 14:23:35,651 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2024-06-14 14:23:35,778 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43
[2024-06-14 14:23:35,779 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 44 transitions, 183 flow. Second operand  has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:23:35,779 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:23:35,779 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43
[2024-06-14 14:23:35,780 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:23:36,745 INFO  L124   PetriNetUnfolderBase]: 1333/2085 cut-off events.
[2024-06-14 14:23:36,745 INFO  L125   PetriNetUnfolderBase]: For 2082/2082 co-relation queries the response was YES.
[2024-06-14 14:23:36,749 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5740 conditions, 2085 events. 1333/2085 cut-off events. For 2082/2082 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 10389 event pairs, 592 based on Foata normal form. 2/2046 useless extension candidates. Maximal degree in co-relation 5721. Up to 1980 conditions per place. 
[2024-06-14 14:23:36,757 INFO  L140   encePairwiseOnDemand]: 35/43 looper letters, 44 selfloop transitions, 8 changer transitions 0/58 dead transitions.
[2024-06-14 14:23:36,757 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 58 transitions, 329 flow
[2024-06-14 14:23:36,758 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-14 14:23:36,758 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-14 14:23:36,760 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 101 transitions.
[2024-06-14 14:23:36,760 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4697674418604651
[2024-06-14 14:23:36,761 INFO  L175             Difference]: Start difference. First operand has 51 places, 44 transitions, 183 flow. Second operand 5 states and 101 transitions.
[2024-06-14 14:23:36,761 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 58 transitions, 329 flow
[2024-06-14 14:23:36,765 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 58 transitions, 302 flow, removed 4 selfloop flow, removed 3 redundant places.
[2024-06-14 14:23:36,767 INFO  L231             Difference]: Finished difference. Result has 53 places, 47 transitions, 200 flow
[2024-06-14 14:23:36,767 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=200, PETRI_PLACES=53, PETRI_TRANSITIONS=47}
[2024-06-14 14:23:36,768 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 9 predicate places.
[2024-06-14 14:23:36,768 INFO  L495      AbstractCegarLoop]: Abstraction has has 53 places, 47 transitions, 200 flow
[2024-06-14 14:23:36,769 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:23:36,769 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:23:36,769 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:23:36,769 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-06-14 14:23:36,769 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-14 14:23:36,769 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:23:36,770 INFO  L85        PathProgramCache]: Analyzing trace with hash -737515851, now seen corresponding path program 1 times
[2024-06-14 14:23:36,770 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:23:36,770 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415286599]
[2024-06-14 14:23:36,770 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:23:36,770 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:23:36,802 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:23:48,087 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-14 14:23:48,087 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:23:48,087 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415286599]
[2024-06-14 14:23:48,087 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415286599] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:23:48,087 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:23:48,087 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-14 14:23:48,087 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950617449]
[2024-06-14 14:23:48,088 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:23:48,088 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-14 14:23:48,088 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:23:48,088 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-14 14:23:48,088 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2024-06-14 14:23:48,196 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43
[2024-06-14 14:23:48,197 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 47 transitions, 200 flow. Second operand  has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:23:48,197 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:23:48,197 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43
[2024-06-14 14:23:48,197 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:23:49,264 INFO  L124   PetriNetUnfolderBase]: 1323/2107 cut-off events.
[2024-06-14 14:23:49,264 INFO  L125   PetriNetUnfolderBase]: For 3045/3045 co-relation queries the response was YES.
[2024-06-14 14:23:49,268 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6177 conditions, 2107 events. 1323/2107 cut-off events. For 3045/3045 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 10641 event pairs, 556 based on Foata normal form. 4/2102 useless extension candidates. Maximal degree in co-relation 6156. Up to 1948 conditions per place. 
[2024-06-14 14:23:49,276 INFO  L140   encePairwiseOnDemand]: 34/43 looper letters, 49 selfloop transitions, 11 changer transitions 0/66 dead transitions.
[2024-06-14 14:23:49,276 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 66 transitions, 378 flow
[2024-06-14 14:23:49,276 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-14 14:23:49,277 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-14 14:23:49,278 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 120 transitions.
[2024-06-14 14:23:49,278 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46511627906976744
[2024-06-14 14:23:49,278 INFO  L175             Difference]: Start difference. First operand has 53 places, 47 transitions, 200 flow. Second operand 6 states and 120 transitions.
[2024-06-14 14:23:49,279 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 66 transitions, 378 flow
[2024-06-14 14:23:49,284 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 66 transitions, 358 flow, removed 4 selfloop flow, removed 3 redundant places.
[2024-06-14 14:23:49,285 INFO  L231             Difference]: Finished difference. Result has 56 places, 50 transitions, 234 flow
[2024-06-14 14:23:49,285 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=234, PETRI_PLACES=56, PETRI_TRANSITIONS=50}
[2024-06-14 14:23:49,287 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 12 predicate places.
[2024-06-14 14:23:49,287 INFO  L495      AbstractCegarLoop]: Abstraction has has 56 places, 50 transitions, 234 flow
[2024-06-14 14:23:49,288 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:23:49,288 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:23:49,288 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:23:49,289 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-06-14 14:23:49,289 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-14 14:23:49,289 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:23:49,289 INFO  L85        PathProgramCache]: Analyzing trace with hash -1181685930, now seen corresponding path program 1 times
[2024-06-14 14:23:49,289 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:23:49,289 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907107974]
[2024-06-14 14:23:49,289 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:23:49,290 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:23:49,316 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:23:59,566 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-14 14:23:59,566 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:23:59,566 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907107974]
[2024-06-14 14:23:59,566 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907107974] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:23:59,567 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:23:59,567 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-14 14:23:59,567 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313279382]
[2024-06-14 14:23:59,567 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:23:59,567 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-14 14:23:59,567 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:23:59,568 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-14 14:23:59,568 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2024-06-14 14:23:59,685 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43
[2024-06-14 14:23:59,686 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 50 transitions, 234 flow. Second operand  has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:23:59,687 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:23:59,687 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43
[2024-06-14 14:23:59,687 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:24:01,080 INFO  L124   PetriNetUnfolderBase]: 1541/2335 cut-off events.
[2024-06-14 14:24:01,080 INFO  L125   PetriNetUnfolderBase]: For 5142/5146 co-relation queries the response was YES.
[2024-06-14 14:24:01,085 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7555 conditions, 2335 events. 1541/2335 cut-off events. For 5142/5146 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 11192 event pairs, 656 based on Foata normal form. 6/2340 useless extension candidates. Maximal degree in co-relation 7533. Up to 2244 conditions per place. 
[2024-06-14 14:24:01,094 INFO  L140   encePairwiseOnDemand]: 34/43 looper letters, 55 selfloop transitions, 16 changer transitions 0/76 dead transitions.
[2024-06-14 14:24:01,094 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 76 transitions, 486 flow
[2024-06-14 14:24:01,095 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-14 14:24:01,095 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-14 14:24:01,095 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 121 transitions.
[2024-06-14 14:24:01,096 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4689922480620155
[2024-06-14 14:24:01,096 INFO  L175             Difference]: Start difference. First operand has 56 places, 50 transitions, 234 flow. Second operand 6 states and 121 transitions.
[2024-06-14 14:24:01,096 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 76 transitions, 486 flow
[2024-06-14 14:24:01,098 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 76 transitions, 456 flow, removed 6 selfloop flow, removed 4 redundant places.
[2024-06-14 14:24:01,099 INFO  L231             Difference]: Finished difference. Result has 58 places, 56 transitions, 290 flow
[2024-06-14 14:24:01,099 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=290, PETRI_PLACES=58, PETRI_TRANSITIONS=56}
[2024-06-14 14:24:01,099 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 14 predicate places.
[2024-06-14 14:24:01,099 INFO  L495      AbstractCegarLoop]: Abstraction has has 58 places, 56 transitions, 290 flow
[2024-06-14 14:24:01,100 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:24:01,100 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:24:01,100 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:24:01,100 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-06-14 14:24:01,100 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-14 14:24:01,100 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:24:01,101 INFO  L85        PathProgramCache]: Analyzing trace with hash -1376369794, now seen corresponding path program 2 times
[2024-06-14 14:24:01,101 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:24:01,101 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557878759]
[2024-06-14 14:24:01,101 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:24:01,101 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:24:01,126 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:24:11,841 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-14 14:24:11,841 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:24:11,842 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557878759]
[2024-06-14 14:24:11,842 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557878759] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:24:11,842 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:24:11,842 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-14 14:24:11,842 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481069693]
[2024-06-14 14:24:11,842 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:24:11,843 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-14 14:24:11,843 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:24:11,843 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-14 14:24:11,843 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-06-14 14:24:11,973 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43
[2024-06-14 14:24:11,973 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 56 transitions, 290 flow. Second operand  has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:24:11,973 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:24:11,973 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43
[2024-06-14 14:24:11,973 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:24:13,311 INFO  L124   PetriNetUnfolderBase]: 1536/2327 cut-off events.
[2024-06-14 14:24:13,311 INFO  L125   PetriNetUnfolderBase]: For 6822/6822 co-relation queries the response was YES.
[2024-06-14 14:24:13,316 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 8050 conditions, 2327 events. 1536/2327 cut-off events. For 6822/6822 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 11143 event pairs, 652 based on Foata normal form. 2/2328 useless extension candidates. Maximal degree in co-relation 8027. Up to 2239 conditions per place. 
[2024-06-14 14:24:13,327 INFO  L140   encePairwiseOnDemand]: 34/43 looper letters, 60 selfloop transitions, 17 changer transitions 0/82 dead transitions.
[2024-06-14 14:24:13,327 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 82 transitions, 510 flow
[2024-06-14 14:24:13,328 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 14:24:13,328 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 14:24:13,328 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 151 transitions.
[2024-06-14 14:24:13,329 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.438953488372093
[2024-06-14 14:24:13,329 INFO  L175             Difference]: Start difference. First operand has 58 places, 56 transitions, 290 flow. Second operand 8 states and 151 transitions.
[2024-06-14 14:24:13,329 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 82 transitions, 510 flow
[2024-06-14 14:24:13,333 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 82 transitions, 476 flow, removed 13 selfloop flow, removed 2 redundant places.
[2024-06-14 14:24:13,334 INFO  L231             Difference]: Finished difference. Result has 64 places, 56 transitions, 298 flow
[2024-06-14 14:24:13,334 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=298, PETRI_PLACES=64, PETRI_TRANSITIONS=56}
[2024-06-14 14:24:13,335 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 20 predicate places.
[2024-06-14 14:24:13,335 INFO  L495      AbstractCegarLoop]: Abstraction has has 64 places, 56 transitions, 298 flow
[2024-06-14 14:24:13,335 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:24:13,335 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:24:13,335 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:24:13,335 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-06-14 14:24:13,335 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-14 14:24:13,336 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:24:13,336 INFO  L85        PathProgramCache]: Analyzing trace with hash 2022323220, now seen corresponding path program 1 times
[2024-06-14 14:24:13,336 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:24:13,336 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745999815]
[2024-06-14 14:24:13,336 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:24:13,336 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:24:13,362 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:24:25,293 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-14 14:24:25,294 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:24:25,294 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745999815]
[2024-06-14 14:24:25,294 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745999815] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:24:25,294 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:24:25,294 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 14:24:25,294 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102414206]
[2024-06-14 14:24:25,295 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:24:25,295 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 14:24:25,295 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:24:25,299 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 14:24:25,299 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-14 14:24:25,493 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43
[2024-06-14 14:24:25,494 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 56 transitions, 298 flow. Second operand  has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:24:25,494 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:24:25,494 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43
[2024-06-14 14:24:25,494 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:24:26,891 INFO  L124   PetriNetUnfolderBase]: 1547/2348 cut-off events.
[2024-06-14 14:24:26,891 INFO  L125   PetriNetUnfolderBase]: For 8046/8046 co-relation queries the response was YES.
[2024-06-14 14:24:26,895 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 8249 conditions, 2348 events. 1547/2348 cut-off events. For 8046/8046 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 11283 event pairs, 631 based on Foata normal form. 2/2349 useless extension candidates. Maximal degree in co-relation 8224. Up to 2258 conditions per place. 
[2024-06-14 14:24:26,906 INFO  L140   encePairwiseOnDemand]: 33/43 looper letters, 65 selfloop transitions, 14 changer transitions 0/84 dead transitions.
[2024-06-14 14:24:26,906 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 84 transitions, 544 flow
[2024-06-14 14:24:26,907 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 14:24:26,907 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 14:24:26,907 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 137 transitions.
[2024-06-14 14:24:26,907 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45514950166112955
[2024-06-14 14:24:26,908 INFO  L175             Difference]: Start difference. First operand has 64 places, 56 transitions, 298 flow. Second operand 7 states and 137 transitions.
[2024-06-14 14:24:26,908 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 84 transitions, 544 flow
[2024-06-14 14:24:26,911 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 84 transitions, 498 flow, removed 2 selfloop flow, removed 8 redundant places.
[2024-06-14 14:24:26,913 INFO  L231             Difference]: Finished difference. Result has 63 places, 59 transitions, 318 flow
[2024-06-14 14:24:26,913 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=318, PETRI_PLACES=63, PETRI_TRANSITIONS=59}
[2024-06-14 14:24:26,914 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 19 predicate places.
[2024-06-14 14:24:26,914 INFO  L495      AbstractCegarLoop]: Abstraction has has 63 places, 59 transitions, 318 flow
[2024-06-14 14:24:26,915 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:24:26,915 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:24:26,915 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:24:26,915 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-06-14 14:24:26,915 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-14 14:24:26,915 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:24:26,916 INFO  L85        PathProgramCache]: Analyzing trace with hash -89753958, now seen corresponding path program 2 times
[2024-06-14 14:24:26,916 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:24:26,916 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332042450]
[2024-06-14 14:24:26,916 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:24:26,916 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:24:26,942 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:24:39,505 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-14 14:24:39,506 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:24:39,506 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332042450]
[2024-06-14 14:24:39,506 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332042450] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:24:39,506 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:24:39,506 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 14:24:39,506 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241659833]
[2024-06-14 14:24:39,507 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:24:39,507 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 14:24:39,507 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:24:39,507 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 14:24:39,507 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2024-06-14 14:24:39,672 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43
[2024-06-14 14:24:39,673 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 59 transitions, 318 flow. Second operand  has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:24:39,673 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:24:39,673 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43
[2024-06-14 14:24:39,673 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:24:40,792 INFO  L124   PetriNetUnfolderBase]: 1558/2374 cut-off events.
[2024-06-14 14:24:40,793 INFO  L125   PetriNetUnfolderBase]: For 10577/10581 co-relation queries the response was YES.
[2024-06-14 14:24:40,799 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 8844 conditions, 2374 events. 1558/2374 cut-off events. For 10577/10581 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 11535 event pairs, 635 based on Foata normal form. 6/2379 useless extension candidates. Maximal degree in co-relation 8819. Up to 2227 conditions per place. 
[2024-06-14 14:24:40,822 INFO  L140   encePairwiseOnDemand]: 33/43 looper letters, 58 selfloop transitions, 26 changer transitions 0/89 dead transitions.
[2024-06-14 14:24:40,823 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 89 transitions, 638 flow
[2024-06-14 14:24:40,823 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 14:24:40,823 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 14:24:40,824 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 140 transitions.
[2024-06-14 14:24:40,824 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46511627906976744
[2024-06-14 14:24:40,824 INFO  L175             Difference]: Start difference. First operand has 63 places, 59 transitions, 318 flow. Second operand 7 states and 140 transitions.
[2024-06-14 14:24:40,824 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 89 transitions, 638 flow
[2024-06-14 14:24:40,828 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 89 transitions, 596 flow, removed 9 selfloop flow, removed 5 redundant places.
[2024-06-14 14:24:40,829 INFO  L231             Difference]: Finished difference. Result has 65 places, 65 transitions, 402 flow
[2024-06-14 14:24:40,830 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=402, PETRI_PLACES=65, PETRI_TRANSITIONS=65}
[2024-06-14 14:24:40,830 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 21 predicate places.
[2024-06-14 14:24:40,830 INFO  L495      AbstractCegarLoop]: Abstraction has has 65 places, 65 transitions, 402 flow
[2024-06-14 14:24:40,830 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:24:40,830 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:24:40,831 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:24:40,831 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-06-14 14:24:40,831 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-14 14:24:40,831 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:24:40,831 INFO  L85        PathProgramCache]: Analyzing trace with hash -1977015970, now seen corresponding path program 1 times
[2024-06-14 14:24:40,831 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:24:40,831 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98890473]
[2024-06-14 14:24:40,832 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:24:40,832 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:24:40,857 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:24:53,256 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-14 14:24:53,256 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:24:53,256 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98890473]
[2024-06-14 14:24:53,256 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98890473] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:24:53,256 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:24:53,258 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 14:24:53,258 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246738766]
[2024-06-14 14:24:53,258 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:24:53,259 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 14:24:53,261 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:24:53,264 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 14:24:53,266 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2024-06-14 14:24:53,451 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43
[2024-06-14 14:24:53,451 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 65 transitions, 402 flow. Second operand  has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:24:53,452 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:24:53,452 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43
[2024-06-14 14:24:53,452 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:24:54,653 INFO  L124   PetriNetUnfolderBase]: 1580/2406 cut-off events.
[2024-06-14 14:24:54,653 INFO  L125   PetriNetUnfolderBase]: For 13710/13710 co-relation queries the response was YES.
[2024-06-14 14:24:54,659 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 9519 conditions, 2406 events. 1580/2406 cut-off events. For 13710/13710 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 11667 event pairs, 583 based on Foata normal form. 4/2407 useless extension candidates. Maximal degree in co-relation 9493. Up to 2233 conditions per place. 
[2024-06-14 14:24:54,667 INFO  L140   encePairwiseOnDemand]: 33/43 looper letters, 70 selfloop transitions, 23 changer transitions 0/98 dead transitions.
[2024-06-14 14:24:54,667 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 98 transitions, 742 flow
[2024-06-14 14:24:54,668 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 14:24:54,668 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 14:24:54,668 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 143 transitions.
[2024-06-14 14:24:54,669 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4750830564784053
[2024-06-14 14:24:54,669 INFO  L175             Difference]: Start difference. First operand has 65 places, 65 transitions, 402 flow. Second operand 7 states and 143 transitions.
[2024-06-14 14:24:54,669 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 98 transitions, 742 flow
[2024-06-14 14:24:54,674 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 98 transitions, 702 flow, removed 12 selfloop flow, removed 3 redundant places.
[2024-06-14 14:24:54,675 INFO  L231             Difference]: Finished difference. Result has 69 places, 71 transitions, 474 flow
[2024-06-14 14:24:54,675 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=362, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=474, PETRI_PLACES=69, PETRI_TRANSITIONS=71}
[2024-06-14 14:24:54,676 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 25 predicate places.
[2024-06-14 14:24:54,676 INFO  L495      AbstractCegarLoop]: Abstraction has has 69 places, 71 transitions, 474 flow
[2024-06-14 14:24:54,676 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:24:54,676 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:24:54,676 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:24:54,676 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-06-14 14:24:54,676 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-14 14:24:54,677 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:24:54,677 INFO  L85        PathProgramCache]: Analyzing trace with hash 277085658, now seen corresponding path program 2 times
[2024-06-14 14:24:54,677 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:24:54,677 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578446854]
[2024-06-14 14:24:54,677 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:24:54,677 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:24:54,705 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:25:05,756 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-14 14:25:05,757 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:25:05,757 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578446854]
[2024-06-14 14:25:05,757 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578446854] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:25:05,757 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:25:05,757 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 14:25:05,757 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327880981]
[2024-06-14 14:25:05,757 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:25:05,757 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 14:25:05,758 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:25:05,760 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 14:25:05,760 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56
[2024-06-14 14:25:05,888 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43
[2024-06-14 14:25:05,888 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 71 transitions, 474 flow. Second operand  has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:25:05,888 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:25:05,888 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43
[2024-06-14 14:25:05,897 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:25:07,194 INFO  L124   PetriNetUnfolderBase]: 1602/2444 cut-off events.
[2024-06-14 14:25:07,195 INFO  L125   PetriNetUnfolderBase]: For 16688/16692 co-relation queries the response was YES.
[2024-06-14 14:25:07,199 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 10256 conditions, 2444 events. 1602/2444 cut-off events. For 16688/16692 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 11910 event pairs, 580 based on Foata normal form. 8/2451 useless extension candidates. Maximal degree in co-relation 10228. Up to 2252 conditions per place. 
[2024-06-14 14:25:07,220 INFO  L140   encePairwiseOnDemand]: 33/43 looper letters, 65 selfloop transitions, 27 changer transitions 0/97 dead transitions.
[2024-06-14 14:25:07,220 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 97 transitions, 786 flow
[2024-06-14 14:25:07,220 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 14:25:07,220 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 14:25:07,221 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 138 transitions.
[2024-06-14 14:25:07,221 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4584717607973422
[2024-06-14 14:25:07,221 INFO  L175             Difference]: Start difference. First operand has 69 places, 71 transitions, 474 flow. Second operand 7 states and 138 transitions.
[2024-06-14 14:25:07,221 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 97 transitions, 786 flow
[2024-06-14 14:25:07,228 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 97 transitions, 752 flow, removed 10 selfloop flow, removed 3 redundant places.
[2024-06-14 14:25:07,229 INFO  L231             Difference]: Finished difference. Result has 73 places, 74 transitions, 534 flow
[2024-06-14 14:25:07,230 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=440, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=534, PETRI_PLACES=73, PETRI_TRANSITIONS=74}
[2024-06-14 14:25:07,230 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 29 predicate places.
[2024-06-14 14:25:07,230 INFO  L495      AbstractCegarLoop]: Abstraction has has 73 places, 74 transitions, 534 flow
[2024-06-14 14:25:07,230 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:25:07,230 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:25:07,230 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:25:07,231 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-06-14 14:25:07,231 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-14 14:25:07,231 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:25:07,231 INFO  L85        PathProgramCache]: Analyzing trace with hash -1799884636, now seen corresponding path program 3 times
[2024-06-14 14:25:07,231 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:25:07,231 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489512464]
[2024-06-14 14:25:07,231 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:25:07,232 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:25:07,256 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:25:18,209 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:25:18,210 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:25:18,210 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489512464]
[2024-06-14 14:25:18,210 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489512464] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:25:18,210 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:25:18,210 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 14:25:18,210 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190542782]
[2024-06-14 14:25:18,210 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:25:18,211 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 14:25:18,211 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:25:18,212 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 14:25:18,212 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2024-06-14 14:25:18,370 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43
[2024-06-14 14:25:18,370 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 74 transitions, 534 flow. Second operand  has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:25:18,370 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:25:18,370 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43
[2024-06-14 14:25:18,370 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:25:19,711 INFO  L124   PetriNetUnfolderBase]: 1597/2435 cut-off events.
[2024-06-14 14:25:19,712 INFO  L125   PetriNetUnfolderBase]: For 18783/18783 co-relation queries the response was YES.
[2024-06-14 14:25:19,716 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 10524 conditions, 2435 events. 1597/2435 cut-off events. For 18783/18783 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 11823 event pairs, 614 based on Foata normal form. 2/2436 useless extension candidates. Maximal degree in co-relation 10494. Up to 2286 conditions per place. 
[2024-06-14 14:25:19,723 INFO  L140   encePairwiseOnDemand]: 33/43 looper letters, 72 selfloop transitions, 27 changer transitions 0/104 dead transitions.
[2024-06-14 14:25:19,723 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 104 transitions, 808 flow
[2024-06-14 14:25:19,723 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 14:25:19,723 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 14:25:19,724 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 170 transitions.
[2024-06-14 14:25:19,724 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4392764857881137
[2024-06-14 14:25:19,724 INFO  L175             Difference]: Start difference. First operand has 73 places, 74 transitions, 534 flow. Second operand 9 states and 170 transitions.
[2024-06-14 14:25:19,724 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 104 transitions, 808 flow
[2024-06-14 14:25:19,735 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 104 transitions, 728 flow, removed 21 selfloop flow, removed 4 redundant places.
[2024-06-14 14:25:19,736 INFO  L231             Difference]: Finished difference. Result has 78 places, 74 transitions, 516 flow
[2024-06-14 14:25:19,737 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=454, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=516, PETRI_PLACES=78, PETRI_TRANSITIONS=74}
[2024-06-14 14:25:19,737 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 34 predicate places.
[2024-06-14 14:25:19,737 INFO  L495      AbstractCegarLoop]: Abstraction has has 78 places, 74 transitions, 516 flow
[2024-06-14 14:25:19,737 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:25:19,737 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:25:19,737 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:25:19,738 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-06-14 14:25:19,738 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-14 14:25:19,738 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:25:19,738 INFO  L85        PathProgramCache]: Analyzing trace with hash -1799884450, now seen corresponding path program 3 times
[2024-06-14 14:25:19,738 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:25:19,738 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638952216]
[2024-06-14 14:25:19,738 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:25:19,739 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:25:19,763 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:25:30,800 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-14 14:25:30,800 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:25:30,801 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638952216]
[2024-06-14 14:25:30,801 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638952216] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:25:30,801 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:25:30,801 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 14:25:30,801 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550838208]
[2024-06-14 14:25:30,801 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:25:30,801 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 14:25:30,802 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:25:30,802 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 14:25:30,802 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56
[2024-06-14 14:25:30,940 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43
[2024-06-14 14:25:30,941 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 74 transitions, 516 flow. Second operand  has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:25:30,941 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:25:30,941 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43
[2024-06-14 14:25:30,941 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:25:32,127 INFO  L124   PetriNetUnfolderBase]: 1587/2423 cut-off events.
[2024-06-14 14:25:32,128 INFO  L125   PetriNetUnfolderBase]: For 21065/21069 co-relation queries the response was YES.
[2024-06-14 14:25:32,132 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 10555 conditions, 2423 events. 1587/2423 cut-off events. For 21065/21069 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 11814 event pairs, 578 based on Foata normal form. 8/2430 useless extension candidates. Maximal degree in co-relation 10524. Up to 2237 conditions per place. 
[2024-06-14 14:25:32,139 INFO  L140   encePairwiseOnDemand]: 33/43 looper letters, 65 selfloop transitions, 26 changer transitions 0/96 dead transitions.
[2024-06-14 14:25:32,139 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 96 transitions, 752 flow
[2024-06-14 14:25:32,140 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 14:25:32,140 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 14:25:32,140 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 138 transitions.
[2024-06-14 14:25:32,141 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4584717607973422
[2024-06-14 14:25:32,141 INFO  L175             Difference]: Start difference. First operand has 78 places, 74 transitions, 516 flow. Second operand 7 states and 138 transitions.
[2024-06-14 14:25:32,141 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 96 transitions, 752 flow
[2024-06-14 14:25:32,150 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 96 transitions, 668 flow, removed 11 selfloop flow, removed 8 redundant places.
[2024-06-14 14:25:32,151 INFO  L231             Difference]: Finished difference. Result has 77 places, 74 transitions, 492 flow
[2024-06-14 14:25:32,151 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=432, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=492, PETRI_PLACES=77, PETRI_TRANSITIONS=74}
[2024-06-14 14:25:32,152 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 33 predicate places.
[2024-06-14 14:25:32,152 INFO  L495      AbstractCegarLoop]: Abstraction has has 77 places, 74 transitions, 492 flow
[2024-06-14 14:25:32,152 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:25:32,152 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:25:32,152 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:25:32,153 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2024-06-14 14:25:32,153 INFO  L420      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:25:32,153 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:25:32,153 INFO  L85        PathProgramCache]: Analyzing trace with hash 1510036908, now seen corresponding path program 1 times
[2024-06-14 14:25:32,153 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:25:32,153 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112517479]
[2024-06-14 14:25:32,153 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:25:32,154 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:25:32,207 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:25:44,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-14 14:25:44,423 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:25:44,423 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112517479]
[2024-06-14 14:25:44,423 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112517479] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:25:44,423 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:25:44,423 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-06-14 14:25:44,423 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666612594]
[2024-06-14 14:25:44,423 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:25:44,423 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-06-14 14:25:44,423 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:25:44,424 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-06-14 14:25:44,424 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2024-06-14 14:25:44,536 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 43
[2024-06-14 14:25:44,536 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 74 transitions, 492 flow. Second operand  has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:25:44,536 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:25:44,536 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 43
[2024-06-14 14:25:44,536 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:25:45,420 INFO  L124   PetriNetUnfolderBase]: 1183/2002 cut-off events.
[2024-06-14 14:25:45,420 INFO  L125   PetriNetUnfolderBase]: For 18881/18881 co-relation queries the response was YES.
[2024-06-14 14:25:45,425 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 8598 conditions, 2002 events. 1183/2002 cut-off events. For 18881/18881 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 10834 event pairs, 488 based on Foata normal form. 1/2002 useless extension candidates. Maximal degree in co-relation 8566. Up to 1736 conditions per place. 
[2024-06-14 14:25:45,432 INFO  L140   encePairwiseOnDemand]: 36/43 looper letters, 57 selfloop transitions, 8 changer transitions 0/85 dead transitions.
[2024-06-14 14:25:45,432 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 85 transitions, 660 flow
[2024-06-14 14:25:45,433 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-14 14:25:45,433 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-14 14:25:45,433 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 105 transitions.
[2024-06-14 14:25:45,433 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4883720930232558
[2024-06-14 14:25:45,433 INFO  L175             Difference]: Start difference. First operand has 77 places, 74 transitions, 492 flow. Second operand 5 states and 105 transitions.
[2024-06-14 14:25:45,434 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 85 transitions, 660 flow
[2024-06-14 14:25:45,443 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 85 transitions, 586 flow, removed 0 selfloop flow, removed 7 redundant places.
[2024-06-14 14:25:45,444 INFO  L231             Difference]: Finished difference. Result has 75 places, 77 transitions, 464 flow
[2024-06-14 14:25:45,444 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=418, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=464, PETRI_PLACES=75, PETRI_TRANSITIONS=77}
[2024-06-14 14:25:45,445 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 31 predicate places.
[2024-06-14 14:25:45,445 INFO  L495      AbstractCegarLoop]: Abstraction has has 75 places, 77 transitions, 464 flow
[2024-06-14 14:25:45,445 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:25:45,445 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:25:45,445 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:25:45,446 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2024-06-14 14:25:45,446 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-14 14:25:45,446 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:25:45,446 INFO  L85        PathProgramCache]: Analyzing trace with hash -1728913158, now seen corresponding path program 1 times
[2024-06-14 14:25:45,446 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:25:45,446 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700678954]
[2024-06-14 14:25:45,446 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:25:45,447 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:25:45,475 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:25:58,043 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:25:58,043 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:25:58,043 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700678954]
[2024-06-14 14:25:58,043 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700678954] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:25:58,044 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:25:58,044 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 14:25:58,044 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431138766]
[2024-06-14 14:25:58,044 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:25:58,044 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 14:25:58,044 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:25:58,045 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 14:25:58,045 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-14 14:25:58,247 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43
[2024-06-14 14:25:58,247 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 77 transitions, 464 flow. Second operand  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:25:58,248 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:25:58,248 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43
[2024-06-14 14:25:58,248 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:25:59,582 INFO  L124   PetriNetUnfolderBase]: 1606/2452 cut-off events.
[2024-06-14 14:25:59,582 INFO  L125   PetriNetUnfolderBase]: For 26147/26147 co-relation queries the response was YES.
[2024-06-14 14:25:59,587 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 11239 conditions, 2452 events. 1606/2452 cut-off events. For 26147/26147 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 11941 event pairs, 599 based on Foata normal form. 4/2455 useless extension candidates. Maximal degree in co-relation 11206. Up to 2327 conditions per place. 
[2024-06-14 14:25:59,593 INFO  L140   encePairwiseOnDemand]: 32/43 looper letters, 88 selfloop transitions, 17 changer transitions 0/110 dead transitions.
[2024-06-14 14:25:59,593 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 110 transitions, 784 flow
[2024-06-14 14:25:59,595 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 14:25:59,595 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 14:25:59,596 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 155 transitions.
[2024-06-14 14:25:59,596 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45058139534883723
[2024-06-14 14:25:59,596 INFO  L175             Difference]: Start difference. First operand has 75 places, 77 transitions, 464 flow. Second operand 8 states and 155 transitions.
[2024-06-14 14:25:59,596 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 110 transitions, 784 flow
[2024-06-14 14:25:59,605 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 110 transitions, 760 flow, removed 6 selfloop flow, removed 3 redundant places.
[2024-06-14 14:25:59,606 INFO  L231             Difference]: Finished difference. Result has 80 places, 80 transitions, 522 flow
[2024-06-14 14:25:59,607 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=440, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=522, PETRI_PLACES=80, PETRI_TRANSITIONS=80}
[2024-06-14 14:25:59,607 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 36 predicate places.
[2024-06-14 14:25:59,607 INFO  L495      AbstractCegarLoop]: Abstraction has has 80 places, 80 transitions, 522 flow
[2024-06-14 14:25:59,607 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:25:59,608 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:25:59,608 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:25:59,608 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2024-06-14 14:25:59,608 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-14 14:25:59,608 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:25:59,608 INFO  L85        PathProgramCache]: Analyzing trace with hash -161149116, now seen corresponding path program 2 times
[2024-06-14 14:25:59,608 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:25:59,609 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456654020]
[2024-06-14 14:25:59,609 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:25:59,609 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:25:59,633 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:26:10,924 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-14 14:26:10,924 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:26:10,924 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456654020]
[2024-06-14 14:26:10,924 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456654020] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:26:10,925 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:26:10,925 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 14:26:10,925 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702310615]
[2024-06-14 14:26:10,925 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:26:10,925 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 14:26:10,925 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:26:10,926 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 14:26:10,926 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72
[2024-06-14 14:26:11,105 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43
[2024-06-14 14:26:11,106 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 80 transitions, 522 flow. Second operand  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:26:11,106 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:26:11,106 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43
[2024-06-14 14:26:11,106 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:26:12,656 INFO  L124   PetriNetUnfolderBase]: 1660/2548 cut-off events.
[2024-06-14 14:26:12,656 INFO  L125   PetriNetUnfolderBase]: For 31062/31062 co-relation queries the response was YES.
[2024-06-14 14:26:12,661 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 12292 conditions, 2548 events. 1660/2548 cut-off events. For 31062/31062 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 12546 event pairs, 542 based on Foata normal form. 4/2549 useless extension candidates. Maximal degree in co-relation 12258. Up to 2192 conditions per place. 
[2024-06-14 14:26:12,667 INFO  L140   encePairwiseOnDemand]: 32/43 looper letters, 76 selfloop transitions, 43 changer transitions 0/124 dead transitions.
[2024-06-14 14:26:12,668 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 124 transitions, 1080 flow
[2024-06-14 14:26:12,670 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 14:26:12,670 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 14:26:12,670 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 168 transitions.
[2024-06-14 14:26:12,671 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4883720930232558
[2024-06-14 14:26:12,671 INFO  L175             Difference]: Start difference. First operand has 80 places, 80 transitions, 522 flow. Second operand 8 states and 168 transitions.
[2024-06-14 14:26:12,671 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 124 transitions, 1080 flow
[2024-06-14 14:26:12,678 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 124 transitions, 1022 flow, removed 14 selfloop flow, removed 6 redundant places.
[2024-06-14 14:26:12,680 INFO  L231             Difference]: Finished difference. Result has 82 places, 89 transitions, 684 flow
[2024-06-14 14:26:12,680 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=464, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=684, PETRI_PLACES=82, PETRI_TRANSITIONS=89}
[2024-06-14 14:26:12,680 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 38 predicate places.
[2024-06-14 14:26:12,680 INFO  L495      AbstractCegarLoop]: Abstraction has has 82 places, 89 transitions, 684 flow
[2024-06-14 14:26:12,680 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:26:12,680 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:26:12,681 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:26:12,681 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2024-06-14 14:26:12,681 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-14 14:26:12,681 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:26:12,681 INFO  L85        PathProgramCache]: Analyzing trace with hash -1924085692, now seen corresponding path program 3 times
[2024-06-14 14:26:12,681 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:26:12,681 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471713957]
[2024-06-14 14:26:12,682 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:26:12,682 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:26:12,706 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:26:25,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-14 14:26:25,706 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:26:25,707 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471713957]
[2024-06-14 14:26:25,707 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471713957] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:26:25,707 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:26:25,715 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 14:26:25,715 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776077473]
[2024-06-14 14:26:25,715 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:26:25,716 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 14:26:25,717 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:26:25,717 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 14:26:25,717 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72
[2024-06-14 14:26:25,875 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43
[2024-06-14 14:26:25,876 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 89 transitions, 684 flow. Second operand  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:26:25,876 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:26:25,876 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43
[2024-06-14 14:26:25,876 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:26:27,365 INFO  L124   PetriNetUnfolderBase]: 1650/2534 cut-off events.
[2024-06-14 14:26:27,366 INFO  L125   PetriNetUnfolderBase]: For 35442/35442 co-relation queries the response was YES.
[2024-06-14 14:26:27,372 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 12740 conditions, 2534 events. 1650/2534 cut-off events. For 35442/35442 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 12527 event pairs, 542 based on Foata normal form. 4/2535 useless extension candidates. Maximal degree in co-relation 12705. Up to 2184 conditions per place. 
[2024-06-14 14:26:27,380 INFO  L140   encePairwiseOnDemand]: 32/43 looper letters, 72 selfloop transitions, 44 changer transitions 0/121 dead transitions.
[2024-06-14 14:26:27,380 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 121 transitions, 1056 flow
[2024-06-14 14:26:27,382 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 14:26:27,382 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 14:26:27,382 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 164 transitions.
[2024-06-14 14:26:27,383 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.47674418604651164
[2024-06-14 14:26:27,383 INFO  L175             Difference]: Start difference. First operand has 82 places, 89 transitions, 684 flow. Second operand 8 states and 164 transitions.
[2024-06-14 14:26:27,383 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 121 transitions, 1056 flow
[2024-06-14 14:26:27,400 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 121 transitions, 970 flow, removed 32 selfloop flow, removed 3 redundant places.
[2024-06-14 14:26:27,401 INFO  L231             Difference]: Finished difference. Result has 87 places, 89 transitions, 694 flow
[2024-06-14 14:26:27,402 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=598, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=694, PETRI_PLACES=87, PETRI_TRANSITIONS=89}
[2024-06-14 14:26:27,402 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 43 predicate places.
[2024-06-14 14:26:27,402 INFO  L495      AbstractCegarLoop]: Abstraction has has 87 places, 89 transitions, 694 flow
[2024-06-14 14:26:27,402 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:26:27,402 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:26:27,402 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:26:27,403 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2024-06-14 14:26:27,403 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-14 14:26:27,403 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:26:27,403 INFO  L85        PathProgramCache]: Analyzing trace with hash -7635068, now seen corresponding path program 4 times
[2024-06-14 14:26:27,403 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:26:27,403 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689251133]
[2024-06-14 14:26:27,403 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:26:27,404 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:26:27,428 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:26:42,416 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:26:42,416 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:26:42,416 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689251133]
[2024-06-14 14:26:42,417 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689251133] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:26:42,417 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:26:42,417 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 14:26:42,417 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973120203]
[2024-06-14 14:26:42,417 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:26:42,417 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 14:26:42,418 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:26:42,418 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 14:26:42,418 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72
[2024-06-14 14:26:42,604 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43
[2024-06-14 14:26:42,605 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 89 transitions, 694 flow. Second operand  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:26:42,605 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:26:42,605 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43
[2024-06-14 14:26:42,605 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:26:44,067 INFO  L124   PetriNetUnfolderBase]: 1672/2574 cut-off events.
[2024-06-14 14:26:44,067 INFO  L125   PetriNetUnfolderBase]: For 39198/39200 co-relation queries the response was YES.
[2024-06-14 14:26:44,074 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 13218 conditions, 2574 events. 1672/2574 cut-off events. For 39198/39200 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 12841 event pairs, 547 based on Foata normal form. 4/2576 useless extension candidates. Maximal degree in co-relation 13181. Up to 2203 conditions per place. 
[2024-06-14 14:26:44,083 INFO  L140   encePairwiseOnDemand]: 32/43 looper letters, 69 selfloop transitions, 47 changer transitions 0/121 dead transitions.
[2024-06-14 14:26:44,084 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 121 transitions, 1114 flow
[2024-06-14 14:26:44,086 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 14:26:44,086 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 14:26:44,087 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 161 transitions.
[2024-06-14 14:26:44,087 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4680232558139535
[2024-06-14 14:26:44,087 INFO  L175             Difference]: Start difference. First operand has 87 places, 89 transitions, 694 flow. Second operand 8 states and 161 transitions.
[2024-06-14 14:26:44,087 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 121 transitions, 1114 flow
[2024-06-14 14:26:44,101 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 121 transitions, 1033 flow, removed 2 selfloop flow, removed 6 redundant places.
[2024-06-14 14:26:44,105 INFO  L231             Difference]: Finished difference. Result has 89 places, 92 transitions, 767 flow
[2024-06-14 14:26:44,106 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=616, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=767, PETRI_PLACES=89, PETRI_TRANSITIONS=92}
[2024-06-14 14:26:44,106 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 45 predicate places.
[2024-06-14 14:26:44,106 INFO  L495      AbstractCegarLoop]: Abstraction has has 89 places, 92 transitions, 767 flow
[2024-06-14 14:26:44,107 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:26:44,107 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:26:44,107 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:26:44,107 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2024-06-14 14:26:44,108 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-14 14:26:44,108 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:26:44,108 INFO  L85        PathProgramCache]: Analyzing trace with hash -1584671088, now seen corresponding path program 5 times
[2024-06-14 14:26:44,108 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:26:44,108 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307385554]
[2024-06-14 14:26:44,108 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:26:44,108 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:26:44,158 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:26:56,457 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-14 14:26:56,457 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:26:56,457 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307385554]
[2024-06-14 14:26:56,457 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307385554] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:26:56,457 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:26:56,458 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 14:26:56,458 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660904594]
[2024-06-14 14:26:56,458 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:26:56,458 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 14:26:56,458 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:26:56,459 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 14:26:56,459 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72
[2024-06-14 14:26:56,619 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43
[2024-06-14 14:26:56,620 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 92 transitions, 767 flow. Second operand  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:26:56,620 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:26:56,620 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43
[2024-06-14 14:26:56,620 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:26:58,006 INFO  L124   PetriNetUnfolderBase]: 1694/2616 cut-off events.
[2024-06-14 14:26:58,007 INFO  L125   PetriNetUnfolderBase]: For 43799/43801 co-relation queries the response was YES.
[2024-06-14 14:26:58,014 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 13670 conditions, 2616 events. 1694/2616 cut-off events. For 43799/43801 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 13115 event pairs, 554 based on Foata normal form. 4/2618 useless extension candidates. Maximal degree in co-relation 13632. Up to 2222 conditions per place. 
[2024-06-14 14:26:58,023 INFO  L140   encePairwiseOnDemand]: 32/43 looper letters, 66 selfloop transitions, 52 changer transitions 0/123 dead transitions.
[2024-06-14 14:26:58,024 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 123 transitions, 1196 flow
[2024-06-14 14:26:58,026 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 14:26:58,026 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 14:26:58,026 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 159 transitions.
[2024-06-14 14:26:58,026 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4622093023255814
[2024-06-14 14:26:58,026 INFO  L175             Difference]: Start difference. First operand has 89 places, 92 transitions, 767 flow. Second operand 8 states and 159 transitions.
[2024-06-14 14:26:58,027 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 123 transitions, 1196 flow
[2024-06-14 14:26:58,048 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 123 transitions, 1018 flow, removed 23 selfloop flow, removed 7 redundant places.
[2024-06-14 14:26:58,049 INFO  L231             Difference]: Finished difference. Result has 90 places, 95 transitions, 756 flow
[2024-06-14 14:26:58,050 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=604, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=756, PETRI_PLACES=90, PETRI_TRANSITIONS=95}
[2024-06-14 14:26:58,050 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 46 predicate places.
[2024-06-14 14:26:58,050 INFO  L495      AbstractCegarLoop]: Abstraction has has 90 places, 95 transitions, 756 flow
[2024-06-14 14:26:58,050 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:26:58,050 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:26:58,051 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:26:58,051 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2024-06-14 14:26:58,051 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-14 14:26:58,051 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:26:58,051 INFO  L85        PathProgramCache]: Analyzing trace with hash 38158254, now seen corresponding path program 6 times
[2024-06-14 14:26:58,051 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:26:58,051 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471092274]
[2024-06-14 14:26:58,052 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:26:58,052 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:26:58,076 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:27:10,017 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-14 14:27:10,018 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:27:10,018 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471092274]
[2024-06-14 14:27:10,018 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471092274] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:27:10,018 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:27:10,018 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 14:27:10,018 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177657428]
[2024-06-14 14:27:10,018 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:27:10,018 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 14:27:10,018 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:27:10,019 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 14:27:10,019 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72
[2024-06-14 14:27:10,167 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43
[2024-06-14 14:27:10,168 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 95 transitions, 756 flow. Second operand  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:27:10,168 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:27:10,168 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43
[2024-06-14 14:27:10,168 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:27:11,539 INFO  L124   PetriNetUnfolderBase]: 1684/2602 cut-off events.
[2024-06-14 14:27:11,540 INFO  L125   PetriNetUnfolderBase]: For 45720/45722 co-relation queries the response was YES.
[2024-06-14 14:27:11,546 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 13613 conditions, 2602 events. 1684/2602 cut-off events. For 45720/45722 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 12948 event pairs, 547 based on Foata normal form. 4/2604 useless extension candidates. Maximal degree in co-relation 13574. Up to 2214 conditions per place. 
[2024-06-14 14:27:11,554 INFO  L140   encePairwiseOnDemand]: 32/43 looper letters, 68 selfloop transitions, 49 changer transitions 0/122 dead transitions.
[2024-06-14 14:27:11,554 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 122 transitions, 1056 flow
[2024-06-14 14:27:11,555 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 14:27:11,555 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 14:27:11,556 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 160 transitions.
[2024-06-14 14:27:11,556 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46511627906976744
[2024-06-14 14:27:11,556 INFO  L175             Difference]: Start difference. First operand has 90 places, 95 transitions, 756 flow. Second operand 8 states and 160 transitions.
[2024-06-14 14:27:11,556 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 122 transitions, 1056 flow
[2024-06-14 14:27:11,577 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 122 transitions, 928 flow, removed 28 selfloop flow, removed 5 redundant places.
[2024-06-14 14:27:11,580 INFO  L231             Difference]: Finished difference. Result has 93 places, 95 transitions, 734 flow
[2024-06-14 14:27:11,580 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=628, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=734, PETRI_PLACES=93, PETRI_TRANSITIONS=95}
[2024-06-14 14:27:11,587 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 49 predicate places.
[2024-06-14 14:27:11,587 INFO  L495      AbstractCegarLoop]: Abstraction has has 93 places, 95 transitions, 734 flow
[2024-06-14 14:27:11,587 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:27:11,587 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:27:11,587 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:27:11,588 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2024-06-14 14:27:11,588 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-14 14:27:11,588 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:27:11,588 INFO  L85        PathProgramCache]: Analyzing trace with hash 45786951, now seen corresponding path program 1 times
[2024-06-14 14:27:11,588 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:27:11,589 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588315621]
[2024-06-14 14:27:11,589 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:27:11,589 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:27:11,659 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:27:22,236 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-14 14:27:22,237 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:27:22,237 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588315621]
[2024-06-14 14:27:22,237 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588315621] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:27:22,237 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:27:22,237 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 14:27:22,237 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190863366]
[2024-06-14 14:27:22,238 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:27:22,238 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 14:27:22,238 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:27:22,239 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 14:27:22,239 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-14 14:27:22,426 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43
[2024-06-14 14:27:22,427 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 95 transitions, 734 flow. Second operand  has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:27:22,427 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:27:22,427 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43
[2024-06-14 14:27:22,427 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:27:23,693 INFO  L124   PetriNetUnfolderBase]: 1469/2364 cut-off events.
[2024-06-14 14:27:23,693 INFO  L125   PetriNetUnfolderBase]: For 41318/41318 co-relation queries the response was YES.
[2024-06-14 14:27:23,699 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 12064 conditions, 2364 events. 1469/2364 cut-off events. For 41318/41318 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 12165 event pairs, 468 based on Foata normal form. 4/2367 useless extension candidates. Maximal degree in co-relation 12024. Up to 2144 conditions per place. 
[2024-06-14 14:27:23,706 INFO  L140   encePairwiseOnDemand]: 33/43 looper letters, 102 selfloop transitions, 16 changer transitions 0/124 dead transitions.
[2024-06-14 14:27:23,706 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 124 transitions, 1084 flow
[2024-06-14 14:27:23,708 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 14:27:23,708 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 14:27:23,709 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 155 transitions.
[2024-06-14 14:27:23,709 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45058139534883723
[2024-06-14 14:27:23,709 INFO  L175             Difference]: Start difference. First operand has 93 places, 95 transitions, 734 flow. Second operand 8 states and 155 transitions.
[2024-06-14 14:27:23,709 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 124 transitions, 1084 flow
[2024-06-14 14:27:23,730 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 124 transitions, 944 flow, removed 0 selfloop flow, removed 8 redundant places.
[2024-06-14 14:27:23,731 INFO  L231             Difference]: Finished difference. Result has 94 places, 100 transitions, 697 flow
[2024-06-14 14:27:23,732 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=600, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=697, PETRI_PLACES=94, PETRI_TRANSITIONS=100}
[2024-06-14 14:27:23,732 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 50 predicate places.
[2024-06-14 14:27:23,732 INFO  L495      AbstractCegarLoop]: Abstraction has has 94 places, 100 transitions, 697 flow
[2024-06-14 14:27:23,732 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:27:23,732 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:27:23,733 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:27:23,733 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2024-06-14 14:27:23,733 INFO  L420      AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:27:23,733 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:27:23,733 INFO  L85        PathProgramCache]: Analyzing trace with hash -433494889, now seen corresponding path program 1 times
[2024-06-14 14:27:23,733 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:27:23,733 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922087958]
[2024-06-14 14:27:23,734 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:27:23,734 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:27:23,801 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:27:37,487 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-14 14:27:37,487 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:27:37,487 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922087958]
[2024-06-14 14:27:37,487 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922087958] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:27:37,487 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:27:37,487 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-14 14:27:37,488 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349908289]
[2024-06-14 14:27:37,488 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:27:37,488 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-14 14:27:37,488 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:27:37,488 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-14 14:27:37,488 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2024-06-14 14:27:37,616 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 43
[2024-06-14 14:27:37,616 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 100 transitions, 697 flow. Second operand  has 7 states, 7 states have (on average 15.0) internal successors, (105), 7 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:27:37,616 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:27:37,616 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 43
[2024-06-14 14:27:37,617 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:27:38,643 INFO  L124   PetriNetUnfolderBase]: 1236/2105 cut-off events.
[2024-06-14 14:27:38,644 INFO  L125   PetriNetUnfolderBase]: For 43381/43383 co-relation queries the response was YES.
[2024-06-14 14:27:38,650 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 11174 conditions, 2105 events. 1236/2105 cut-off events. For 43381/43383 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 11522 event pairs, 443 based on Foata normal form. 3/2088 useless extension candidates. Maximal degree in co-relation 11132. Up to 1817 conditions per place. 
[2024-06-14 14:27:38,655 INFO  L140   encePairwiseOnDemand]: 35/43 looper letters, 81 selfloop transitions, 11 changer transitions 0/112 dead transitions.
[2024-06-14 14:27:38,655 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 112 transitions, 927 flow
[2024-06-14 14:27:38,656 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-14 14:27:38,656 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-14 14:27:38,656 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 122 transitions.
[2024-06-14 14:27:38,656 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4728682170542636
[2024-06-14 14:27:38,656 INFO  L175             Difference]: Start difference. First operand has 94 places, 100 transitions, 697 flow. Second operand 6 states and 122 transitions.
[2024-06-14 14:27:38,657 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 112 transitions, 927 flow
[2024-06-14 14:27:38,672 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 112 transitions, 870 flow, removed 15 selfloop flow, removed 5 redundant places.
[2024-06-14 14:27:38,674 INFO  L231             Difference]: Finished difference. Result has 95 places, 103 transitions, 698 flow
[2024-06-14 14:27:38,674 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=640, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=698, PETRI_PLACES=95, PETRI_TRANSITIONS=103}
[2024-06-14 14:27:38,674 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 51 predicate places.
[2024-06-14 14:27:38,674 INFO  L495      AbstractCegarLoop]: Abstraction has has 95 places, 103 transitions, 698 flow
[2024-06-14 14:27:38,674 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 15.0) internal successors, (105), 7 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:27:38,674 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:27:38,675 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:27:38,675 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2024-06-14 14:27:38,675 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-14 14:27:38,675 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:27:38,675 INFO  L85        PathProgramCache]: Analyzing trace with hash -1655084799, now seen corresponding path program 1 times
[2024-06-14 14:27:38,675 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:27:38,675 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682403010]
[2024-06-14 14:27:38,676 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:27:38,676 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:27:38,700 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:27:51,806 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-14 14:27:51,806 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:27:51,806 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682403010]
[2024-06-14 14:27:51,806 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682403010] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:27:51,806 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:27:51,806 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 14:27:51,807 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986749641]
[2024-06-14 14:27:51,807 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:27:51,809 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 14:27:51,809 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:27:51,809 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 14:27:51,809 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-14 14:27:51,997 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43
[2024-06-14 14:27:51,998 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 103 transitions, 698 flow. Second operand  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:27:51,998 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:27:51,998 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43
[2024-06-14 14:27:51,998 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:27:53,559 INFO  L124   PetriNetUnfolderBase]: 1712/2650 cut-off events.
[2024-06-14 14:27:53,559 INFO  L125   PetriNetUnfolderBase]: For 57687/57687 co-relation queries the response was YES.
[2024-06-14 14:27:53,567 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 14602 conditions, 2650 events. 1712/2650 cut-off events. For 57687/57687 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 13248 event pairs, 392 based on Foata normal form. 4/2653 useless extension candidates. Maximal degree in co-relation 14559. Up to 2428 conditions per place. 
[2024-06-14 14:27:53,577 INFO  L140   encePairwiseOnDemand]: 33/43 looper letters, 119 selfloop transitions, 20 changer transitions 0/144 dead transitions.
[2024-06-14 14:27:53,577 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 144 transitions, 1224 flow
[2024-06-14 14:27:53,591 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 14:27:53,591 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 14:27:53,591 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 174 transitions.
[2024-06-14 14:27:53,592 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4496124031007752
[2024-06-14 14:27:53,592 INFO  L175             Difference]: Start difference. First operand has 95 places, 103 transitions, 698 flow. Second operand 9 states and 174 transitions.
[2024-06-14 14:27:53,592 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 144 transitions, 1224 flow
[2024-06-14 14:27:53,619 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 144 transitions, 1188 flow, removed 9 selfloop flow, removed 4 redundant places.
[2024-06-14 14:27:53,621 INFO  L231             Difference]: Finished difference. Result has 100 places, 107 transitions, 785 flow
[2024-06-14 14:27:53,621 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=662, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=785, PETRI_PLACES=100, PETRI_TRANSITIONS=107}
[2024-06-14 14:27:53,622 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 56 predicate places.
[2024-06-14 14:27:53,622 INFO  L495      AbstractCegarLoop]: Abstraction has has 100 places, 107 transitions, 785 flow
[2024-06-14 14:27:53,622 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:27:53,622 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:27:53,622 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:27:53,622 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2024-06-14 14:27:53,623 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-14 14:27:53,623 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:27:53,623 INFO  L85        PathProgramCache]: Analyzing trace with hash -1652227839, now seen corresponding path program 2 times
[2024-06-14 14:27:53,623 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:27:53,623 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039751386]
[2024-06-14 14:27:53,623 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:27:53,623 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:27:53,648 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:28:06,676 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-14 14:28:06,676 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:28:06,677 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039751386]
[2024-06-14 14:28:06,677 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039751386] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:28:06,677 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:28:06,677 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 14:28:06,677 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253452320]
[2024-06-14 14:28:06,677 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:28:06,677 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 14:28:06,678 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:28:06,678 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 14:28:06,678 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-14 14:28:06,812 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43
[2024-06-14 14:28:06,812 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 107 transitions, 785 flow. Second operand  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:28:06,812 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:28:06,812 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43
[2024-06-14 14:28:06,812 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:28:08,243 INFO  L124   PetriNetUnfolderBase]: 1704/2638 cut-off events.
[2024-06-14 14:28:08,244 INFO  L125   PetriNetUnfolderBase]: For 62068/62068 co-relation queries the response was YES.
[2024-06-14 14:28:08,250 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 14854 conditions, 2638 events. 1704/2638 cut-off events. For 62068/62068 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 13197 event pairs, 531 based on Foata normal form. 4/2641 useless extension candidates. Maximal degree in co-relation 14810. Up to 2475 conditions per place. 
[2024-06-14 14:28:08,257 INFO  L140   encePairwiseOnDemand]: 33/43 looper letters, 116 selfloop transitions, 16 changer transitions 0/137 dead transitions.
[2024-06-14 14:28:08,257 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 137 transitions, 1125 flow
[2024-06-14 14:28:08,259 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 14:28:08,259 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 14:28:08,259 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 154 transitions.
[2024-06-14 14:28:08,260 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4476744186046512
[2024-06-14 14:28:08,260 INFO  L175             Difference]: Start difference. First operand has 100 places, 107 transitions, 785 flow. Second operand 8 states and 154 transitions.
[2024-06-14 14:28:08,260 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 137 transitions, 1125 flow
[2024-06-14 14:28:08,287 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 137 transitions, 1045 flow, removed 31 selfloop flow, removed 5 redundant places.
[2024-06-14 14:28:08,288 INFO  L231             Difference]: Finished difference. Result has 103 places, 107 transitions, 744 flow
[2024-06-14 14:28:08,288 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=705, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=744, PETRI_PLACES=103, PETRI_TRANSITIONS=107}
[2024-06-14 14:28:08,289 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 59 predicate places.
[2024-06-14 14:28:08,289 INFO  L495      AbstractCegarLoop]: Abstraction has has 103 places, 107 transitions, 744 flow
[2024-06-14 14:28:08,289 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:28:08,289 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:28:08,289 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:28:08,289 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2024-06-14 14:28:08,290 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-14 14:28:08,290 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:28:08,290 INFO  L85        PathProgramCache]: Analyzing trace with hash -1536936669, now seen corresponding path program 3 times
[2024-06-14 14:28:08,290 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:28:08,290 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057837491]
[2024-06-14 14:28:08,290 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:28:08,290 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:28:08,315 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:28:20,836 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-14 14:28:20,836 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:28:20,836 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057837491]
[2024-06-14 14:28:20,837 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057837491] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:28:20,837 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:28:20,837 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 14:28:20,837 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070615470]
[2024-06-14 14:28:20,837 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:28:20,837 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 14:28:20,838 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:28:20,838 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 14:28:20,838 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-06-14 14:28:20,998 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43
[2024-06-14 14:28:20,999 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 107 transitions, 744 flow. Second operand  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:28:20,999 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:28:20,999 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43
[2024-06-14 14:28:20,999 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:28:22,277 INFO  L124   PetriNetUnfolderBase]: 1721/2666 cut-off events.
[2024-06-14 14:28:22,277 INFO  L125   PetriNetUnfolderBase]: For 67346/67348 co-relation queries the response was YES.
[2024-06-14 14:28:22,284 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 15114 conditions, 2666 events. 1721/2666 cut-off events. For 67346/67348 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 13373 event pairs, 535 based on Foata normal form. 6/2671 useless extension candidates. Maximal degree in co-relation 15068. Up to 2457 conditions per place. 
[2024-06-14 14:28:22,292 INFO  L140   encePairwiseOnDemand]: 33/43 looper letters, 103 selfloop transitions, 28 changer transitions 0/136 dead transitions.
[2024-06-14 14:28:22,292 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 136 transitions, 1114 flow
[2024-06-14 14:28:22,294 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 14:28:22,294 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 14:28:22,294 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 155 transitions.
[2024-06-14 14:28:22,294 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45058139534883723
[2024-06-14 14:28:22,295 INFO  L175             Difference]: Start difference. First operand has 103 places, 107 transitions, 744 flow. Second operand 8 states and 155 transitions.
[2024-06-14 14:28:22,295 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 136 transitions, 1114 flow
[2024-06-14 14:28:22,319 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 136 transitions, 1077 flow, removed 1 selfloop flow, removed 7 redundant places.
[2024-06-14 14:28:22,320 INFO  L231             Difference]: Finished difference. Result has 104 places, 109 transitions, 814 flow
[2024-06-14 14:28:22,321 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=707, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=814, PETRI_PLACES=104, PETRI_TRANSITIONS=109}
[2024-06-14 14:28:22,325 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 60 predicate places.
[2024-06-14 14:28:22,326 INFO  L495      AbstractCegarLoop]: Abstraction has has 104 places, 109 transitions, 814 flow
[2024-06-14 14:28:22,326 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:28:22,326 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:28:22,327 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:28:22,327 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2024-06-14 14:28:22,330 INFO  L420      AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:28:22,331 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:28:22,331 INFO  L85        PathProgramCache]: Analyzing trace with hash -1951114961, now seen corresponding path program 1 times
[2024-06-14 14:28:22,331 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:28:22,331 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458709789]
[2024-06-14 14:28:22,331 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:28:22,331 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:28:22,373 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:28:37,515 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-14 14:28:37,515 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:28:37,515 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458709789]
[2024-06-14 14:28:37,516 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458709789] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:28:37,516 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:28:37,516 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-14 14:28:37,516 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864352498]
[2024-06-14 14:28:37,516 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:28:37,518 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-14 14:28:37,518 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:28:37,518 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-14 14:28:37,518 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-06-14 14:28:37,639 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43
[2024-06-14 14:28:37,640 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 109 transitions, 814 flow. Second operand  has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:28:37,640 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:28:37,640 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43
[2024-06-14 14:28:37,640 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:28:38,647 INFO  L124   PetriNetUnfolderBase]: 1450/2369 cut-off events.
[2024-06-14 14:28:38,647 INFO  L125   PetriNetUnfolderBase]: For 70780/70788 co-relation queries the response was YES.
[2024-06-14 14:28:38,657 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 14020 conditions, 2369 events. 1450/2369 cut-off events. For 70780/70788 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 12716 event pairs, 509 based on Foata normal form. 4/2352 useless extension candidates. Maximal degree in co-relation 13973. Up to 2117 conditions per place. 
[2024-06-14 14:28:38,665 INFO  L140   encePairwiseOnDemand]: 35/43 looper letters, 92 selfloop transitions, 13 changer transitions 0/127 dead transitions.
[2024-06-14 14:28:38,666 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 127 transitions, 1090 flow
[2024-06-14 14:28:38,666 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-14 14:28:38,666 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-14 14:28:38,666 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 123 transitions.
[2024-06-14 14:28:38,667 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.47674418604651164
[2024-06-14 14:28:38,667 INFO  L175             Difference]: Start difference. First operand has 104 places, 109 transitions, 814 flow. Second operand 6 states and 123 transitions.
[2024-06-14 14:28:38,667 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 127 transitions, 1090 flow
[2024-06-14 14:28:38,702 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 127 transitions, 1001 flow, removed 18 selfloop flow, removed 6 redundant places.
[2024-06-14 14:28:38,703 INFO  L231             Difference]: Finished difference. Result has 104 places, 112 transitions, 792 flow
[2024-06-14 14:28:38,704 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=725, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=792, PETRI_PLACES=104, PETRI_TRANSITIONS=112}
[2024-06-14 14:28:38,704 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 60 predicate places.
[2024-06-14 14:28:38,704 INFO  L495      AbstractCegarLoop]: Abstraction has has 104 places, 112 transitions, 792 flow
[2024-06-14 14:28:38,704 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:28:38,704 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:28:38,704 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:28:38,705 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2024-06-14 14:28:38,705 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-14 14:28:38,720 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:28:38,720 INFO  L85        PathProgramCache]: Analyzing trace with hash 1529224891, now seen corresponding path program 4 times
[2024-06-14 14:28:38,720 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:28:38,720 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949523234]
[2024-06-14 14:28:38,720 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:28:38,721 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:28:38,752 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:28:50,901 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-14 14:28:50,902 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:28:50,902 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949523234]
[2024-06-14 14:28:50,902 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949523234] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:28:50,902 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:28:50,902 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 14:28:50,902 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194346645]
[2024-06-14 14:28:50,902 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:28:50,903 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 14:28:50,904 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:28:50,904 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 14:28:50,905 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-06-14 14:28:51,063 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43
[2024-06-14 14:28:51,064 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 112 transitions, 792 flow. Second operand  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:28:51,064 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:28:51,064 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43
[2024-06-14 14:28:51,064 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:28:52,486 INFO  L124   PetriNetUnfolderBase]: 1723/2669 cut-off events.
[2024-06-14 14:28:52,486 INFO  L125   PetriNetUnfolderBase]: For 76378/76378 co-relation queries the response was YES.
[2024-06-14 14:28:52,495 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 15732 conditions, 2669 events. 1723/2669 cut-off events. For 76378/76378 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 13386 event pairs, 528 based on Foata normal form. 4/2672 useless extension candidates. Maximal degree in co-relation 15684. Up to 2459 conditions per place. 
[2024-06-14 14:28:52,504 INFO  L140   encePairwiseOnDemand]: 33/43 looper letters, 115 selfloop transitions, 29 changer transitions 0/149 dead transitions.
[2024-06-14 14:28:52,505 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 149 transitions, 1212 flow
[2024-06-14 14:28:52,507 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-14 14:28:52,507 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 14:28:52,507 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 187 transitions.
[2024-06-14 14:28:52,508 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43488372093023253
[2024-06-14 14:28:52,508 INFO  L175             Difference]: Start difference. First operand has 104 places, 112 transitions, 792 flow. Second operand 10 states and 187 transitions.
[2024-06-14 14:28:52,508 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 149 transitions, 1212 flow
[2024-06-14 14:28:52,537 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 149 transitions, 1169 flow, removed 11 selfloop flow, removed 4 redundant places.
[2024-06-14 14:28:52,539 INFO  L231             Difference]: Finished difference. Result has 110 places, 114 transitions, 862 flow
[2024-06-14 14:28:52,539 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=749, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=862, PETRI_PLACES=110, PETRI_TRANSITIONS=114}
[2024-06-14 14:28:52,540 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 66 predicate places.
[2024-06-14 14:28:52,540 INFO  L495      AbstractCegarLoop]: Abstraction has has 110 places, 114 transitions, 862 flow
[2024-06-14 14:28:52,540 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:28:52,540 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:28:52,540 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:28:52,540 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26
[2024-06-14 14:28:52,540 INFO  L420      AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:28:52,541 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:28:52,541 INFO  L85        PathProgramCache]: Analyzing trace with hash 1935769201, now seen corresponding path program 2 times
[2024-06-14 14:28:52,541 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:28:52,541 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584074002]
[2024-06-14 14:28:52,541 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:28:52,541 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:28:52,582 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:29:04,937 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-14 14:29:04,937 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:29:04,937 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584074002]
[2024-06-14 14:29:04,938 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584074002] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:29:04,938 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:29:04,938 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-14 14:29:04,938 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983721451]
[2024-06-14 14:29:04,938 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:29:04,938 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-14 14:29:04,939 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:29:04,939 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-14 14:29:04,939 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2024-06-14 14:29:05,068 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43
[2024-06-14 14:29:05,068 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 114 transitions, 862 flow. Second operand  has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:29:05,068 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:29:05,069 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43
[2024-06-14 14:29:05,069 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:29:05,983 INFO  L124   PetriNetUnfolderBase]: 1439/2341 cut-off events.
[2024-06-14 14:29:05,983 INFO  L125   PetriNetUnfolderBase]: For 78850/78852 co-relation queries the response was YES.
[2024-06-14 14:29:05,991 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 14427 conditions, 2341 events. 1439/2341 cut-off events. For 78850/78852 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 12516 event pairs, 514 based on Foata normal form. 3/2322 useless extension candidates. Maximal degree in co-relation 14378. Up to 2099 conditions per place. 
[2024-06-14 14:29:05,998 INFO  L140   encePairwiseOnDemand]: 35/43 looper letters, 85 selfloop transitions, 18 changer transitions 0/126 dead transitions.
[2024-06-14 14:29:05,998 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 126 transitions, 1124 flow
[2024-06-14 14:29:05,999 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-14 14:29:05,999 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-14 14:29:05,999 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 119 transitions.
[2024-06-14 14:29:05,999 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46124031007751937
[2024-06-14 14:29:05,999 INFO  L175             Difference]: Start difference. First operand has 110 places, 114 transitions, 862 flow. Second operand 6 states and 119 transitions.
[2024-06-14 14:29:05,999 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 126 transitions, 1124 flow
[2024-06-14 14:29:06,028 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 126 transitions, 1029 flow, removed 20 selfloop flow, removed 8 redundant places.
[2024-06-14 14:29:06,030 INFO  L231             Difference]: Finished difference. Result has 108 places, 117 transitions, 849 flow
[2024-06-14 14:29:06,030 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=767, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=849, PETRI_PLACES=108, PETRI_TRANSITIONS=117}
[2024-06-14 14:29:06,030 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 64 predicate places.
[2024-06-14 14:29:06,030 INFO  L495      AbstractCegarLoop]: Abstraction has has 108 places, 117 transitions, 849 flow
[2024-06-14 14:29:06,030 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:29:06,031 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:29:06,031 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:29:06,031 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27
[2024-06-14 14:29:06,031 INFO  L420      AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:29:06,031 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:29:06,031 INFO  L85        PathProgramCache]: Analyzing trace with hash 324657317, now seen corresponding path program 1 times
[2024-06-14 14:29:06,031 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:29:06,032 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238846959]
[2024-06-14 14:29:06,032 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:29:06,032 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:29:06,069 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:29:17,752 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-14 14:29:17,752 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:29:17,752 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238846959]
[2024-06-14 14:29:17,776 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238846959] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:29:17,776 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:29:17,776 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-14 14:29:17,776 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173946530]
[2024-06-14 14:29:17,777 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:29:17,777 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-14 14:29:17,778 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:29:17,778 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-14 14:29:17,778 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-06-14 14:29:17,915 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43
[2024-06-14 14:29:17,916 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 117 transitions, 849 flow. Second operand  has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:29:17,916 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:29:17,916 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43
[2024-06-14 14:29:17,916 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:29:18,879 INFO  L124   PetriNetUnfolderBase]: 1518/2447 cut-off events.
[2024-06-14 14:29:18,879 INFO  L125   PetriNetUnfolderBase]: For 72190/72190 co-relation queries the response was YES.
[2024-06-14 14:29:18,887 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 14520 conditions, 2447 events. 1518/2447 cut-off events. For 72190/72190 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 12653 event pairs, 446 based on Foata normal form. 1/2447 useless extension candidates. Maximal degree in co-relation 14470. Up to 2255 conditions per place. 
[2024-06-14 14:29:18,896 INFO  L140   encePairwiseOnDemand]: 35/43 looper letters, 115 selfloop transitions, 11 changer transitions 0/132 dead transitions.
[2024-06-14 14:29:18,896 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 132 transitions, 1169 flow
[2024-06-14 14:29:18,897 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-14 14:29:18,897 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-14 14:29:18,897 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 115 transitions.
[2024-06-14 14:29:18,897 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44573643410852715
[2024-06-14 14:29:18,897 INFO  L175             Difference]: Start difference. First operand has 108 places, 117 transitions, 849 flow. Second operand 6 states and 115 transitions.
[2024-06-14 14:29:18,897 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 132 transitions, 1169 flow
[2024-06-14 14:29:18,933 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 132 transitions, 1109 flow, removed 14 selfloop flow, removed 4 redundant places.
[2024-06-14 14:29:18,935 INFO  L231             Difference]: Finished difference. Result has 110 places, 120 transitions, 861 flow
[2024-06-14 14:29:18,935 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=789, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=861, PETRI_PLACES=110, PETRI_TRANSITIONS=120}
[2024-06-14 14:29:18,936 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 66 predicate places.
[2024-06-14 14:29:18,936 INFO  L495      AbstractCegarLoop]: Abstraction has has 110 places, 120 transitions, 861 flow
[2024-06-14 14:29:18,936 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:29:18,936 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:29:18,937 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:29:18,937 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28
[2024-06-14 14:29:18,937 INFO  L420      AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:29:18,937 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:29:18,937 INFO  L85        PathProgramCache]: Analyzing trace with hash -553447349, now seen corresponding path program 2 times
[2024-06-14 14:29:18,937 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:29:18,937 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200921596]
[2024-06-14 14:29:18,938 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:29:18,938 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:29:18,978 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:29:31,438 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:29:31,438 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:29:31,439 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200921596]
[2024-06-14 14:29:31,439 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200921596] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:29:31,439 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:29:31,439 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-14 14:29:31,439 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800961137]
[2024-06-14 14:29:31,439 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:29:31,439 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-14 14:29:31,439 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:29:31,439 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-14 14:29:31,439 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2024-06-14 14:29:31,526 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43
[2024-06-14 14:29:31,526 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 120 transitions, 861 flow. Second operand  has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:29:31,527 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:29:31,527 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43
[2024-06-14 14:29:31,527 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:29:32,463 INFO  L124   PetriNetUnfolderBase]: 1515/2444 cut-off events.
[2024-06-14 14:29:32,464 INFO  L125   PetriNetUnfolderBase]: For 75708/75710 co-relation queries the response was YES.
[2024-06-14 14:29:32,473 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 14806 conditions, 2444 events. 1515/2444 cut-off events. For 75708/75710 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 12676 event pairs, 450 based on Foata normal form. 3/2446 useless extension candidates. Maximal degree in co-relation 14755. Up to 2245 conditions per place. 
[2024-06-14 14:29:32,482 INFO  L140   encePairwiseOnDemand]: 35/43 looper letters, 110 selfloop transitions, 16 changer transitions 0/132 dead transitions.
[2024-06-14 14:29:32,483 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 132 transitions, 1179 flow
[2024-06-14 14:29:32,483 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-14 14:29:32,483 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-14 14:29:32,483 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 114 transitions.
[2024-06-14 14:29:32,484 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4418604651162791
[2024-06-14 14:29:32,484 INFO  L175             Difference]: Start difference. First operand has 110 places, 120 transitions, 861 flow. Second operand 6 states and 114 transitions.
[2024-06-14 14:29:32,484 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 132 transitions, 1179 flow
[2024-06-14 14:29:32,524 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 132 transitions, 1129 flow, removed 16 selfloop flow, removed 4 redundant places.
[2024-06-14 14:29:32,526 INFO  L231             Difference]: Finished difference. Result has 112 places, 123 transitions, 899 flow
[2024-06-14 14:29:32,526 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=811, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=899, PETRI_PLACES=112, PETRI_TRANSITIONS=123}
[2024-06-14 14:29:32,526 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 68 predicate places.
[2024-06-14 14:29:32,527 INFO  L495      AbstractCegarLoop]: Abstraction has has 112 places, 123 transitions, 899 flow
[2024-06-14 14:29:32,527 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:29:32,527 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:29:32,527 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:29:32,527 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29
[2024-06-14 14:29:32,527 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-14 14:29:32,528 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:29:32,528 INFO  L85        PathProgramCache]: Analyzing trace with hash 1437598675, now seen corresponding path program 1 times
[2024-06-14 14:29:32,528 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:29:32,528 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684079766]
[2024-06-14 14:29:32,528 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:29:32,528 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:29:32,556 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:29:46,380 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:29:46,380 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:29:46,381 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684079766]
[2024-06-14 14:29:46,381 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684079766] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:29:46,381 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:29:46,381 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 14:29:46,381 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055792127]
[2024-06-14 14:29:46,381 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:29:46,381 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 14:29:46,382 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:29:46,382 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 14:29:46,382 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2024-06-14 14:29:46,577 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43
[2024-06-14 14:29:46,578 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 123 transitions, 899 flow. Second operand  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:29:46,578 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:29:46,578 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43
[2024-06-14 14:29:46,586 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:29:48,232 INFO  L124   PetriNetUnfolderBase]: 1888/2949 cut-off events.
[2024-06-14 14:29:48,233 INFO  L125   PetriNetUnfolderBase]: For 115627/115627 co-relation queries the response was YES.
[2024-06-14 14:29:48,242 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 19189 conditions, 2949 events. 1888/2949 cut-off events. For 115627/115627 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 15247 event pairs, 431 based on Foata normal form. 16/2964 useless extension candidates. Maximal degree in co-relation 19137. Up to 2439 conditions per place. 
[2024-06-14 14:29:48,253 INFO  L140   encePairwiseOnDemand]: 32/43 looper letters, 147 selfloop transitions, 23 changer transitions 0/175 dead transitions.
[2024-06-14 14:29:48,253 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 175 transitions, 1567 flow
[2024-06-14 14:29:48,255 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-14 14:29:48,256 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 14:29:48,256 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 199 transitions.
[2024-06-14 14:29:48,256 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4627906976744186
[2024-06-14 14:29:48,256 INFO  L175             Difference]: Start difference. First operand has 112 places, 123 transitions, 899 flow. Second operand 10 states and 199 transitions.
[2024-06-14 14:29:48,256 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 175 transitions, 1567 flow
[2024-06-14 14:29:48,292 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 175 transitions, 1501 flow, removed 19 selfloop flow, removed 4 redundant places.
[2024-06-14 14:29:48,294 INFO  L231             Difference]: Finished difference. Result has 118 places, 125 transitions, 951 flow
[2024-06-14 14:29:48,294 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=833, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=951, PETRI_PLACES=118, PETRI_TRANSITIONS=125}
[2024-06-14 14:29:48,294 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 74 predicate places.
[2024-06-14 14:29:48,295 INFO  L495      AbstractCegarLoop]: Abstraction has has 118 places, 125 transitions, 951 flow
[2024-06-14 14:29:48,295 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:29:48,295 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:29:48,295 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:29:48,295 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30
[2024-06-14 14:29:48,295 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-14 14:29:48,295 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:29:48,296 INFO  L85        PathProgramCache]: Analyzing trace with hash 320693955, now seen corresponding path program 2 times
[2024-06-14 14:29:48,296 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:29:48,296 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102774120]
[2024-06-14 14:29:48,296 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:29:48,296 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:29:48,322 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:30:01,559 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-14 14:30:01,559 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:30:01,560 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102774120]
[2024-06-14 14:30:01,560 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102774120] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:30:01,560 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:30:01,560 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 14:30:01,560 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359750555]
[2024-06-14 14:30:01,560 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:30:01,560 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 14:30:01,561 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:30:01,561 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 14:30:01,561 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2024-06-14 14:30:01,774 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43
[2024-06-14 14:30:01,774 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 125 transitions, 951 flow. Second operand  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:30:01,775 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:30:01,775 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43
[2024-06-14 14:30:01,775 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:30:03,379 INFO  L124   PetriNetUnfolderBase]: 1938/3041 cut-off events.
[2024-06-14 14:30:03,380 INFO  L125   PetriNetUnfolderBase]: For 123428/123428 co-relation queries the response was YES.
[2024-06-14 14:30:03,395 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 19861 conditions, 3041 events. 1938/3041 cut-off events. For 123428/123428 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 15963 event pairs, 598 based on Foata normal form. 20/3060 useless extension candidates. Maximal degree in co-relation 19808. Up to 2744 conditions per place. 
[2024-06-14 14:30:03,411 INFO  L140   encePairwiseOnDemand]: 32/43 looper letters, 142 selfloop transitions, 18 changer transitions 0/165 dead transitions.
[2024-06-14 14:30:03,411 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 165 transitions, 1427 flow
[2024-06-14 14:30:03,414 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 14:30:03,414 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 14:30:03,415 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 175 transitions.
[2024-06-14 14:30:03,415 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45219638242894056
[2024-06-14 14:30:03,415 INFO  L175             Difference]: Start difference. First operand has 118 places, 125 transitions, 951 flow. Second operand 9 states and 175 transitions.
[2024-06-14 14:30:03,415 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 165 transitions, 1427 flow
[2024-06-14 14:30:03,494 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 165 transitions, 1378 flow, removed 13 selfloop flow, removed 6 redundant places.
[2024-06-14 14:30:03,497 INFO  L231             Difference]: Finished difference. Result has 121 places, 126 transitions, 981 flow
[2024-06-14 14:30:03,497 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=904, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=981, PETRI_PLACES=121, PETRI_TRANSITIONS=126}
[2024-06-14 14:30:03,498 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 77 predicate places.
[2024-06-14 14:30:03,498 INFO  L495      AbstractCegarLoop]: Abstraction has has 121 places, 126 transitions, 981 flow
[2024-06-14 14:30:03,498 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:30:03,498 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:30:03,499 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:30:03,499 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31
[2024-06-14 14:30:03,499 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-14 14:30:03,499 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:30:03,499 INFO  L85        PathProgramCache]: Analyzing trace with hash 1526164435, now seen corresponding path program 3 times
[2024-06-14 14:30:03,499 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:30:03,500 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909565807]
[2024-06-14 14:30:03,500 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:30:03,500 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:30:03,536 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:30:17,589 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-14 14:30:17,589 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:30:17,589 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909565807]
[2024-06-14 14:30:17,590 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909565807] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:30:17,590 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:30:17,590 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 14:30:17,590 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167657818]
[2024-06-14 14:30:17,590 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:30:17,590 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 14:30:17,590 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:30:17,591 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 14:30:17,591 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-14 14:30:17,818 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43
[2024-06-14 14:30:17,819 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 126 transitions, 981 flow. Second operand  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:30:17,819 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:30:17,819 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43
[2024-06-14 14:30:17,819 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:30:19,410 INFO  L124   PetriNetUnfolderBase]: 1910/2997 cut-off events.
[2024-06-14 14:30:19,411 INFO  L125   PetriNetUnfolderBase]: For 121762/121762 co-relation queries the response was YES.
[2024-06-14 14:30:19,422 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 19266 conditions, 2997 events. 1910/2997 cut-off events. For 121762/121762 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 15645 event pairs, 558 based on Foata normal form. 16/3012 useless extension candidates. Maximal degree in co-relation 19211. Up to 2590 conditions per place. 
[2024-06-14 14:30:19,433 INFO  L140   encePairwiseOnDemand]: 32/43 looper letters, 144 selfloop transitions, 20 changer transitions 0/169 dead transitions.
[2024-06-14 14:30:19,434 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 169 transitions, 1449 flow
[2024-06-14 14:30:19,436 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 14:30:19,436 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 14:30:19,436 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 179 transitions.
[2024-06-14 14:30:19,436 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4625322997416021
[2024-06-14 14:30:19,436 INFO  L175             Difference]: Start difference. First operand has 121 places, 126 transitions, 981 flow. Second operand 9 states and 179 transitions.
[2024-06-14 14:30:19,436 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 169 transitions, 1449 flow
[2024-06-14 14:30:19,497 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 169 transitions, 1392 flow, removed 12 selfloop flow, removed 7 redundant places.
[2024-06-14 14:30:19,500 INFO  L231             Difference]: Finished difference. Result has 123 places, 126 transitions, 970 flow
[2024-06-14 14:30:19,500 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=924, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=970, PETRI_PLACES=123, PETRI_TRANSITIONS=126}
[2024-06-14 14:30:19,500 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 79 predicate places.
[2024-06-14 14:30:19,500 INFO  L495      AbstractCegarLoop]: Abstraction has has 123 places, 126 transitions, 970 flow
[2024-06-14 14:30:19,501 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:30:19,501 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:30:19,501 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:30:19,501 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32
[2024-06-14 14:30:19,501 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-14 14:30:19,501 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:30:19,501 INFO  L85        PathProgramCache]: Analyzing trace with hash -400247071, now seen corresponding path program 4 times
[2024-06-14 14:30:19,502 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:30:19,502 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147034212]
[2024-06-14 14:30:19,502 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:30:19,502 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:30:19,530 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:30:32,587 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-14 14:30:32,588 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:30:32,588 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147034212]
[2024-06-14 14:30:32,588 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147034212] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:30:32,588 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:30:32,588 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 14:30:32,588 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901427411]
[2024-06-14 14:30:32,588 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:30:32,588 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 14:30:32,588 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:30:32,588 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 14:30:32,589 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90
[2024-06-14 14:30:32,764 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43
[2024-06-14 14:30:32,764 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 126 transitions, 970 flow. Second operand  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:30:32,764 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:30:32,764 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43
[2024-06-14 14:30:32,764 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:30:34,379 INFO  L124   PetriNetUnfolderBase]: 1985/3131 cut-off events.
[2024-06-14 14:30:34,380 INFO  L125   PetriNetUnfolderBase]: For 130364/130366 co-relation queries the response was YES.
[2024-06-14 14:30:34,390 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 20020 conditions, 3131 events. 1985/3131 cut-off events. For 130364/130366 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 16701 event pairs, 547 based on Foata normal form. 20/3149 useless extension candidates. Maximal degree in co-relation 19964. Up to 2598 conditions per place. 
[2024-06-14 14:30:34,400 INFO  L140   encePairwiseOnDemand]: 32/43 looper letters, 109 selfloop transitions, 52 changer transitions 0/166 dead transitions.
[2024-06-14 14:30:34,400 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 166 transitions, 1452 flow
[2024-06-14 14:30:34,402 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 14:30:34,402 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 14:30:34,402 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 184 transitions.
[2024-06-14 14:30:34,403 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4754521963824289
[2024-06-14 14:30:34,403 INFO  L175             Difference]: Start difference. First operand has 123 places, 126 transitions, 970 flow. Second operand 9 states and 184 transitions.
[2024-06-14 14:30:34,403 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 166 transitions, 1452 flow
[2024-06-14 14:30:34,452 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 166 transitions, 1393 flow, removed 6 selfloop flow, removed 8 redundant places.
[2024-06-14 14:30:34,453 INFO  L231             Difference]: Finished difference. Result has 124 places, 127 transitions, 1058 flow
[2024-06-14 14:30:34,454 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=911, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1058, PETRI_PLACES=124, PETRI_TRANSITIONS=127}
[2024-06-14 14:30:34,454 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 80 predicate places.
[2024-06-14 14:30:34,454 INFO  L495      AbstractCegarLoop]: Abstraction has has 124 places, 127 transitions, 1058 flow
[2024-06-14 14:30:34,454 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:30:34,454 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:30:34,455 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:30:34,455 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33
[2024-06-14 14:30:34,455 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-14 14:30:34,455 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:30:34,456 INFO  L85        PathProgramCache]: Analyzing trace with hash -400394941, now seen corresponding path program 5 times
[2024-06-14 14:30:34,456 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:30:34,456 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209919907]
[2024-06-14 14:30:34,456 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:30:34,456 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:30:34,484 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:30:47,440 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-14 14:30:47,440 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:30:47,440 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209919907]
[2024-06-14 14:30:47,440 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209919907] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:30:47,440 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:30:47,440 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 14:30:47,440 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515374060]
[2024-06-14 14:30:47,440 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:30:47,440 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 14:30:47,440 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:30:47,441 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 14:30:47,441 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90
[2024-06-14 14:30:47,638 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43
[2024-06-14 14:30:47,638 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 127 transitions, 1058 flow. Second operand  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:30:47,638 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:30:47,638 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43
[2024-06-14 14:30:47,638 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:30:49,349 INFO  L124   PetriNetUnfolderBase]: 2154/3420 cut-off events.
[2024-06-14 14:30:49,350 INFO  L125   PetriNetUnfolderBase]: For 150059/150061 co-relation queries the response was YES.
[2024-06-14 14:30:49,363 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 22528 conditions, 3420 events. 2154/3420 cut-off events. For 150059/150061 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 18873 event pairs, 570 based on Foata normal form. 16/3434 useless extension candidates. Maximal degree in co-relation 22471. Up to 2601 conditions per place. 
[2024-06-14 14:30:49,377 INFO  L140   encePairwiseOnDemand]: 32/43 looper letters, 113 selfloop transitions, 55 changer transitions 0/173 dead transitions.
[2024-06-14 14:30:49,377 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 173 transitions, 1734 flow
[2024-06-14 14:30:49,379 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 14:30:49,379 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 14:30:49,380 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 188 transitions.
[2024-06-14 14:30:49,380 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.48578811369509045
[2024-06-14 14:30:49,380 INFO  L175             Difference]: Start difference. First operand has 124 places, 127 transitions, 1058 flow. Second operand 9 states and 188 transitions.
[2024-06-14 14:30:49,380 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 173 transitions, 1734 flow
[2024-06-14 14:30:49,451 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 173 transitions, 1615 flow, removed 9 selfloop flow, removed 7 redundant places.
[2024-06-14 14:30:49,453 INFO  L231             Difference]: Finished difference. Result has 126 places, 129 transitions, 1129 flow
[2024-06-14 14:30:49,454 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=939, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1129, PETRI_PLACES=126, PETRI_TRANSITIONS=129}
[2024-06-14 14:30:49,454 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 82 predicate places.
[2024-06-14 14:30:49,454 INFO  L495      AbstractCegarLoop]: Abstraction has has 126 places, 129 transitions, 1129 flow
[2024-06-14 14:30:49,454 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:30:49,454 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:30:49,454 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:30:49,454 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34
[2024-06-14 14:30:49,455 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-14 14:30:49,455 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:30:49,455 INFO  L85        PathProgramCache]: Analyzing trace with hash -394884691, now seen corresponding path program 6 times
[2024-06-14 14:30:49,455 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:30:49,455 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933190024]
[2024-06-14 14:30:49,455 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:30:49,455 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:30:49,480 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:31:02,429 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-14 14:31:02,430 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:31:02,430 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933190024]
[2024-06-14 14:31:02,430 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933190024] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:31:02,430 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:31:02,430 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 14:31:02,430 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180665499]
[2024-06-14 14:31:02,430 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:31:02,430 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 14:31:02,431 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:31:02,431 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 14:31:02,431 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90
[2024-06-14 14:31:02,609 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43
[2024-06-14 14:31:02,609 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 129 transitions, 1129 flow. Second operand  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:31:02,609 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:31:02,609 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43
[2024-06-14 14:31:02,609 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:31:04,272 INFO  L124   PetriNetUnfolderBase]: 2118/3364 cut-off events.
[2024-06-14 14:31:04,272 INFO  L125   PetriNetUnfolderBase]: For 148264/148266 co-relation queries the response was YES.
[2024-06-14 14:31:04,284 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 21709 conditions, 3364 events. 2118/3364 cut-off events. For 148264/148266 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 18452 event pairs, 572 based on Foata normal form. 20/3382 useless extension candidates. Maximal degree in co-relation 21651. Up to 2821 conditions per place. 
[2024-06-14 14:31:04,294 INFO  L140   encePairwiseOnDemand]: 32/43 looper letters, 109 selfloop transitions, 53 changer transitions 0/167 dead transitions.
[2024-06-14 14:31:04,295 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 167 transitions, 1575 flow
[2024-06-14 14:31:04,297 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 14:31:04,297 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 14:31:04,304 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 182 transitions.
[2024-06-14 14:31:04,306 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4702842377260982
[2024-06-14 14:31:04,307 INFO  L175             Difference]: Start difference. First operand has 126 places, 129 transitions, 1129 flow. Second operand 9 states and 182 transitions.
[2024-06-14 14:31:04,307 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 167 transitions, 1575 flow
[2024-06-14 14:31:04,367 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 167 transitions, 1474 flow, removed 21 selfloop flow, removed 5 redundant places.
[2024-06-14 14:31:04,370 INFO  L231             Difference]: Finished difference. Result has 130 places, 129 transitions, 1141 flow
[2024-06-14 14:31:04,370 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1028, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1141, PETRI_PLACES=130, PETRI_TRANSITIONS=129}
[2024-06-14 14:31:04,370 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 86 predicate places.
[2024-06-14 14:31:04,370 INFO  L495      AbstractCegarLoop]: Abstraction has has 130 places, 129 transitions, 1141 flow
[2024-06-14 14:31:04,371 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:31:04,371 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:31:04,371 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:31:04,371 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35
[2024-06-14 14:31:04,371 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-14 14:31:04,371 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:31:04,371 INFO  L85        PathProgramCache]: Analyzing trace with hash -394669210, now seen corresponding path program 1 times
[2024-06-14 14:31:04,372 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:31:04,372 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564910896]
[2024-06-14 14:31:04,372 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:31:04,372 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:31:04,429 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:31:15,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-14 14:31:15,379 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:31:15,379 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564910896]
[2024-06-14 14:31:15,379 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564910896] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:31:15,379 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:31:15,379 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 14:31:15,379 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581548888]
[2024-06-14 14:31:15,379 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:31:15,379 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 14:31:15,379 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:31:15,379 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 14:31:15,380 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90
[2024-06-14 14:31:15,612 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43
[2024-06-14 14:31:15,612 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 129 transitions, 1141 flow. Second operand  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:31:15,612 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:31:15,612 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43
[2024-06-14 14:31:15,612 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:31:17,341 INFO  L124   PetriNetUnfolderBase]: 2135/3406 cut-off events.
[2024-06-14 14:31:17,341 INFO  L125   PetriNetUnfolderBase]: For 144559/144561 co-relation queries the response was YES.
[2024-06-14 14:31:17,354 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 21947 conditions, 3406 events. 2135/3406 cut-off events. For 144559/144561 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 18898 event pairs, 611 based on Foata normal form. 4/3408 useless extension candidates. Maximal degree in co-relation 21887. Up to 3115 conditions per place. 
[2024-06-14 14:31:17,366 INFO  L140   encePairwiseOnDemand]: 32/43 looper letters, 128 selfloop transitions, 33 changer transitions 0/166 dead transitions.
[2024-06-14 14:31:17,366 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 166 transitions, 1611 flow
[2024-06-14 14:31:17,368 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 14:31:17,368 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 14:31:17,371 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 174 transitions.
[2024-06-14 14:31:17,373 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4496124031007752
[2024-06-14 14:31:17,373 INFO  L175             Difference]: Start difference. First operand has 130 places, 129 transitions, 1141 flow. Second operand 9 states and 174 transitions.
[2024-06-14 14:31:17,373 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 166 transitions, 1611 flow
[2024-06-14 14:31:17,434 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 166 transitions, 1491 flow, removed 2 selfloop flow, removed 8 redundant places.
[2024-06-14 14:31:17,436 INFO  L231             Difference]: Finished difference. Result has 132 places, 134 transitions, 1170 flow
[2024-06-14 14:31:17,436 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1025, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1170, PETRI_PLACES=132, PETRI_TRANSITIONS=134}
[2024-06-14 14:31:17,437 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 88 predicate places.
[2024-06-14 14:31:17,437 INFO  L495      AbstractCegarLoop]: Abstraction has has 132 places, 134 transitions, 1170 flow
[2024-06-14 14:31:17,437 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:31:17,437 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:31:17,437 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:31:17,438 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36
[2024-06-14 14:31:17,438 INFO  L420      AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:31:17,438 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:31:17,438 INFO  L85        PathProgramCache]: Analyzing trace with hash 9931062, now seen corresponding path program 1 times
[2024-06-14 14:31:17,438 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:31:17,438 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634489795]
[2024-06-14 14:31:17,439 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:31:17,439 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:31:17,495 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:31:31,758 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-14 14:31:31,759 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:31:31,759 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634489795]
[2024-06-14 14:31:31,759 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634489795] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:31:31,759 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:31:31,759 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 14:31:31,759 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619318691]
[2024-06-14 14:31:31,760 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:31:31,761 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 14:31:31,761 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:31:31,761 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 14:31:31,761 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-14 14:31:31,905 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43
[2024-06-14 14:31:31,905 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 134 transitions, 1170 flow. Second operand  has 8 states, 8 states have (on average 13.875) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:31:31,905 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:31:31,905 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43
[2024-06-14 14:31:31,905 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:31:33,180 INFO  L124   PetriNetUnfolderBase]: 1891/3119 cut-off events.
[2024-06-14 14:31:33,181 INFO  L125   PetriNetUnfolderBase]: For 148146/148152 co-relation queries the response was YES.
[2024-06-14 14:31:33,192 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 20846 conditions, 3119 events. 1891/3119 cut-off events. For 148146/148152 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 17966 event pairs, 585 based on Foata normal form. 4/3076 useless extension candidates. Maximal degree in co-relation 20784. Up to 2762 conditions per place. 
[2024-06-14 14:31:33,203 INFO  L140   encePairwiseOnDemand]: 34/43 looper letters, 110 selfloop transitions, 16 changer transitions 0/153 dead transitions.
[2024-06-14 14:31:33,203 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 153 transitions, 1496 flow
[2024-06-14 14:31:33,204 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 14:31:33,204 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 14:31:33,204 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 139 transitions.
[2024-06-14 14:31:33,204 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46179401993355484
[2024-06-14 14:31:33,205 INFO  L175             Difference]: Start difference. First operand has 132 places, 134 transitions, 1170 flow. Second operand 7 states and 139 transitions.
[2024-06-14 14:31:33,205 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 153 transitions, 1496 flow
[2024-06-14 14:31:33,263 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 153 transitions, 1393 flow, removed 21 selfloop flow, removed 6 redundant places.
[2024-06-14 14:31:33,265 INFO  L231             Difference]: Finished difference. Result has 133 places, 137 transitions, 1145 flow
[2024-06-14 14:31:33,265 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1067, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1145, PETRI_PLACES=133, PETRI_TRANSITIONS=137}
[2024-06-14 14:31:33,265 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 89 predicate places.
[2024-06-14 14:31:33,265 INFO  L495      AbstractCegarLoop]: Abstraction has has 133 places, 137 transitions, 1145 flow
[2024-06-14 14:31:33,266 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 13.875) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:31:33,266 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:31:33,266 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:31:33,266 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37
[2024-06-14 14:31:33,266 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-14 14:31:33,266 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:31:33,266 INFO  L85        PathProgramCache]: Analyzing trace with hash 360782567, now seen corresponding path program 7 times
[2024-06-14 14:31:33,266 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:31:33,267 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757027554]
[2024-06-14 14:31:33,267 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:31:33,267 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:31:33,292 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:31:46,605 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-14 14:31:46,605 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:31:46,605 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757027554]
[2024-06-14 14:31:46,605 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757027554] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:31:46,605 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:31:46,606 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 14:31:46,606 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931070474]
[2024-06-14 14:31:46,606 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:31:46,606 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 14:31:46,606 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:31:46,607 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 14:31:46,607 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90
[2024-06-14 14:31:46,748 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43
[2024-06-14 14:31:46,748 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 137 transitions, 1145 flow. Second operand  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:31:46,748 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:31:46,748 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43
[2024-06-14 14:31:46,749 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:31:48,389 INFO  L124   PetriNetUnfolderBase]: 2220/3528 cut-off events.
[2024-06-14 14:31:48,390 INFO  L125   PetriNetUnfolderBase]: For 169677/169679 co-relation queries the response was YES.
[2024-06-14 14:31:48,404 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 23536 conditions, 3528 events. 2220/3528 cut-off events. For 169677/169679 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 19538 event pairs, 574 based on Foata normal form. 20/3546 useless extension candidates. Maximal degree in co-relation 23473. Up to 2987 conditions per place. 
[2024-06-14 14:31:48,416 INFO  L140   encePairwiseOnDemand]: 32/43 looper letters, 112 selfloop transitions, 56 changer transitions 0/173 dead transitions.
[2024-06-14 14:31:48,416 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 173 transitions, 1645 flow
[2024-06-14 14:31:48,418 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 14:31:48,418 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 14:31:48,419 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 177 transitions.
[2024-06-14 14:31:48,419 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4573643410852713
[2024-06-14 14:31:48,419 INFO  L175             Difference]: Start difference. First operand has 133 places, 137 transitions, 1145 flow. Second operand 9 states and 177 transitions.
[2024-06-14 14:31:48,419 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 173 transitions, 1645 flow
[2024-06-14 14:31:48,498 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 173 transitions, 1589 flow, removed 14 selfloop flow, removed 5 redundant places.
[2024-06-14 14:31:48,500 INFO  L231             Difference]: Finished difference. Result has 137 places, 138 transitions, 1250 flow
[2024-06-14 14:31:48,500 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1089, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1250, PETRI_PLACES=137, PETRI_TRANSITIONS=138}
[2024-06-14 14:31:48,500 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 93 predicate places.
[2024-06-14 14:31:48,500 INFO  L495      AbstractCegarLoop]: Abstraction has has 137 places, 138 transitions, 1250 flow
[2024-06-14 14:31:48,501 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:31:48,501 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:31:48,501 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:31:48,501 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38
[2024-06-14 14:31:48,501 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-14 14:31:48,501 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:31:48,501 INFO  L85        PathProgramCache]: Analyzing trace with hash 1991712521, now seen corresponding path program 8 times
[2024-06-14 14:31:48,502 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:31:48,502 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483772549]
[2024-06-14 14:31:48,502 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:31:48,502 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:31:48,530 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:31:56,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-14 14:31:56,292 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:31:56,292 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483772549]
[2024-06-14 14:31:56,292 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483772549] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:31:56,293 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:31:56,293 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 14:31:56,293 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921125764]
[2024-06-14 14:31:56,293 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:31:56,293 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 14:31:56,293 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:31:56,293 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 14:31:56,293 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90
[2024-06-14 14:31:56,520 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43
[2024-06-14 14:31:56,521 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 138 transitions, 1250 flow. Second operand  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:31:56,521 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:31:56,521 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43
[2024-06-14 14:31:56,521 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:31:58,581 INFO  L124   PetriNetUnfolderBase]: 2295/3658 cut-off events.
[2024-06-14 14:31:58,581 INFO  L125   PetriNetUnfolderBase]: For 182795/182797 co-relation queries the response was YES.
[2024-06-14 14:31:58,596 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 24787 conditions, 3658 events. 2295/3658 cut-off events. For 182795/182797 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 20479 event pairs, 593 based on Foata normal form. 20/3676 useless extension candidates. Maximal degree in co-relation 24723. Up to 3112 conditions per place. 
[2024-06-14 14:31:58,609 INFO  L140   encePairwiseOnDemand]: 32/43 looper letters, 116 selfloop transitions, 54 changer transitions 0/175 dead transitions.
[2024-06-14 14:31:58,610 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 175 transitions, 1762 flow
[2024-06-14 14:31:58,612 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 14:31:58,612 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 14:31:58,612 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 179 transitions.
[2024-06-14 14:31:58,612 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4625322997416021
[2024-06-14 14:31:58,612 INFO  L175             Difference]: Start difference. First operand has 137 places, 138 transitions, 1250 flow. Second operand 9 states and 179 transitions.
[2024-06-14 14:31:58,612 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 175 transitions, 1762 flow
[2024-06-14 14:31:58,709 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 175 transitions, 1629 flow, removed 12 selfloop flow, removed 7 redundant places.
[2024-06-14 14:31:58,711 INFO  L231             Difference]: Finished difference. Result has 139 places, 139 transitions, 1276 flow
[2024-06-14 14:31:58,711 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1117, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1276, PETRI_PLACES=139, PETRI_TRANSITIONS=139}
[2024-06-14 14:31:58,712 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 95 predicate places.
[2024-06-14 14:31:58,712 INFO  L495      AbstractCegarLoop]: Abstraction has has 139 places, 139 transitions, 1276 flow
[2024-06-14 14:31:58,712 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:31:58,712 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:31:58,712 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:31:58,712 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39
[2024-06-14 14:31:58,712 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-14 14:31:58,713 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:31:58,713 INFO  L85        PathProgramCache]: Analyzing trace with hash 161332907, now seen corresponding path program 9 times
[2024-06-14 14:31:58,713 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:31:58,713 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102797558]
[2024-06-14 14:31:58,713 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:31:58,713 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:31:58,738 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:32:12,475 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:32:12,476 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:32:12,476 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102797558]
[2024-06-14 14:32:12,476 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102797558] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:32:12,476 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:32:12,476 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 14:32:12,476 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246940447]
[2024-06-14 14:32:12,476 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:32:12,476 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 14:32:12,476 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:32:12,477 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 14:32:12,477 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90
[2024-06-14 14:32:12,688 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43
[2024-06-14 14:32:12,689 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 139 transitions, 1276 flow. Second operand  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:32:12,689 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:32:12,689 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43
[2024-06-14 14:32:12,689 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:32:14,505 INFO  L124   PetriNetUnfolderBase]: 2414/3865 cut-off events.
[2024-06-14 14:32:14,505 INFO  L125   PetriNetUnfolderBase]: For 200336/200336 co-relation queries the response was YES.
[2024-06-14 14:32:14,524 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 26572 conditions, 3865 events. 2414/3865 cut-off events. For 200336/200336 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 21997 event pairs, 589 based on Foata normal form. 16/3880 useless extension candidates. Maximal degree in co-relation 26507. Up to 2917 conditions per place. 
[2024-06-14 14:32:14,541 INFO  L140   encePairwiseOnDemand]: 32/43 looper letters, 129 selfloop transitions, 59 changer transitions 0/193 dead transitions.
[2024-06-14 14:32:14,541 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 193 transitions, 2062 flow
[2024-06-14 14:32:14,541 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-14 14:32:14,542 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-14 14:32:14,542 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 220 transitions.
[2024-06-14 14:32:14,542 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46511627906976744
[2024-06-14 14:32:14,542 INFO  L175             Difference]: Start difference. First operand has 139 places, 139 transitions, 1276 flow. Second operand 11 states and 220 transitions.
[2024-06-14 14:32:14,542 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 193 transitions, 2062 flow
[2024-06-14 14:32:14,655 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 193 transitions, 1931 flow, removed 13 selfloop flow, removed 7 redundant places.
[2024-06-14 14:32:14,657 INFO  L231             Difference]: Finished difference. Result has 143 places, 141 transitions, 1359 flow
[2024-06-14 14:32:14,658 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1145, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1359, PETRI_PLACES=143, PETRI_TRANSITIONS=141}
[2024-06-14 14:32:14,658 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 99 predicate places.
[2024-06-14 14:32:14,658 INFO  L495      AbstractCegarLoop]: Abstraction has has 143 places, 141 transitions, 1359 flow
[2024-06-14 14:32:14,658 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:32:14,658 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:32:14,658 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:32:14,659 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40
[2024-06-14 14:32:14,659 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-14 14:32:14,659 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:32:14,659 INFO  L85        PathProgramCache]: Analyzing trace with hash 166843157, now seen corresponding path program 10 times
[2024-06-14 14:32:14,659 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:32:14,659 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60639061]
[2024-06-14 14:32:14,659 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:32:14,660 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:32:14,689 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:32:27,971 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-14 14:32:27,971 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:32:27,971 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60639061]
[2024-06-14 14:32:27,971 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60639061] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:32:27,971 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:32:27,971 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 14:32:27,971 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567609422]
[2024-06-14 14:32:27,971 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:32:27,972 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 14:32:27,972 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:32:27,972 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 14:32:27,972 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90
[2024-06-14 14:32:28,162 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43
[2024-06-14 14:32:28,162 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 141 transitions, 1359 flow. Second operand  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:32:28,162 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:32:28,162 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43
[2024-06-14 14:32:28,163 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:32:30,087 INFO  L124   PetriNetUnfolderBase]: 2378/3803 cut-off events.
[2024-06-14 14:32:30,087 INFO  L125   PetriNetUnfolderBase]: For 195320/195322 co-relation queries the response was YES.
[2024-06-14 14:32:30,104 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 25517 conditions, 3803 events. 2378/3803 cut-off events. For 195320/195322 co-relation queries the response was YES. Maximal size of possible extension queue 215. Compared 21616 event pairs, 605 based on Foata normal form. 20/3821 useless extension candidates. Maximal degree in co-relation 25451. Up to 3257 conditions per place. 
[2024-06-14 14:32:30,116 INFO  L140   encePairwiseOnDemand]: 32/43 looper letters, 119 selfloop transitions, 53 changer transitions 0/177 dead transitions.
[2024-06-14 14:32:30,116 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 177 transitions, 1833 flow
[2024-06-14 14:32:30,118 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 14:32:30,118 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 14:32:30,118 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 180 transitions.
[2024-06-14 14:32:30,119 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46511627906976744
[2024-06-14 14:32:30,119 INFO  L175             Difference]: Start difference. First operand has 143 places, 141 transitions, 1359 flow. Second operand 9 states and 180 transitions.
[2024-06-14 14:32:30,119 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 177 transitions, 1833 flow
[2024-06-14 14:32:30,259 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 177 transitions, 1713 flow, removed 28 selfloop flow, removed 7 redundant places.
[2024-06-14 14:32:30,261 INFO  L231             Difference]: Finished difference. Result has 145 places, 141 transitions, 1352 flow
[2024-06-14 14:32:30,261 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1239, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1352, PETRI_PLACES=145, PETRI_TRANSITIONS=141}
[2024-06-14 14:32:30,262 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 101 predicate places.
[2024-06-14 14:32:30,262 INFO  L495      AbstractCegarLoop]: Abstraction has has 145 places, 141 transitions, 1352 flow
[2024-06-14 14:32:30,262 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:32:30,262 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:32:30,262 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:32:30,262 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41
[2024-06-14 14:32:30,263 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-14 14:32:30,263 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:32:30,263 INFO  L85        PathProgramCache]: Analyzing trace with hash -1101439794, now seen corresponding path program 2 times
[2024-06-14 14:32:30,263 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:32:30,263 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460753339]
[2024-06-14 14:32:30,263 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:32:30,263 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:32:30,303 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:32:42,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-14 14:32:42,227 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:32:42,227 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460753339]
[2024-06-14 14:32:42,227 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460753339] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:32:42,227 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:32:42,227 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 14:32:42,228 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554242317]
[2024-06-14 14:32:42,228 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:32:42,228 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 14:32:42,228 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:32:42,229 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 14:32:42,229 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90
[2024-06-14 14:32:42,410 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43
[2024-06-14 14:32:42,411 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 141 transitions, 1352 flow. Second operand  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:32:42,411 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:32:42,411 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43
[2024-06-14 14:32:42,411 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:32:44,229 INFO  L124   PetriNetUnfolderBase]: 2406/3874 cut-off events.
[2024-06-14 14:32:44,230 INFO  L125   PetriNetUnfolderBase]: For 186422/186426 co-relation queries the response was YES.
[2024-06-14 14:32:44,246 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 25730 conditions, 3874 events. 2406/3874 cut-off events. For 186422/186426 co-relation queries the response was YES. Maximal size of possible extension queue 219. Compared 22288 event pairs, 661 based on Foata normal form. 8/3881 useless extension candidates. Maximal degree in co-relation 25662. Up to 3563 conditions per place. 
[2024-06-14 14:32:44,260 INFO  L140   encePairwiseOnDemand]: 32/43 looper letters, 132 selfloop transitions, 42 changer transitions 0/179 dead transitions.
[2024-06-14 14:32:44,261 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 179 transitions, 1893 flow
[2024-06-14 14:32:44,263 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 14:32:44,263 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 14:32:44,263 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 169 transitions.
[2024-06-14 14:32:44,263 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43669250645994834
[2024-06-14 14:32:44,263 INFO  L175             Difference]: Start difference. First operand has 145 places, 141 transitions, 1352 flow. Second operand 9 states and 169 transitions.
[2024-06-14 14:32:44,264 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 179 transitions, 1893 flow
[2024-06-14 14:32:44,385 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 179 transitions, 1762 flow, removed 3 selfloop flow, removed 8 redundant places.
[2024-06-14 14:32:44,388 INFO  L231             Difference]: Finished difference. Result has 147 places, 151 transitions, 1454 flow
[2024-06-14 14:32:44,388 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1231, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1454, PETRI_PLACES=147, PETRI_TRANSITIONS=151}
[2024-06-14 14:32:44,388 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 103 predicate places.
[2024-06-14 14:32:44,388 INFO  L495      AbstractCegarLoop]: Abstraction has has 147 places, 151 transitions, 1454 flow
[2024-06-14 14:32:44,389 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:32:44,389 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:32:44,389 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:32:44,389 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42
[2024-06-14 14:32:44,389 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-14 14:32:44,389 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:32:44,389 INFO  L85        PathProgramCache]: Analyzing trace with hash -1091916594, now seen corresponding path program 3 times
[2024-06-14 14:32:44,389 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:32:44,390 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797405324]
[2024-06-14 14:32:44,390 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:32:44,390 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:32:44,427 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:32:55,528 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:32:55,528 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:32:55,528 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797405324]
[2024-06-14 14:32:55,528 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797405324] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:32:55,528 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:32:55,528 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 14:32:55,528 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158341511]
[2024-06-14 14:32:55,528 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:32:55,529 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 14:32:55,529 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:32:55,529 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 14:32:55,529 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-14 14:32:55,727 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43
[2024-06-14 14:32:55,727 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 151 transitions, 1454 flow. Second operand  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:32:55,727 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:32:55,727 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43
[2024-06-14 14:32:55,727 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:32:57,558 INFO  L124   PetriNetUnfolderBase]: 2423/3881 cut-off events.
[2024-06-14 14:32:57,559 INFO  L125   PetriNetUnfolderBase]: For 195386/195390 co-relation queries the response was YES.
[2024-06-14 14:32:57,577 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 26325 conditions, 3881 events. 2423/3881 cut-off events. For 195386/195390 co-relation queries the response was YES. Maximal size of possible extension queue 219. Compared 22192 event pairs, 589 based on Foata normal form. 8/3888 useless extension candidates. Maximal degree in co-relation 26255. Up to 3502 conditions per place. 
[2024-06-14 14:32:57,590 INFO  L140   encePairwiseOnDemand]: 32/43 looper letters, 132 selfloop transitions, 49 changer transitions 0/186 dead transitions.
[2024-06-14 14:32:57,590 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 186 transitions, 2166 flow
[2024-06-14 14:32:57,592 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 14:32:57,592 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 14:32:57,593 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 172 transitions.
[2024-06-14 14:32:57,593 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4444444444444444
[2024-06-14 14:32:57,593 INFO  L175             Difference]: Start difference. First operand has 147 places, 151 transitions, 1454 flow. Second operand 9 states and 172 transitions.
[2024-06-14 14:32:57,593 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 186 transitions, 2166 flow
[2024-06-14 14:32:57,707 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 186 transitions, 2063 flow, removed 27 selfloop flow, removed 4 redundant places.
[2024-06-14 14:32:57,709 INFO  L231             Difference]: Finished difference. Result has 152 places, 155 transitions, 1576 flow
[2024-06-14 14:32:57,709 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1351, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1576, PETRI_PLACES=152, PETRI_TRANSITIONS=155}
[2024-06-14 14:32:57,709 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 108 predicate places.
[2024-06-14 14:32:57,710 INFO  L495      AbstractCegarLoop]: Abstraction has has 152 places, 155 transitions, 1576 flow
[2024-06-14 14:32:57,710 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:32:57,710 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:32:57,710 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:32:57,710 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43
[2024-06-14 14:32:57,710 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-14 14:32:57,710 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:32:57,710 INFO  L85        PathProgramCache]: Analyzing trace with hash -1984363674, now seen corresponding path program 4 times
[2024-06-14 14:32:57,711 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:32:57,711 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073071420]
[2024-06-14 14:32:57,711 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:32:57,711 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:32:57,750 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:33:08,153 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-14 14:33:08,154 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:33:08,154 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073071420]
[2024-06-14 14:33:08,154 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073071420] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:33:08,154 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:33:08,154 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 14:33:08,154 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408686576]
[2024-06-14 14:33:08,155 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:33:08,155 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 14:33:08,155 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:33:08,156 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 14:33:08,156 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90
[2024-06-14 14:33:08,288 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43
[2024-06-14 14:33:08,289 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 155 transitions, 1576 flow. Second operand  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:33:08,289 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:33:08,289 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43
[2024-06-14 14:33:08,289 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:33:10,272 INFO  L124   PetriNetUnfolderBase]: 2440/3938 cut-off events.
[2024-06-14 14:33:10,272 INFO  L125   PetriNetUnfolderBase]: For 204144/204148 co-relation queries the response was YES.
[2024-06-14 14:33:10,289 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 26437 conditions, 3938 events. 2440/3938 cut-off events. For 204144/204148 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 22791 event pairs, 671 based on Foata normal form. 8/3945 useless extension candidates. Maximal degree in co-relation 26366. Up to 3617 conditions per place. 
[2024-06-14 14:33:10,301 INFO  L140   encePairwiseOnDemand]: 32/43 looper letters, 141 selfloop transitions, 40 changer transitions 0/186 dead transitions.
[2024-06-14 14:33:10,302 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 186 transitions, 2081 flow
[2024-06-14 14:33:10,302 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 14:33:10,302 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 14:33:10,303 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 171 transitions.
[2024-06-14 14:33:10,303 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4418604651162791
[2024-06-14 14:33:10,303 INFO  L175             Difference]: Start difference. First operand has 152 places, 155 transitions, 1576 flow. Second operand 9 states and 171 transitions.
[2024-06-14 14:33:10,303 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 186 transitions, 2081 flow
[2024-06-14 14:33:10,432 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 186 transitions, 1937 flow, removed 47 selfloop flow, removed 5 redundant places.
[2024-06-14 14:33:10,434 INFO  L231             Difference]: Finished difference. Result has 157 places, 158 transitions, 1602 flow
[2024-06-14 14:33:10,435 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1454, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1602, PETRI_PLACES=157, PETRI_TRANSITIONS=158}
[2024-06-14 14:33:10,435 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 113 predicate places.
[2024-06-14 14:33:10,435 INFO  L495      AbstractCegarLoop]: Abstraction has has 157 places, 158 transitions, 1602 flow
[2024-06-14 14:33:10,435 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:33:10,435 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:33:10,436 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:33:10,436 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44
[2024-06-14 14:33:10,436 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-14 14:33:10,436 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:33:10,436 INFO  L85        PathProgramCache]: Analyzing trace with hash 1844734408, now seen corresponding path program 5 times
[2024-06-14 14:33:10,436 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:33:10,436 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723761283]
[2024-06-14 14:33:10,437 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:33:10,437 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:33:10,474 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:33:22,363 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-14 14:33:22,363 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:33:22,363 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723761283]
[2024-06-14 14:33:22,364 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723761283] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:33:22,364 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:33:22,364 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 14:33:22,364 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466429398]
[2024-06-14 14:33:22,364 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:33:22,364 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 14:33:22,368 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:33:22,369 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 14:33:22,369 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90
[2024-06-14 14:33:22,497 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43
[2024-06-14 14:33:22,497 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 158 transitions, 1602 flow. Second operand  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:33:22,498 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:33:22,498 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43
[2024-06-14 14:33:22,498 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:33:24,408 INFO  L124   PetriNetUnfolderBase]: 2432/3916 cut-off events.
[2024-06-14 14:33:24,408 INFO  L125   PetriNetUnfolderBase]: For 206835/206839 co-relation queries the response was YES.
[2024-06-14 14:33:24,428 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 26281 conditions, 3916 events. 2432/3916 cut-off events. For 206835/206839 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 22569 event pairs, 659 based on Foata normal form. 8/3923 useless extension candidates. Maximal degree in co-relation 26207. Up to 3605 conditions per place. 
[2024-06-14 14:33:24,443 INFO  L140   encePairwiseOnDemand]: 32/43 looper letters, 140 selfloop transitions, 41 changer transitions 0/186 dead transitions.
[2024-06-14 14:33:24,443 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 186 transitions, 2034 flow
[2024-06-14 14:33:24,446 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 14:33:24,446 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 14:33:24,446 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 170 transitions.
[2024-06-14 14:33:24,446 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4392764857881137
[2024-06-14 14:33:24,446 INFO  L175             Difference]: Start difference. First operand has 157 places, 158 transitions, 1602 flow. Second operand 9 states and 170 transitions.
[2024-06-14 14:33:24,446 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 186 transitions, 2034 flow
[2024-06-14 14:33:24,606 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 186 transitions, 1897 flow, removed 31 selfloop flow, removed 6 redundant places.
[2024-06-14 14:33:24,609 INFO  L231             Difference]: Finished difference. Result has 160 places, 158 transitions, 1554 flow
[2024-06-14 14:33:24,609 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1465, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1554, PETRI_PLACES=160, PETRI_TRANSITIONS=158}
[2024-06-14 14:33:24,609 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 116 predicate places.
[2024-06-14 14:33:24,609 INFO  L495      AbstractCegarLoop]: Abstraction has has 160 places, 158 transitions, 1554 flow
[2024-06-14 14:33:24,609 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:33:24,609 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:33:24,610 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:33:24,610 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45
[2024-06-14 14:33:24,610 INFO  L420      AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:33:24,610 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:33:24,610 INFO  L85        PathProgramCache]: Analyzing trace with hash 22818072, now seen corresponding path program 2 times
[2024-06-14 14:33:24,610 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:33:24,610 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681959823]
[2024-06-14 14:33:24,611 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:33:24,611 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:33:24,666 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:33:41,261 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-14 14:33:41,261 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:33:41,261 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681959823]
[2024-06-14 14:33:41,261 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681959823] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:33:41,262 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:33:41,262 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 14:33:41,262 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730952859]
[2024-06-14 14:33:41,262 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:33:41,262 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 14:33:41,263 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:33:41,263 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 14:33:41,263 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-14 14:33:41,524 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43
[2024-06-14 14:33:41,525 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 158 transitions, 1554 flow. Second operand  has 8 states, 8 states have (on average 13.875) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:33:41,525 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:33:41,525 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43
[2024-06-14 14:33:41,525 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:33:43,007 INFO  L124   PetriNetUnfolderBase]: 2172/3606 cut-off events.
[2024-06-14 14:33:43,007 INFO  L125   PetriNetUnfolderBase]: For 210813/210819 co-relation queries the response was YES.
[2024-06-14 14:33:43,024 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 24634 conditions, 3606 events. 2172/3606 cut-off events. For 210813/210819 co-relation queries the response was YES. Maximal size of possible extension queue 222. Compared 21738 event pairs, 632 based on Foata normal form. 5/3563 useless extension candidates. Maximal degree in co-relation 24559. Up to 3214 conditions per place. 
[2024-06-14 14:33:43,037 INFO  L140   encePairwiseOnDemand]: 34/43 looper letters, 116 selfloop transitions, 21 changer transitions 0/171 dead transitions.
[2024-06-14 14:33:43,037 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 171 transitions, 1892 flow
[2024-06-14 14:33:43,038 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 14:33:43,038 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 14:33:43,038 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 135 transitions.
[2024-06-14 14:33:43,038 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4485049833887043
[2024-06-14 14:33:43,038 INFO  L175             Difference]: Start difference. First operand has 160 places, 158 transitions, 1554 flow. Second operand 7 states and 135 transitions.
[2024-06-14 14:33:43,039 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 171 transitions, 1892 flow
[2024-06-14 14:33:43,149 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 171 transitions, 1752 flow, removed 10 selfloop flow, removed 11 redundant places.
[2024-06-14 14:33:43,151 INFO  L231             Difference]: Finished difference. Result has 156 places, 161 transitions, 1508 flow
[2024-06-14 14:33:43,151 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1414, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1508, PETRI_PLACES=156, PETRI_TRANSITIONS=161}
[2024-06-14 14:33:43,152 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 112 predicate places.
[2024-06-14 14:33:43,152 INFO  L495      AbstractCegarLoop]: Abstraction has has 156 places, 161 transitions, 1508 flow
[2024-06-14 14:33:43,152 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 13.875) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:33:43,152 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:33:43,152 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:33:43,152 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46
[2024-06-14 14:33:43,152 INFO  L420      AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:33:43,153 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:33:43,153 INFO  L85        PathProgramCache]: Analyzing trace with hash 29210002, now seen corresponding path program 3 times
[2024-06-14 14:33:43,153 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:33:43,153 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3294610]
[2024-06-14 14:33:43,153 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:33:43,153 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:33:43,211 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:33:57,540 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-14 14:33:57,540 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:33:57,540 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3294610]
[2024-06-14 14:33:57,541 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3294610] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:33:57,541 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:33:57,541 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 14:33:57,541 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652642486]
[2024-06-14 14:33:57,541 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:33:57,541 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 14:33:57,548 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:33:57,548 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 14:33:57,548 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-14 14:33:57,720 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43
[2024-06-14 14:33:57,720 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 161 transitions, 1508 flow. Second operand  has 8 states, 8 states have (on average 13.875) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:33:57,720 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:33:57,720 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43
[2024-06-14 14:33:57,720 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:33:59,152 INFO  L124   PetriNetUnfolderBase]: 2179/3631 cut-off events.
[2024-06-14 14:33:59,152 INFO  L125   PetriNetUnfolderBase]: For 219947/219955 co-relation queries the response was YES.
[2024-06-14 14:33:59,169 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 25041 conditions, 3631 events. 2179/3631 cut-off events. For 219947/219955 co-relation queries the response was YES. Maximal size of possible extension queue 225. Compared 22022 event pairs, 641 based on Foata normal form. 10/3593 useless extension candidates. Maximal degree in co-relation 24968. Up to 3208 conditions per place. 
[2024-06-14 14:33:59,180 INFO  L140   encePairwiseOnDemand]: 34/43 looper letters, 114 selfloop transitions, 29 changer transitions 0/177 dead transitions.
[2024-06-14 14:33:59,180 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 177 transitions, 1878 flow
[2024-06-14 14:33:59,180 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 14:33:59,180 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 14:33:59,181 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 136 transitions.
[2024-06-14 14:33:59,181 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45182724252491696
[2024-06-14 14:33:59,181 INFO  L175             Difference]: Start difference. First operand has 156 places, 161 transitions, 1508 flow. Second operand 7 states and 136 transitions.
[2024-06-14 14:33:59,181 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 177 transitions, 1878 flow
[2024-06-14 14:33:59,353 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 177 transitions, 1806 flow, removed 17 selfloop flow, removed 5 redundant places.
[2024-06-14 14:33:59,355 INFO  L231             Difference]: Finished difference. Result has 159 places, 167 transitions, 1582 flow
[2024-06-14 14:33:59,355 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1436, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1582, PETRI_PLACES=159, PETRI_TRANSITIONS=167}
[2024-06-14 14:33:59,356 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 115 predicate places.
[2024-06-14 14:33:59,356 INFO  L495      AbstractCegarLoop]: Abstraction has has 159 places, 167 transitions, 1582 flow
[2024-06-14 14:33:59,356 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 13.875) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:33:59,356 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:33:59,356 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:33:59,356 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47
[2024-06-14 14:33:59,357 INFO  L420      AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:33:59,357 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:33:59,357 INFO  L85        PathProgramCache]: Analyzing trace with hash -177854343, now seen corresponding path program 1 times
[2024-06-14 14:33:59,357 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:33:59,357 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025868771]
[2024-06-14 14:33:59,357 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:33:59,357 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:33:59,409 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:34:11,622 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-14 14:34:11,622 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:34:11,622 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025868771]
[2024-06-14 14:34:11,622 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025868771] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:34:11,623 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:34:11,623 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 14:34:11,623 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306522302]
[2024-06-14 14:34:11,623 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:34:11,623 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 14:34:11,623 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:34:11,624 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 14:34:11,624 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2024-06-14 14:34:11,809 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43
[2024-06-14 14:34:11,809 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 167 transitions, 1582 flow. Second operand  has 8 states, 8 states have (on average 12.875) internal successors, (103), 8 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:34:11,809 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:34:11,809 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43
[2024-06-14 14:34:11,809 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:34:13,253 INFO  L124   PetriNetUnfolderBase]: 2340/3842 cut-off events.
[2024-06-14 14:34:13,253 INFO  L125   PetriNetUnfolderBase]: For 229717/229717 co-relation queries the response was YES.
[2024-06-14 14:34:13,273 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 26638 conditions, 3842 events. 2340/3842 cut-off events. For 229717/229717 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 22626 event pairs, 628 based on Foata normal form. 2/3843 useless extension candidates. Maximal degree in co-relation 26563. Up to 3543 conditions per place. 
[2024-06-14 14:34:13,286 INFO  L140   encePairwiseOnDemand]: 33/43 looper letters, 163 selfloop transitions, 14 changer transitions 0/187 dead transitions.
[2024-06-14 14:34:13,287 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 187 transitions, 2020 flow
[2024-06-14 14:34:13,287 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 14:34:13,287 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 14:34:13,288 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 134 transitions.
[2024-06-14 14:34:13,288 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44518272425249167
[2024-06-14 14:34:13,288 INFO  L175             Difference]: Start difference. First operand has 159 places, 167 transitions, 1582 flow. Second operand 7 states and 134 transitions.
[2024-06-14 14:34:13,288 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 187 transitions, 2020 flow
[2024-06-14 14:34:13,578 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 187 transitions, 1959 flow, removed 20 selfloop flow, removed 3 redundant places.
[2024-06-14 14:34:13,581 INFO  L231             Difference]: Finished difference. Result has 163 places, 170 transitions, 1601 flow
[2024-06-14 14:34:13,581 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1521, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1601, PETRI_PLACES=163, PETRI_TRANSITIONS=170}
[2024-06-14 14:34:13,581 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 119 predicate places.
[2024-06-14 14:34:13,581 INFO  L495      AbstractCegarLoop]: Abstraction has has 163 places, 170 transitions, 1601 flow
[2024-06-14 14:34:13,581 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 12.875) internal successors, (103), 8 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:34:13,582 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:34:13,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-14 14:34:13,582 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48
[2024-06-14 14:34:13,582 INFO  L420      AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:34:13,582 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:34:13,582 INFO  L85        PathProgramCache]: Analyzing trace with hash -177704613, now seen corresponding path program 2 times
[2024-06-14 14:34:13,583 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:34:13,583 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947227433]
[2024-06-14 14:34:13,583 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:34:13,583 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:34:13,619 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:34:27,286 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-14 14:34:27,287 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:34:27,287 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947227433]
[2024-06-14 14:34:27,287 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947227433] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:34:27,287 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:34:27,287 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 14:34:27,287 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539439793]
[2024-06-14 14:34:27,287 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:34:27,287 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 14:34:27,287 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:34:27,287 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 14:34:27,287 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-14 14:34:27,391 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43
[2024-06-14 14:34:27,392 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 170 transitions, 1601 flow. Second operand  has 8 states, 8 states have (on average 12.875) internal successors, (103), 8 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:34:27,392 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:34:27,392 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43
[2024-06-14 14:34:27,392 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:34:28,949 INFO  L124   PetriNetUnfolderBase]: 2350/3858 cut-off events.
[2024-06-14 14:34:28,950 INFO  L125   PetriNetUnfolderBase]: For 238482/238482 co-relation queries the response was YES.
[2024-06-14 14:34:28,970 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 27259 conditions, 3858 events. 2350/3858 cut-off events. For 238482/238482 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 22756 event pairs, 628 based on Foata normal form. 2/3859 useless extension candidates. Maximal degree in co-relation 27182. Up to 3548 conditions per place. 
[2024-06-14 14:34:28,983 INFO  L140   encePairwiseOnDemand]: 33/43 looper letters, 159 selfloop transitions, 19 changer transitions 0/188 dead transitions.
[2024-06-14 14:34:28,984 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 188 transitions, 2043 flow
[2024-06-14 14:34:28,984 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 14:34:28,984 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 14:34:28,985 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 134 transitions.
[2024-06-14 14:34:28,985 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44518272425249167
[2024-06-14 14:34:28,985 INFO  L175             Difference]: Start difference. First operand has 163 places, 170 transitions, 1601 flow. Second operand 7 states and 134 transitions.
[2024-06-14 14:34:28,985 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 188 transitions, 2043 flow
[2024-06-14 14:34:29,248 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 188 transitions, 1985 flow, removed 17 selfloop flow, removed 5 redundant places.
[2024-06-14 14:34:29,250 INFO  L231             Difference]: Finished difference. Result has 165 places, 173 transitions, 1639 flow
[2024-06-14 14:34:29,250 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1543, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1639, PETRI_PLACES=165, PETRI_TRANSITIONS=173}
[2024-06-14 14:34:29,251 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 121 predicate places.
[2024-06-14 14:34:29,251 INFO  L495      AbstractCegarLoop]: Abstraction has has 165 places, 173 transitions, 1639 flow
[2024-06-14 14:34:29,251 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 12.875) internal successors, (103), 8 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:34:29,251 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:34:29,251 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:34:29,251 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49
[2024-06-14 14:34:29,252 INFO  L420      AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:34:29,252 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:34:29,252 INFO  L85        PathProgramCache]: Analyzing trace with hash 15650934, now seen corresponding path program 1 times
[2024-06-14 14:34:29,252 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:34:29,252 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921377461]
[2024-06-14 14:34:29,252 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:34:29,253 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:34:29,305 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:34:42,506 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-14 14:34:42,506 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:34:42,506 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921377461]
[2024-06-14 14:34:42,507 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921377461] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:34:42,507 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:34:42,507 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 14:34:42,507 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703636804]
[2024-06-14 14:34:42,507 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:34:42,507 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 14:34:42,508 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:34:42,508 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 14:34:42,508 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-14 14:34:42,710 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43
[2024-06-14 14:34:42,711 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 173 transitions, 1639 flow. Second operand  has 8 states, 8 states have (on average 12.875) internal successors, (103), 8 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:34:42,711 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:34:42,711 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43
[2024-06-14 14:34:42,711 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:34:44,595 INFO  L124   PetriNetUnfolderBase]: 2355/3857 cut-off events.
[2024-06-14 14:34:44,595 INFO  L125   PetriNetUnfolderBase]: For 247919/247919 co-relation queries the response was YES.
[2024-06-14 14:34:44,614 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 27797 conditions, 3857 events. 2355/3857 cut-off events. For 247919/247919 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 22653 event pairs, 617 based on Foata normal form. 2/3858 useless extension candidates. Maximal degree in co-relation 27719. Up to 3573 conditions per place. 
[2024-06-14 14:34:44,626 INFO  L140   encePairwiseOnDemand]: 34/43 looper letters, 165 selfloop transitions, 14 changer transitions 0/189 dead transitions.
[2024-06-14 14:34:44,626 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 189 transitions, 2075 flow
[2024-06-14 14:34:44,627 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 14:34:44,627 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 14:34:44,627 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 130 transitions.
[2024-06-14 14:34:44,628 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4318936877076412
[2024-06-14 14:34:44,628 INFO  L175             Difference]: Start difference. First operand has 165 places, 173 transitions, 1639 flow. Second operand 7 states and 130 transitions.
[2024-06-14 14:34:44,628 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 189 transitions, 2075 flow
[2024-06-14 14:34:44,780 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 189 transitions, 2001 flow, removed 20 selfloop flow, removed 5 redundant places.
[2024-06-14 14:34:44,783 INFO  L231             Difference]: Finished difference. Result has 167 places, 176 transitions, 1651 flow
[2024-06-14 14:34:44,783 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1565, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1651, PETRI_PLACES=167, PETRI_TRANSITIONS=176}
[2024-06-14 14:34:44,783 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 123 predicate places.
[2024-06-14 14:34:44,783 INFO  L495      AbstractCegarLoop]: Abstraction has has 167 places, 176 transitions, 1651 flow
[2024-06-14 14:34:44,784 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 12.875) internal successors, (103), 8 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:34:44,784 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:34:44,784 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:34:44,784 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50
[2024-06-14 14:34:44,784 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-14 14:34:44,784 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:34:44,784 INFO  L85        PathProgramCache]: Analyzing trace with hash 23002367, now seen corresponding path program 3 times
[2024-06-14 14:34:44,784 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:34:44,785 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689133656]
[2024-06-14 14:34:44,785 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:34:44,785 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:34:44,821 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:34:59,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-14 14:34:59,809 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:34:59,809 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689133656]
[2024-06-14 14:34:59,809 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689133656] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:34:59,809 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:34:59,809 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 14:34:59,809 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137592860]
[2024-06-14 14:34:59,810 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:34:59,810 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 14:34:59,810 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:34:59,810 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 14:34:59,810 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-14 14:35:00,032 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43
[2024-06-14 14:35:00,032 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 176 transitions, 1651 flow. Second operand  has 8 states, 8 states have (on average 12.875) internal successors, (103), 8 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:35:00,032 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:35:00,032 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43
[2024-06-14 14:35:00,033 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:35:01,550 INFO  L124   PetriNetUnfolderBase]: 2357/3874 cut-off events.
[2024-06-14 14:35:01,551 INFO  L125   PetriNetUnfolderBase]: For 255203/255205 co-relation queries the response was YES.
[2024-06-14 14:35:01,572 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 28141 conditions, 3874 events. 2357/3874 cut-off events. For 255203/255205 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 22934 event pairs, 635 based on Foata normal form. 4/3877 useless extension candidates. Maximal degree in co-relation 28062. Up to 3546 conditions per place. 
[2024-06-14 14:35:01,588 INFO  L140   encePairwiseOnDemand]: 33/43 looper letters, 155 selfloop transitions, 26 changer transitions 0/191 dead transitions.
[2024-06-14 14:35:01,588 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 191 transitions, 2099 flow
[2024-06-14 14:35:01,589 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 14:35:01,589 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 14:35:01,589 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 133 transitions.
[2024-06-14 14:35:01,589 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4418604651162791
[2024-06-14 14:35:01,589 INFO  L175             Difference]: Start difference. First operand has 167 places, 176 transitions, 1651 flow. Second operand 7 states and 133 transitions.
[2024-06-14 14:35:01,589 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 191 transitions, 2099 flow
[2024-06-14 14:35:01,812 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 191 transitions, 2035 flow, removed 20 selfloop flow, removed 5 redundant places.
[2024-06-14 14:35:01,815 INFO  L231             Difference]: Finished difference. Result has 169 places, 179 transitions, 1705 flow
[2024-06-14 14:35:01,815 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1587, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1705, PETRI_PLACES=169, PETRI_TRANSITIONS=179}
[2024-06-14 14:35:01,815 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 125 predicate places.
[2024-06-14 14:35:01,816 INFO  L495      AbstractCegarLoop]: Abstraction has has 169 places, 179 transitions, 1705 flow
[2024-06-14 14:35:01,816 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 12.875) internal successors, (103), 8 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:35:01,816 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:35:01,816 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:35:01,816 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51
[2024-06-14 14:35:01,816 INFO  L420      AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:35:01,816 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:35:01,817 INFO  L85        PathProgramCache]: Analyzing trace with hash 23002584, now seen corresponding path program 2 times
[2024-06-14 14:35:01,817 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:35:01,817 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420169287]
[2024-06-14 14:35:01,817 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:35:01,817 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:35:01,877 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:35:16,698 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-14 14:35:16,699 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:35:16,699 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420169287]
[2024-06-14 14:35:16,699 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420169287] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:35:16,699 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:35:16,699 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 14:35:16,699 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36469999]
[2024-06-14 14:35:16,699 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:35:16,701 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 14:35:16,701 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:35:16,701 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 14:35:16,702 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-14 14:35:16,896 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43
[2024-06-14 14:35:16,912 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 179 transitions, 1705 flow. Second operand  has 8 states, 8 states have (on average 12.875) internal successors, (103), 8 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:35:16,913 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:35:16,913 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43
[2024-06-14 14:35:16,913 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:35:18,431 INFO  L124   PetriNetUnfolderBase]: 2367/3877 cut-off events.
[2024-06-14 14:35:18,432 INFO  L125   PetriNetUnfolderBase]: For 265250/265252 co-relation queries the response was YES.
[2024-06-14 14:35:18,450 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 28778 conditions, 3877 events. 2367/3877 cut-off events. For 265250/265252 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 22800 event pairs, 620 based on Foata normal form. 4/3880 useless extension candidates. Maximal degree in co-relation 28698. Up to 3582 conditions per place. 
[2024-06-14 14:35:18,463 INFO  L140   encePairwiseOnDemand]: 34/43 looper letters, 163 selfloop transitions, 19 changer transitions 0/192 dead transitions.
[2024-06-14 14:35:18,463 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 192 transitions, 2147 flow
[2024-06-14 14:35:18,464 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 14:35:18,464 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 14:35:18,464 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 129 transitions.
[2024-06-14 14:35:18,464 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42857142857142855
[2024-06-14 14:35:18,465 INFO  L175             Difference]: Start difference. First operand has 169 places, 179 transitions, 1705 flow. Second operand 7 states and 129 transitions.
[2024-06-14 14:35:18,465 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 192 transitions, 2147 flow
[2024-06-14 14:35:18,695 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 192 transitions, 2051 flow, removed 24 selfloop flow, removed 5 redundant places.
[2024-06-14 14:35:18,697 INFO  L231             Difference]: Finished difference. Result has 171 places, 182 transitions, 1713 flow
[2024-06-14 14:35:18,698 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1609, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1713, PETRI_PLACES=171, PETRI_TRANSITIONS=182}
[2024-06-14 14:35:18,698 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 127 predicate places.
[2024-06-14 14:35:18,698 INFO  L495      AbstractCegarLoop]: Abstraction has has 171 places, 182 transitions, 1713 flow
[2024-06-14 14:35:18,698 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 12.875) internal successors, (103), 8 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:35:18,698 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:35:18,698 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:35:18,698 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52
[2024-06-14 14:35:18,699 INFO  L420      AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:35:18,699 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:35:18,699 INFO  L85        PathProgramCache]: Analyzing trace with hash 23269494, now seen corresponding path program 3 times
[2024-06-14 14:35:18,699 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:35:18,699 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368612813]
[2024-06-14 14:35:18,699 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:35:18,699 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:35:18,760 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:35:33,584 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-14 14:35:33,585 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:35:33,585 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368612813]
[2024-06-14 14:35:33,585 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368612813] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:35:33,585 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:35:33,585 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 14:35:33,585 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993301634]
[2024-06-14 14:35:33,585 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:35:33,586 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 14:35:33,586 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:35:33,586 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 14:35:33,586 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-14 14:35:33,777 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43
[2024-06-14 14:35:33,778 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 182 transitions, 1713 flow. Second operand  has 8 states, 8 states have (on average 12.875) internal successors, (103), 8 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:35:33,778 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:35:33,778 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43
[2024-06-14 14:35:33,778 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:35:35,873 INFO  L124   PetriNetUnfolderBase]: 2361/3879 cut-off events.
[2024-06-14 14:35:35,874 INFO  L125   PetriNetUnfolderBase]: For 271090/271092 co-relation queries the response was YES.
[2024-06-14 14:35:35,906 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 28937 conditions, 3879 events. 2361/3879 cut-off events. For 271090/271092 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 22898 event pairs, 630 based on Foata normal form. 4/3882 useless extension candidates. Maximal degree in co-relation 28856. Up to 3563 conditions per place. 
[2024-06-14 14:35:35,925 INFO  L140   encePairwiseOnDemand]: 34/43 looper letters, 156 selfloop transitions, 29 changer transitions 0/195 dead transitions.
[2024-06-14 14:35:35,926 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 195 transitions, 2167 flow
[2024-06-14 14:35:35,926 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 14:35:35,926 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 14:35:35,927 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 130 transitions.
[2024-06-14 14:35:35,927 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4318936877076412
[2024-06-14 14:35:35,927 INFO  L175             Difference]: Start difference. First operand has 171 places, 182 transitions, 1713 flow. Second operand 7 states and 130 transitions.
[2024-06-14 14:35:35,927 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 195 transitions, 2167 flow
[2024-06-14 14:35:36,240 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 195 transitions, 2085 flow, removed 24 selfloop flow, removed 5 redundant places.
[2024-06-14 14:35:36,246 INFO  L231             Difference]: Finished difference. Result has 173 places, 185 transitions, 1762 flow
[2024-06-14 14:35:36,246 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1631, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1762, PETRI_PLACES=173, PETRI_TRANSITIONS=185}
[2024-06-14 14:35:36,247 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 129 predicate places.
[2024-06-14 14:35:36,247 INFO  L495      AbstractCegarLoop]: Abstraction has has 173 places, 185 transitions, 1762 flow
[2024-06-14 14:35:36,247 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 12.875) internal successors, (103), 8 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:35:36,247 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:35:36,247 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:35:36,247 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53
[2024-06-14 14:35:36,247 INFO  L420      AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:35:36,248 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:35:36,248 INFO  L85        PathProgramCache]: Analyzing trace with hash 23279414, now seen corresponding path program 1 times
[2024-06-14 14:35:36,248 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:35:36,248 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959180833]
[2024-06-14 14:35:36,248 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:35:36,248 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:35:36,298 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:35:50,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-14 14:35:50,846 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:35:50,846 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959180833]
[2024-06-14 14:35:50,846 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959180833] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:35:50,847 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:35:50,847 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 14:35:50,847 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782736776]
[2024-06-14 14:35:50,847 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:35:50,847 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 14:35:50,847 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:35:50,848 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 14:35:50,848 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-14 14:35:51,116 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43
[2024-06-14 14:35:51,117 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 185 transitions, 1762 flow. Second operand  has 9 states, 9 states have (on average 13.777777777777779) internal successors, (124), 9 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:35:51,117 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:35:51,117 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43
[2024-06-14 14:35:51,117 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:35:52,534 INFO  L124   PetriNetUnfolderBase]: 2207/3691 cut-off events.
[2024-06-14 14:35:52,534 INFO  L125   PetriNetUnfolderBase]: For 279258/279266 co-relation queries the response was YES.
[2024-06-14 14:35:52,557 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 28336 conditions, 3691 events. 2207/3691 cut-off events. For 279258/279266 co-relation queries the response was YES. Maximal size of possible extension queue 225. Compared 22440 event pairs, 630 based on Foata normal form. 3/3648 useless extension candidates. Maximal degree in co-relation 28254. Up to 3277 conditions per place. 
[2024-06-14 14:35:52,574 INFO  L140   encePairwiseOnDemand]: 33/43 looper letters, 145 selfloop transitions, 17 changer transitions 0/199 dead transitions.
[2024-06-14 14:35:52,574 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 199 transitions, 2166 flow
[2024-06-14 14:35:52,574 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 14:35:52,575 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 14:35:52,575 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 149 transitions.
[2024-06-14 14:35:52,575 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4331395348837209
[2024-06-14 14:35:52,575 INFO  L175             Difference]: Start difference. First operand has 173 places, 185 transitions, 1762 flow. Second operand 8 states and 149 transitions.
[2024-06-14 14:35:52,575 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 199 transitions, 2166 flow
[2024-06-14 14:35:52,776 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 199 transitions, 2059 flow, removed 27 selfloop flow, removed 5 redundant places.
[2024-06-14 14:35:52,778 INFO  L231             Difference]: Finished difference. Result has 176 places, 188 transitions, 1755 flow
[2024-06-14 14:35:52,778 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1655, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1755, PETRI_PLACES=176, PETRI_TRANSITIONS=188}
[2024-06-14 14:35:52,779 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 132 predicate places.
[2024-06-14 14:35:52,779 INFO  L495      AbstractCegarLoop]: Abstraction has has 176 places, 188 transitions, 1755 flow
[2024-06-14 14:35:52,779 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 13.777777777777779) internal successors, (124), 9 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:35:52,779 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:35:52,779 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-14 14:35:52,779 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54
[2024-06-14 14:35:52,779 INFO  L420      AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:35:52,780 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:35:52,780 INFO  L85        PathProgramCache]: Analyzing trace with hash -1748588762, now seen corresponding path program 1 times
[2024-06-14 14:35:52,780 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:35:52,780 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409438338]
[2024-06-14 14:35:52,780 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:35:52,780 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:35:52,815 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:36:06,139 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-14 14:36:06,139 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:36:06,140 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409438338]
[2024-06-14 14:36:06,140 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409438338] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:36:06,140 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:36:06,140 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 14:36:06,140 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264336428]
[2024-06-14 14:36:06,140 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:36:06,140 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 14:36:06,141 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:36:06,141 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 14:36:06,141 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2024-06-14 14:36:06,285 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43
[2024-06-14 14:36:06,286 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 188 transitions, 1755 flow. Second operand  has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:36:06,286 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:36:06,286 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43
[2024-06-14 14:36:06,286 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:36:07,848 INFO  L124   PetriNetUnfolderBase]: 2474/3993 cut-off events.
[2024-06-14 14:36:07,849 INFO  L125   PetriNetUnfolderBase]: For 286793/286795 co-relation queries the response was YES.
[2024-06-14 14:36:07,869 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 30282 conditions, 3993 events. 2474/3993 cut-off events. For 286793/286795 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 23168 event pairs, 660 based on Foata normal form. 3/3995 useless extension candidates. Maximal degree in co-relation 30199. Up to 3761 conditions per place. 
[2024-06-14 14:36:07,883 INFO  L140   encePairwiseOnDemand]: 34/43 looper letters, 186 selfloop transitions, 19 changer transitions 0/210 dead transitions.
[2024-06-14 14:36:07,884 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 210 transitions, 2269 flow
[2024-06-14 14:36:07,884 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 14:36:07,884 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 14:36:07,884 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 132 transitions.
[2024-06-14 14:36:07,884 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43853820598006643
[2024-06-14 14:36:07,885 INFO  L175             Difference]: Start difference. First operand has 176 places, 188 transitions, 1755 flow. Second operand 7 states and 132 transitions.
[2024-06-14 14:36:07,885 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 210 transitions, 2269 flow
[2024-06-14 14:36:08,107 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 210 transitions, 2161 flow, removed 28 selfloop flow, removed 7 redundant places.
[2024-06-14 14:36:08,109 INFO  L231             Difference]: Finished difference. Result has 176 places, 191 transitions, 1753 flow
[2024-06-14 14:36:08,110 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1647, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1753, PETRI_PLACES=176, PETRI_TRANSITIONS=191}
[2024-06-14 14:36:08,110 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 132 predicate places.
[2024-06-14 14:36:08,110 INFO  L495      AbstractCegarLoop]: Abstraction has has 176 places, 191 transitions, 1753 flow
[2024-06-14 14:36:08,110 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:36:08,110 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:36:08,110 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-14 14:36:08,110 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55
[2024-06-14 14:36:08,111 INFO  L420      AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:36:08,111 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:36:08,111 INFO  L85        PathProgramCache]: Analyzing trace with hash 1879260942, now seen corresponding path program 2 times
[2024-06-14 14:36:08,111 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:36:08,111 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009771045]
[2024-06-14 14:36:08,111 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:36:08,111 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:36:08,148 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:36:20,944 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:36:20,945 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:36:20,945 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009771045]
[2024-06-14 14:36:20,945 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009771045] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:36:20,945 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:36:20,945 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 14:36:20,945 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446214180]
[2024-06-14 14:36:20,946 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:36:20,946 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 14:36:20,946 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:36:20,946 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 14:36:20,946 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-14 14:36:21,098 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43
[2024-06-14 14:36:21,098 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 191 transitions, 1753 flow. Second operand  has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:36:21,098 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:36:21,098 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43
[2024-06-14 14:36:21,098 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:36:22,693 INFO  L124   PetriNetUnfolderBase]: 2487/4011 cut-off events.
[2024-06-14 14:36:22,694 INFO  L125   PetriNetUnfolderBase]: For 298224/298226 co-relation queries the response was YES.
[2024-06-14 14:36:22,715 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 30902 conditions, 4011 events. 2487/4011 cut-off events. For 298224/298226 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 23271 event pairs, 660 based on Foata normal form. 3/4013 useless extension candidates. Maximal degree in co-relation 30819. Up to 3769 conditions per place. 
[2024-06-14 14:36:22,733 INFO  L140   encePairwiseOnDemand]: 34/43 looper letters, 185 selfloop transitions, 26 changer transitions 0/216 dead transitions.
[2024-06-14 14:36:22,733 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 216 transitions, 2464 flow
[2024-06-14 14:36:22,734 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 14:36:22,734 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 14:36:22,734 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 131 transitions.
[2024-06-14 14:36:22,734 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43521594684385384
[2024-06-14 14:36:22,734 INFO  L175             Difference]: Start difference. First operand has 176 places, 191 transitions, 1753 flow. Second operand 7 states and 131 transitions.
[2024-06-14 14:36:22,734 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 216 transitions, 2464 flow
[2024-06-14 14:36:22,986 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 216 transitions, 2380 flow, removed 25 selfloop flow, removed 5 redundant places.
[2024-06-14 14:36:22,988 INFO  L231             Difference]: Finished difference. Result has 179 places, 199 transitions, 1883 flow
[2024-06-14 14:36:22,989 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1669, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1883, PETRI_PLACES=179, PETRI_TRANSITIONS=199}
[2024-06-14 14:36:22,989 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 135 predicate places.
[2024-06-14 14:36:22,989 INFO  L495      AbstractCegarLoop]: Abstraction has has 179 places, 199 transitions, 1883 flow
[2024-06-14 14:36:22,989 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:36:22,990 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:36:22,990 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-14 14:36:22,990 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56
[2024-06-14 14:36:22,990 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-14 14:36:22,990 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:36:22,990 INFO  L85        PathProgramCache]: Analyzing trace with hash -630379080, now seen corresponding path program 1 times
[2024-06-14 14:36:22,990 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:36:22,991 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338527670]
[2024-06-14 14:36:22,991 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:36:22,991 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:36:23,033 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:36:34,453 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-14 14:36:34,454 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:36:34,454 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338527670]
[2024-06-14 14:36:34,454 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338527670] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:36:34,454 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:36:34,454 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-14 14:36:34,454 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059506742]
[2024-06-14 14:36:34,454 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:36:34,454 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-14 14:36:34,454 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:36:34,454 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-14 14:36:34,455 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110
[2024-06-14 14:36:34,692 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43
[2024-06-14 14:36:34,693 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 199 transitions, 1883 flow. Second operand  has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:36:34,693 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:36:34,693 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43
[2024-06-14 14:36:34,693 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:36:36,706 INFO  L124   PetriNetUnfolderBase]: 2651/4307 cut-off events.
[2024-06-14 14:36:36,706 INFO  L125   PetriNetUnfolderBase]: For 327410/327412 co-relation queries the response was YES.
[2024-06-14 14:36:36,802 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 32894 conditions, 4307 events. 2651/4307 cut-off events. For 327410/327412 co-relation queries the response was YES. Maximal size of possible extension queue 252. Compared 25574 event pairs, 641 based on Foata normal form. 12/4317 useless extension candidates. Maximal degree in co-relation 32809. Up to 3452 conditions per place. 
[2024-06-14 14:36:36,820 INFO  L140   encePairwiseOnDemand]: 31/43 looper letters, 177 selfloop transitions, 70 changer transitions 0/252 dead transitions.
[2024-06-14 14:36:36,821 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 252 transitions, 2693 flow
[2024-06-14 14:36:36,823 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-14 14:36:36,823 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 14:36:36,823 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 199 transitions.
[2024-06-14 14:36:36,823 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4627906976744186
[2024-06-14 14:36:36,824 INFO  L175             Difference]: Start difference. First operand has 179 places, 199 transitions, 1883 flow. Second operand 10 states and 199 transitions.
[2024-06-14 14:36:36,824 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 252 transitions, 2693 flow
[2024-06-14 14:36:37,035 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 252 transitions, 2607 flow, removed 34 selfloop flow, removed 3 redundant places.
[2024-06-14 14:36:37,038 INFO  L231             Difference]: Finished difference. Result has 188 places, 210 transitions, 2135 flow
[2024-06-14 14:36:37,038 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1797, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2135, PETRI_PLACES=188, PETRI_TRANSITIONS=210}
[2024-06-14 14:36:37,039 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 144 predicate places.
[2024-06-14 14:36:37,039 INFO  L495      AbstractCegarLoop]: Abstraction has has 188 places, 210 transitions, 2135 flow
[2024-06-14 14:36:37,039 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:36:37,039 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:36:37,039 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-14 14:36:37,039 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57
[2024-06-14 14:36:37,039 INFO  L420      AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:36:37,040 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:36:37,040 INFO  L85        PathProgramCache]: Analyzing trace with hash 215262442, now seen corresponding path program 1 times
[2024-06-14 14:36:37,040 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:36:37,040 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979950037]
[2024-06-14 14:36:37,041 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:36:37,041 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:36:37,100 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:36:52,926 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-14 14:36:52,927 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:36:52,927 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979950037]
[2024-06-14 14:36:52,927 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979950037] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:36:52,927 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:36:52,927 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 14:36:52,927 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730007878]
[2024-06-14 14:36:52,927 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:36:52,927 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 14:36:52,927 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:36:52,927 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 14:36:52,927 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-14 14:36:53,085 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43
[2024-06-14 14:36:53,086 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 210 transitions, 2135 flow. Second operand  has 10 states, 10 states have (on average 13.6) internal successors, (136), 10 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:36:53,086 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:36:53,086 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43
[2024-06-14 14:36:53,086 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:36:54,734 INFO  L124   PetriNetUnfolderBase]: 2416/4050 cut-off events.
[2024-06-14 14:36:54,734 INFO  L125   PetriNetUnfolderBase]: For 327451/327469 co-relation queries the response was YES.
[2024-06-14 14:36:54,762 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 32252 conditions, 4050 events. 2416/4050 cut-off events. For 327451/327469 co-relation queries the response was YES. Maximal size of possible extension queue 255. Compared 25095 event pairs, 645 based on Foata normal form. 7/4003 useless extension candidates. Maximal degree in co-relation 32163. Up to 3543 conditions per place. 
[2024-06-14 14:36:54,780 INFO  L140   encePairwiseOnDemand]: 33/43 looper letters, 166 selfloop transitions, 21 changer transitions 0/230 dead transitions.
[2024-06-14 14:36:54,780 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 230 transitions, 2607 flow
[2024-06-14 14:36:54,782 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 14:36:54,782 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 14:36:54,783 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 155 transitions.
[2024-06-14 14:36:54,783 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45058139534883723
[2024-06-14 14:36:54,783 INFO  L175             Difference]: Start difference. First operand has 188 places, 210 transitions, 2135 flow. Second operand 8 states and 155 transitions.
[2024-06-14 14:36:54,783 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 230 transitions, 2607 flow
[2024-06-14 14:36:55,137 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 230 transitions, 2468 flow, removed 19 selfloop flow, removed 5 redundant places.
[2024-06-14 14:36:55,139 INFO  L231             Difference]: Finished difference. Result has 191 places, 213 transitions, 2106 flow
[2024-06-14 14:36:55,139 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1996, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2106, PETRI_PLACES=191, PETRI_TRANSITIONS=213}
[2024-06-14 14:36:55,140 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 147 predicate places.
[2024-06-14 14:36:55,140 INFO  L495      AbstractCegarLoop]: Abstraction has has 191 places, 213 transitions, 2106 flow
[2024-06-14 14:36:55,140 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 13.6) internal successors, (136), 10 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:36:55,140 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:36:55,140 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-14 14:36:55,140 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58
[2024-06-14 14:36:55,141 INFO  L420      AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:36:55,141 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:36:55,141 INFO  L85        PathProgramCache]: Analyzing trace with hash -1549286972, now seen corresponding path program 3 times
[2024-06-14 14:36:55,141 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:36:55,141 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71068371]
[2024-06-14 14:36:55,141 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:36:55,141 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:36:55,180 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
Killed by 15