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


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


Checking for ERROR reachability
Using default analysis
Version bcb38a6f
Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe034_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/safe034_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false
--- Real Ultimate output ---
This is Ultimate 0.2.4-tmp.fs.goblint-validation-bcb38a6-m
[2024-06-04 18:13:10,479 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-06-04 18:13:10,545 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-06-04 18:13:10,548 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-06-04 18:13:10,549 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-06-04 18:13:10,572 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-06-04 18:13:10,573 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-06-04 18:13:10,573 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-06-04 18:13:10,574 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-06-04 18:13:10,577 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-06-04 18:13:10,577 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-06-04 18:13:10,577 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-06-04 18:13:10,578 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-06-04 18:13:10,579 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-06-04 18:13:10,579 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-06-04 18:13:10,579 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-06-04 18:13:10,579 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-06-04 18:13:10,579 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-06-04 18:13:10,580 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-06-04 18:13:10,580 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-06-04 18:13:10,580 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-06-04 18:13:10,580 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-06-04 18:13:10,581 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-06-04 18:13:10,581 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-06-04 18:13:10,581 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-06-04 18:13:10,581 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-06-04 18:13:10,581 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-06-04 18:13:10,582 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-06-04 18:13:10,582 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-06-04 18:13:10,582 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-06-04 18:13:10,583 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-06-04 18:13:10,583 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-06-04 18:13:10,583 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-06-04 18:13:10,584 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-06-04 18:13:10,584 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-06-04 18:13:10,584 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-06-04 18:13:10,584 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-06-04 18:13:10,584 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-06-04 18:13:10,584 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-06-04 18:13:10,585 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-06-04 18:13:10,585 INFO  L153        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-06-04 18:13:10,585 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-06-04 18:13:10,585 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-06-04 18:13:10,585 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-04 18:13:10,751 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-06-04 18:13:10,781 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-06-04 18:13:10,783 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-06-04 18:13:10,783 INFO  L270        PluginConnector]: Initializing Witness Parser...
[2024-06-04 18:13:10,784 INFO  L274        PluginConnector]: Witness Parser initialized
[2024-06-04 18:13:10,785 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/safe034_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.yml/witness.yml
[2024-06-04 18:13:10,973 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-06-04 18:13:10,973 INFO  L274        PluginConnector]: CDTParser initialized
[2024-06-04 18:13:10,974 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe034_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i
[2024-06-04 18:13:11,929 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-06-04 18:13:12,191 INFO  L384              CDTParser]: Found 1 translation units.
[2024-06-04 18:13:12,191 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe034_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i
[2024-06-04 18:13:12,208 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f619495f/a31135c6aac2439cab416751a5868e0e/FLAGcd8eacf91
[2024-06-04 18:13:12,222 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f619495f/a31135c6aac2439cab416751a5868e0e
[2024-06-04 18:13:12,223 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-06-04 18:13:12,224 INFO  L133        ToolchainWalker]: Walking toolchain with 5 elements.
[2024-06-04 18:13:12,226 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-06-04 18:13:12,226 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-06-04 18:13:12,231 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-06-04 18:13:12,231 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 06:13:10" (1/2) ...
[2024-06-04 18:13:12,232 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@218cccd4 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 06:13:12, skipping insertion in model container
[2024-06-04 18:13:12,232 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 06:13:10" (1/2) ...
[2024-06-04 18:13:12,234 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@3f1011ec and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 06:13:12, skipping insertion in model container
[2024-06-04 18:13:12,234 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 06:13:12" (2/2) ...
[2024-06-04 18:13:12,234 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@218cccd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 06:13:12, skipping insertion in model container
[2024-06-04 18:13:12,234 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 06:13:12" (2/2) ...
[2024-06-04 18:13:12,235 INFO  L83    nessWitnessExtractor]: Extracting all invariants from correctness witness
[2024-06-04 18:13:12,307 INFO  L95    edCorrectnessWitness]: Found the following entries in the witness:
[2024-06-04 18:13:12,308 INFO  L97    edCorrectnessWitness]: Location invariant before [L830-L830] ((((((((((((((((((! multithreaded || y$r_buff1_thd1 == (_Bool)0) && (! 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 || y$read_delayed_var == 0)) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd1 >= 0LL && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )z >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )z >= 0LL) && (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 )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EAX >= 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_buff0_thd3 >= 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$r_buff1_thd3 >= 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 )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )y$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )y$flush_delayed >= 0LL) && (long long )x + (long long )y$mem_tmp >= 0LL) && (long long )x + (long long )y$r_buff0_thd0 >= 0LL) && (long long )x + (long long )y$r_buff0_thd1 >= 0LL) && (long long )x + (long long )y$r_buff0_thd2 >= 0LL) && (long long )x + (long long )y$r_buff0_thd3 >= 0LL) && (long long )x + (long long )y$r_buff1_thd0 >= 0LL) && (long long )x + (long long )y$r_buff1_thd1 >= 0LL) && (long long )x + (long long )y$r_buff1_thd2 >= 0LL) && (long long )x + (long long )y$r_buff1_thd3 >= 0LL) && (long long )x + (long long )y$read_delayed >= 0LL) && (long long )x + (long long )y$w_buff0 >= 0LL) && (long long )x + (long long )y$w_buff1 >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )y + (long long )y$flush_delayed >= 0LL) && (long long )y + (long long )y$mem_tmp >= 0LL) && (long long )y + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y + (long long )y$read_delayed >= 0LL) && (long long )y + (long long )y$w_buff0 >= 0LL) && (long long )y + (long long )y$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y$flush_delayed + (long long )y$mem_tmp >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$flush_delayed + (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$flush_delayed + (long long )z >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$mem_tmp + (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff1 >= 0LL) && (long long )y$mem_tmp + (long long )z >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )z >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )z >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )z >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )z >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )z >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )z >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )z >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd3 + (long long )z >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$read_delayed + (long long )z >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )z >= 0LL) && (long long )y$w_buff1 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )z >= 0LL) && (2LL + (long long )__unbuffered_p0_EAX) - (long long )z >= 0LL) && (2LL + (long long )__unbuffered_p1_EAX) - (long long )z >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )z >= 0LL) && (2LL + (long long )x) - (long long )z >= 0LL) && (2LL + (long long )y) - (long long )z >= 0LL) && (2LL + (long long )y$flush_delayed) - (long long )z >= 0LL) && (2LL + (long long )y$mem_tmp) - (long long )z >= 0LL) && (2LL + (long long )y$r_buff0_thd0) - (long long )z >= 0LL) && (2LL + (long long )y$r_buff0_thd1) - (long long )z >= 0LL) && (2LL + (long long )y$r_buff0_thd2) - (long long )z >= 0LL) && (2LL + (long long )y$r_buff0_thd3) - (long long )z >= 0LL) && (2LL + (long long )y$r_buff1_thd0) - (long long )z >= 0LL) && (2LL + (long long )y$r_buff1_thd1) - (long long )z >= 0LL) && (2LL + (long long )y$r_buff1_thd2) - (long long )z >= 0LL) && (2LL + (long long )y$r_buff1_thd3) - (long long )z >= 0LL) && (2LL + (long long )y$read_delayed) - (long long )z >= 0LL) && (2LL + (long long )y$w_buff0) - (long long )z >= 0LL) && (2LL + (long long )y$w_buff1) - (long long )z >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )z >= 0LL) && (2LL + (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) && (2LL - (long long )y$r_buff0_thd0) - (long long )z >= 0LL) && (2LL - (long long )y$r_buff0_thd1) - (long long )z >= 0LL) && (2LL - (long long )y$r_buff0_thd2) - (long long )z >= 0LL) && (2LL - (long long )y$r_buff1_thd0) - (long long )z >= 0LL) && (2LL - (long long )y$r_buff1_thd1) - (long long )z >= 0LL) && (2LL - (long long )y$r_buff1_thd2) - (long long )z >= 0LL) && (2LL - (long long )y$read_delayed) - (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 )main$tmp_guard1 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$read_delayed >= 0LL) && (long long )x - (long long )y$r_buff0_thd0 >= 0LL) && (long long )x - (long long )y$r_buff0_thd1 >= 0LL) && (long long )x - (long long )y$r_buff0_thd2 >= 0LL) && (long long )x - (long long )y$r_buff1_thd0 >= 0LL) && (long long )x - (long long )y$r_buff1_thd1 >= 0LL) && (long long )x - (long long )y$r_buff1_thd2 >= 0LL) && (long long )x - (long long )y$read_delayed >= 0LL) && (long long )y - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y - (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd3 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 1) && (y$mem_tmp == 0 || y$mem_tmp == 1)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p1_EAX) && 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) && x <= 1) && y <= 1) && y$mem_tmp <= 1) && y$w_buff0 <= 1) && y$w_buff1 <= 1) && z <= 2) && z <= 127) && 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)) && (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) || z == 2)))) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= y$w_buff1 && y$w_buff1 <= 1) && (y$w_buff1 == 0 || y$w_buff1 == 1)))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || ((0 <= y$w_buff0 && y$w_buff0 <= 1) && (y$w_buff0 == 0 || y$w_buff0 == 1)))) && (! multithreaded || (((0 <= z && z <= 2) && z <= 127) && ((z == 0 || z == 1) || z == 2)))
[2024-06-04 18:13:12,309 INFO  L97    edCorrectnessWitness]: Location invariant before [L832-L832] ((((((((((((((((((! multithreaded || y$r_buff1_thd1 == (_Bool)0) && (! 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 || y$read_delayed_var == 0)) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd1 >= 0LL && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )z >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )z >= 0LL) && (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 )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EAX >= 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_buff0_thd3 >= 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$r_buff1_thd3 >= 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 )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )y$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )y$flush_delayed >= 0LL) && (long long )x + (long long )y$mem_tmp >= 0LL) && (long long )x + (long long )y$r_buff0_thd0 >= 0LL) && (long long )x + (long long )y$r_buff0_thd1 >= 0LL) && (long long )x + (long long )y$r_buff0_thd2 >= 0LL) && (long long )x + (long long )y$r_buff0_thd3 >= 0LL) && (long long )x + (long long )y$r_buff1_thd0 >= 0LL) && (long long )x + (long long )y$r_buff1_thd1 >= 0LL) && (long long )x + (long long )y$r_buff1_thd2 >= 0LL) && (long long )x + (long long )y$r_buff1_thd3 >= 0LL) && (long long )x + (long long )y$read_delayed >= 0LL) && (long long )x + (long long )y$w_buff0 >= 0LL) && (long long )x + (long long )y$w_buff1 >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )y + (long long )y$flush_delayed >= 0LL) && (long long )y + (long long )y$mem_tmp >= 0LL) && (long long )y + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y + (long long )y$read_delayed >= 0LL) && (long long )y + (long long )y$w_buff0 >= 0LL) && (long long )y + (long long )y$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y$flush_delayed + (long long )y$mem_tmp >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$flush_delayed + (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$flush_delayed + (long long )z >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$mem_tmp + (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff1 >= 0LL) && (long long )y$mem_tmp + (long long )z >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )z >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )z >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )z >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )z >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )z >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )z >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )z >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd3 + (long long )z >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$read_delayed + (long long )z >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )z >= 0LL) && (long long )y$w_buff1 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )z >= 0LL) && (2LL + (long long )__unbuffered_p0_EAX) - (long long )z >= 0LL) && (2LL + (long long )__unbuffered_p1_EAX) - (long long )z >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )z >= 0LL) && (2LL + (long long )x) - (long long )z >= 0LL) && (2LL + (long long )y) - (long long )z >= 0LL) && (2LL + (long long )y$flush_delayed) - (long long )z >= 0LL) && (2LL + (long long )y$mem_tmp) - (long long )z >= 0LL) && (2LL + (long long )y$r_buff0_thd0) - (long long )z >= 0LL) && (2LL + (long long )y$r_buff0_thd1) - (long long )z >= 0LL) && (2LL + (long long )y$r_buff0_thd2) - (long long )z >= 0LL) && (2LL + (long long )y$r_buff0_thd3) - (long long )z >= 0LL) && (2LL + (long long )y$r_buff1_thd0) - (long long )z >= 0LL) && (2LL + (long long )y$r_buff1_thd1) - (long long )z >= 0LL) && (2LL + (long long )y$r_buff1_thd2) - (long long )z >= 0LL) && (2LL + (long long )y$r_buff1_thd3) - (long long )z >= 0LL) && (2LL + (long long )y$read_delayed) - (long long )z >= 0LL) && (2LL + (long long )y$w_buff0) - (long long )z >= 0LL) && (2LL + (long long )y$w_buff1) - (long long )z >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )z >= 0LL) && (2LL + (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) && (2LL - (long long )y$r_buff0_thd0) - (long long )z >= 0LL) && (2LL - (long long )y$r_buff0_thd1) - (long long )z >= 0LL) && (2LL - (long long )y$r_buff0_thd2) - (long long )z >= 0LL) && (2LL - (long long )y$r_buff1_thd0) - (long long )z >= 0LL) && (2LL - (long long )y$r_buff1_thd1) - (long long )z >= 0LL) && (2LL - (long long )y$r_buff1_thd2) - (long long )z >= 0LL) && (2LL - (long long )y$read_delayed) - (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 )main$tmp_guard1 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$read_delayed >= 0LL) && (long long )x - (long long )y$r_buff0_thd0 >= 0LL) && (long long )x - (long long )y$r_buff0_thd1 >= 0LL) && (long long )x - (long long )y$r_buff0_thd2 >= 0LL) && (long long )x - (long long )y$r_buff1_thd0 >= 0LL) && (long long )x - (long long )y$r_buff1_thd1 >= 0LL) && (long long )x - (long long )y$r_buff1_thd2 >= 0LL) && (long long )x - (long long )y$read_delayed >= 0LL) && (long long )y - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y - (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd3 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 1) && (y$mem_tmp == 0 || y$mem_tmp == 1)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p1_EAX) && 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) && x <= 1) && y <= 1) && y$mem_tmp <= 1) && y$w_buff0 <= 1) && y$w_buff1 <= 1) && z <= 2) && z <= 127) && 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)) && (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) || z == 2)))) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= y$w_buff1 && y$w_buff1 <= 1) && (y$w_buff1 == 0 || y$w_buff1 == 1)))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || ((0 <= y$w_buff0 && y$w_buff0 <= 1) && (y$w_buff0 == 0 || y$w_buff0 == 1)))) && (! multithreaded || (((0 <= z && z <= 2) && z <= 127) && ((z == 0 || z == 1) || z == 2)))
[2024-06-04 18:13:12,309 INFO  L97    edCorrectnessWitness]: Location invariant before [L833-L833] ((((((((((((((((((! multithreaded || y$r_buff1_thd1 == (_Bool)0) && (! 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 || y$read_delayed_var == 0)) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd1 >= 0LL && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )z >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )z >= 0LL) && (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 )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EAX >= 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_buff0_thd3 >= 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$r_buff1_thd3 >= 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 )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )y$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )y$flush_delayed >= 0LL) && (long long )x + (long long )y$mem_tmp >= 0LL) && (long long )x + (long long )y$r_buff0_thd0 >= 0LL) && (long long )x + (long long )y$r_buff0_thd1 >= 0LL) && (long long )x + (long long )y$r_buff0_thd2 >= 0LL) && (long long )x + (long long )y$r_buff0_thd3 >= 0LL) && (long long )x + (long long )y$r_buff1_thd0 >= 0LL) && (long long )x + (long long )y$r_buff1_thd1 >= 0LL) && (long long )x + (long long )y$r_buff1_thd2 >= 0LL) && (long long )x + (long long )y$r_buff1_thd3 >= 0LL) && (long long )x + (long long )y$read_delayed >= 0LL) && (long long )x + (long long )y$w_buff0 >= 0LL) && (long long )x + (long long )y$w_buff1 >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )y + (long long )y$flush_delayed >= 0LL) && (long long )y + (long long )y$mem_tmp >= 0LL) && (long long )y + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y + (long long )y$read_delayed >= 0LL) && (long long )y + (long long )y$w_buff0 >= 0LL) && (long long )y + (long long )y$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y$flush_delayed + (long long )y$mem_tmp >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$flush_delayed + (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$flush_delayed + (long long )z >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$mem_tmp + (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff1 >= 0LL) && (long long )y$mem_tmp + (long long )z >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )z >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )z >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )z >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )z >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )z >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )z >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )z >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd3 + (long long )z >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$read_delayed + (long long )z >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )z >= 0LL) && (long long )y$w_buff1 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )z >= 0LL) && (2LL + (long long )__unbuffered_p0_EAX) - (long long )z >= 0LL) && (2LL + (long long )__unbuffered_p1_EAX) - (long long )z >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )z >= 0LL) && (2LL + (long long )x) - (long long )z >= 0LL) && (2LL + (long long )y) - (long long )z >= 0LL) && (2LL + (long long )y$flush_delayed) - (long long )z >= 0LL) && (2LL + (long long )y$mem_tmp) - (long long )z >= 0LL) && (2LL + (long long )y$r_buff0_thd0) - (long long )z >= 0LL) && (2LL + (long long )y$r_buff0_thd1) - (long long )z >= 0LL) && (2LL + (long long )y$r_buff0_thd2) - (long long )z >= 0LL) && (2LL + (long long )y$r_buff0_thd3) - (long long )z >= 0LL) && (2LL + (long long )y$r_buff1_thd0) - (long long )z >= 0LL) && (2LL + (long long )y$r_buff1_thd1) - (long long )z >= 0LL) && (2LL + (long long )y$r_buff1_thd2) - (long long )z >= 0LL) && (2LL + (long long )y$r_buff1_thd3) - (long long )z >= 0LL) && (2LL + (long long )y$read_delayed) - (long long )z >= 0LL) && (2LL + (long long )y$w_buff0) - (long long )z >= 0LL) && (2LL + (long long )y$w_buff1) - (long long )z >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )z >= 0LL) && (2LL + (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) && (2LL - (long long )y$r_buff0_thd0) - (long long )z >= 0LL) && (2LL - (long long )y$r_buff0_thd1) - (long long )z >= 0LL) && (2LL - (long long )y$r_buff0_thd2) - (long long )z >= 0LL) && (2LL - (long long )y$r_buff1_thd0) - (long long )z >= 0LL) && (2LL - (long long )y$r_buff1_thd1) - (long long )z >= 0LL) && (2LL - (long long )y$r_buff1_thd2) - (long long )z >= 0LL) && (2LL - (long long )y$read_delayed) - (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 )main$tmp_guard1 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$read_delayed >= 0LL) && (long long )x - (long long )y$r_buff0_thd0 >= 0LL) && (long long )x - (long long )y$r_buff0_thd1 >= 0LL) && (long long )x - (long long )y$r_buff0_thd2 >= 0LL) && (long long )x - (long long )y$r_buff1_thd0 >= 0LL) && (long long )x - (long long )y$r_buff1_thd1 >= 0LL) && (long long )x - (long long )y$r_buff1_thd2 >= 0LL) && (long long )x - (long long )y$read_delayed >= 0LL) && (long long )y - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y - (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd3 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 1) && (y$mem_tmp == 0 || y$mem_tmp == 1)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p1_EAX) && 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) && x <= 1) && y <= 1) && y$mem_tmp <= 1) && y$w_buff0 <= 1) && y$w_buff1 <= 1) && z <= 2) && z <= 127) && 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)) && (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) || z == 2)))) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= y$w_buff1 && y$w_buff1 <= 1) && (y$w_buff1 == 0 || y$w_buff1 == 1)))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || ((0 <= y$w_buff0 && y$w_buff0 <= 1) && (y$w_buff0 == 0 || y$w_buff0 == 1)))) && (! multithreaded || (((0 <= z && z <= 2) && z <= 127) && ((z == 0 || z == 1) || z == 2)))
[2024-06-04 18:13:12,310 INFO  L103   edCorrectnessWitness]: ghost_variable multithreaded = 0
[2024-06-04 18:13:12,310 INFO  L106   edCorrectnessWitness]: ghost_update [L828-L828] multithreaded = 1;
[2024-06-04 18:13:12,347 INFO  L177         MainTranslator]: Built tables and reachable declarations
[2024-06-04 18:13:12,556 INFO  L207          PostProcessor]: Analyzing one entry point: main
[2024-06-04 18:13:12,571 INFO  L202         MainTranslator]: Completed pre-run
Start Parsing Local
Start Parsing Local
Start Parsing Local
Start Parsing Local
Start Parsing Local
[2024-06-04 18:13:12,881 INFO  L207          PostProcessor]: Analyzing one entry point: main
[2024-06-04 18:13:12,914 INFO  L206         MainTranslator]: Completed translation
[2024-06-04 18:13:12,916 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 06:13:12 WrapperNode
[2024-06-04 18:13:12,917 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-06-04 18:13:12,918 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-06-04 18:13:12,918 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-06-04 18:13:12,918 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-06-04 18:13:12,923 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 06:13:12" (1/1) ...
[2024-06-04 18:13:12,959 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 06:13:12" (1/1) ...
[2024-06-04 18:13:13,088 INFO  L138                Inliner]: procedures = 175, calls = 47, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 125
[2024-06-04 18:13:13,089 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-06-04 18:13:13,090 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-06-04 18:13:13,090 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-06-04 18:13:13,090 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-06-04 18:13:13,099 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 06:13:12" (1/1) ...
[2024-06-04 18:13:13,099 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 06:13:12" (1/1) ...
[2024-06-04 18:13:13,128 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 06:13:12" (1/1) ...
[2024-06-04 18:13:13,165 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-04 18:13:13,165 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 06:13:12" (1/1) ...
[2024-06-04 18:13:13,165 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 06:13:12" (1/1) ...
[2024-06-04 18:13:13,193 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 06:13:12" (1/1) ...
[2024-06-04 18:13:13,195 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 06:13:12" (1/1) ...
[2024-06-04 18:13:13,208 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 06:13:12" (1/1) ...
[2024-06-04 18:13:13,213 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 06:13:12" (1/1) ...
[2024-06-04 18:13:13,273 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-06-04 18:13:13,274 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-06-04 18:13:13,274 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-06-04 18:13:13,274 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-06-04 18:13:13,274 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 06:13:12" (1/1) ...
[2024-06-04 18:13:13,288 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-06-04 18:13:13,296 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-06-04 18:13:13,310 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-04 18:13:13,316 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-04 18:13:13,345 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2024-06-04 18:13:13,346 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-06-04 18:13:13,346 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2024-06-04 18:13:13,346 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2024-06-04 18:13:13,346 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2024-06-04 18:13:13,346 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2024-06-04 18:13:13,347 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2024-06-04 18:13:13,347 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2024-06-04 18:13:13,347 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-06-04 18:13:13,347 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2024-06-04 18:13:13,347 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-06-04 18:13:13,347 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-06-04 18:13:13,348 WARN  L214             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement
[2024-06-04 18:13:13,438 INFO  L244             CfgBuilder]: Building ICFG
[2024-06-04 18:13:13,440 INFO  L270             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-06-04 18:13:14,434 INFO  L289             CfgBuilder]: Ommited future-live optimization because the input is a concurrent program.
[2024-06-04 18:13:14,436 INFO  L293             CfgBuilder]: Performing block encoding
[2024-06-04 18:13:14,678 INFO  L315             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-06-04 18:13:14,678 INFO  L320             CfgBuilder]: Removed 0 assume(true) statements.
[2024-06-04 18:13:14,680 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.06 06:13:14 BoogieIcfgContainer
[2024-06-04 18:13:14,680 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-06-04 18:13:14,682 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-06-04 18:13:14,682 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-06-04 18:13:14,685 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-06-04 18:13:14,685 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 06:13:10" (1/4) ...
[2024-06-04 18:13:14,687 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@718127ab and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 04.06 06:13:14, skipping insertion in model container
[2024-06-04 18:13:14,687 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.06 06:13:12" (2/4) ...
[2024-06-04 18:13:14,688 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@718127ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.06 06:13:14, skipping insertion in model container
[2024-06-04 18:13:14,688 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 06:13:12" (3/4) ...
[2024-06-04 18:13:14,688 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@718127ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.06 06:13:14, skipping insertion in model container
[2024-06-04 18:13:14,689 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.06 06:13:14" (4/4) ...
[2024-06-04 18:13:14,690 INFO  L112   eAbstractionObserver]: Analyzing ICFG safe034_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i
[2024-06-04 18:13:14,703 INFO  L204   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-06-04 18:13:14,703 INFO  L163   ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations.
[2024-06-04 18:13:14,704 INFO  L522   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-06-04 18:13:14,793 INFO  L144    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-06-04 18:13:14,823 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 53 places, 43 transitions, 98 flow
[2024-06-04 18:13:14,873 INFO  L124   PetriNetUnfolderBase]: 0/40 cut-off events.
[2024-06-04 18:13:14,873 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-06-04 18:13:14,904 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 5. Compared 73 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-04 18:13:14,904 INFO  L82        GeneralOperation]: Start removeDead. Operand has 53 places, 43 transitions, 98 flow
[2024-06-04 18:13:14,906 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 44 places, 34 transitions, 77 flow
[2024-06-04 18:13:14,930 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-06-04 18:13:14,938 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;@7d8feda2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-06-04 18:13:14,938 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2024-06-04 18:13:14,947 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-06-04 18:13:14,947 INFO  L124   PetriNetUnfolderBase]: 0/7 cut-off events.
[2024-06-04 18:13:14,948 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-06-04 18:13:14,948 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:13:14,949 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1]
[2024-06-04 18:13:14,949 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-04 18:13:14,954 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:13:14,954 INFO  L85        PathProgramCache]: Analyzing trace with hash -1738321291, now seen corresponding path program 1 times
[2024-06-04 18:13:14,964 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:13:14,964 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753458031]
[2024-06-04 18:13:14,964 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:13:14,965 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:13:15,323 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:13:19,726 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:13:19,727 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:13:19,727 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753458031]
[2024-06-04 18:13:19,728 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753458031] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:13:19,728 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:13:19,729 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-06-04 18:13:19,730 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013060975]
[2024-06-04 18:13:19,730 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:13:19,736 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-06-04 18:13:19,740 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:13:19,771 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-06-04 18:13:19,771 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-06-04 18:13:19,851 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 14 out of 43
[2024-06-04 18:13:19,853 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-04 18:13:19,853 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:13:19,853 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 43
[2024-06-04 18:13:19,854 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:13:20,562 INFO  L124   PetriNetUnfolderBase]: 869/1382 cut-off events.
[2024-06-04 18:13:20,562 INFO  L125   PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES.
[2024-06-04 18:13:20,566 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2762 conditions, 1382 events. 869/1382 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 7076 event pairs, 566 based on Foata normal form. 1/1341 useless extension candidates. Maximal degree in co-relation 2747. Up to 1315 conditions per place. 
[2024-06-04 18:13:20,573 INFO  L140   encePairwiseOnDemand]: 36/43 looper letters, 32 selfloop transitions, 4 changer transitions 0/44 dead transitions.
[2024-06-04 18:13:20,573 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 44 transitions, 175 flow
[2024-06-04 18:13:20,574 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-06-04 18:13:20,576 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-06-04 18:13:20,581 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 81 transitions.
[2024-06-04 18:13:20,582 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.627906976744186
[2024-06-04 18:13:20,583 INFO  L175             Difference]: Start difference. First operand has 44 places, 34 transitions, 77 flow. Second operand 3 states and 81 transitions.
[2024-06-04 18:13:20,584 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 44 transitions, 175 flow
[2024-06-04 18:13:20,586 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 44 transitions, 170 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-06-04 18:13:20,587 INFO  L231             Difference]: Finished difference. Result has 44 places, 37 transitions, 104 flow
[2024-06-04 18:13:20,589 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-04 18:13:20,591 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 0 predicate places.
[2024-06-04 18:13:20,591 INFO  L495      AbstractCegarLoop]: Abstraction has has 44 places, 37 transitions, 104 flow
[2024-06-04 18:13:20,591 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-04 18:13:20,591 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:13:20,592 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:13:20,592 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-06-04 18:13:20,592 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-04 18:13:20,592 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:13:20,593 INFO  L85        PathProgramCache]: Analyzing trace with hash 215566164, now seen corresponding path program 1 times
[2024-06-04 18:13:20,593 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:13:20,593 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429078603]
[2024-06-04 18:13:20,593 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:13:20,593 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:13:20,637 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:13:23,781 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:13:23,782 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:13:23,783 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429078603]
[2024-06-04 18:13:23,783 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429078603] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:13:23,783 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:13:23,783 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-06-04 18:13:23,783 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636820152]
[2024-06-04 18:13:23,784 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:13:23,785 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-06-04 18:13:23,785 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:13:23,786 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-06-04 18:13:23,786 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-06-04 18:13:23,876 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 14 out of 43
[2024-06-04 18:13:23,876 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 37 transitions, 104 flow. Second operand  has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:13:23,876 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:13:23,876 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 43
[2024-06-04 18:13:23,876 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:13:24,390 INFO  L124   PetriNetUnfolderBase]: 863/1369 cut-off events.
[2024-06-04 18:13:24,390 INFO  L125   PetriNetUnfolderBase]: For 300/300 co-relation queries the response was YES.
[2024-06-04 18:13:24,393 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 3146 conditions, 1369 events. 863/1369 cut-off events. For 300/300 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 6950 event pairs, 486 based on Foata normal form. 3/1360 useless extension candidates. Maximal degree in co-relation 3131. Up to 1291 conditions per place. 
[2024-06-04 18:13:24,399 INFO  L140   encePairwiseOnDemand]: 35/43 looper letters, 39 selfloop transitions, 7 changer transitions 0/54 dead transitions.
[2024-06-04 18:13:24,400 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 54 transitions, 242 flow
[2024-06-04 18:13:24,400 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-06-04 18:13:24,400 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-06-04 18:13:24,402 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 105 transitions.
[2024-06-04 18:13:24,402 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.6104651162790697
[2024-06-04 18:13:24,402 INFO  L175             Difference]: Start difference. First operand has 44 places, 37 transitions, 104 flow. Second operand 4 states and 105 transitions.
[2024-06-04 18:13:24,402 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 54 transitions, 242 flow
[2024-06-04 18:13:24,403 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 54 transitions, 238 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-06-04 18:13:24,406 INFO  L231             Difference]: Finished difference. Result has 47 places, 40 transitions, 140 flow
[2024-06-04 18:13:24,406 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-04 18:13:24,406 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 3 predicate places.
[2024-06-04 18:13:24,407 INFO  L495      AbstractCegarLoop]: Abstraction has has 47 places, 40 transitions, 140 flow
[2024-06-04 18:13:24,407 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:13:24,407 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:13:24,408 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:13:24,409 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-06-04 18:13:24,410 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:13:24,410 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:13:24,411 INFO  L85        PathProgramCache]: Analyzing trace with hash -109129976, now seen corresponding path program 1 times
[2024-06-04 18:13:24,411 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:13:24,416 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216867826]
[2024-06-04 18:13:24,416 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:13:24,416 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:13:24,454 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:13:32,633 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:13:32,633 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:13:32,634 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216867826]
[2024-06-04 18:13:32,634 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216867826] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:13:32,634 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:13:32,634 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-06-04 18:13:32,634 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123775948]
[2024-06-04 18:13:32,634 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:13:32,635 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-06-04 18:13:32,635 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:13:32,635 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-06-04 18:13:32,636 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2024-06-04 18:13:32,784 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43
[2024-06-04 18:13:32,785 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.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:13:32,785 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:13:32,785 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43
[2024-06-04 18:13:32,785 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:13:33,552 INFO  L124   PetriNetUnfolderBase]: 1094/1703 cut-off events.
[2024-06-04 18:13:33,552 INFO  L125   PetriNetUnfolderBase]: For 973/973 co-relation queries the response was YES.
[2024-06-04 18:13:33,555 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4356 conditions, 1703 events. 1094/1703 cut-off events. For 973/973 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 8362 event pairs, 637 based on Foata normal form. 4/1705 useless extension candidates. Maximal degree in co-relation 4339. Up to 1626 conditions per place. 
[2024-06-04 18:13:33,562 INFO  L140   encePairwiseOnDemand]: 35/43 looper letters, 40 selfloop transitions, 8 changer transitions 0/55 dead transitions.
[2024-06-04 18:13:33,562 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 55 transitions, 278 flow
[2024-06-04 18:13:33,562 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-04 18:13:33,562 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-04 18:13:33,565 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 107 transitions.
[2024-06-04 18:13:33,565 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.49767441860465117
[2024-06-04 18:13:33,565 INFO  L175             Difference]: Start difference. First operand has 47 places, 40 transitions, 140 flow. Second operand 5 states and 107 transitions.
[2024-06-04 18:13:33,566 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 55 transitions, 278 flow
[2024-06-04 18:13:33,567 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 55 transitions, 264 flow, removed 2 selfloop flow, removed 2 redundant places.
[2024-06-04 18:13:33,568 INFO  L231             Difference]: Finished difference. Result has 50 places, 43 transitions, 168 flow
[2024-06-04 18:13:33,568 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=168, PETRI_PLACES=50, PETRI_TRANSITIONS=43}
[2024-06-04 18:13:33,569 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 6 predicate places.
[2024-06-04 18:13:33,570 INFO  L495      AbstractCegarLoop]: Abstraction has has 50 places, 43 transitions, 168 flow
[2024-06-04 18:13:33,570 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:13:33,570 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:13:33,570 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:13:33,570 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-06-04 18:13:33,570 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:13:33,571 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:13:33,571 INFO  L85        PathProgramCache]: Analyzing trace with hash -396028654, now seen corresponding path program 1 times
[2024-06-04 18:13:33,571 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:13:33,571 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896403785]
[2024-06-04 18:13:33,571 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:13:33,571 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:13:33,639 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:13:36,870 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:13:36,872 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:13:36,875 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896403785]
[2024-06-04 18:13:36,875 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896403785] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:13:36,875 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:13:36,875 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-06-04 18:13:36,876 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971718489]
[2024-06-04 18:13:36,876 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:13:36,876 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-06-04 18:13:36,877 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:13:36,878 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-06-04 18:13:36,879 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2024-06-04 18:13:36,987 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 43
[2024-06-04 18:13:36,987 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 43 transitions, 168 flow. Second operand  has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:13:36,987 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:13:36,987 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 43
[2024-06-04 18:13:36,987 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:13:37,699 INFO  L124   PetriNetUnfolderBase]: 1085/1724 cut-off events.
[2024-06-04 18:13:37,700 INFO  L125   PetriNetUnfolderBase]: For 1686/1686 co-relation queries the response was YES.
[2024-06-04 18:13:37,704 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4761 conditions, 1724 events. 1085/1724 cut-off events. For 1686/1686 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 8638 event pairs, 369 based on Foata normal form. 6/1728 useless extension candidates. Maximal degree in co-relation 4742. Up to 1569 conditions per place. 
[2024-06-04 18:13:37,711 INFO  L140   encePairwiseOnDemand]: 34/43 looper letters, 54 selfloop transitions, 12 changer transitions 0/73 dead transitions.
[2024-06-04 18:13:37,711 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 73 transitions, 384 flow
[2024-06-04 18:13:37,712 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-04 18:13:37,713 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-04 18:13:37,714 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 144 transitions.
[2024-06-04 18:13:37,714 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5581395348837209
[2024-06-04 18:13:37,714 INFO  L175             Difference]: Start difference. First operand has 50 places, 43 transitions, 168 flow. Second operand 6 states and 144 transitions.
[2024-06-04 18:13:37,714 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 73 transitions, 384 flow
[2024-06-04 18:13:37,717 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 73 transitions, 366 flow, removed 3 selfloop flow, removed 3 redundant places.
[2024-06-04 18:13:37,718 INFO  L231             Difference]: Finished difference. Result has 53 places, 47 transitions, 209 flow
[2024-06-04 18:13:37,718 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=209, PETRI_PLACES=53, PETRI_TRANSITIONS=47}
[2024-06-04 18:13:37,719 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 9 predicate places.
[2024-06-04 18:13:37,719 INFO  L495      AbstractCegarLoop]: Abstraction has has 53 places, 47 transitions, 209 flow
[2024-06-04 18:13:37,720 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:13:37,720 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:13:37,720 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:13:37,720 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-06-04 18:13:37,720 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-04 18:13:37,720 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:13:37,720 INFO  L85        PathProgramCache]: Analyzing trace with hash -1801311321, now seen corresponding path program 1 times
[2024-06-04 18:13:37,721 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:13:37,721 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987265469]
[2024-06-04 18:13:37,721 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:13:37,721 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:13:37,755 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:13:45,998 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:13:45,999 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:13:45,999 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987265469]
[2024-06-04 18:13:45,999 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987265469] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:13:45,999 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:13:45,999 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-04 18:13:45,999 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672292678]
[2024-06-04 18:13:45,999 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:13:45,999 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-04 18:13:46,000 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:13:46,000 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-04 18:13:46,000 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2024-06-04 18:13:46,084 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43
[2024-06-04 18:13:46,085 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 47 transitions, 209 flow. Second operand  has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 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-04 18:13:46,085 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:13:46,085 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43
[2024-06-04 18:13:46,085 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:13:46,976 INFO  L124   PetriNetUnfolderBase]: 1107/1760 cut-off events.
[2024-06-04 18:13:46,977 INFO  L125   PetriNetUnfolderBase]: For 2759/2759 co-relation queries the response was YES.
[2024-06-04 18:13:46,979 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5299 conditions, 1760 events. 1107/1760 cut-off events. For 2759/2759 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 8888 event pairs, 429 based on Foata normal form. 4/1760 useless extension candidates. Maximal degree in co-relation 5279. Up to 1581 conditions per place. 
[2024-06-04 18:13:46,986 INFO  L140   encePairwiseOnDemand]: 34/43 looper letters, 53 selfloop transitions, 16 changer transitions 0/76 dead transitions.
[2024-06-04 18:13:46,986 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 76 transitions, 455 flow
[2024-06-04 18:13:46,986 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-04 18:13:46,987 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-04 18:13:46,987 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 134 transitions.
[2024-06-04 18:13:46,987 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5193798449612403
[2024-06-04 18:13:46,987 INFO  L175             Difference]: Start difference. First operand has 53 places, 47 transitions, 209 flow. Second operand 6 states and 134 transitions.
[2024-06-04 18:13:46,987 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 76 transitions, 455 flow
[2024-06-04 18:13:46,989 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 76 transitions, 426 flow, removed 5 selfloop flow, removed 3 redundant places.
[2024-06-04 18:13:46,990 INFO  L231             Difference]: Finished difference. Result has 56 places, 53 transitions, 262 flow
[2024-06-04 18:13:46,990 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=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=262, PETRI_PLACES=56, PETRI_TRANSITIONS=53}
[2024-06-04 18:13:46,991 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 12 predicate places.
[2024-06-04 18:13:46,991 INFO  L495      AbstractCegarLoop]: Abstraction has has 56 places, 53 transitions, 262 flow
[2024-06-04 18:13:46,991 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 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-04 18:13:46,991 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:13:46,991 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:13:46,991 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-06-04 18:13:46,992 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-04 18:13:46,992 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:13:46,992 INFO  L85        PathProgramCache]: Analyzing trace with hash -1221764151, now seen corresponding path program 2 times
[2024-06-04 18:13:46,992 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:13:46,992 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794745614]
[2024-06-04 18:13:46,992 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:13:46,992 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:13:47,015 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:13:54,647 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:13:54,647 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:13:54,648 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794745614]
[2024-06-04 18:13:54,648 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794745614] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:13:54,648 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:13:54,648 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-04 18:13:54,648 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968155214]
[2024-06-04 18:13:54,648 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:13:54,648 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-04 18:13:54,648 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:13:54,649 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-04 18:13:54,649 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2024-06-04 18:13:54,725 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43
[2024-06-04 18:13:54,726 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 53 transitions, 262 flow. Second operand  has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 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-04 18:13:54,726 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:13:54,726 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43
[2024-06-04 18:13:54,726 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:13:55,574 INFO  L124   PetriNetUnfolderBase]: 1097/1747 cut-off events.
[2024-06-04 18:13:55,574 INFO  L125   PetriNetUnfolderBase]: For 3950/3950 co-relation queries the response was YES.
[2024-06-04 18:13:55,577 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5660 conditions, 1747 events. 1097/1747 cut-off events. For 3950/3950 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 8753 event pairs, 437 based on Foata normal form. 4/1747 useless extension candidates. Maximal degree in co-relation 5638. Up to 1573 conditions per place. 
[2024-06-04 18:13:55,584 INFO  L140   encePairwiseOnDemand]: 34/43 looper letters, 47 selfloop transitions, 16 changer transitions 0/70 dead transitions.
[2024-06-04 18:13:55,585 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 70 transitions, 430 flow
[2024-06-04 18:13:55,585 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-04 18:13:55,585 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-04 18:13:55,586 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 128 transitions.
[2024-06-04 18:13:55,586 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.49612403100775193
[2024-06-04 18:13:55,586 INFO  L175             Difference]: Start difference. First operand has 56 places, 53 transitions, 262 flow. Second operand 6 states and 128 transitions.
[2024-06-04 18:13:55,586 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 70 transitions, 430 flow
[2024-06-04 18:13:55,590 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 70 transitions, 400 flow, removed 11 selfloop flow, removed 2 redundant places.
[2024-06-04 18:13:55,591 INFO  L231             Difference]: Finished difference. Result has 60 places, 53 transitions, 272 flow
[2024-06-04 18:13:55,591 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=272, PETRI_PLACES=60, PETRI_TRANSITIONS=53}
[2024-06-04 18:13:55,591 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 16 predicate places.
[2024-06-04 18:13:55,591 INFO  L495      AbstractCegarLoop]: Abstraction has has 60 places, 53 transitions, 272 flow
[2024-06-04 18:13:55,592 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 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-04 18:13:55,592 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:13:55,592 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:13:55,592 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-06-04 18:13:55,592 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:13:55,592 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:13:55,593 INFO  L85        PathProgramCache]: Analyzing trace with hash -1016207211, now seen corresponding path program 1 times
[2024-06-04 18:13:55,593 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:13:55,593 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27627671]
[2024-06-04 18:13:55,593 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:13:55,593 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:13:55,630 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:14:04,040 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:14:04,041 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:14:04,041 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27627671]
[2024-06-04 18:14:04,041 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27627671] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:14:04,041 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:14:04,041 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-04 18:14:04,041 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806141746]
[2024-06-04 18:14:04,042 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:14:04,042 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-04 18:14:04,042 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:14:04,042 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-04 18:14:04,042 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2024-06-04 18:14:04,165 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 43
[2024-06-04 18:14:04,166 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 53 transitions, 272 flow. Second operand  has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 7 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:14:04,166 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:14:04,166 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 43
[2024-06-04 18:14:04,166 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:14:04,798 INFO  L124   PetriNetUnfolderBase]: 1019/1657 cut-off events.
[2024-06-04 18:14:04,799 INFO  L125   PetriNetUnfolderBase]: For 4335/4335 co-relation queries the response was YES.
[2024-06-04 18:14:04,803 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5469 conditions, 1657 events. 1019/1657 cut-off events. For 4335/4335 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 8370 event pairs, 458 based on Foata normal form. 1/1656 useless extension candidates. Maximal degree in co-relation 5445. Up to 1516 conditions per place. 
[2024-06-04 18:14:04,809 INFO  L140   encePairwiseOnDemand]: 36/43 looper letters, 45 selfloop transitions, 8 changer transitions 0/64 dead transitions.
[2024-06-04 18:14:04,810 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 64 transitions, 414 flow
[2024-06-04 18:14:04,810 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-04 18:14:04,810 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-04 18:14:04,810 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 105 transitions.
[2024-06-04 18:14:04,811 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4883720930232558
[2024-06-04 18:14:04,811 INFO  L175             Difference]: Start difference. First operand has 60 places, 53 transitions, 272 flow. Second operand 5 states and 105 transitions.
[2024-06-04 18:14:04,811 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 64 transitions, 414 flow
[2024-06-04 18:14:04,813 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 64 transitions, 370 flow, removed 2 selfloop flow, removed 6 redundant places.
[2024-06-04 18:14:04,814 INFO  L231             Difference]: Finished difference. Result has 59 places, 56 transitions, 272 flow
[2024-06-04 18:14:04,814 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=272, PETRI_PLACES=59, PETRI_TRANSITIONS=56}
[2024-06-04 18:14:04,815 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 15 predicate places.
[2024-06-04 18:14:04,815 INFO  L495      AbstractCegarLoop]: Abstraction has has 59 places, 56 transitions, 272 flow
[2024-06-04 18:14:04,815 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 7 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:14:04,815 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:14:04,815 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:14:04,815 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-06-04 18:14:04,816 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:14:04,816 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:14:04,816 INFO  L85        PathProgramCache]: Analyzing trace with hash -193072058, now seen corresponding path program 1 times
[2024-06-04 18:14:04,816 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:14:04,816 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117199260]
[2024-06-04 18:14:04,816 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:14:04,816 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:14:04,841 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:14:14,535 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:14:14,535 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:14:14,536 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117199260]
[2024-06-04 18:14:14,536 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117199260] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:14:14,536 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:14:14,536 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 18:14:14,536 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64258280]
[2024-06-04 18:14:14,536 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:14:14,536 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 18:14:14,537 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:14:14,537 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 18:14:14,537 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-04 18:14:14,671 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43
[2024-06-04 18:14:14,671 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 56 transitions, 272 flow. Second operand  has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:14:14,671 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:14:14,671 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43
[2024-06-04 18:14:14,671 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:14:15,452 INFO  L124   PetriNetUnfolderBase]: 1116/1778 cut-off events.
[2024-06-04 18:14:15,453 INFO  L125   PetriNetUnfolderBase]: For 5695/5695 co-relation queries the response was YES.
[2024-06-04 18:14:15,456 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6153 conditions, 1778 events. 1116/1778 cut-off events. For 5695/5695 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 8962 event pairs, 444 based on Foata normal form. 4/1780 useless extension candidates. Maximal degree in co-relation 6129. Up to 1609 conditions per place. 
[2024-06-04 18:14:15,464 INFO  L140   encePairwiseOnDemand]: 33/43 looper letters, 55 selfloop transitions, 16 changer transitions 0/78 dead transitions.
[2024-06-04 18:14:15,464 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 78 transitions, 484 flow
[2024-06-04 18:14:15,466 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-04 18:14:15,466 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-04 18:14:15,466 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 130 transitions.
[2024-06-04 18:14:15,466 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5038759689922481
[2024-06-04 18:14:15,466 INFO  L175             Difference]: Start difference. First operand has 59 places, 56 transitions, 272 flow. Second operand 6 states and 130 transitions.
[2024-06-04 18:14:15,466 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 78 transitions, 484 flow
[2024-06-04 18:14:15,469 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 78 transitions, 462 flow, removed 5 selfloop flow, removed 3 redundant places.
[2024-06-04 18:14:15,470 INFO  L231             Difference]: Finished difference. Result has 62 places, 59 transitions, 322 flow
[2024-06-04 18:14:15,470 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=322, PETRI_PLACES=62, PETRI_TRANSITIONS=59}
[2024-06-04 18:14:15,471 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 18 predicate places.
[2024-06-04 18:14:15,471 INFO  L495      AbstractCegarLoop]: Abstraction has has 62 places, 59 transitions, 322 flow
[2024-06-04 18:14:15,471 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:14:15,471 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:14:15,471 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:14:15,471 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-06-04 18:14:15,471 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-04 18:14:15,472 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:14:15,472 INFO  L85        PathProgramCache]: Analyzing trace with hash -192952088, now seen corresponding path program 2 times
[2024-06-04 18:14:15,472 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:14:15,472 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938129249]
[2024-06-04 18:14:15,472 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:14:15,472 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:14:15,494 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:14:24,932 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:14:24,932 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:14:24,932 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938129249]
[2024-06-04 18:14:24,932 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938129249] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:14:24,932 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:14:24,932 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 18:14:24,932 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114405241]
[2024-06-04 18:14:24,933 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:14:24,933 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 18:14:24,933 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:14:24,933 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 18:14:24,933 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2024-06-04 18:14:25,045 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43
[2024-06-04 18:14:25,045 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 59 transitions, 322 flow. Second operand  has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:14:25,045 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:14:25,045 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43
[2024-06-04 18:14:25,045 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:14:25,904 INFO  L124   PetriNetUnfolderBase]: 1138/1816 cut-off events.
[2024-06-04 18:14:25,904 INFO  L125   PetriNetUnfolderBase]: For 7129/7129 co-relation queries the response was YES.
[2024-06-04 18:14:25,907 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6774 conditions, 1816 events. 1138/1816 cut-off events. For 7129/7129 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 9137 event pairs, 396 based on Foata normal form. 4/1818 useless extension candidates. Maximal degree in co-relation 6749. Up to 1548 conditions per place. 
[2024-06-04 18:14:25,913 INFO  L140   encePairwiseOnDemand]: 33/43 looper letters, 63 selfloop transitions, 27 changer transitions 0/97 dead transitions.
[2024-06-04 18:14:25,914 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 97 transitions, 666 flow
[2024-06-04 18:14:25,916 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:14:25,916 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:14:25,916 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 174 transitions.
[2024-06-04 18:14:25,916 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5058139534883721
[2024-06-04 18:14:25,916 INFO  L175             Difference]: Start difference. First operand has 62 places, 59 transitions, 322 flow. Second operand 8 states and 174 transitions.
[2024-06-04 18:14:25,917 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 97 transitions, 666 flow
[2024-06-04 18:14:25,921 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 97 transitions, 618 flow, removed 10 selfloop flow, removed 5 redundant places.
[2024-06-04 18:14:25,922 INFO  L231             Difference]: Finished difference. Result has 65 places, 65 transitions, 402 flow
[2024-06-04 18:14:25,922 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=402, PETRI_PLACES=65, PETRI_TRANSITIONS=65}
[2024-06-04 18:14:25,923 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 21 predicate places.
[2024-06-04 18:14:25,923 INFO  L495      AbstractCegarLoop]: Abstraction has has 65 places, 65 transitions, 402 flow
[2024-06-04 18:14:25,923 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:14:25,923 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:14:25,923 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:14:25,923 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-06-04 18:14:25,923 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-04 18:14:25,924 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:14:25,924 INFO  L85        PathProgramCache]: Analyzing trace with hash 1922978886, now seen corresponding path program 3 times
[2024-06-04 18:14:25,924 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:14:25,924 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493363148]
[2024-06-04 18:14:25,924 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:14:25,924 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:14:25,946 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:14:35,282 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:14:35,282 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:14:35,282 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493363148]
[2024-06-04 18:14:35,282 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493363148] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:14:35,282 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:14:35,282 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 18:14:35,283 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338198523]
[2024-06-04 18:14:35,283 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:14:35,283 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 18:14:35,283 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:14:35,283 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 18:14:35,284 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2024-06-04 18:14:35,404 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43
[2024-06-04 18:14:35,404 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 65 transitions, 402 flow. Second operand  has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:14:35,404 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:14:35,405 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43
[2024-06-04 18:14:35,405 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:14:36,167 INFO  L124   PetriNetUnfolderBase]: 1128/1802 cut-off events.
[2024-06-04 18:14:36,167 INFO  L125   PetriNetUnfolderBase]: For 7877/7877 co-relation queries the response was YES.
[2024-06-04 18:14:36,171 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6955 conditions, 1802 events. 1128/1802 cut-off events. For 7877/7877 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 9084 event pairs, 401 based on Foata normal form. 4/1804 useless extension candidates. Maximal degree in co-relation 6930. Up to 1540 conditions per place. 
[2024-06-04 18:14:36,178 INFO  L140   encePairwiseOnDemand]: 33/43 looper letters, 60 selfloop transitions, 27 changer transitions 0/94 dead transitions.
[2024-06-04 18:14:36,178 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 94 transitions, 648 flow
[2024-06-04 18:14:36,178 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:14:36,179 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:14:36,179 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 171 transitions.
[2024-06-04 18:14:36,179 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.49709302325581395
[2024-06-04 18:14:36,179 INFO  L175             Difference]: Start difference. First operand has 65 places, 65 transitions, 402 flow. Second operand 8 states and 171 transitions.
[2024-06-04 18:14:36,179 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 94 transitions, 648 flow
[2024-06-04 18:14:36,185 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 94 transitions, 594 flow, removed 18 selfloop flow, removed 4 redundant places.
[2024-06-04 18:14:36,186 INFO  L231             Difference]: Finished difference. Result has 69 places, 65 transitions, 410 flow
[2024-06-04 18:14:36,186 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=348, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=410, PETRI_PLACES=69, PETRI_TRANSITIONS=65}
[2024-06-04 18:14:36,187 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 25 predicate places.
[2024-06-04 18:14:36,187 INFO  L495      AbstractCegarLoop]: Abstraction has has 69 places, 65 transitions, 410 flow
[2024-06-04 18:14:36,187 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:14:36,187 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:14:36,187 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:14:36,187 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-06-04 18:14:36,188 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-04 18:14:36,188 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:14:36,188 INFO  L85        PathProgramCache]: Analyzing trace with hash 1931567622, now seen corresponding path program 1 times
[2024-06-04 18:14:36,188 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:14:36,188 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979883213]
[2024-06-04 18:14:36,188 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:14:36,188 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:14:36,238 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:14:44,029 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:14:44,030 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:14:44,030 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979883213]
[2024-06-04 18:14:44,030 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979883213] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:14:44,031 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:14:44,031 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 18:14:44,031 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397303059]
[2024-06-04 18:14:44,031 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:14:44,031 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 18:14:44,031 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:14:44,033 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 18:14:44,033 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-04 18:14:44,131 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43
[2024-06-04 18:14:44,132 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 65 transitions, 410 flow. Second operand  has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:14:44,132 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:14:44,132 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43
[2024-06-04 18:14:44,132 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:14:44,977 INFO  L124   PetriNetUnfolderBase]: 1120/1790 cut-off events.
[2024-06-04 18:14:44,977 INFO  L125   PetriNetUnfolderBase]: For 9080/9080 co-relation queries the response was YES.
[2024-06-04 18:14:44,980 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7075 conditions, 1790 events. 1120/1790 cut-off events. For 9080/9080 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 8978 event pairs, 408 based on Foata normal form. 4/1792 useless extension candidates. Maximal degree in co-relation 7048. Up to 1645 conditions per place. 
[2024-06-04 18:14:44,985 INFO  L140   encePairwiseOnDemand]: 34/43 looper letters, 70 selfloop transitions, 13 changer transitions 0/90 dead transitions.
[2024-06-04 18:14:44,985 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 90 transitions, 669 flow
[2024-06-04 18:14:44,996 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 18:14:44,996 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 18:14:44,996 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 143 transitions.
[2024-06-04 18:14:44,997 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4750830564784053
[2024-06-04 18:14:44,997 INFO  L175             Difference]: Start difference. First operand has 69 places, 65 transitions, 410 flow. Second operand 7 states and 143 transitions.
[2024-06-04 18:14:44,997 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 90 transitions, 669 flow
[2024-06-04 18:14:45,002 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 90 transitions, 594 flow, removed 4 selfloop flow, removed 7 redundant places.
[2024-06-04 18:14:45,003 INFO  L231             Difference]: Finished difference. Result has 70 places, 70 transitions, 421 flow
[2024-06-04 18:14:45,003 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=340, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=421, PETRI_PLACES=70, PETRI_TRANSITIONS=70}
[2024-06-04 18:14:45,003 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 26 predicate places.
[2024-06-04 18:14:45,004 INFO  L495      AbstractCegarLoop]: Abstraction has has 70 places, 70 transitions, 421 flow
[2024-06-04 18:14:45,004 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:14:45,004 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:14:45,004 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:14:45,004 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-06-04 18:14:45,004 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:14:45,005 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:14:45,005 INFO  L85        PathProgramCache]: Analyzing trace with hash -1451950613, now seen corresponding path program 1 times
[2024-06-04 18:14:45,005 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:14:45,005 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956932454]
[2024-06-04 18:14:45,005 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:14:45,005 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:14:45,042 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:14:52,905 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:14:52,905 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:14:52,905 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956932454]
[2024-06-04 18:14:52,905 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956932454] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:14:52,905 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:14:52,905 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-04 18:14:52,905 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32060558]
[2024-06-04 18:14:52,905 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:14:52,906 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-04 18:14:52,906 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:14:52,906 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-04 18:14:52,906 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2024-06-04 18:14:53,040 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 43
[2024-06-04 18:14:53,053 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 70 transitions, 421 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-04 18:14:53,053 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:14:53,053 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 43
[2024-06-04 18:14:53,053 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:14:53,599 INFO  L124   PetriNetUnfolderBase]: 1027/1666 cut-off events.
[2024-06-04 18:14:53,599 INFO  L125   PetriNetUnfolderBase]: For 10472/10487 co-relation queries the response was YES.
[2024-06-04 18:14:53,603 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6951 conditions, 1666 events. 1027/1666 cut-off events. For 10472/10487 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 8534 event pairs, 411 based on Foata normal form. 14/1662 useless extension candidates. Maximal degree in co-relation 6922. Up to 1493 conditions per place. 
[2024-06-04 18:14:53,608 INFO  L140   encePairwiseOnDemand]: 34/43 looper letters, 58 selfloop transitions, 19 changer transitions 0/88 dead transitions.
[2024-06-04 18:14:53,608 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 88 transitions, 673 flow
[2024-06-04 18:14:53,609 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-04 18:14:53,609 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-04 18:14:53,609 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 127 transitions.
[2024-06-04 18:14:53,609 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.49224806201550386
[2024-06-04 18:14:53,609 INFO  L175             Difference]: Start difference. First operand has 70 places, 70 transitions, 421 flow. Second operand 6 states and 127 transitions.
[2024-06-04 18:14:53,610 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 88 transitions, 673 flow
[2024-06-04 18:14:53,615 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 88 transitions, 632 flow, removed 10 selfloop flow, removed 4 redundant places.
[2024-06-04 18:14:53,616 INFO  L231             Difference]: Finished difference. Result has 73 places, 78 transitions, 500 flow
[2024-06-04 18:14:53,616 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=380, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=500, PETRI_PLACES=73, PETRI_TRANSITIONS=78}
[2024-06-04 18:14:53,617 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 29 predicate places.
[2024-06-04 18:14:53,617 INFO  L495      AbstractCegarLoop]: Abstraction has has 73 places, 78 transitions, 500 flow
[2024-06-04 18:14:53,617 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-04 18:14:53,617 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:14:53,617 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:14:53,618 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-06-04 18:14:53,618 INFO  L420      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:14:53,618 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:14:53,618 INFO  L85        PathProgramCache]: Analyzing trace with hash -573947114, now seen corresponding path program 1 times
[2024-06-04 18:14:53,618 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:14:53,618 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555774273]
[2024-06-04 18:14:53,618 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:14:53,619 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:14:53,653 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:15:02,679 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:15:02,679 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:15:02,679 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555774273]
[2024-06-04 18:15:02,679 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555774273] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:15:02,679 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:15:02,679 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 18:15:02,679 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97251806]
[2024-06-04 18:15:02,680 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:15:02,680 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 18:15:02,680 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:15:02,680 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 18:15:02,680 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-04 18:15:02,811 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 43
[2024-06-04 18:15:02,812 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 78 transitions, 500 flow. Second operand  has 8 states, 8 states have (on average 14.75) internal successors, (118), 8 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:15:02,812 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:15:02,812 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 43
[2024-06-04 18:15:02,812 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:15:03,461 INFO  L124   PetriNetUnfolderBase]: 1056/1726 cut-off events.
[2024-06-04 18:15:03,462 INFO  L125   PetriNetUnfolderBase]: For 12639/12654 co-relation queries the response was YES.
[2024-06-04 18:15:03,465 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7690 conditions, 1726 events. 1056/1726 cut-off events. For 12639/12654 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 8849 event pairs, 410 based on Foata normal form. 13/1724 useless extension candidates. Maximal degree in co-relation 7659. Up to 1547 conditions per place. 
[2024-06-04 18:15:03,471 INFO  L140   encePairwiseOnDemand]: 33/43 looper letters, 75 selfloop transitions, 20 changer transitions 0/106 dead transitions.
[2024-06-04 18:15:03,471 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 106 transitions, 817 flow
[2024-06-04 18:15:03,471 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 18:15:03,472 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 18:15:03,472 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 149 transitions.
[2024-06-04 18:15:03,472 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4950166112956811
[2024-06-04 18:15:03,472 INFO  L175             Difference]: Start difference. First operand has 73 places, 78 transitions, 500 flow. Second operand 7 states and 149 transitions.
[2024-06-04 18:15:03,472 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 106 transitions, 817 flow
[2024-06-04 18:15:03,480 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 106 transitions, 776 flow, removed 13 selfloop flow, removed 2 redundant places.
[2024-06-04 18:15:03,481 INFO  L231             Difference]: Finished difference. Result has 79 places, 88 transitions, 603 flow
[2024-06-04 18:15:03,481 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=466, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=603, PETRI_PLACES=79, PETRI_TRANSITIONS=88}
[2024-06-04 18:15:03,482 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 35 predicate places.
[2024-06-04 18:15:03,482 INFO  L495      AbstractCegarLoop]: Abstraction has has 79 places, 88 transitions, 603 flow
[2024-06-04 18:15:03,482 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 14.75) internal successors, (118), 8 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:15:03,482 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:15:03,482 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:15:03,483 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2024-06-04 18:15:03,483 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-04 18:15:03,483 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:15:03,483 INFO  L85        PathProgramCache]: Analyzing trace with hash -1616178278, now seen corresponding path program 2 times
[2024-06-04 18:15:03,483 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:15:03,483 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812725965]
[2024-06-04 18:15:03,483 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:15:03,484 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:15:03,520 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:15:11,791 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:15:11,791 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:15:11,792 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812725965]
[2024-06-04 18:15:11,792 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812725965] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:15:11,792 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:15:11,792 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-04 18:15:11,792 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741352678]
[2024-06-04 18:15:11,792 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:15:11,792 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-04 18:15:11,792 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:15:11,793 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-04 18:15:11,793 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-06-04 18:15:11,894 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 43
[2024-06-04 18:15:11,894 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 88 transitions, 603 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-04 18:15:11,894 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:15:11,894 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 43
[2024-06-04 18:15:11,894 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:15:12,544 INFO  L124   PetriNetUnfolderBase]: 1058/1734 cut-off events.
[2024-06-04 18:15:12,544 INFO  L125   PetriNetUnfolderBase]: For 14292/14330 co-relation queries the response was YES.
[2024-06-04 18:15:12,548 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7940 conditions, 1734 events. 1058/1734 cut-off events. For 14292/14330 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 8954 event pairs, 408 based on Foata normal form. 13/1731 useless extension candidates. Maximal degree in co-relation 7906. Up to 1543 conditions per place. 
[2024-06-04 18:15:12,553 INFO  L140   encePairwiseOnDemand]: 35/43 looper letters, 73 selfloop transitions, 21 changer transitions 0/105 dead transitions.
[2024-06-04 18:15:12,553 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 105 transitions, 869 flow
[2024-06-04 18:15:12,553 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-04 18:15:12,554 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-04 18:15:12,554 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 128 transitions.
[2024-06-04 18:15:12,554 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.49612403100775193
[2024-06-04 18:15:12,554 INFO  L175             Difference]: Start difference. First operand has 79 places, 88 transitions, 603 flow. Second operand 6 states and 128 transitions.
[2024-06-04 18:15:12,554 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 105 transitions, 869 flow
[2024-06-04 18:15:12,562 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 105 transitions, 835 flow, removed 7 selfloop flow, removed 3 redundant places.
[2024-06-04 18:15:12,563 INFO  L231             Difference]: Finished difference. Result has 82 places, 91 transitions, 665 flow
[2024-06-04 18:15:12,563 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=569, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=665, PETRI_PLACES=82, PETRI_TRANSITIONS=91}
[2024-06-04 18:15:12,564 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 38 predicate places.
[2024-06-04 18:15:12,564 INFO  L495      AbstractCegarLoop]: Abstraction has has 82 places, 91 transitions, 665 flow
[2024-06-04 18:15:12,564 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-04 18:15:12,564 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:15:12,564 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:15:12,565 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2024-06-04 18:15:12,565 INFO  L420      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:15:12,565 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:15:12,565 INFO  L85        PathProgramCache]: Analyzing trace with hash -1617520268, now seen corresponding path program 3 times
[2024-06-04 18:15:12,565 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:15:12,565 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779925820]
[2024-06-04 18:15:12,565 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:15:12,566 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:15:12,602 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:15:20,552 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:15:20,553 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:15:20,553 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779925820]
[2024-06-04 18:15:20,553 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779925820] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:15:20,553 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:15:20,553 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-04 18:15:20,553 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220663258]
[2024-06-04 18:15:20,553 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:15:20,553 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-04 18:15:20,553 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:15:20,554 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-04 18:15:20,554 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2024-06-04 18:15:20,675 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 43
[2024-06-04 18:15:20,676 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 91 transitions, 665 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-04 18:15:20,676 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:15:20,676 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 43
[2024-06-04 18:15:20,676 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:15:21,260 INFO  L124   PetriNetUnfolderBase]: 1050/1710 cut-off events.
[2024-06-04 18:15:21,260 INFO  L125   PetriNetUnfolderBase]: For 16043/16063 co-relation queries the response was YES.
[2024-06-04 18:15:21,265 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7995 conditions, 1710 events. 1050/1710 cut-off events. For 16043/16063 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 8772 event pairs, 413 based on Foata normal form. 13/1700 useless extension candidates. Maximal degree in co-relation 7960. Up to 1508 conditions per place. 
[2024-06-04 18:15:21,270 INFO  L140   encePairwiseOnDemand]: 34/43 looper letters, 61 selfloop transitions, 28 changer transitions 0/100 dead transitions.
[2024-06-04 18:15:21,270 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 100 transitions, 869 flow
[2024-06-04 18:15:21,271 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-04 18:15:21,271 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-04 18:15:21,271 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 126 transitions.
[2024-06-04 18:15:21,271 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4883720930232558
[2024-06-04 18:15:21,271 INFO  L175             Difference]: Start difference. First operand has 82 places, 91 transitions, 665 flow. Second operand 6 states and 126 transitions.
[2024-06-04 18:15:21,271 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 100 transitions, 869 flow
[2024-06-04 18:15:21,281 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 100 transitions, 805 flow, removed 16 selfloop flow, removed 4 redundant places.
[2024-06-04 18:15:21,282 INFO  L231             Difference]: Finished difference. Result has 84 places, 91 transitions, 665 flow
[2024-06-04 18:15:21,282 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=601, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=665, PETRI_PLACES=84, PETRI_TRANSITIONS=91}
[2024-06-04 18:15:21,283 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 40 predicate places.
[2024-06-04 18:15:21,283 INFO  L495      AbstractCegarLoop]: Abstraction has has 84 places, 91 transitions, 665 flow
[2024-06-04 18:15:21,283 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-04 18:15:21,283 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:15:21,283 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:15:21,283 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2024-06-04 18:15:21,283 INFO  L420      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:15:21,284 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:15:21,284 INFO  L85        PathProgramCache]: Analyzing trace with hash -2067469644, now seen corresponding path program 1 times
[2024-06-04 18:15:21,284 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:15:21,284 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693945878]
[2024-06-04 18:15:21,284 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:15:21,284 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:15:21,318 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:15:30,412 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:15:30,413 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:15:30,413 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693945878]
[2024-06-04 18:15:30,415 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693945878] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:15:30,415 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:15:30,415 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 18:15:30,415 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938995589]
[2024-06-04 18:15:30,415 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:15:30,415 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 18:15:30,415 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:15:30,416 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 18:15:30,416 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-04 18:15:30,529 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43
[2024-06-04 18:15:30,530 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 91 transitions, 665 flow. Second operand  has 8 states, 8 states have (on average 13.75) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:15:30,530 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:15:30,530 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43
[2024-06-04 18:15:30,530 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:15:31,163 INFO  L124   PetriNetUnfolderBase]: 1169/1878 cut-off events.
[2024-06-04 18:15:31,164 INFO  L125   PetriNetUnfolderBase]: For 15733/15735 co-relation queries the response was YES.
[2024-06-04 18:15:31,168 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 8565 conditions, 1878 events. 1169/1878 cut-off events. For 15733/15735 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 9581 event pairs, 425 based on Foata normal form. 2/1878 useless extension candidates. Maximal degree in co-relation 8529. Up to 1738 conditions per place. 
[2024-06-04 18:15:31,174 INFO  L140   encePairwiseOnDemand]: 34/43 looper letters, 89 selfloop transitions, 11 changer transitions 0/107 dead transitions.
[2024-06-04 18:15:31,174 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 107 transitions, 933 flow
[2024-06-04 18:15:31,175 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-04 18:15:31,175 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-04 18:15:31,175 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 121 transitions.
[2024-06-04 18:15:31,175 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4689922480620155
[2024-06-04 18:15:31,175 INFO  L175             Difference]: Start difference. First operand has 84 places, 91 transitions, 665 flow. Second operand 6 states and 121 transitions.
[2024-06-04 18:15:31,175 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 107 transitions, 933 flow
[2024-06-04 18:15:31,186 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 107 transitions, 855 flow, removed 5 selfloop flow, removed 5 redundant places.
[2024-06-04 18:15:31,187 INFO  L231             Difference]: Finished difference. Result has 85 places, 94 transitions, 649 flow
[2024-06-04 18:15:31,187 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=587, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=649, PETRI_PLACES=85, PETRI_TRANSITIONS=94}
[2024-06-04 18:15:31,188 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 41 predicate places.
[2024-06-04 18:15:31,188 INFO  L495      AbstractCegarLoop]: Abstraction has has 85 places, 94 transitions, 649 flow
[2024-06-04 18:15:31,188 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 13.75) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:15:31,188 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:15:31,188 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:15:31,188 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2024-06-04 18:15:31,188 INFO  L420      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:15:31,189 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:15:31,189 INFO  L85        PathProgramCache]: Analyzing trace with hash -2060803404, now seen corresponding path program 2 times
[2024-06-04 18:15:31,189 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:15:31,189 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873335808]
[2024-06-04 18:15:31,189 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:15:31,189 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:15:31,221 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:15:39,874 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:15:39,875 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:15:39,875 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873335808]
[2024-06-04 18:15:39,875 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873335808] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:15:39,875 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:15:39,875 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 18:15:39,875 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124519924]
[2024-06-04 18:15:39,875 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:15:39,875 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 18:15:39,875 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:15:39,876 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 18:15:39,876 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-04 18:15:40,020 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43
[2024-06-04 18:15:40,021 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 94 transitions, 649 flow. Second operand  has 8 states, 8 states have (on average 13.75) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:15:40,021 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:15:40,021 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43
[2024-06-04 18:15:40,021 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:15:40,666 INFO  L124   PetriNetUnfolderBase]: 1171/1883 cut-off events.
[2024-06-04 18:15:40,667 INFO  L125   PetriNetUnfolderBase]: For 17823/17825 co-relation queries the response was YES.
[2024-06-04 18:15:40,671 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 8843 conditions, 1883 events. 1171/1883 cut-off events. For 17823/17825 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 9622 event pairs, 425 based on Foata normal form. 2/1883 useless extension candidates. Maximal degree in co-relation 8806. Up to 1732 conditions per place. 
[2024-06-04 18:15:40,677 INFO  L140   encePairwiseOnDemand]: 34/43 looper letters, 88 selfloop transitions, 17 changer transitions 0/112 dead transitions.
[2024-06-04 18:15:40,677 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 112 transitions, 939 flow
[2024-06-04 18:15:40,677 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 18:15:40,678 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 18:15:40,678 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 139 transitions.
[2024-06-04 18:15:40,678 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46179401993355484
[2024-06-04 18:15:40,678 INFO  L175             Difference]: Start difference. First operand has 85 places, 94 transitions, 649 flow. Second operand 7 states and 139 transitions.
[2024-06-04 18:15:40,678 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 112 transitions, 939 flow
[2024-06-04 18:15:40,691 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 112 transitions, 899 flow, removed 11 selfloop flow, removed 4 redundant places.
[2024-06-04 18:15:40,693 INFO  L231             Difference]: Finished difference. Result has 88 places, 97 transitions, 689 flow
[2024-06-04 18:15:40,693 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=609, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=689, PETRI_PLACES=88, PETRI_TRANSITIONS=97}
[2024-06-04 18:15:40,693 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 44 predicate places.
[2024-06-04 18:15:40,693 INFO  L495      AbstractCegarLoop]: Abstraction has has 88 places, 97 transitions, 689 flow
[2024-06-04 18:15:40,693 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 13.75) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:15:40,694 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:15:40,694 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:15:40,694 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2024-06-04 18:15:40,694 INFO  L420      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:15:40,694 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:15:40,694 INFO  L85        PathProgramCache]: Analyzing trace with hash -1617504396, now seen corresponding path program 1 times
[2024-06-04 18:15:40,694 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:15:40,695 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653419266]
[2024-06-04 18:15:40,695 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:15:40,695 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:15:40,736 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:15:49,237 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:15:49,237 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:15:49,237 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653419266]
[2024-06-04 18:15:49,237 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653419266] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:15:49,237 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:15:49,237 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 18:15:49,237 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850514340]
[2024-06-04 18:15:49,237 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:15:49,237 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 18:15:49,237 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:15:49,238 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 18:15:49,238 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-04 18:15:49,355 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 43
[2024-06-04 18:15:49,356 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 97 transitions, 689 flow. Second operand  has 8 states, 8 states have (on average 14.875) internal successors, (119), 8 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:15:49,356 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:15:49,356 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 43
[2024-06-04 18:15:49,356 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:15:49,967 INFO  L124   PetriNetUnfolderBase]: 1057/1728 cut-off events.
[2024-06-04 18:15:49,968 INFO  L125   PetriNetUnfolderBase]: For 19395/19425 co-relation queries the response was YES.
[2024-06-04 18:15:49,973 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 8648 conditions, 1728 events. 1057/1728 cut-off events. For 19395/19425 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 8926 event pairs, 409 based on Foata normal form. 18/1722 useless extension candidates. Maximal degree in co-relation 8610. Up to 1516 conditions per place. 
[2024-06-04 18:15:49,978 INFO  L140   encePairwiseOnDemand]: 33/43 looper letters, 66 selfloop transitions, 34 changer transitions 0/111 dead transitions.
[2024-06-04 18:15:49,978 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 111 transitions, 957 flow
[2024-06-04 18:15:49,979 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 18:15:49,979 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 18:15:49,979 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 144 transitions.
[2024-06-04 18:15:49,979 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.47840531561461797
[2024-06-04 18:15:49,979 INFO  L175             Difference]: Start difference. First operand has 88 places, 97 transitions, 689 flow. Second operand 7 states and 144 transitions.
[2024-06-04 18:15:49,980 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 111 transitions, 957 flow
[2024-06-04 18:15:49,991 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 111 transitions, 899 flow, removed 14 selfloop flow, removed 5 redundant places.
[2024-06-04 18:15:49,993 INFO  L231             Difference]: Finished difference. Result has 90 places, 101 transitions, 754 flow
[2024-06-04 18:15:49,993 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=631, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=754, PETRI_PLACES=90, PETRI_TRANSITIONS=101}
[2024-06-04 18:15:49,993 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 46 predicate places.
[2024-06-04 18:15:49,993 INFO  L495      AbstractCegarLoop]: Abstraction has has 90 places, 101 transitions, 754 flow
[2024-06-04 18:15:49,994 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 14.875) internal successors, (119), 8 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:15:49,994 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:15:49,994 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:15:49,994 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2024-06-04 18:15:49,994 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-04 18:15:49,994 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:15:49,994 INFO  L85        PathProgramCache]: Analyzing trace with hash 1790199461, now seen corresponding path program 1 times
[2024-06-04 18:15:49,995 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:15:49,995 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827428383]
[2024-06-04 18:15:49,995 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:15:49,995 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:15:50,017 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:16:00,618 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:16:00,618 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:16:00,619 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827428383]
[2024-06-04 18:16:00,619 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827428383] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:16:00,619 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:16:00,619 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:16:00,619 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151491728]
[2024-06-04 18:16:00,619 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:16:00,619 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:16:00,619 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:16:00,620 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:16:00,620 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:16:00,833 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43
[2024-06-04 18:16:00,833 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 101 transitions, 754 flow. Second operand  has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:16:00,834 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:16:00,834 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43
[2024-06-04 18:16:00,834 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:16:01,850 INFO  L124   PetriNetUnfolderBase]: 1372/2228 cut-off events.
[2024-06-04 18:16:01,851 INFO  L125   PetriNetUnfolderBase]: For 26902/26904 co-relation queries the response was YES.
[2024-06-04 18:16:01,857 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 11334 conditions, 2228 events. 1372/2228 cut-off events. For 26902/26904 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 11974 event pairs, 347 based on Foata normal form. 16/2242 useless extension candidates. Maximal degree in co-relation 11295. Up to 1674 conditions per place. 
[2024-06-04 18:16:01,864 INFO  L140   encePairwiseOnDemand]: 33/43 looper letters, 108 selfloop transitions, 26 changer transitions 0/141 dead transitions.
[2024-06-04 18:16:01,865 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 141 transitions, 1252 flow
[2024-06-04 18:16:01,865 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:16:01,865 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:16:01,866 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 177 transitions.
[2024-06-04 18:16:01,866 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5145348837209303
[2024-06-04 18:16:01,866 INFO  L175             Difference]: Start difference. First operand has 90 places, 101 transitions, 754 flow. Second operand 8 states and 177 transitions.
[2024-06-04 18:16:01,866 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 141 transitions, 1252 flow
[2024-06-04 18:16:01,879 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 141 transitions, 1157 flow, removed 16 selfloop flow, removed 5 redundant places.
[2024-06-04 18:16:01,880 INFO  L231             Difference]: Finished difference. Result has 94 places, 104 transitions, 770 flow
[2024-06-04 18:16:01,881 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=659, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=770, PETRI_PLACES=94, PETRI_TRANSITIONS=104}
[2024-06-04 18:16:01,881 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 50 predicate places.
[2024-06-04 18:16:01,881 INFO  L495      AbstractCegarLoop]: Abstraction has has 94 places, 104 transitions, 770 flow
[2024-06-04 18:16:01,881 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:16:01,881 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:16:01,882 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:16:01,882 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2024-06-04 18:16:01,882 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-04 18:16:01,882 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:16:01,882 INFO  L85        PathProgramCache]: Analyzing trace with hash -637773625, now seen corresponding path program 2 times
[2024-06-04 18:16:01,882 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:16:01,883 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562449491]
[2024-06-04 18:16:01,883 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:16:01,883 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:16:01,928 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:16:12,516 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:16:12,516 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:16:12,517 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562449491]
[2024-06-04 18:16:12,517 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562449491] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:16:12,517 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:16:12,517 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:16:12,517 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562229773]
[2024-06-04 18:16:12,517 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:16:12,518 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:16:12,518 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:16:12,518 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:16:12,519 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:16:12,688 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43
[2024-06-04 18:16:12,689 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 104 transitions, 770 flow. Second operand  has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:16:12,689 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:16:12,689 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43
[2024-06-04 18:16:12,689 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:16:13,698 INFO  L124   PetriNetUnfolderBase]: 1328/2157 cut-off events.
[2024-06-04 18:16:13,698 INFO  L125   PetriNetUnfolderBase]: For 28138/28140 co-relation queries the response was YES.
[2024-06-04 18:16:13,704 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 11073 conditions, 2157 events. 1328/2157 cut-off events. For 28138/28140 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 11448 event pairs, 436 based on Foata normal form. 24/2179 useless extension candidates. Maximal degree in co-relation 11032. Up to 1786 conditions per place. 
[2024-06-04 18:16:13,709 INFO  L140   encePairwiseOnDemand]: 33/43 looper letters, 101 selfloop transitions, 23 changer transitions 0/131 dead transitions.
[2024-06-04 18:16:13,710 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 131 transitions, 1120 flow
[2024-06-04 18:16:13,711 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 18:16:13,711 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 18:16:13,712 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 153 transitions.
[2024-06-04 18:16:13,712 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5083056478405316
[2024-06-04 18:16:13,712 INFO  L175             Difference]: Start difference. First operand has 94 places, 104 transitions, 770 flow. Second operand 7 states and 153 transitions.
[2024-06-04 18:16:13,712 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 131 transitions, 1120 flow
[2024-06-04 18:16:13,728 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 131 transitions, 1081 flow, removed 6 selfloop flow, removed 4 redundant places.
[2024-06-04 18:16:13,729 INFO  L231             Difference]: Finished difference. Result has 97 places, 104 transitions, 786 flow
[2024-06-04 18:16:13,729 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=731, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=786, PETRI_PLACES=97, PETRI_TRANSITIONS=104}
[2024-06-04 18:16:13,730 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 53 predicate places.
[2024-06-04 18:16:13,730 INFO  L495      AbstractCegarLoop]: Abstraction has has 97 places, 104 transitions, 786 flow
[2024-06-04 18:16:13,730 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:16:13,730 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:16:13,730 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:16:13,730 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2024-06-04 18:16:13,730 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-04 18:16:13,731 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:16:13,731 INFO  L85        PathProgramCache]: Analyzing trace with hash -577672987, now seen corresponding path program 3 times
[2024-06-04 18:16:13,731 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:16:13,731 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16698973]
[2024-06-04 18:16:13,731 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:16:13,731 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:16:13,752 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:16:24,085 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:16:24,085 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:16:24,085 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16698973]
[2024-06-04 18:16:24,085 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16698973] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:16:24,085 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:16:24,085 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:16:24,086 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895326598]
[2024-06-04 18:16:24,086 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:16:24,086 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:16:24,086 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:16:24,086 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:16:24,086 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:16:24,243 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43
[2024-06-04 18:16:24,244 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 104 transitions, 786 flow. Second operand  has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:16:24,244 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:16:24,244 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43
[2024-06-04 18:16:24,244 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:16:25,231 INFO  L124   PetriNetUnfolderBase]: 1403/2278 cut-off events.
[2024-06-04 18:16:25,232 INFO  L125   PetriNetUnfolderBase]: For 30795/30797 co-relation queries the response was YES.
[2024-06-04 18:16:25,238 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 11815 conditions, 2278 events. 1403/2278 cut-off events. For 30795/30797 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 12243 event pairs, 411 based on Foata normal form. 20/2296 useless extension candidates. Maximal degree in co-relation 11772. Up to 1842 conditions per place. 
[2024-06-04 18:16:25,243 INFO  L140   encePairwiseOnDemand]: 33/43 looper letters, 100 selfloop transitions, 35 changer transitions 0/142 dead transitions.
[2024-06-04 18:16:25,243 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 142 transitions, 1210 flow
[2024-06-04 18:16:25,245 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 18:16:25,245 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 18:16:25,245 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 194 transitions.
[2024-06-04 18:16:25,246 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5012919896640827
[2024-06-04 18:16:25,246 INFO  L175             Difference]: Start difference. First operand has 97 places, 104 transitions, 786 flow. Second operand 9 states and 194 transitions.
[2024-06-04 18:16:25,246 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 142 transitions, 1210 flow
[2024-06-04 18:16:25,264 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 142 transitions, 1158 flow, removed 1 selfloop flow, removed 6 redundant places.
[2024-06-04 18:16:25,265 INFO  L231             Difference]: Finished difference. Result has 100 places, 105 transitions, 833 flow
[2024-06-04 18:16:25,266 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=734, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=833, PETRI_PLACES=100, PETRI_TRANSITIONS=105}
[2024-06-04 18:16:25,266 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 56 predicate places.
[2024-06-04 18:16:25,266 INFO  L495      AbstractCegarLoop]: Abstraction has has 100 places, 105 transitions, 833 flow
[2024-06-04 18:16:25,266 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:16:25,267 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:16:25,267 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:16:25,267 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2024-06-04 18:16:25,267 INFO  L420      AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:16:25,267 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:16:25,267 INFO  L85        PathProgramCache]: Analyzing trace with hash 1146822885, now seen corresponding path program 4 times
[2024-06-04 18:16:25,267 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:16:25,268 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953839979]
[2024-06-04 18:16:25,268 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:16:25,268 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:16:25,289 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:16:36,020 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:16:36,021 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:16:36,021 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953839979]
[2024-06-04 18:16:36,021 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953839979] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:16:36,021 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:16:36,021 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:16:36,021 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747503740]
[2024-06-04 18:16:36,021 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:16:36,021 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:16:36,021 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:16:36,021 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:16:36,022 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:16:36,157 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43
[2024-06-04 18:16:36,158 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 105 transitions, 833 flow. Second operand  has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:16:36,158 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:16:36,158 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43
[2024-06-04 18:16:36,158 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:16:37,129 INFO  L124   PetriNetUnfolderBase]: 1428/2325 cut-off events.
[2024-06-04 18:16:37,130 INFO  L125   PetriNetUnfolderBase]: For 33269/33271 co-relation queries the response was YES.
[2024-06-04 18:16:37,137 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 12117 conditions, 2325 events. 1428/2325 cut-off events. For 33269/33271 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 12572 event pairs, 417 based on Foata normal form. 20/2343 useless extension candidates. Maximal degree in co-relation 12073. Up to 1889 conditions per place. 
[2024-06-04 18:16:37,143 INFO  L140   encePairwiseOnDemand]: 33/43 looper letters, 101 selfloop transitions, 35 changer transitions 0/143 dead transitions.
[2024-06-04 18:16:37,143 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 143 transitions, 1261 flow
[2024-06-04 18:16:37,145 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 18:16:37,145 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 18:16:37,145 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 193 transitions.
[2024-06-04 18:16:37,145 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.49870801033591733
[2024-06-04 18:16:37,145 INFO  L175             Difference]: Start difference. First operand has 100 places, 105 transitions, 833 flow. Second operand 9 states and 193 transitions.
[2024-06-04 18:16:37,145 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 143 transitions, 1261 flow
[2024-06-04 18:16:37,166 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 143 transitions, 1186 flow, removed 4 selfloop flow, removed 7 redundant places.
[2024-06-04 18:16:37,168 INFO  L231             Difference]: Finished difference. Result has 102 places, 106 transitions, 859 flow
[2024-06-04 18:16:37,168 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=758, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=859, PETRI_PLACES=102, PETRI_TRANSITIONS=106}
[2024-06-04 18:16:37,168 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 58 predicate places.
[2024-06-04 18:16:37,169 INFO  L495      AbstractCegarLoop]: Abstraction has has 102 places, 106 transitions, 859 flow
[2024-06-04 18:16:37,169 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:16:37,169 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:16:37,169 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:16:37,169 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2024-06-04 18:16:37,169 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-04 18:16:37,170 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:16:37,170 INFO  L85        PathProgramCache]: Analyzing trace with hash 1153503013, now seen corresponding path program 1 times
[2024-06-04 18:16:37,170 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:16:37,170 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894557999]
[2024-06-04 18:16:37,170 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:16:37,170 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:16:37,205 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:16:45,195 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:16:45,195 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:16:45,195 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894557999]
[2024-06-04 18:16:45,195 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894557999] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:16:45,195 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:16:45,195 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:16:45,196 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162547242]
[2024-06-04 18:16:45,196 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:16:45,196 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:16:45,196 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:16:45,196 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:16:45,197 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:16:45,336 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43
[2024-06-04 18:16:45,337 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 106 transitions, 859 flow. Second operand  has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:16:45,337 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:16:45,337 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43
[2024-06-04 18:16:45,337 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:16:46,315 INFO  L124   PetriNetUnfolderBase]: 1456/2377 cut-off events.
[2024-06-04 18:16:46,315 INFO  L125   PetriNetUnfolderBase]: For 33892/33892 co-relation queries the response was YES.
[2024-06-04 18:16:46,322 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 12446 conditions, 2377 events. 1456/2377 cut-off events. For 33892/33892 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 12899 event pairs, 431 based on Foata normal form. 4/2379 useless extension candidates. Maximal degree in co-relation 12401. Up to 2125 conditions per place. 
[2024-06-04 18:16:46,329 INFO  L140   encePairwiseOnDemand]: 33/43 looper letters, 115 selfloop transitions, 27 changer transitions 0/149 dead transitions.
[2024-06-04 18:16:46,329 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 149 transitions, 1318 flow
[2024-06-04 18:16:46,331 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-04 18:16:46,331 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-04 18:16:46,331 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 206 transitions.
[2024-06-04 18:16:46,332 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4790697674418605
[2024-06-04 18:16:46,332 INFO  L175             Difference]: Start difference. First operand has 102 places, 106 transitions, 859 flow. Second operand 10 states and 206 transitions.
[2024-06-04 18:16:46,332 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 149 transitions, 1318 flow
[2024-06-04 18:16:46,353 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 149 transitions, 1235 flow, removed 5 selfloop flow, removed 7 redundant places.
[2024-06-04 18:16:46,355 INFO  L231             Difference]: Finished difference. Result has 106 places, 112 transitions, 908 flow
[2024-06-04 18:16:46,355 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=782, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=908, PETRI_PLACES=106, PETRI_TRANSITIONS=112}
[2024-06-04 18:16:46,356 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 62 predicate places.
[2024-06-04 18:16:46,356 INFO  L495      AbstractCegarLoop]: Abstraction has has 106 places, 112 transitions, 908 flow
[2024-06-04 18:16:46,356 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:16:46,356 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:16:46,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-04 18:16:46,356 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2024-06-04 18:16:46,356 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-04 18:16:46,356 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:16:46,356 INFO  L85        PathProgramCache]: Analyzing trace with hash 800184101, now seen corresponding path program 2 times
[2024-06-04 18:16:46,357 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:16:46,357 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439689799]
[2024-06-04 18:16:46,357 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:16:46,357 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:16:46,393 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:16:54,874 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:16:54,874 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:16:54,874 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439689799]
[2024-06-04 18:16:54,874 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439689799] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:16:54,874 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:16:54,874 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:16:54,875 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572510022]
[2024-06-04 18:16:54,875 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:16:54,875 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:16:54,875 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:16:54,875 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:16:54,875 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:16:55,048 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43
[2024-06-04 18:16:55,048 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 112 transitions, 908 flow. Second operand  has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:16:55,048 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:16:55,048 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43
[2024-06-04 18:16:55,048 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:16:56,119 INFO  L124   PetriNetUnfolderBase]: 1473/2424 cut-off events.
[2024-06-04 18:16:56,119 INFO  L125   PetriNetUnfolderBase]: For 36674/36674 co-relation queries the response was YES.
[2024-06-04 18:16:56,126 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 12885 conditions, 2424 events. 1473/2424 cut-off events. For 36674/36674 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 13232 event pairs, 435 based on Foata normal form. 4/2426 useless extension candidates. Maximal degree in co-relation 12838. Up to 2152 conditions per place. 
[2024-06-04 18:16:56,133 INFO  L140   encePairwiseOnDemand]: 33/43 looper letters, 119 selfloop transitions, 33 changer transitions 0/159 dead transitions.
[2024-06-04 18:16:56,133 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 159 transitions, 1416 flow
[2024-06-04 18:16:56,135 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-04 18:16:56,135 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-04 18:16:56,135 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 222 transitions.
[2024-06-04 18:16:56,135 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4693446088794926
[2024-06-04 18:16:56,135 INFO  L175             Difference]: Start difference. First operand has 106 places, 112 transitions, 908 flow. Second operand 11 states and 222 transitions.
[2024-06-04 18:16:56,135 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 159 transitions, 1416 flow
[2024-06-04 18:16:56,160 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 159 transitions, 1331 flow, removed 14 selfloop flow, removed 7 redundant places.
[2024-06-04 18:16:56,162 INFO  L231             Difference]: Finished difference. Result has 111 places, 119 transitions, 991 flow
[2024-06-04 18:16:56,162 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=831, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=991, PETRI_PLACES=111, PETRI_TRANSITIONS=119}
[2024-06-04 18:16:56,163 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 67 predicate places.
[2024-06-04 18:16:56,163 INFO  L495      AbstractCegarLoop]: Abstraction has has 111 places, 119 transitions, 991 flow
[2024-06-04 18:16:56,163 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:16:56,163 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:16:56,163 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:16:56,163 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2024-06-04 18:16:56,163 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-04 18:16:56,164 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:16:56,164 INFO  L85        PathProgramCache]: Analyzing trace with hash 810659621, now seen corresponding path program 3 times
[2024-06-04 18:16:56,164 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:16:56,164 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716528837]
[2024-06-04 18:16:56,164 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:16:56,165 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:16:56,200 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:17:04,495 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:17:04,496 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:17:04,496 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716528837]
[2024-06-04 18:17:04,496 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716528837] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:17:04,496 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:17:04,496 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:17:04,496 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208229662]
[2024-06-04 18:17:04,496 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:17:04,496 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:17:04,496 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:17:04,497 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:17:04,497 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:17:04,692 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43
[2024-06-04 18:17:04,692 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 119 transitions, 991 flow. Second operand  has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:17:04,692 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:17:04,692 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43
[2024-06-04 18:17:04,692 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:17:05,842 INFO  L124   PetriNetUnfolderBase]: 1465/2412 cut-off events.
[2024-06-04 18:17:05,842 INFO  L125   PetriNetUnfolderBase]: For 39382/39382 co-relation queries the response was YES.
[2024-06-04 18:17:05,850 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 13119 conditions, 2412 events. 1465/2412 cut-off events. For 39382/39382 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 13180 event pairs, 377 based on Foata normal form. 4/2414 useless extension candidates. Maximal degree in co-relation 13070. Up to 2063 conditions per place. 
[2024-06-04 18:17:05,856 INFO  L140   encePairwiseOnDemand]: 33/43 looper letters, 115 selfloop transitions, 41 changer transitions 0/163 dead transitions.
[2024-06-04 18:17:05,856 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 163 transitions, 1483 flow
[2024-06-04 18:17:05,858 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-04 18:17:05,858 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-04 18:17:05,858 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 223 transitions.
[2024-06-04 18:17:05,858 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4714587737843552
[2024-06-04 18:17:05,859 INFO  L175             Difference]: Start difference. First operand has 111 places, 119 transitions, 991 flow. Second operand 11 states and 223 transitions.
[2024-06-04 18:17:05,859 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 163 transitions, 1483 flow
[2024-06-04 18:17:05,885 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 163 transitions, 1409 flow, removed 16 selfloop flow, removed 6 redundant places.
[2024-06-04 18:17:05,887 INFO  L231             Difference]: Finished difference. Result has 117 places, 122 transitions, 1078 flow
[2024-06-04 18:17:05,887 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=917, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1078, PETRI_PLACES=117, PETRI_TRANSITIONS=122}
[2024-06-04 18:17:05,887 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 73 predicate places.
[2024-06-04 18:17:05,888 INFO  L495      AbstractCegarLoop]: Abstraction has has 117 places, 122 transitions, 1078 flow
[2024-06-04 18:17:05,888 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:17:05,888 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:17:05,888 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:17:05,888 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2024-06-04 18:17:05,888 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-04 18:17:05,889 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:17:05,889 INFO  L85        PathProgramCache]: Analyzing trace with hash 332952012, now seen corresponding path program 1 times
[2024-06-04 18:17:05,889 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:17:05,889 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390134885]
[2024-06-04 18:17:05,889 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:17:05,889 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:17:05,929 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:17:14,908 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:17:14,908 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:17:14,908 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390134885]
[2024-06-04 18:17:14,909 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390134885] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:17:14,909 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:17:14,909 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:17:14,909 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239095296]
[2024-06-04 18:17:14,909 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:17:14,910 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:17:14,910 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:17:14,911 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:17:14,911 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:17:15,033 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43
[2024-06-04 18:17:15,033 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 122 transitions, 1078 flow. Second operand  has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 9 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:17:15,034 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:17:15,034 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43
[2024-06-04 18:17:15,034 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:17:15,921 INFO  L124   PetriNetUnfolderBase]: 1551/2552 cut-off events.
[2024-06-04 18:17:15,921 INFO  L125   PetriNetUnfolderBase]: For 45673/45673 co-relation queries the response was YES.
[2024-06-04 18:17:15,932 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 14250 conditions, 2552 events. 1551/2552 cut-off events. For 45673/45673 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 14205 event pairs, 427 based on Foata normal form. 6/2548 useless extension candidates. Maximal degree in co-relation 14199. Up to 2203 conditions per place. 
[2024-06-04 18:17:15,941 INFO  L140   encePairwiseOnDemand]: 31/43 looper letters, 107 selfloop transitions, 37 changer transitions 0/151 dead transitions.
[2024-06-04 18:17:15,942 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 151 transitions, 1604 flow
[2024-06-04 18:17:15,942 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 18:17:15,942 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 18:17:15,942 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 148 transitions.
[2024-06-04 18:17:15,943 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.49169435215946844
[2024-06-04 18:17:15,943 INFO  L175             Difference]: Start difference. First operand has 117 places, 122 transitions, 1078 flow. Second operand 7 states and 148 transitions.
[2024-06-04 18:17:15,943 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 151 transitions, 1604 flow
[2024-06-04 18:17:15,981 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 151 transitions, 1491 flow, removed 23 selfloop flow, removed 8 redundant places.
[2024-06-04 18:17:15,983 INFO  L231             Difference]: Finished difference. Result has 118 places, 135 transitions, 1230 flow
[2024-06-04 18:17:15,983 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=965, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1230, PETRI_PLACES=118, PETRI_TRANSITIONS=135}
[2024-06-04 18:17:15,983 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 74 predicate places.
[2024-06-04 18:17:15,984 INFO  L495      AbstractCegarLoop]: Abstraction has has 118 places, 135 transitions, 1230 flow
[2024-06-04 18:17:15,984 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 9 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:17:15,984 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:17:15,984 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:17:15,984 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2024-06-04 18:17:15,984 INFO  L420      AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:17:15,985 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:17:15,985 INFO  L85        PathProgramCache]: Analyzing trace with hash 1396962954, now seen corresponding path program 2 times
[2024-06-04 18:17:15,985 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:17:15,985 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008900277]
[2024-06-04 18:17:15,985 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:17:15,985 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:17:16,025 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:17:25,150 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:17:25,150 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:17:25,150 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008900277]
[2024-06-04 18:17:25,150 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008900277] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:17:25,151 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:17:25,151 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:17:25,151 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718032335]
[2024-06-04 18:17:25,151 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:17:25,151 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:17:25,151 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:17:25,152 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:17:25,152 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:17:25,318 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43
[2024-06-04 18:17:25,319 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 135 transitions, 1230 flow. Second operand  has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 9 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:17:25,319 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:17:25,319 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43
[2024-06-04 18:17:25,319 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:17:26,228 INFO  L124   PetriNetUnfolderBase]: 1668/2732 cut-off events.
[2024-06-04 18:17:26,228 INFO  L125   PetriNetUnfolderBase]: For 56204/56204 co-relation queries the response was YES.
[2024-06-04 18:17:26,237 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 16269 conditions, 2732 events. 1668/2732 cut-off events. For 56204/56204 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 15419 event pairs, 428 based on Foata normal form. 6/2728 useless extension candidates. Maximal degree in co-relation 16215. Up to 2221 conditions per place. 
[2024-06-04 18:17:26,246 INFO  L140   encePairwiseOnDemand]: 31/43 looper letters, 109 selfloop transitions, 65 changer transitions 0/181 dead transitions.
[2024-06-04 18:17:26,246 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 181 transitions, 2036 flow
[2024-06-04 18:17:26,247 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:17:26,247 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:17:26,247 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 170 transitions.
[2024-06-04 18:17:26,247 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4941860465116279
[2024-06-04 18:17:26,247 INFO  L175             Difference]: Start difference. First operand has 118 places, 135 transitions, 1230 flow. Second operand 8 states and 170 transitions.
[2024-06-04 18:17:26,247 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 181 transitions, 2036 flow
[2024-06-04 18:17:26,290 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 181 transitions, 1939 flow, removed 41 selfloop flow, removed 2 redundant places.
[2024-06-04 18:17:26,292 INFO  L231             Difference]: Finished difference. Result has 126 places, 159 transitions, 1635 flow
[2024-06-04 18:17:26,292 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1145, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1635, PETRI_PLACES=126, PETRI_TRANSITIONS=159}
[2024-06-04 18:17:26,292 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 82 predicate places.
[2024-06-04 18:17:26,292 INFO  L495      AbstractCegarLoop]: Abstraction has has 126 places, 159 transitions, 1635 flow
[2024-06-04 18:17:26,293 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 9 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:17:26,293 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:17:26,293 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:17:26,293 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26
[2024-06-04 18:17:26,293 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-04 18:17:26,293 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:17:26,293 INFO  L85        PathProgramCache]: Analyzing trace with hash 539605452, now seen corresponding path program 3 times
[2024-06-04 18:17:26,293 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:17:26,293 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074516227]
[2024-06-04 18:17:26,293 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:17:26,293 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:17:26,328 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:17:35,390 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:17:35,390 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:17:35,390 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074516227]
[2024-06-04 18:17:35,391 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074516227] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:17:35,391 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:17:35,391 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:17:35,391 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262103452]
[2024-06-04 18:17:35,391 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:17:35,391 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:17:35,392 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:17:35,392 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:17:35,392 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:17:35,525 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43
[2024-06-04 18:17:35,525 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 159 transitions, 1635 flow. Second operand  has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 9 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:17:35,525 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:17:35,525 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43
[2024-06-04 18:17:35,525 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:17:36,386 INFO  L124   PetriNetUnfolderBase]: 1658/2728 cut-off events.
[2024-06-04 18:17:36,387 INFO  L125   PetriNetUnfolderBase]: For 59468/59468 co-relation queries the response was YES.
[2024-06-04 18:17:36,398 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 16765 conditions, 2728 events. 1658/2728 cut-off events. For 59468/59468 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 15508 event pairs, 439 based on Foata normal form. 6/2724 useless extension candidates. Maximal degree in co-relation 16707. Up to 2218 conditions per place. 
[2024-06-04 18:17:36,408 INFO  L140   encePairwiseOnDemand]: 31/43 looper letters, 114 selfloop transitions, 62 changer transitions 0/183 dead transitions.
[2024-06-04 18:17:36,408 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 183 transitions, 2205 flow
[2024-06-04 18:17:36,408 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:17:36,408 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:17:36,409 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 170 transitions.
[2024-06-04 18:17:36,409 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4941860465116279
[2024-06-04 18:17:36,409 INFO  L175             Difference]: Start difference. First operand has 126 places, 159 transitions, 1635 flow. Second operand 8 states and 170 transitions.
[2024-06-04 18:17:36,409 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 183 transitions, 2205 flow
[2024-06-04 18:17:36,473 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 183 transitions, 2036 flow, removed 69 selfloop flow, removed 3 redundant places.
[2024-06-04 18:17:36,475 INFO  L231             Difference]: Finished difference. Result has 132 places, 164 transitions, 1691 flow
[2024-06-04 18:17:36,475 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1480, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1691, PETRI_PLACES=132, PETRI_TRANSITIONS=164}
[2024-06-04 18:17:36,476 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 88 predicate places.
[2024-06-04 18:17:36,476 INFO  L495      AbstractCegarLoop]: Abstraction has has 132 places, 164 transitions, 1691 flow
[2024-06-04 18:17:36,476 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 9 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:17:36,476 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:17:36,476 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:17:36,476 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27
[2024-06-04 18:17:36,477 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-04 18:17:36,477 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:17:36,477 INFO  L85        PathProgramCache]: Analyzing trace with hash 1396972874, now seen corresponding path program 1 times
[2024-06-04 18:17:36,477 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:17:36,477 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275934808]
[2024-06-04 18:17:36,477 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:17:36,477 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:17:36,523 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:17:45,881 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:17:45,881 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:17:45,881 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275934808]
[2024-06-04 18:17:45,881 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275934808] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:17:45,882 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:17:45,882 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:17:45,882 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943655375]
[2024-06-04 18:17:45,882 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:17:45,882 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:17:45,882 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:17:45,883 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:17:45,883 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:17:46,060 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 43
[2024-06-04 18:17:46,061 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 164 transitions, 1691 flow. Second operand  has 9 states, 9 states have (on average 14.777777777777779) internal successors, (133), 9 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:17:46,061 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:17:46,061 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 43
[2024-06-04 18:17:46,061 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:17:46,915 INFO  L124   PetriNetUnfolderBase]: 1589/2666 cut-off events.
[2024-06-04 18:17:46,915 INFO  L125   PetriNetUnfolderBase]: For 62262/62271 co-relation queries the response was YES.
[2024-06-04 18:17:46,926 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 16162 conditions, 2666 events. 1589/2666 cut-off events. For 62262/62271 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 15550 event pairs, 435 based on Foata normal form. 12/2656 useless extension candidates. Maximal degree in co-relation 16101. Up to 2204 conditions per place. 
[2024-06-04 18:17:46,935 INFO  L140   encePairwiseOnDemand]: 33/43 looper letters, 108 selfloop transitions, 48 changer transitions 0/181 dead transitions.
[2024-06-04 18:17:46,935 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 181 transitions, 2091 flow
[2024-06-04 18:17:46,935 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:17:46,935 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:17:46,936 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 164 transitions.
[2024-06-04 18:17:46,936 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.47674418604651164
[2024-06-04 18:17:46,936 INFO  L175             Difference]: Start difference. First operand has 132 places, 164 transitions, 1691 flow. Second operand 8 states and 164 transitions.
[2024-06-04 18:17:46,936 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 181 transitions, 2091 flow
[2024-06-04 18:17:46,984 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 181 transitions, 1977 flow, removed 16 selfloop flow, removed 5 redundant places.
[2024-06-04 18:17:46,986 INFO  L231             Difference]: Finished difference. Result has 135 places, 166 transitions, 1719 flow
[2024-06-04 18:17:46,986 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1577, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1719, PETRI_PLACES=135, PETRI_TRANSITIONS=166}
[2024-06-04 18:17:46,987 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 91 predicate places.
[2024-06-04 18:17:46,987 INFO  L495      AbstractCegarLoop]: Abstraction has has 135 places, 166 transitions, 1719 flow
[2024-06-04 18:17:46,987 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 14.777777777777779) internal successors, (133), 9 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:17:46,987 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:17:46,987 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-04 18:17:46,987 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28
[2024-06-04 18:17:46,987 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-04 18:17:46,988 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:17:46,988 INFO  L85        PathProgramCache]: Analyzing trace with hash -1985954221, now seen corresponding path program 1 times
[2024-06-04 18:17:46,988 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:17:46,988 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858353321]
[2024-06-04 18:17:46,988 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:17:46,988 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:17:47,022 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:17:55,614 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:17:55,615 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:17:55,615 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858353321]
[2024-06-04 18:17:55,615 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858353321] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:17:55,615 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:17:55,615 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:17:55,615 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437103137]
[2024-06-04 18:17:55,615 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:17:55,615 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:17:55,615 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:17:55,616 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:17:55,616 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:17:55,778 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43
[2024-06-04 18:17:55,779 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 166 transitions, 1719 flow. Second operand  has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 9 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:17:55,779 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:17:55,779 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43
[2024-06-04 18:17:55,779 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:17:56,680 INFO  L124   PetriNetUnfolderBase]: 1689/2787 cut-off events.
[2024-06-04 18:17:56,680 INFO  L125   PetriNetUnfolderBase]: For 62510/62512 co-relation queries the response was YES.
[2024-06-04 18:17:56,691 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 16725 conditions, 2787 events. 1689/2787 cut-off events. For 62510/62512 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 15898 event pairs, 438 based on Foata normal form. 4/2789 useless extension candidates. Maximal degree in co-relation 16664. Up to 2461 conditions per place. 
[2024-06-04 18:17:56,700 INFO  L140   encePairwiseOnDemand]: 32/43 looper letters, 158 selfloop transitions, 31 changer transitions 0/196 dead transitions.
[2024-06-04 18:17:56,700 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 196 transitions, 2228 flow
[2024-06-04 18:17:56,701 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 18:17:56,701 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 18:17:56,701 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 184 transitions.
[2024-06-04 18:17:56,701 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4754521963824289
[2024-06-04 18:17:56,701 INFO  L175             Difference]: Start difference. First operand has 135 places, 166 transitions, 1719 flow. Second operand 9 states and 184 transitions.
[2024-06-04 18:17:56,701 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 196 transitions, 2228 flow
[2024-06-04 18:17:56,746 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 196 transitions, 2114 flow, removed 11 selfloop flow, removed 6 redundant places.
[2024-06-04 18:17:56,749 INFO  L231             Difference]: Finished difference. Result has 138 places, 169 transitions, 1728 flow
[2024-06-04 18:17:56,749 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1605, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1728, PETRI_PLACES=138, PETRI_TRANSITIONS=169}
[2024-06-04 18:17:56,749 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 94 predicate places.
[2024-06-04 18:17:56,749 INFO  L495      AbstractCegarLoop]: Abstraction has has 138 places, 169 transitions, 1728 flow
[2024-06-04 18:17:56,749 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 9 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:17:56,750 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:17:56,750 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-04 18:17:56,750 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29
[2024-06-04 18:17:56,750 INFO  L420      AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:17:56,750 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:17:56,750 INFO  L85        PathProgramCache]: Analyzing trace with hash -386392109, now seen corresponding path program 2 times
[2024-06-04 18:17:56,750 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:17:56,751 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805239592]
[2024-06-04 18:17:56,751 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:17:56,751 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:17:56,783 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:18:05,763 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:18:05,763 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:18:05,763 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805239592]
[2024-06-04 18:18:05,763 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805239592] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:18:05,763 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:18:05,763 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:18:05,763 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674563985]
[2024-06-04 18:18:05,763 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:18:05,764 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:18:05,764 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:18:05,764 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:18:05,764 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:18:05,904 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43
[2024-06-04 18:18:05,904 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 169 transitions, 1728 flow. Second operand  has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 9 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:18:05,904 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:18:05,904 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43
[2024-06-04 18:18:05,904 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:18:06,882 INFO  L124   PetriNetUnfolderBase]: 1705/2828 cut-off events.
[2024-06-04 18:18:06,882 INFO  L125   PetriNetUnfolderBase]: For 66234/66236 co-relation queries the response was YES.
[2024-06-04 18:18:06,894 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 16955 conditions, 2828 events. 1705/2828 cut-off events. For 66234/66236 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 16269 event pairs, 434 based on Foata normal form. 4/2830 useless extension candidates. Maximal degree in co-relation 16893. Up to 2446 conditions per place. 
[2024-06-04 18:18:06,904 INFO  L140   encePairwiseOnDemand]: 32/43 looper letters, 150 selfloop transitions, 45 changer transitions 0/202 dead transitions.
[2024-06-04 18:18:06,904 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 202 transitions, 2365 flow
[2024-06-04 18:18:06,905 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 18:18:06,905 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 18:18:06,905 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 185 transitions.
[2024-06-04 18:18:06,905 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4780361757105943
[2024-06-04 18:18:06,905 INFO  L175             Difference]: Start difference. First operand has 138 places, 169 transitions, 1728 flow. Second operand 9 states and 185 transitions.
[2024-06-04 18:18:06,905 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 202 transitions, 2365 flow
[2024-06-04 18:18:06,981 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 202 transitions, 2263 flow, removed 16 selfloop flow, removed 8 redundant places.
[2024-06-04 18:18:06,983 INFO  L231             Difference]: Finished difference. Result has 140 places, 176 transitions, 1868 flow
[2024-06-04 18:18:06,983 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1626, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1868, PETRI_PLACES=140, PETRI_TRANSITIONS=176}
[2024-06-04 18:18:06,984 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 96 predicate places.
[2024-06-04 18:18:06,984 INFO  L495      AbstractCegarLoop]: Abstraction has has 140 places, 176 transitions, 1868 flow
[2024-06-04 18:18:06,984 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 9 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:18:06,984 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:18:06,984 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-04 18:18:06,984 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30
[2024-06-04 18:18:06,984 INFO  L420      AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:18:06,984 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:18:06,985 INFO  L85        PathProgramCache]: Analyzing trace with hash 2043533083, now seen corresponding path program 3 times
[2024-06-04 18:18:06,985 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:18:06,985 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469183748]
[2024-06-04 18:18:06,985 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:18:06,985 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:18:07,021 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:18:16,728 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:18:16,729 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:18:16,729 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469183748]
[2024-06-04 18:18:16,729 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469183748] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:18:16,729 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:18:16,729 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:18:16,729 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524999243]
[2024-06-04 18:18:16,729 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:18:16,729 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:18:16,729 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:18:16,730 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:18:16,730 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:18:16,892 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43
[2024-06-04 18:18:16,892 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 176 transitions, 1868 flow. Second operand  has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 9 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:18:16,892 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:18:16,892 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43
[2024-06-04 18:18:16,892 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:18:17,726 INFO  L124   PetriNetUnfolderBase]: 1699/2805 cut-off events.
[2024-06-04 18:18:17,727 INFO  L125   PetriNetUnfolderBase]: For 68552/68552 co-relation queries the response was YES.
[2024-06-04 18:18:17,738 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 17037 conditions, 2805 events. 1699/2805 cut-off events. For 68552/68552 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 16076 event pairs, 450 based on Foata normal form. 2/2797 useless extension candidates. Maximal degree in co-relation 16974. Up to 2481 conditions per place. 
[2024-06-04 18:18:17,746 INFO  L140   encePairwiseOnDemand]: 32/43 looper letters, 157 selfloop transitions, 29 changer transitions 0/193 dead transitions.
[2024-06-04 18:18:17,747 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 193 transitions, 2294 flow
[2024-06-04 18:18:17,747 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 18:18:17,747 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 18:18:17,747 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 144 transitions.
[2024-06-04 18:18:17,748 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.47840531561461797
[2024-06-04 18:18:17,748 INFO  L175             Difference]: Start difference. First operand has 140 places, 176 transitions, 1868 flow. Second operand 7 states and 144 transitions.
[2024-06-04 18:18:17,748 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 193 transitions, 2294 flow
[2024-06-04 18:18:17,821 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 193 transitions, 2179 flow, removed 26 selfloop flow, removed 6 redundant places.
[2024-06-04 18:18:17,823 INFO  L231             Difference]: Finished difference. Result has 141 places, 176 transitions, 1817 flow
[2024-06-04 18:18:17,824 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1753, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1817, PETRI_PLACES=141, PETRI_TRANSITIONS=176}
[2024-06-04 18:18:17,824 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 97 predicate places.
[2024-06-04 18:18:17,824 INFO  L495      AbstractCegarLoop]: Abstraction has has 141 places, 176 transitions, 1817 flow
[2024-06-04 18:18:17,824 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 9 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:18:17,824 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:18:17,825 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-04 18:18:17,825 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31
[2024-06-04 18:18:17,825 INFO  L420      AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:18:17,825 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:18:17,825 INFO  L85        PathProgramCache]: Analyzing trace with hash 2043920893, now seen corresponding path program 4 times
[2024-06-04 18:18:17,825 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:18:17,825 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600723545]
[2024-06-04 18:18:17,825 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:18:17,825 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:18:17,862 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:18:27,068 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:18:27,068 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:18:27,068 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600723545]
[2024-06-04 18:18:27,068 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600723545] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:18:27,068 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:18:27,068 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:18:27,068 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270376330]
[2024-06-04 18:18:27,068 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:18:27,069 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:18:27,069 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:18:27,069 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:18:27,069 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:18:27,215 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43
[2024-06-04 18:18:27,215 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 176 transitions, 1817 flow. Second operand  has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 9 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:18:27,215 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:18:27,215 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43
[2024-06-04 18:18:27,215 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:18:28,081 INFO  L124   PetriNetUnfolderBase]: 1683/2787 cut-off events.
[2024-06-04 18:18:28,081 INFO  L125   PetriNetUnfolderBase]: For 70612/70612 co-relation queries the response was YES.
[2024-06-04 18:18:28,092 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 16745 conditions, 2787 events. 1683/2787 cut-off events. For 70612/70612 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 15998 event pairs, 447 based on Foata normal form. 4/2781 useless extension candidates. Maximal degree in co-relation 16681. Up to 2393 conditions per place. 
[2024-06-04 18:18:28,100 INFO  L140   encePairwiseOnDemand]: 31/43 looper letters, 143 selfloop transitions, 41 changer transitions 0/191 dead transitions.
[2024-06-04 18:18:28,100 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 191 transitions, 2235 flow
[2024-06-04 18:18:28,100 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 18:18:28,100 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 18:18:28,101 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 146 transitions.
[2024-06-04 18:18:28,101 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4850498338870432
[2024-06-04 18:18:28,101 INFO  L175             Difference]: Start difference. First operand has 141 places, 176 transitions, 1817 flow. Second operand 7 states and 146 transitions.
[2024-06-04 18:18:28,101 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 191 transitions, 2235 flow
[2024-06-04 18:18:28,159 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 191 transitions, 2153 flow, removed 14 selfloop flow, removed 5 redundant places.
[2024-06-04 18:18:28,161 INFO  L231             Difference]: Finished difference. Result has 143 places, 176 transitions, 1825 flow
[2024-06-04 18:18:28,162 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1735, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1825, PETRI_PLACES=143, PETRI_TRANSITIONS=176}
[2024-06-04 18:18:28,162 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 99 predicate places.
[2024-06-04 18:18:28,162 INFO  L495      AbstractCegarLoop]: Abstraction has has 143 places, 176 transitions, 1825 flow
[2024-06-04 18:18:28,162 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 9 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:18:28,162 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:18:28,162 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-04 18:18:28,162 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32
[2024-06-04 18:18:28,162 INFO  L420      AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:18:28,162 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:18:28,163 INFO  L85        PathProgramCache]: Analyzing trace with hash -2044572453, now seen corresponding path program 5 times
[2024-06-04 18:18:28,163 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:18:28,163 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490646280]
[2024-06-04 18:18:28,163 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:18:28,163 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:18:28,195 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:18:37,015 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:18:37,016 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:18:37,016 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490646280]
[2024-06-04 18:18:37,016 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490646280] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:18:37,016 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:18:37,016 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:18:37,016 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740924937]
[2024-06-04 18:18:37,016 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:18:37,016 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:18:37,016 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:18:37,017 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:18:37,017 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:18:37,160 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43
[2024-06-04 18:18:37,160 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 176 transitions, 1825 flow. Second operand  has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 9 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:18:37,160 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:18:37,160 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43
[2024-06-04 18:18:37,160 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:18:38,043 INFO  L124   PetriNetUnfolderBase]: 1703/2823 cut-off events.
[2024-06-04 18:18:38,044 INFO  L125   PetriNetUnfolderBase]: For 74584/74584 co-relation queries the response was YES.
[2024-06-04 18:18:38,053 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 17067 conditions, 2823 events. 1703/2823 cut-off events. For 74584/74584 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 16295 event pairs, 443 based on Foata normal form. 4/2817 useless extension candidates. Maximal degree in co-relation 17002. Up to 2272 conditions per place. 
[2024-06-04 18:18:38,061 INFO  L140   encePairwiseOnDemand]: 31/43 looper letters, 115 selfloop transitions, 76 changer transitions 0/198 dead transitions.
[2024-06-04 18:18:38,061 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 198 transitions, 2382 flow
[2024-06-04 18:18:38,062 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:18:38,062 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:18:38,062 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 167 transitions.
[2024-06-04 18:18:38,062 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.48546511627906974
[2024-06-04 18:18:38,062 INFO  L175             Difference]: Start difference. First operand has 143 places, 176 transitions, 1825 flow. Second operand 8 states and 167 transitions.
[2024-06-04 18:18:38,062 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 198 transitions, 2382 flow
[2024-06-04 18:18:38,124 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 198 transitions, 2272 flow, removed 8 selfloop flow, removed 6 redundant places.
[2024-06-04 18:18:38,126 INFO  L231             Difference]: Finished difference. Result has 145 places, 180 transitions, 1927 flow
[2024-06-04 18:18:38,127 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1715, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1927, PETRI_PLACES=145, PETRI_TRANSITIONS=180}
[2024-06-04 18:18:38,127 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 101 predicate places.
[2024-06-04 18:18:38,127 INFO  L495      AbstractCegarLoop]: Abstraction has has 145 places, 180 transitions, 1927 flow
[2024-06-04 18:18:38,127 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 9 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:18:38,127 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:18:38,127 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-04 18:18:38,127 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33
[2024-06-04 18:18:38,127 INFO  L420      AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:18:38,129 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:18:38,129 INFO  L85        PathProgramCache]: Analyzing trace with hash -452114477, now seen corresponding path program 6 times
[2024-06-04 18:18:38,129 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:18:38,129 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980167080]
[2024-06-04 18:18:38,129 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:18:38,129 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:18:38,160 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:18:46,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-04 18:18:46,944 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:18:46,944 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980167080]
[2024-06-04 18:18:46,944 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980167080] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:18:46,944 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:18:46,945 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:18:46,945 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702089245]
[2024-06-04 18:18:46,945 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:18:46,945 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:18:46,945 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:18:46,945 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:18:46,945 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:18:47,064 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43
[2024-06-04 18:18:47,064 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 180 transitions, 1927 flow. Second operand  has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 9 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:18:47,064 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:18:47,064 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43
[2024-06-04 18:18:47,064 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:18:47,840 INFO  L124   PetriNetUnfolderBase]: 1687/2789 cut-off events.
[2024-06-04 18:18:47,840 INFO  L125   PetriNetUnfolderBase]: For 76693/76693 co-relation queries the response was YES.
[2024-06-04 18:18:47,851 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 17057 conditions, 2789 events. 1687/2789 cut-off events. For 76693/76693 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 16004 event pairs, 441 based on Foata normal form. 4/2783 useless extension candidates. Maximal degree in co-relation 16991. Up to 2259 conditions per place. 
[2024-06-04 18:18:47,860 INFO  L140   encePairwiseOnDemand]: 31/43 looper letters, 117 selfloop transitions, 73 changer transitions 0/197 dead transitions.
[2024-06-04 18:18:47,861 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 197 transitions, 2365 flow
[2024-06-04 18:18:47,861 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:18:47,861 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:18:47,861 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 167 transitions.
[2024-06-04 18:18:47,861 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.48546511627906974
[2024-06-04 18:18:47,861 INFO  L175             Difference]: Start difference. First operand has 145 places, 180 transitions, 1927 flow. Second operand 8 states and 167 transitions.
[2024-06-04 18:18:47,861 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 197 transitions, 2365 flow
[2024-06-04 18:18:47,935 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 197 transitions, 2113 flow, removed 27 selfloop flow, removed 7 redundant places.
[2024-06-04 18:18:47,937 INFO  L231             Difference]: Finished difference. Result has 146 places, 180 transitions, 1830 flow
[2024-06-04 18:18:47,937 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1675, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1830, PETRI_PLACES=146, PETRI_TRANSITIONS=180}
[2024-06-04 18:18:47,937 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 102 predicate places.
[2024-06-04 18:18:47,937 INFO  L495      AbstractCegarLoop]: Abstraction has has 146 places, 180 transitions, 1830 flow
[2024-06-04 18:18:47,938 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 9 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:18:47,938 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:18:47,938 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-04 18:18:47,938 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34
[2024-06-04 18:18:47,938 INFO  L420      AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:18:47,938 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:18:47,938 INFO  L85        PathProgramCache]: Analyzing trace with hash -444039659, now seen corresponding path program 1 times
[2024-06-04 18:18:47,938 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:18:47,939 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222510129]
[2024-06-04 18:18:47,939 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:18:47,939 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:18:47,975 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:18:57,129 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:18:57,129 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:18:57,129 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222510129]
[2024-06-04 18:18:57,129 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222510129] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:18:57,129 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:18:57,129 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:18:57,129 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448113882]
[2024-06-04 18:18:57,129 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:18:57,129 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:18:57,130 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:18:57,130 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:18:57,130 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:18:57,278 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 43
[2024-06-04 18:18:57,278 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 180 transitions, 1830 flow. Second operand  has 9 states, 9 states have (on average 14.777777777777779) internal successors, (133), 9 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:18:57,278 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:18:57,278 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 43
[2024-06-04 18:18:57,278 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:18:58,057 INFO  L124   PetriNetUnfolderBase]: 1593/2690 cut-off events.
[2024-06-04 18:18:58,057 INFO  L125   PetriNetUnfolderBase]: For 78984/78993 co-relation queries the response was YES.
[2024-06-04 18:18:58,069 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 16436 conditions, 2690 events. 1593/2690 cut-off events. For 78984/78993 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 15891 event pairs, 428 based on Foata normal form. 2/2670 useless extension candidates. Maximal degree in co-relation 16370. Up to 2255 conditions per place. 
[2024-06-04 18:18:58,078 INFO  L140   encePairwiseOnDemand]: 33/43 looper letters, 122 selfloop transitions, 41 changer transitions 0/193 dead transitions.
[2024-06-04 18:18:58,078 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 193 transitions, 2218 flow
[2024-06-04 18:18:58,078 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 18:18:58,078 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 18:18:58,079 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 143 transitions.
[2024-06-04 18:18:58,079 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4750830564784053
[2024-06-04 18:18:58,079 INFO  L175             Difference]: Start difference. First operand has 146 places, 180 transitions, 1830 flow. Second operand 7 states and 143 transitions.
[2024-06-04 18:18:58,079 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 193 transitions, 2218 flow
[2024-06-04 18:18:58,139 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 193 transitions, 2055 flow, removed 0 selfloop flow, removed 7 redundant places.
[2024-06-04 18:18:58,142 INFO  L231             Difference]: Finished difference. Result has 146 places, 183 transitions, 1796 flow
[2024-06-04 18:18:58,142 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1667, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1796, PETRI_PLACES=146, PETRI_TRANSITIONS=183}
[2024-06-04 18:18:58,142 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 102 predicate places.
[2024-06-04 18:18:58,142 INFO  L495      AbstractCegarLoop]: Abstraction has has 146 places, 183 transitions, 1796 flow
[2024-06-04 18:18:58,142 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 14.777777777777779) internal successors, (133), 9 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:18:58,143 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:18:58,143 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-04 18:18:58,143 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35
[2024-06-04 18:18:58,143 INFO  L420      AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:18:58,143 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:18:58,143 INFO  L85        PathProgramCache]: Analyzing trace with hash 356469907, now seen corresponding path program 2 times
[2024-06-04 18:18:58,143 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:18:58,144 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473011983]
[2024-06-04 18:18:58,144 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:18:58,144 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:18:58,179 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:19:07,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-04 18:19:07,209 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:19:07,209 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473011983]
[2024-06-04 18:19:07,209 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473011983] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:19:07,209 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:19:07,209 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:19:07,209 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869311552]
[2024-06-04 18:19:07,209 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:19:07,210 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:19:07,210 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:19:07,210 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:19:07,210 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:19:07,385 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 43
[2024-06-04 18:19:07,386 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 183 transitions, 1796 flow. Second operand  has 9 states, 9 states have (on average 14.777777777777779) internal successors, (133), 9 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:19:07,386 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:19:07,386 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 43
[2024-06-04 18:19:07,386 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:19:08,165 INFO  L124   PetriNetUnfolderBase]: 1587/2682 cut-off events.
[2024-06-04 18:19:08,166 INFO  L125   PetriNetUnfolderBase]: For 81774/81783 co-relation queries the response was YES.
[2024-06-04 18:19:08,177 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 16501 conditions, 2682 events. 1587/2682 cut-off events. For 81774/81783 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 15856 event pairs, 427 based on Foata normal form. 2/2662 useless extension candidates. Maximal degree in co-relation 16434. Up to 2234 conditions per place. 
[2024-06-04 18:19:08,185 INFO  L140   encePairwiseOnDemand]: 34/43 looper letters, 122 selfloop transitions, 44 changer transitions 0/196 dead transitions.
[2024-06-04 18:19:08,185 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 196 transitions, 2196 flow
[2024-06-04 18:19:08,185 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 18:19:08,186 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 18:19:08,186 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 143 transitions.
[2024-06-04 18:19:08,186 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4750830564784053
[2024-06-04 18:19:08,186 INFO  L175             Difference]: Start difference. First operand has 146 places, 183 transitions, 1796 flow. Second operand 7 states and 143 transitions.
[2024-06-04 18:19:08,186 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 196 transitions, 2196 flow
[2024-06-04 18:19:08,247 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 196 transitions, 2093 flow, removed 13 selfloop flow, removed 5 redundant places.
[2024-06-04 18:19:08,249 INFO  L231             Difference]: Finished difference. Result has 148 places, 186 transitions, 1833 flow
[2024-06-04 18:19:08,249 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1693, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1833, PETRI_PLACES=148, PETRI_TRANSITIONS=186}
[2024-06-04 18:19:08,250 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 104 predicate places.
[2024-06-04 18:19:08,250 INFO  L495      AbstractCegarLoop]: Abstraction has has 148 places, 186 transitions, 1833 flow
[2024-06-04 18:19:08,250 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 14.777777777777779) internal successors, (133), 9 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:19:08,250 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:19:08,250 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-04 18:19:08,250 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36
[2024-06-04 18:19:08,250 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-04 18:19:08,250 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:19:08,250 INFO  L85        PathProgramCache]: Analyzing trace with hash -680184329, now seen corresponding path program 1 times
[2024-06-04 18:19:08,251 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:19:08,251 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10542957]
[2024-06-04 18:19:08,251 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:19:08,251 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:19:08,299 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:19:16,757 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:19:16,757 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:19:16,757 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10542957]
[2024-06-04 18:19:16,757 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10542957] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:19:16,758 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:19:16,758 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 18:19:16,758 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962850637]
[2024-06-04 18:19:16,758 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:19:16,758 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 18:19:16,758 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:19:16,759 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 18:19:16,759 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-04 18:19:16,893 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43
[2024-06-04 18:19:16,893 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 186 transitions, 1833 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-04 18:19:16,893 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:19:16,893 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43
[2024-06-04 18:19:16,893 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:19:17,776 INFO  L124   PetriNetUnfolderBase]: 1688/2803 cut-off events.
[2024-06-04 18:19:17,776 INFO  L125   PetriNetUnfolderBase]: For 83924/83926 co-relation queries the response was YES.
[2024-06-04 18:19:17,786 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 17408 conditions, 2803 events. 1688/2803 cut-off events. For 83924/83926 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 16161 event pairs, 437 based on Foata normal form. 1/2802 useless extension candidates. Maximal degree in co-relation 17340. Up to 2544 conditions per place. 
[2024-06-04 18:19:17,795 INFO  L140   encePairwiseOnDemand]: 34/43 looper letters, 184 selfloop transitions, 14 changer transitions 0/205 dead transitions.
[2024-06-04 18:19:17,795 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 205 transitions, 2329 flow
[2024-06-04 18:19:17,796 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 18:19:17,796 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 18:19:17,796 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 139 transitions.
[2024-06-04 18:19:17,796 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46179401993355484
[2024-06-04 18:19:17,797 INFO  L175             Difference]: Start difference. First operand has 148 places, 186 transitions, 1833 flow. Second operand 7 states and 139 transitions.
[2024-06-04 18:19:17,797 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 205 transitions, 2329 flow
[2024-06-04 18:19:17,857 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 205 transitions, 2213 flow, removed 16 selfloop flow, removed 5 redundant places.
[2024-06-04 18:19:17,859 INFO  L231             Difference]: Finished difference. Result has 150 places, 189 transitions, 1809 flow
[2024-06-04 18:19:17,859 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1717, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1809, PETRI_PLACES=150, PETRI_TRANSITIONS=189}
[2024-06-04 18:19:17,860 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 106 predicate places.
[2024-06-04 18:19:17,860 INFO  L495      AbstractCegarLoop]: Abstraction has has 150 places, 189 transitions, 1809 flow
[2024-06-04 18:19:17,860 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-04 18:19:17,860 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:19:17,860 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-04 18:19:17,860 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37
[2024-06-04 18:19:17,860 INFO  L420      AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:19:17,860 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:19:17,860 INFO  L85        PathProgramCache]: Analyzing trace with hash 1731579347, now seen corresponding path program 1 times
[2024-06-04 18:19:17,860 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:19:17,861 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593888572]
[2024-06-04 18:19:17,861 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:19:17,861 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:19:17,902 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:19:26,816 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:19:26,817 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:19:26,817 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593888572]
[2024-06-04 18:19:26,817 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593888572] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:19:26,817 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:19:26,817 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:19:26,817 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529055030]
[2024-06-04 18:19:26,817 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:19:26,817 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:19:26,817 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:19:26,817 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:19:26,817 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:19:26,971 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43
[2024-06-04 18:19:26,972 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 189 transitions, 1809 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-04 18:19:26,972 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:19:26,972 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43
[2024-06-04 18:19:26,972 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:19:27,772 INFO  L124   PetriNetUnfolderBase]: 1703/2822 cut-off events.
[2024-06-04 18:19:27,772 INFO  L125   PetriNetUnfolderBase]: For 89640/89640 co-relation queries the response was YES.
[2024-06-04 18:19:27,784 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 17724 conditions, 2822 events. 1703/2822 cut-off events. For 89640/89640 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 16258 event pairs, 429 based on Foata normal form. 3/2815 useless extension candidates. Maximal degree in co-relation 17655. Up to 2454 conditions per place. 
[2024-06-04 18:19:27,794 INFO  L140   encePairwiseOnDemand]: 31/43 looper letters, 172 selfloop transitions, 45 changer transitions 0/224 dead transitions.
[2024-06-04 18:19:27,794 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 224 transitions, 2503 flow
[2024-06-04 18:19:27,794 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:19:27,794 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:19:27,795 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 163 transitions.
[2024-06-04 18:19:27,795 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4738372093023256
[2024-06-04 18:19:27,795 INFO  L175             Difference]: Start difference. First operand has 150 places, 189 transitions, 1809 flow. Second operand 8 states and 163 transitions.
[2024-06-04 18:19:27,795 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 224 transitions, 2503 flow
[2024-06-04 18:19:27,864 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 224 transitions, 2433 flow, removed 23 selfloop flow, removed 5 redundant places.
[2024-06-04 18:19:27,866 INFO  L231             Difference]: Finished difference. Result has 155 places, 209 transitions, 2110 flow
[2024-06-04 18:19:27,866 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1739, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2110, PETRI_PLACES=155, PETRI_TRANSITIONS=209}
[2024-06-04 18:19:27,867 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 111 predicate places.
[2024-06-04 18:19:27,867 INFO  L495      AbstractCegarLoop]: Abstraction has has 155 places, 209 transitions, 2110 flow
[2024-06-04 18:19:27,867 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-04 18:19:27,867 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:19:27,867 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-04 18:19:27,867 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38
[2024-06-04 18:19:27,867 INFO  L420      AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:19:27,867 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:19:27,868 INFO  L85        PathProgramCache]: Analyzing trace with hash -443824395, now seen corresponding path program 2 times
[2024-06-04 18:19:27,868 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:19:27,868 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559402196]
[2024-06-04 18:19:27,868 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:19:27,868 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:19:27,920 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:19:36,724 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:19:36,724 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:19:36,724 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559402196]
[2024-06-04 18:19:36,724 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559402196] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:19:36,724 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:19:36,724 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:19:36,724 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364280783]
[2024-06-04 18:19:36,724 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:19:36,724 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:19:36,724 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:19:36,725 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:19:36,725 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:19:36,835 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43
[2024-06-04 18:19:36,836 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 209 transitions, 2110 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-04 18:19:36,836 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:19:36,836 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43
[2024-06-04 18:19:36,836 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:19:37,734 INFO  L124   PetriNetUnfolderBase]: 1718/2851 cut-off events.
[2024-06-04 18:19:37,735 INFO  L125   PetriNetUnfolderBase]: For 95879/95879 co-relation queries the response was YES.
[2024-06-04 18:19:37,747 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 18613 conditions, 2851 events. 1718/2851 cut-off events. For 95879/95879 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 16435 event pairs, 419 based on Foata normal form. 3/2844 useless extension candidates. Maximal degree in co-relation 18541. Up to 2390 conditions per place. 
[2024-06-04 18:19:37,757 INFO  L140   encePairwiseOnDemand]: 31/43 looper letters, 165 selfloop transitions, 80 changer transitions 0/252 dead transitions.
[2024-06-04 18:19:37,757 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 252 transitions, 2891 flow
[2024-06-04 18:19:37,772 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 18:19:37,772 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 18:19:37,772 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 183 transitions.
[2024-06-04 18:19:37,773 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4728682170542636
[2024-06-04 18:19:37,773 INFO  L175             Difference]: Start difference. First operand has 155 places, 209 transitions, 2110 flow. Second operand 9 states and 183 transitions.
[2024-06-04 18:19:37,773 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 252 transitions, 2891 flow
[2024-06-04 18:19:37,860 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 252 transitions, 2790 flow, removed 35 selfloop flow, removed 3 redundant places.
[2024-06-04 18:19:37,863 INFO  L231             Difference]: Finished difference. Result has 164 places, 235 transitions, 2534 flow
[2024-06-04 18:19:37,863 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2009, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2534, PETRI_PLACES=164, PETRI_TRANSITIONS=235}
[2024-06-04 18:19:37,863 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 120 predicate places.
[2024-06-04 18:19:37,863 INFO  L495      AbstractCegarLoop]: Abstraction has has 164 places, 235 transitions, 2534 flow
[2024-06-04 18:19:37,863 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-04 18:19:37,864 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:19:37,864 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-04 18:19:37,864 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39
[2024-06-04 18:19:37,864 INFO  L420      AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:19:37,864 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:19:37,864 INFO  L85        PathProgramCache]: Analyzing trace with hash 356476851, now seen corresponding path program 3 times
[2024-06-04 18:19:37,864 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:19:37,865 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6073314]
[2024-06-04 18:19:37,865 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:19:37,865 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:19:37,907 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:19:47,615 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:19:47,615 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:19:47,615 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6073314]
[2024-06-04 18:19:47,615 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6073314] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:19:47,615 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:19:47,616 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:19:47,616 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727753045]
[2024-06-04 18:19:47,616 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:19:47,616 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:19:47,616 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:19:47,616 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:19:47,616 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:19:47,733 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43
[2024-06-04 18:19:47,733 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 235 transitions, 2534 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-04 18:19:47,734 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:19:47,734 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43
[2024-06-04 18:19:47,734 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:19:48,757 INFO  L124   PetriNetUnfolderBase]: 1793/2947 cut-off events.
[2024-06-04 18:19:48,757 INFO  L125   PetriNetUnfolderBase]: For 108329/108329 co-relation queries the response was YES.
[2024-06-04 18:19:48,769 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 20511 conditions, 2947 events. 1793/2947 cut-off events. For 108329/108329 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 16849 event pairs, 418 based on Foata normal form. 6/2943 useless extension candidates. Maximal degree in co-relation 20434. Up to 2332 conditions per place. 
[2024-06-04 18:19:48,777 INFO  L140   encePairwiseOnDemand]: 30/43 looper letters, 122 selfloop transitions, 138 changer transitions 0/267 dead transitions.
[2024-06-04 18:19:48,777 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 267 transitions, 3412 flow
[2024-06-04 18:19:48,778 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-04 18:19:48,778 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-04 18:19:48,778 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 208 transitions.
[2024-06-04 18:19:48,778 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.48372093023255813
[2024-06-04 18:19:48,778 INFO  L175             Difference]: Start difference. First operand has 164 places, 235 transitions, 2534 flow. Second operand 10 states and 208 transitions.
[2024-06-04 18:19:48,778 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 267 transitions, 3412 flow
[2024-06-04 18:19:48,882 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 267 transitions, 3252 flow, removed 43 selfloop flow, removed 4 redundant places.
[2024-06-04 18:19:48,884 INFO  L231             Difference]: Finished difference. Result has 171 places, 250 transitions, 2940 flow
[2024-06-04 18:19:48,885 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2374, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=129, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2940, PETRI_PLACES=171, PETRI_TRANSITIONS=250}
[2024-06-04 18:19:48,885 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 127 predicate places.
[2024-06-04 18:19:48,885 INFO  L495      AbstractCegarLoop]: Abstraction has has 171 places, 250 transitions, 2940 flow
[2024-06-04 18:19:48,885 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-04 18:19:48,885 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:19:48,885 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-04 18:19:48,885 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40
[2024-06-04 18:19:48,885 INFO  L420      AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:19:48,886 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:19:48,886 INFO  L85        PathProgramCache]: Analyzing trace with hash 347905971, now seen corresponding path program 4 times
[2024-06-04 18:19:48,886 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:19:48,886 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121610999]
[2024-06-04 18:19:48,886 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:19:48,886 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:19:48,930 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:19:57,955 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:19:57,955 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:19:57,955 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121610999]
[2024-06-04 18:19:57,955 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121610999] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:19:57,955 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:19:57,955 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:19:57,955 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947357119]
[2024-06-04 18:19:57,955 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:19:57,955 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:19:57,955 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:19:57,955 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:19:57,956 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:19:58,129 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43
[2024-06-04 18:19:58,130 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 250 transitions, 2940 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-04 18:19:58,130 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:19:58,130 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43
[2024-06-04 18:19:58,130 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:19:59,016 INFO  L124   PetriNetUnfolderBase]: 1784/2937 cut-off events.
[2024-06-04 18:19:59,016 INFO  L125   PetriNetUnfolderBase]: For 111717/111717 co-relation queries the response was YES.
[2024-06-04 18:19:59,029 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 21344 conditions, 2937 events. 1784/2937 cut-off events. For 111717/111717 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 16765 event pairs, 414 based on Foata normal form. 3/2930 useless extension candidates. Maximal degree in co-relation 21264. Up to 2482 conditions per place. 
[2024-06-04 18:19:59,037 INFO  L140   encePairwiseOnDemand]: 31/43 looper letters, 191 selfloop transitions, 73 changer transitions 0/271 dead transitions.
[2024-06-04 18:19:59,037 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 271 transitions, 3618 flow
[2024-06-04 18:19:59,038 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 18:19:59,038 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 18:19:59,038 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 183 transitions.
[2024-06-04 18:19:59,038 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4728682170542636
[2024-06-04 18:19:59,038 INFO  L175             Difference]: Start difference. First operand has 171 places, 250 transitions, 2940 flow. Second operand 9 states and 183 transitions.
[2024-06-04 18:19:59,038 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 271 transitions, 3618 flow
[2024-06-04 18:19:59,162 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 271 transitions, 3331 flow, removed 66 selfloop flow, removed 6 redundant places.
[2024-06-04 18:19:59,166 INFO  L231             Difference]: Finished difference. Result has 174 places, 254 transitions, 2909 flow
[2024-06-04 18:19:59,166 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2667, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2909, PETRI_PLACES=174, PETRI_TRANSITIONS=254}
[2024-06-04 18:19:59,166 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 130 predicate places.
[2024-06-04 18:19:59,166 INFO  L495      AbstractCegarLoop]: Abstraction has has 174 places, 254 transitions, 2909 flow
[2024-06-04 18:19:59,166 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-04 18:19:59,166 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:19:59,167 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:19:59,167 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41
[2024-06-04 18:19:59,167 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-04 18:19:59,167 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:19:59,167 INFO  L85        PathProgramCache]: Analyzing trace with hash 1276644368, now seen corresponding path program 1 times
[2024-06-04 18:19:59,167 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:19:59,167 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778988265]
[2024-06-04 18:19:59,167 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:19:59,168 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:19:59,199 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:20:07,364 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:20:07,364 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:20:07,364 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778988265]
[2024-06-04 18:20:07,364 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778988265] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:20:07,364 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:20:07,365 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:20:07,365 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84319710]
[2024-06-04 18:20:07,365 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:20:07,366 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:20:07,366 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:20:07,366 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:20:07,366 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:20:07,556 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43
[2024-06-04 18:20:07,556 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 254 transitions, 2909 flow. Second operand  has 10 states, 10 states have (on average 13.4) internal successors, (134), 10 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:20:07,556 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:20:07,556 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43
[2024-06-04 18:20:07,556 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:20:08,654 INFO  L124   PetriNetUnfolderBase]: 1907/3166 cut-off events.
[2024-06-04 18:20:08,654 INFO  L125   PetriNetUnfolderBase]: For 118769/118771 co-relation queries the response was YES.
[2024-06-04 18:20:08,669 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 22252 conditions, 3166 events. 1907/3166 cut-off events. For 118769/118771 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 18605 event pairs, 430 based on Foata normal form. 12/3174 useless extension candidates. Maximal degree in co-relation 22170. Up to 2453 conditions per place. 
[2024-06-04 18:20:08,678 INFO  L140   encePairwiseOnDemand]: 32/43 looper letters, 242 selfloop transitions, 48 changer transitions 0/297 dead transitions.
[2024-06-04 18:20:08,679 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 297 transitions, 3743 flow
[2024-06-04 18:20:08,680 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 18:20:08,680 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 18:20:08,680 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 195 transitions.
[2024-06-04 18:20:08,681 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5038759689922481
[2024-06-04 18:20:08,681 INFO  L175             Difference]: Start difference. First operand has 174 places, 254 transitions, 2909 flow. Second operand 9 states and 195 transitions.
[2024-06-04 18:20:08,681 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 297 transitions, 3743 flow
[2024-06-04 18:20:08,795 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 297 transitions, 3527 flow, removed 33 selfloop flow, removed 6 redundant places.
[2024-06-04 18:20:08,798 INFO  L231             Difference]: Finished difference. Result has 179 places, 260 transitions, 2906 flow
[2024-06-04 18:20:08,798 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2693, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2906, PETRI_PLACES=179, PETRI_TRANSITIONS=260}
[2024-06-04 18:20:08,798 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 135 predicate places.
[2024-06-04 18:20:08,799 INFO  L495      AbstractCegarLoop]: Abstraction has has 179 places, 260 transitions, 2906 flow
[2024-06-04 18:20:08,799 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 13.4) internal successors, (134), 10 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:20:08,799 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:20:08,799 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:20:08,799 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42
[2024-06-04 18:20:08,799 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-04 18:20:08,799 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:20:08,799 INFO  L85        PathProgramCache]: Analyzing trace with hash -431531690, now seen corresponding path program 2 times
[2024-06-04 18:20:08,800 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:20:08,800 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451968521]
[2024-06-04 18:20:08,800 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:20:08,800 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:20:08,836 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:20:16,893 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:20:16,893 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:20:16,893 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451968521]
[2024-06-04 18:20:16,893 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451968521] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:20:16,893 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:20:16,893 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:20:16,893 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135662319]
[2024-06-04 18:20:16,893 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:20:16,893 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:20:16,893 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:20:16,894 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:20:16,894 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:20:17,014 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43
[2024-06-04 18:20:17,014 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 260 transitions, 2906 flow. Second operand  has 10 states, 10 states have (on average 13.4) internal successors, (134), 10 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:20:17,014 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:20:17,014 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43
[2024-06-04 18:20:17,014 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:20:18,223 INFO  L124   PetriNetUnfolderBase]: 2017/3384 cut-off events.
[2024-06-04 18:20:18,223 INFO  L125   PetriNetUnfolderBase]: For 127426/127428 co-relation queries the response was YES.
[2024-06-04 18:20:18,240 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 23480 conditions, 3384 events. 2017/3384 cut-off events. For 127426/127428 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 20393 event pairs, 456 based on Foata normal form. 12/3394 useless extension candidates. Maximal degree in co-relation 23396. Up to 2726 conditions per place. 
[2024-06-04 18:20:18,251 INFO  L140   encePairwiseOnDemand]: 32/43 looper letters, 253 selfloop transitions, 50 changer transitions 0/310 dead transitions.
[2024-06-04 18:20:18,252 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 310 transitions, 3781 flow
[2024-06-04 18:20:18,253 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-04 18:20:18,253 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-04 18:20:18,253 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 233 transitions.
[2024-06-04 18:20:18,254 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.492600422832981
[2024-06-04 18:20:18,254 INFO  L175             Difference]: Start difference. First operand has 179 places, 260 transitions, 2906 flow. Second operand 11 states and 233 transitions.
[2024-06-04 18:20:18,254 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 310 transitions, 3781 flow
[2024-06-04 18:20:18,409 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 310 transitions, 3685 flow, removed 14 selfloop flow, removed 4 redundant places.
[2024-06-04 18:20:18,412 INFO  L231             Difference]: Finished difference. Result has 188 places, 266 transitions, 3019 flow
[2024-06-04 18:20:18,412 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2816, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3019, PETRI_PLACES=188, PETRI_TRANSITIONS=266}
[2024-06-04 18:20:18,413 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 144 predicate places.
[2024-06-04 18:20:18,413 INFO  L495      AbstractCegarLoop]: Abstraction has has 188 places, 266 transitions, 3019 flow
[2024-06-04 18:20:18,413 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 13.4) internal successors, (134), 10 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:20:18,413 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:20:18,413 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:20:18,413 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43
[2024-06-04 18:20:18,414 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-04 18:20:18,414 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:20:18,414 INFO  L85        PathProgramCache]: Analyzing trace with hash 2102303974, now seen corresponding path program 3 times
[2024-06-04 18:20:18,414 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:20:18,414 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787495841]
[2024-06-04 18:20:18,414 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:20:18,414 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:20:18,450 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:20:26,218 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:20:26,219 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:20:26,219 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787495841]
[2024-06-04 18:20:26,219 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787495841] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:20:26,219 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:20:26,219 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:20:26,219 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689491041]
[2024-06-04 18:20:26,219 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:20:26,219 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:20:26,219 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:20:26,220 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:20:26,220 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:20:26,456 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43
[2024-06-04 18:20:26,456 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 266 transitions, 3019 flow. Second operand  has 10 states, 10 states have (on average 13.4) internal successors, (134), 10 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:20:26,456 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:20:26,456 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43
[2024-06-04 18:20:26,457 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:20:27,875 INFO  L124   PetriNetUnfolderBase]: 2099/3536 cut-off events.
[2024-06-04 18:20:27,875 INFO  L125   PetriNetUnfolderBase]: For 135393/135395 co-relation queries the response was YES.
[2024-06-04 18:20:27,895 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 24540 conditions, 3536 events. 2099/3536 cut-off events. For 135393/135395 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 21625 event pairs, 481 based on Foata normal form. 12/3546 useless extension candidates. Maximal degree in co-relation 24453. Up to 2868 conditions per place. 
[2024-06-04 18:20:27,906 INFO  L140   encePairwiseOnDemand]: 32/43 looper letters, 255 selfloop transitions, 56 changer transitions 0/318 dead transitions.
[2024-06-04 18:20:27,906 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 318 transitions, 3909 flow
[2024-06-04 18:20:27,908 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2024-06-04 18:20:27,909 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 12 states.
[2024-06-04 18:20:27,909 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 249 transitions.
[2024-06-04 18:20:27,909 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.48255813953488375
[2024-06-04 18:20:27,909 INFO  L175             Difference]: Start difference. First operand has 188 places, 266 transitions, 3019 flow. Second operand 12 states and 249 transitions.
[2024-06-04 18:20:27,909 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 318 transitions, 3909 flow
[2024-06-04 18:20:28,050 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 318 transitions, 3782 flow, removed 17 selfloop flow, removed 7 redundant places.
[2024-06-04 18:20:28,054 INFO  L231             Difference]: Finished difference. Result has 194 places, 270 transitions, 3088 flow
[2024-06-04 18:20:28,054 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2894, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=266, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=3088, PETRI_PLACES=194, PETRI_TRANSITIONS=270}
[2024-06-04 18:20:28,055 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 150 predicate places.
[2024-06-04 18:20:28,055 INFO  L495      AbstractCegarLoop]: Abstraction has has 194 places, 270 transitions, 3088 flow
[2024-06-04 18:20:28,055 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 13.4) internal successors, (134), 10 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:20:28,055 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:20:28,055 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:20:28,055 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44
[2024-06-04 18:20:28,055 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-04 18:20:28,056 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:20:28,056 INFO  L85        PathProgramCache]: Analyzing trace with hash 1654863940, now seen corresponding path program 4 times
[2024-06-04 18:20:28,056 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:20:28,056 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114364336]
[2024-06-04 18:20:28,056 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:20:28,056 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:20:28,088 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:20:36,829 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:20:36,829 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:20:36,829 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114364336]
[2024-06-04 18:20:36,829 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114364336] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:20:36,829 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:20:36,829 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:20:36,829 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877741767]
[2024-06-04 18:20:36,829 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:20:36,829 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:20:36,831 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:20:36,832 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:20:36,832 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:20:37,102 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43
[2024-06-04 18:20:37,112 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 270 transitions, 3088 flow. Second operand  has 10 states, 10 states have (on average 13.4) internal successors, (134), 10 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:20:37,112 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:20:37,112 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43
[2024-06-04 18:20:37,112 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:20:38,357 INFO  L124   PetriNetUnfolderBase]: 2079/3504 cut-off events.
[2024-06-04 18:20:38,357 INFO  L125   PetriNetUnfolderBase]: For 134082/134084 co-relation queries the response was YES.
[2024-06-04 18:20:38,376 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 23821 conditions, 3504 events. 2079/3504 cut-off events. For 134082/134084 co-relation queries the response was YES. Maximal size of possible extension queue 232. Compared 21372 event pairs, 417 based on Foata normal form. 12/3514 useless extension candidates. Maximal degree in co-relation 23733. Up to 2276 conditions per place. 
[2024-06-04 18:20:38,387 INFO  L140   encePairwiseOnDemand]: 32/43 looper letters, 244 selfloop transitions, 67 changer transitions 0/318 dead transitions.
[2024-06-04 18:20:38,387 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 318 transitions, 3872 flow
[2024-06-04 18:20:38,387 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2024-06-04 18:20:38,387 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 12 states.
[2024-06-04 18:20:38,388 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 248 transitions.
[2024-06-04 18:20:38,388 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4806201550387597
[2024-06-04 18:20:38,388 INFO  L175             Difference]: Start difference. First operand has 194 places, 270 transitions, 3088 flow. Second operand 12 states and 248 transitions.
[2024-06-04 18:20:38,388 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 318 transitions, 3872 flow
[2024-06-04 18:20:38,530 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 318 transitions, 3764 flow, removed 14 selfloop flow, removed 7 redundant places.
[2024-06-04 18:20:38,534 INFO  L231             Difference]: Finished difference. Result has 198 places, 269 transitions, 3078 flow
[2024-06-04 18:20:38,534 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2940, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=3078, PETRI_PLACES=198, PETRI_TRANSITIONS=269}
[2024-06-04 18:20:38,534 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 154 predicate places.
[2024-06-04 18:20:38,534 INFO  L495      AbstractCegarLoop]: Abstraction has has 198 places, 269 transitions, 3078 flow
[2024-06-04 18:20:38,534 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 13.4) internal successors, (134), 10 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:20:38,534 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:20:38,534 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:20:38,535 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45
[2024-06-04 18:20:38,535 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-04 18:20:38,535 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:20:38,535 INFO  L85        PathProgramCache]: Analyzing trace with hash -1833798423, now seen corresponding path program 1 times
[2024-06-04 18:20:38,535 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:20:38,535 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484126464]
[2024-06-04 18:20:38,535 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:20:38,535 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:20:38,574 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:20:48,481 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:20:48,481 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:20:48,481 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484126464]
[2024-06-04 18:20:48,481 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484126464] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:20:48,481 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:20:48,481 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:20:48,481 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669694144]
[2024-06-04 18:20:48,481 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:20:48,482 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:20:48,482 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:20:48,482 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:20:48,482 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:20:48,657 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 43
[2024-06-04 18:20:48,657 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 269 transitions, 3078 flow. Second operand  has 9 states, 9 states have (on average 14.88888888888889) internal successors, (134), 9 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:20:48,657 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:20:48,657 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 43
[2024-06-04 18:20:48,657 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:20:49,629 INFO  L124   PetriNetUnfolderBase]: 2052/3473 cut-off events.
[2024-06-04 18:20:49,629 INFO  L125   PetriNetUnfolderBase]: For 151531/151559 co-relation queries the response was YES.
[2024-06-04 18:20:49,647 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 24502 conditions, 3473 events. 2052/3473 cut-off events. For 151531/151559 co-relation queries the response was YES. Maximal size of possible extension queue 238. Compared 21461 event pairs, 474 based on Foata normal form. 17/3453 useless extension candidates. Maximal degree in co-relation 24413. Up to 2757 conditions per place. 
[2024-06-04 18:20:49,658 INFO  L140   encePairwiseOnDemand]: 34/43 looper letters, 198 selfloop transitions, 50 changer transitions 0/292 dead transitions.
[2024-06-04 18:20:49,658 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 292 transitions, 3824 flow
[2024-06-04 18:20:49,658 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:20:49,658 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:20:49,658 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 166 transitions.
[2024-06-04 18:20:49,659 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.48255813953488375
[2024-06-04 18:20:49,659 INFO  L175             Difference]: Start difference. First operand has 198 places, 269 transitions, 3078 flow. Second operand 8 states and 166 transitions.
[2024-06-04 18:20:49,659 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 292 transitions, 3824 flow
[2024-06-04 18:20:49,805 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 292 transitions, 3645 flow, removed 14 selfloop flow, removed 11 redundant places.
[2024-06-04 18:20:49,808 INFO  L231             Difference]: Finished difference. Result has 195 places, 271 transitions, 3045 flow
[2024-06-04 18:20:49,808 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2899, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3045, PETRI_PLACES=195, PETRI_TRANSITIONS=271}
[2024-06-04 18:20:49,809 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 151 predicate places.
[2024-06-04 18:20:49,809 INFO  L495      AbstractCegarLoop]: Abstraction has has 195 places, 271 transitions, 3045 flow
[2024-06-04 18:20:49,809 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 14.88888888888889) internal successors, (134), 9 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:20:49,809 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:20:49,809 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:20:49,809 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46
[2024-06-04 18:20:49,809 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-04 18:20:49,810 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:20:49,810 INFO  L85        PathProgramCache]: Analyzing trace with hash -864671253, now seen corresponding path program 2 times
[2024-06-04 18:20:49,810 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:20:49,810 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454768005]
[2024-06-04 18:20:49,810 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:20:49,810 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:20:49,850 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:20:58,448 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:20:58,448 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:20:58,448 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454768005]
[2024-06-04 18:20:58,449 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454768005] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:20:58,449 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:20:58,449 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:20:58,449 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60293482]
[2024-06-04 18:20:58,449 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:20:58,449 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:20:58,449 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:20:58,449 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:20:58,449 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:20:58,597 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 43
[2024-06-04 18:20:58,597 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 271 transitions, 3045 flow. Second operand  has 9 states, 9 states have (on average 14.88888888888889) internal successors, (134), 9 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:20:58,598 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:20:58,598 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 43
[2024-06-04 18:20:58,598 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:20:59,634 INFO  L124   PetriNetUnfolderBase]: 2075/3511 cut-off events.
[2024-06-04 18:20:59,634 INFO  L125   PetriNetUnfolderBase]: For 156433/156461 co-relation queries the response was YES.
[2024-06-04 18:20:59,652 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 24468 conditions, 3511 events. 2075/3511 cut-off events. For 156433/156461 co-relation queries the response was YES. Maximal size of possible extension queue 239. Compared 21723 event pairs, 482 based on Foata normal form. 18/3493 useless extension candidates. Maximal degree in co-relation 24379. Up to 2947 conditions per place. 
[2024-06-04 18:20:59,661 INFO  L140   encePairwiseOnDemand]: 34/43 looper letters, 195 selfloop transitions, 48 changer transitions 0/287 dead transitions.
[2024-06-04 18:20:59,661 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 287 transitions, 3625 flow
[2024-06-04 18:20:59,662 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:20:59,662 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:20:59,662 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 161 transitions.
[2024-06-04 18:20:59,662 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4680232558139535
[2024-06-04 18:20:59,662 INFO  L175             Difference]: Start difference. First operand has 195 places, 271 transitions, 3045 flow. Second operand 8 states and 161 transitions.
[2024-06-04 18:20:59,662 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 287 transitions, 3625 flow
[2024-06-04 18:20:59,774 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 287 transitions, 3561 flow, removed 4 selfloop flow, removed 4 redundant places.
[2024-06-04 18:20:59,777 INFO  L231             Difference]: Finished difference. Result has 199 places, 272 transitions, 3106 flow
[2024-06-04 18:20:59,778 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2981, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=271, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3106, PETRI_PLACES=199, PETRI_TRANSITIONS=272}
[2024-06-04 18:20:59,778 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 155 predicate places.
[2024-06-04 18:20:59,778 INFO  L495      AbstractCegarLoop]: Abstraction has has 199 places, 272 transitions, 3106 flow
[2024-06-04 18:20:59,778 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 14.88888888888889) internal successors, (134), 9 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:20:59,778 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:20:59,778 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:20:59,778 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47
[2024-06-04 18:20:59,779 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-04 18:20:59,779 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:20:59,779 INFO  L85        PathProgramCache]: Analyzing trace with hash -1849987863, now seen corresponding path program 3 times
[2024-06-04 18:20:59,779 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:20:59,779 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184706342]
[2024-06-04 18:20:59,779 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:20:59,779 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:20:59,815 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:21:08,626 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:21:08,626 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:21:08,626 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184706342]
[2024-06-04 18:21:08,626 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184706342] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:21:08,626 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:21:08,626 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:21:08,626 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750578785]
[2024-06-04 18:21:08,626 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:21:08,626 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:21:08,627 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:21:08,627 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:21:08,627 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:21:08,820 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 43
[2024-06-04 18:21:08,820 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 272 transitions, 3106 flow. Second operand  has 9 states, 9 states have (on average 14.88888888888889) internal successors, (134), 9 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:21:08,820 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:21:08,820 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 43
[2024-06-04 18:21:08,820 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:21:09,820 INFO  L124   PetriNetUnfolderBase]: 2085/3529 cut-off events.
[2024-06-04 18:21:09,820 INFO  L125   PetriNetUnfolderBase]: For 159261/159282 co-relation queries the response was YES.
[2024-06-04 18:21:09,838 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 24666 conditions, 3529 events. 2085/3529 cut-off events. For 159261/159282 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 21880 event pairs, 484 based on Foata normal form. 13/3506 useless extension candidates. Maximal degree in co-relation 24575. Up to 2975 conditions per place. 
[2024-06-04 18:21:09,848 INFO  L140   encePairwiseOnDemand]: 33/43 looper letters, 202 selfloop transitions, 42 changer transitions 0/288 dead transitions.
[2024-06-04 18:21:09,848 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 288 transitions, 3690 flow
[2024-06-04 18:21:09,848 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:21:09,849 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:21:09,849 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 161 transitions.
[2024-06-04 18:21:09,849 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4680232558139535
[2024-06-04 18:21:09,849 INFO  L175             Difference]: Start difference. First operand has 199 places, 272 transitions, 3106 flow. Second operand 8 states and 161 transitions.
[2024-06-04 18:21:09,849 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 288 transitions, 3690 flow
[2024-06-04 18:21:10,009 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 288 transitions, 3589 flow, removed 4 selfloop flow, removed 6 redundant places.
[2024-06-04 18:21:10,012 INFO  L231             Difference]: Finished difference. Result has 201 places, 273 transitions, 3120 flow
[2024-06-04 18:21:10,012 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=3005, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=230, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3120, PETRI_PLACES=201, PETRI_TRANSITIONS=273}
[2024-06-04 18:21:10,013 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 157 predicate places.
[2024-06-04 18:21:10,013 INFO  L495      AbstractCegarLoop]: Abstraction has has 201 places, 273 transitions, 3120 flow
[2024-06-04 18:21:10,013 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 14.88888888888889) internal successors, (134), 9 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:21:10,013 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:21:10,013 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:21:10,013 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48
[2024-06-04 18:21:10,013 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-04 18:21:10,013 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:21:10,013 INFO  L85        PathProgramCache]: Analyzing trace with hash -1472712809, now seen corresponding path program 1 times
[2024-06-04 18:21:10,013 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:21:10,013 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321270295]
[2024-06-04 18:21:10,014 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:21:10,014 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:21:10,062 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:21:18,478 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:21:18,478 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:21:18,478 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321270295]
[2024-06-04 18:21:18,478 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321270295] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:21:18,478 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:21:18,478 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:21:18,478 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017183287]
[2024-06-04 18:21:18,478 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:21:18,478 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:21:18,478 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:21:18,479 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:21:18,479 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:21:18,618 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43
[2024-06-04 18:21:18,618 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 273 transitions, 3120 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-04 18:21:18,618 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:21:18,618 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43
[2024-06-04 18:21:18,618 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:21:19,745 INFO  L124   PetriNetUnfolderBase]: 2216/3720 cut-off events.
[2024-06-04 18:21:19,746 INFO  L125   PetriNetUnfolderBase]: For 156978/156978 co-relation queries the response was YES.
[2024-06-04 18:21:19,763 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 25693 conditions, 3720 events. 2216/3720 cut-off events. For 156978/156978 co-relation queries the response was YES. Maximal size of possible extension queue 247. Compared 22940 event pairs, 507 based on Foata normal form. 2/3716 useless extension candidates. Maximal degree in co-relation 25601. Up to 3308 conditions per place. 
[2024-06-04 18:21:19,774 INFO  L140   encePairwiseOnDemand]: 32/43 looper letters, 256 selfloop transitions, 38 changer transitions 0/301 dead transitions.
[2024-06-04 18:21:19,774 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 301 transitions, 4002 flow
[2024-06-04 18:21:19,774 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:21:19,774 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:21:19,775 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 161 transitions.
[2024-06-04 18:21:19,776 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4680232558139535
[2024-06-04 18:21:19,776 INFO  L175             Difference]: Start difference. First operand has 201 places, 273 transitions, 3120 flow. Second operand 8 states and 161 transitions.
[2024-06-04 18:21:19,776 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 301 transitions, 4002 flow
[2024-06-04 18:21:19,947 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 301 transitions, 3911 flow, removed 5 selfloop flow, removed 6 redundant places.
[2024-06-04 18:21:19,951 INFO  L231             Difference]: Finished difference. Result has 204 places, 281 transitions, 3272 flow
[2024-06-04 18:21:19,951 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=3029, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=273, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3272, PETRI_PLACES=204, PETRI_TRANSITIONS=281}
[2024-06-04 18:21:19,951 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 160 predicate places.
[2024-06-04 18:21:19,951 INFO  L495      AbstractCegarLoop]: Abstraction has has 204 places, 281 transitions, 3272 flow
[2024-06-04 18:21:19,951 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-04 18:21:19,951 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:21:19,951 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:21:19,952 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49
[2024-06-04 18:21:19,952 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-04 18:21:19,952 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:21:19,952 INFO  L85        PathProgramCache]: Analyzing trace with hash 13115051, now seen corresponding path program 1 times
[2024-06-04 18:21:19,952 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:21:19,952 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034767277]
[2024-06-04 18:21:19,952 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:21:19,952 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:21:19,990 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:21:28,612 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:21:28,612 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:21:28,612 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034767277]
[2024-06-04 18:21:28,612 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034767277] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:21:28,612 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:21:28,612 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-04 18:21:28,612 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862035608]
[2024-06-04 18:21:28,612 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:21:28,612 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-04 18:21:28,613 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:21:28,613 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-04 18:21:28,613 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110
[2024-06-04 18:21:28,765 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43
[2024-06-04 18:21:28,765 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 281 transitions, 3272 flow. Second operand  has 11 states, 11 states have (on average 13.545454545454545) internal successors, (149), 11 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:21:28,765 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:21:28,765 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43
[2024-06-04 18:21:28,765 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:21:29,900 INFO  L124   PetriNetUnfolderBase]: 2232/3746 cut-off events.
[2024-06-04 18:21:29,900 INFO  L125   PetriNetUnfolderBase]: For 167276/167276 co-relation queries the response was YES.
[2024-06-04 18:21:29,921 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 26309 conditions, 3746 events. 2232/3746 cut-off events. For 167276/167276 co-relation queries the response was YES. Maximal size of possible extension queue 249. Compared 23098 event pairs, 506 based on Foata normal form. 4/3744 useless extension candidates. Maximal degree in co-relation 26215. Up to 3349 conditions per place. 
[2024-06-04 18:21:29,934 INFO  L140   encePairwiseOnDemand]: 31/43 looper letters, 264 selfloop transitions, 40 changer transitions 0/311 dead transitions.
[2024-06-04 18:21:29,934 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 311 transitions, 4085 flow
[2024-06-04 18:21:29,934 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-04 18:21:29,934 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-04 18:21:29,935 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 188 transitions.
[2024-06-04 18:21:29,935 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4372093023255814
[2024-06-04 18:21:29,935 INFO  L175             Difference]: Start difference. First operand has 204 places, 281 transitions, 3272 flow. Second operand 10 states and 188 transitions.
[2024-06-04 18:21:29,935 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 311 transitions, 4085 flow
[2024-06-04 18:21:30,127 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 311 transitions, 3955 flow, removed 47 selfloop flow, removed 4 redundant places.
[2024-06-04 18:21:30,130 INFO  L231             Difference]: Finished difference. Result has 214 places, 293 transitions, 3425 flow
[2024-06-04 18:21:30,130 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=3143, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3425, PETRI_PLACES=214, PETRI_TRANSITIONS=293}
[2024-06-04 18:21:30,130 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 170 predicate places.
[2024-06-04 18:21:30,131 INFO  L495      AbstractCegarLoop]: Abstraction has has 214 places, 293 transitions, 3425 flow
[2024-06-04 18:21:30,131 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 13.545454545454545) internal successors, (149), 11 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:21:30,131 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:21:30,131 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:21:30,131 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50
[2024-06-04 18:21:30,131 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-04 18:21:30,131 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:21:30,131 INFO  L85        PathProgramCache]: Analyzing trace with hash -1130153269, now seen corresponding path program 2 times
[2024-06-04 18:21:30,131 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:21:30,131 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984740554]
[2024-06-04 18:21:30,131 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:21:30,131 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:21:30,180 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:21:39,571 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:21:39,571 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:21:39,571 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984740554]
[2024-06-04 18:21:39,572 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984740554] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:21:39,572 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:21:39,572 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:21:39,572 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896977474]
[2024-06-04 18:21:39,572 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:21:39,572 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:21:39,572 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:21:39,572 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:21:39,572 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:21:39,778 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43
[2024-06-04 18:21:39,778 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 293 transitions, 3425 flow. Second operand  has 10 states, 10 states have (on average 13.7) internal successors, (137), 10 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:21:39,778 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:21:39,778 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43
[2024-06-04 18:21:39,778 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:21:40,894 INFO  L124   PetriNetUnfolderBase]: 2248/3763 cut-off events.
[2024-06-04 18:21:40,894 INFO  L125   PetriNetUnfolderBase]: For 175187/175187 co-relation queries the response was YES.
[2024-06-04 18:21:40,916 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 26850 conditions, 3763 events. 2248/3763 cut-off events. For 175187/175187 co-relation queries the response was YES. Maximal size of possible extension queue 252. Compared 23207 event pairs, 520 based on Foata normal form. 4/3759 useless extension candidates. Maximal degree in co-relation 26750. Up to 3310 conditions per place. 
[2024-06-04 18:21:40,930 INFO  L140   encePairwiseOnDemand]: 32/43 looper letters, 261 selfloop transitions, 57 changer transitions 0/325 dead transitions.
[2024-06-04 18:21:40,930 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 325 transitions, 4346 flow
[2024-06-04 18:21:40,931 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 18:21:40,931 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 18:21:40,931 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 174 transitions.
[2024-06-04 18:21:40,931 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4496124031007752
[2024-06-04 18:21:40,931 INFO  L175             Difference]: Start difference. First operand has 214 places, 293 transitions, 3425 flow. Second operand 9 states and 174 transitions.
[2024-06-04 18:21:40,931 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 325 transitions, 4346 flow
[2024-06-04 18:21:41,103 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 325 transitions, 4251 flow, removed 29 selfloop flow, removed 3 redundant places.
[2024-06-04 18:21:41,107 INFO  L231             Difference]: Finished difference. Result has 224 places, 308 transitions, 3740 flow
[2024-06-04 18:21:41,107 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=3330, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=293, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=236, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3740, PETRI_PLACES=224, PETRI_TRANSITIONS=308}
[2024-06-04 18:21:41,107 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 180 predicate places.
[2024-06-04 18:21:41,107 INFO  L495      AbstractCegarLoop]: Abstraction has has 224 places, 308 transitions, 3740 flow
[2024-06-04 18:21:41,107 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 13.7) internal successors, (137), 10 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:21:41,107 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:21:41,107 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:21:41,108 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51
[2024-06-04 18:21:41,108 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-04 18:21:41,108 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:21:41,108 INFO  L85        PathProgramCache]: Analyzing trace with hash -873652759, now seen corresponding path program 3 times
[2024-06-04 18:21:41,108 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:21:41,108 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102335246]
[2024-06-04 18:21:41,108 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:21:41,108 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:21:41,145 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:21:50,577 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:21:50,577 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:21:50,577 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102335246]
[2024-06-04 18:21:50,577 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102335246] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:21:50,577 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:21:50,577 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-04 18:21:50,577 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758636419]
[2024-06-04 18:21:50,577 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:21:50,577 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-04 18:21:50,577 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:21:50,578 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-04 18:21:50,578 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110
[2024-06-04 18:21:50,735 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43
[2024-06-04 18:21:50,735 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 308 transitions, 3740 flow. Second operand  has 11 states, 11 states have (on average 13.545454545454545) internal successors, (149), 11 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:21:50,735 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:21:50,735 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43
[2024-06-04 18:21:50,735 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:21:51,927 INFO  L124   PetriNetUnfolderBase]: 2292/3835 cut-off events.
[2024-06-04 18:21:51,927 INFO  L125   PetriNetUnfolderBase]: For 193262/193262 co-relation queries the response was YES.
[2024-06-04 18:21:51,951 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 27758 conditions, 3835 events. 2292/3835 cut-off events. For 193262/193262 co-relation queries the response was YES. Maximal size of possible extension queue 257. Compared 23696 event pairs, 522 based on Foata normal form. 12/3838 useless extension candidates. Maximal degree in co-relation 27652. Up to 3275 conditions per place. 
[2024-06-04 18:21:51,965 INFO  L140   encePairwiseOnDemand]: 31/43 looper letters, 230 selfloop transitions, 95 changer transitions 0/332 dead transitions.
[2024-06-04 18:21:51,965 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 332 transitions, 4562 flow
[2024-06-04 18:21:51,965 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-04 18:21:51,965 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-04 18:21:51,966 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 202 transitions.
[2024-06-04 18:21:51,966 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4697674418604651
[2024-06-04 18:21:51,966 INFO  L175             Difference]: Start difference. First operand has 224 places, 308 transitions, 3740 flow. Second operand 10 states and 202 transitions.
[2024-06-04 18:21:51,966 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 332 transitions, 4562 flow
[2024-06-04 18:21:52,165 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 332 transitions, 4444 flow, removed 32 selfloop flow, removed 3 redundant places.
[2024-06-04 18:21:52,168 INFO  L231             Difference]: Finished difference. Result has 231 places, 311 transitions, 3901 flow
[2024-06-04 18:21:52,169 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=3622, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=308, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=92, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3901, PETRI_PLACES=231, PETRI_TRANSITIONS=311}
[2024-06-04 18:21:52,169 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 187 predicate places.
[2024-06-04 18:21:52,169 INFO  L495      AbstractCegarLoop]: Abstraction has has 231 places, 311 transitions, 3901 flow
[2024-06-04 18:21:52,169 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 13.545454545454545) internal successors, (149), 11 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:21:52,169 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:21:52,169 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:21:52,169 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52
[2024-06-04 18:21:52,170 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-04 18:21:52,170 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:21:52,170 INFO  L85        PathProgramCache]: Analyzing trace with hash -864129559, now seen corresponding path program 4 times
[2024-06-04 18:21:52,170 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:21:52,170 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333302656]
[2024-06-04 18:21:52,170 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:21:52,170 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:21:52,209 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:22:02,651 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:22:02,652 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:22:02,652 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333302656]
[2024-06-04 18:22:02,652 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333302656] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:22:02,652 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:22:02,652 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-04 18:22:02,652 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234360077]
[2024-06-04 18:22:02,652 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:22:02,652 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-04 18:22:02,652 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:22:02,652 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-04 18:22:02,652 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110
[2024-06-04 18:22:02,873 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43
[2024-06-04 18:22:02,874 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 311 transitions, 3901 flow. Second operand  has 11 states, 11 states have (on average 13.545454545454545) internal successors, (149), 11 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:22:02,874 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:22:02,874 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43
[2024-06-04 18:22:02,874 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:22:04,431 INFO  L124   PetriNetUnfolderBase]: 2791/4652 cut-off events.
[2024-06-04 18:22:04,432 INFO  L125   PetriNetUnfolderBase]: For 307779/307779 co-relation queries the response was YES.
[2024-06-04 18:22:04,458 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 36883 conditions, 4652 events. 2791/4652 cut-off events. For 307779/307779 co-relation queries the response was YES. Maximal size of possible extension queue 293. Compared 29356 event pairs, 667 based on Foata normal form. 14/4657 useless extension candidates. Maximal degree in co-relation 36776. Up to 3124 conditions per place. 
[2024-06-04 18:22:04,474 INFO  L140   encePairwiseOnDemand]: 30/43 looper letters, 173 selfloop transitions, 168 changer transitions 0/348 dead transitions.
[2024-06-04 18:22:04,474 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 348 transitions, 5157 flow
[2024-06-04 18:22:04,475 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-04 18:22:04,475 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-04 18:22:04,475 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 215 transitions.
[2024-06-04 18:22:04,475 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5
[2024-06-04 18:22:04,475 INFO  L175             Difference]: Start difference. First operand has 231 places, 311 transitions, 3901 flow. Second operand 10 states and 215 transitions.
[2024-06-04 18:22:04,475 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 348 transitions, 5157 flow
[2024-06-04 18:22:04,707 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 348 transitions, 4922 flow, removed 25 selfloop flow, removed 8 redundant places.
[2024-06-04 18:22:04,711 INFO  L231             Difference]: Finished difference. Result has 234 places, 319 transitions, 4262 flow
[2024-06-04 18:22:04,711 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=3666, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=311, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=163, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4262, PETRI_PLACES=234, PETRI_TRANSITIONS=319}
[2024-06-04 18:22:04,711 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 190 predicate places.
[2024-06-04 18:22:04,712 INFO  L495      AbstractCegarLoop]: Abstraction has has 234 places, 319 transitions, 4262 flow
[2024-06-04 18:22:04,712 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 13.545454545454545) internal successors, (149), 11 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:22:04,712 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:22:04,712 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:22:04,712 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53
[2024-06-04 18:22:04,712 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-04 18:22:04,712 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:22:04,712 INFO  L85        PathProgramCache]: Analyzing trace with hash -1834117909, now seen corresponding path program 5 times
[2024-06-04 18:22:04,712 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:22:04,712 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254810816]
[2024-06-04 18:22:04,712 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:22:04,712 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:22:04,750 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:22:13,840 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:22:13,840 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:22:13,840 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254810816]
[2024-06-04 18:22:13,840 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254810816] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:22:13,840 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:22:13,840 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-04 18:22:13,840 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972689341]
[2024-06-04 18:22:13,840 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:22:13,840 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-04 18:22:13,840 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:22:13,841 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-04 18:22:13,841 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110
[2024-06-04 18:22:14,083 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43
[2024-06-04 18:22:14,083 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 319 transitions, 4262 flow. Second operand  has 11 states, 11 states have (on average 13.545454545454545) internal successors, (149), 11 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:22:14,083 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:22:14,083 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43
[2024-06-04 18:22:14,083 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:22:15,529 INFO  L124   PetriNetUnfolderBase]: 2809/4660 cut-off events.
[2024-06-04 18:22:15,529 INFO  L125   PetriNetUnfolderBase]: For 312599/312599 co-relation queries the response was YES.
[2024-06-04 18:22:15,559 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 37781 conditions, 4660 events. 2809/4660 cut-off events. For 312599/312599 co-relation queries the response was YES. Maximal size of possible extension queue 289. Compared 29242 event pairs, 716 based on Foata normal form. 12/4663 useless extension candidates. Maximal degree in co-relation 37672. Up to 4042 conditions per place. 
[2024-06-04 18:22:15,576 INFO  L140   encePairwiseOnDemand]: 31/43 looper letters, 224 selfloop transitions, 117 changer transitions 0/348 dead transitions.
[2024-06-04 18:22:15,576 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 348 transitions, 5188 flow
[2024-06-04 18:22:15,576 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-04 18:22:15,576 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-04 18:22:15,576 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 203 transitions.
[2024-06-04 18:22:15,577 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4720930232558139
[2024-06-04 18:22:15,577 INFO  L175             Difference]: Start difference. First operand has 234 places, 319 transitions, 4262 flow. Second operand 10 states and 203 transitions.
[2024-06-04 18:22:15,577 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 348 transitions, 5188 flow
[2024-06-04 18:22:15,836 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 348 transitions, 4912 flow, removed 33 selfloop flow, removed 6 redundant places.
[2024-06-04 18:22:15,840 INFO  L231             Difference]: Finished difference. Result has 240 places, 327 transitions, 4429 flow
[2024-06-04 18:22:15,841 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=3997, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=319, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=109, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4429, PETRI_PLACES=240, PETRI_TRANSITIONS=327}
[2024-06-04 18:22:15,841 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 196 predicate places.
[2024-06-04 18:22:15,841 INFO  L495      AbstractCegarLoop]: Abstraction has has 240 places, 327 transitions, 4429 flow
[2024-06-04 18:22:15,841 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 13.545454545454545) internal successors, (149), 11 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:22:15,841 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:22:15,841 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:22:15,841 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54
[2024-06-04 18:22:15,841 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-04 18:22:15,841 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:22:15,841 INFO  L85        PathProgramCache]: Analyzing trace with hash -1547919502, now seen corresponding path program 1 times
[2024-06-04 18:22:15,842 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:22:15,842 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689544127]
[2024-06-04 18:22:15,842 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:22:15,842 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:22:15,872 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:22:24,160 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:22:24,160 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:22:24,160 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689544127]
[2024-06-04 18:22:24,160 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689544127] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:22:24,160 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:22:24,160 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:22:24,160 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338482250]
[2024-06-04 18:22:24,160 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:22:24,160 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:22:24,160 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:22:24,161 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:22:24,161 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:22:24,307 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43
[2024-06-04 18:22:24,307 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 327 transitions, 4429 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-04 18:22:24,307 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:22:24,307 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43
[2024-06-04 18:22:24,307 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:22:25,737 INFO  L124   PetriNetUnfolderBase]: 2819/4687 cut-off events.
[2024-06-04 18:22:25,737 INFO  L125   PetriNetUnfolderBase]: For 307788/307788 co-relation queries the response was YES.
[2024-06-04 18:22:25,768 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 38164 conditions, 4687 events. 2819/4687 cut-off events. For 307788/307788 co-relation queries the response was YES. Maximal size of possible extension queue 293. Compared 29463 event pairs, 710 based on Foata normal form. 2/4687 useless extension candidates. Maximal degree in co-relation 38051. Up to 4237 conditions per place. 
[2024-06-04 18:22:25,786 INFO  L140   encePairwiseOnDemand]: 32/43 looper letters, 318 selfloop transitions, 35 changer transitions 0/360 dead transitions.
[2024-06-04 18:22:25,786 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 360 transitions, 5299 flow
[2024-06-04 18:22:25,786 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-04 18:22:25,786 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-04 18:22:25,787 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 202 transitions.
[2024-06-04 18:22:25,787 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4697674418604651
[2024-06-04 18:22:25,787 INFO  L175             Difference]: Start difference. First operand has 240 places, 327 transitions, 4429 flow. Second operand 10 states and 202 transitions.
[2024-06-04 18:22:25,787 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 360 transitions, 5299 flow
[2024-06-04 18:22:26,166 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 360 transitions, 4987 flow, removed 33 selfloop flow, removed 7 redundant places.
[2024-06-04 18:22:26,169 INFO  L231             Difference]: Finished difference. Result has 243 places, 330 transitions, 4261 flow
[2024-06-04 18:22:26,170 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=4117, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=327, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=292, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4261, PETRI_PLACES=243, PETRI_TRANSITIONS=330}
[2024-06-04 18:22:26,170 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 199 predicate places.
[2024-06-04 18:22:26,170 INFO  L495      AbstractCegarLoop]: Abstraction has has 243 places, 330 transitions, 4261 flow
[2024-06-04 18:22:26,170 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-04 18:22:26,170 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:22:26,170 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:22:26,171 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55
[2024-06-04 18:22:26,171 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-04 18:22:26,171 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:22:26,171 INFO  L85        PathProgramCache]: Analyzing trace with hash 228083954, now seen corresponding path program 2 times
[2024-06-04 18:22:26,171 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:22:26,171 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793086812]
[2024-06-04 18:22:26,172 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:22:26,172 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:22:26,208 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:22:34,581 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:22:34,581 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:22:34,581 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793086812]
[2024-06-04 18:22:34,581 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793086812] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:22:34,581 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:22:34,581 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:22:34,581 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237978193]
[2024-06-04 18:22:34,582 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:22:34,582 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:22:34,582 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:22:34,582 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:22:34,582 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:22:34,721 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43
[2024-06-04 18:22:34,722 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 330 transitions, 4261 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-04 18:22:34,722 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:22:34,722 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43
[2024-06-04 18:22:34,722 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:22:36,240 INFO  L124   PetriNetUnfolderBase]: 2829/4699 cut-off events.
[2024-06-04 18:22:36,240 INFO  L125   PetriNetUnfolderBase]: For 314387/314387 co-relation queries the response was YES.
[2024-06-04 18:22:36,270 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 38376 conditions, 4699 events. 2829/4699 cut-off events. For 314387/314387 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 29514 event pairs, 709 based on Foata normal form. 2/4699 useless extension candidates. Maximal degree in co-relation 38263. Up to 4231 conditions per place. 
[2024-06-04 18:22:36,284 INFO  L140   encePairwiseOnDemand]: 32/43 looper letters, 310 selfloop transitions, 45 changer transitions 0/362 dead transitions.
[2024-06-04 18:22:36,284 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 362 transitions, 5158 flow
[2024-06-04 18:22:36,285 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-04 18:22:36,285 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-04 18:22:36,285 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 201 transitions.
[2024-06-04 18:22:36,285 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46744186046511627
[2024-06-04 18:22:36,285 INFO  L175             Difference]: Start difference. First operand has 243 places, 330 transitions, 4261 flow. Second operand 10 states and 201 transitions.
[2024-06-04 18:22:36,285 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 362 transitions, 5158 flow
[2024-06-04 18:22:36,650 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 362 transitions, 5006 flow, removed 27 selfloop flow, removed 9 redundant places.
[2024-06-04 18:22:36,654 INFO  L231             Difference]: Finished difference. Result has 244 places, 333 transitions, 4280 flow
[2024-06-04 18:22:36,655 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=4109, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=330, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=285, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4280, PETRI_PLACES=244, PETRI_TRANSITIONS=333}
[2024-06-04 18:22:36,655 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 200 predicate places.
[2024-06-04 18:22:36,655 INFO  L495      AbstractCegarLoop]: Abstraction has has 244 places, 333 transitions, 4280 flow
[2024-06-04 18:22:36,655 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-04 18:22:36,655 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:22:36,655 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:22:36,655 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56
[2024-06-04 18:22:36,655 INFO  L420      AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:22:36,655 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:22:36,656 INFO  L85        PathProgramCache]: Analyzing trace with hash -578347104, now seen corresponding path program 3 times
[2024-06-04 18:22:36,656 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:22:36,656 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311944502]
[2024-06-04 18:22:36,656 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:22:36,656 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:22:36,689 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:22:45,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-04 18:22:45,087 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:22:45,087 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311944502]
[2024-06-04 18:22:45,087 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311944502] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:22:45,087 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:22:45,087 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:22:45,087 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543011635]
[2024-06-04 18:22:45,087 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:22:45,087 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:22:45,087 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:22:45,088 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:22:45,088 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:22:45,244 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43
[2024-06-04 18:22:45,244 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 333 transitions, 4280 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-04 18:22:45,244 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:22:45,244 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43
[2024-06-04 18:22:45,245 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:22:46,712 INFO  L124   PetriNetUnfolderBase]: 2871/4769 cut-off events.
[2024-06-04 18:22:46,713 INFO  L125   PetriNetUnfolderBase]: For 333962/333962 co-relation queries the response was YES.
[2024-06-04 18:22:46,745 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 39769 conditions, 4769 events. 2871/4769 cut-off events. For 333962/333962 co-relation queries the response was YES. Maximal size of possible extension queue 303. Compared 29999 event pairs, 711 based on Foata normal form. 2/4769 useless extension candidates. Maximal degree in co-relation 39655. Up to 4217 conditions per place. 
[2024-06-04 18:22:46,761 INFO  L140   encePairwiseOnDemand]: 32/43 looper letters, 288 selfloop transitions, 77 changer transitions 0/372 dead transitions.
[2024-06-04 18:22:46,761 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 372 transitions, 5588 flow
[2024-06-04 18:22:46,761 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-04 18:22:46,761 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-04 18:22:46,761 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 202 transitions.
[2024-06-04 18:22:46,762 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4697674418604651
[2024-06-04 18:22:46,762 INFO  L175             Difference]: Start difference. First operand has 244 places, 333 transitions, 4280 flow. Second operand 10 states and 202 transitions.
[2024-06-04 18:22:46,762 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 372 transitions, 5588 flow
[2024-06-04 18:22:47,104 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 372 transitions, 5445 flow, removed 29 selfloop flow, removed 8 redundant places.
[2024-06-04 18:22:47,108 INFO  L231             Difference]: Finished difference. Result has 246 places, 342 transitions, 4526 flow
[2024-06-04 18:22:47,108 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=4137, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=333, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=262, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4526, PETRI_PLACES=246, PETRI_TRANSITIONS=342}
[2024-06-04 18:22:47,109 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 202 predicate places.
[2024-06-04 18:22:47,109 INFO  L495      AbstractCegarLoop]: Abstraction has has 246 places, 342 transitions, 4526 flow
[2024-06-04 18:22:47,109 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-04 18:22:47,109 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:22:47,109 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:22:47,109 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57
[2024-06-04 18:22:47,109 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-04 18:22:47,109 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:22:47,109 INFO  L85        PathProgramCache]: Analyzing trace with hash -578524734, now seen corresponding path program 4 times
[2024-06-04 18:22:47,109 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:22:47,110 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820788668]
[2024-06-04 18:22:47,110 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:22:47,110 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:22:47,139 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:22:55,925 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:22:55,925 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:22:55,933 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820788668]
[2024-06-04 18:22:55,933 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820788668] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:22:55,933 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:22:55,933 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:22:55,933 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444246529]
[2024-06-04 18:22:55,933 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:22:55,933 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:22:55,933 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:22:55,933 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:22:55,934 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:22:56,166 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43
[2024-06-04 18:22:56,166 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 342 transitions, 4526 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-04 18:22:56,166 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:22:56,166 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43
[2024-06-04 18:22:56,166 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:22:57,619 INFO  L124   PetriNetUnfolderBase]: 2865/4759 cut-off events.
[2024-06-04 18:22:57,619 INFO  L125   PetriNetUnfolderBase]: For 345624/345624 co-relation queries the response was YES.
[2024-06-04 18:22:57,653 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 40227 conditions, 4759 events. 2865/4759 cut-off events. For 345624/345624 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 29945 event pairs, 710 based on Foata normal form. 2/4759 useless extension candidates. Maximal degree in co-relation 40112. Up to 4329 conditions per place. 
[2024-06-04 18:22:57,670 INFO  L140   encePairwiseOnDemand]: 33/43 looper letters, 311 selfloop transitions, 40 changer transitions 0/358 dead transitions.
[2024-06-04 18:22:57,670 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 358 transitions, 5291 flow
[2024-06-04 18:22:57,671 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 18:22:57,671 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 18:22:57,671 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 142 transitions.
[2024-06-04 18:22:57,671 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4717607973421927
[2024-06-04 18:22:57,671 INFO  L175             Difference]: Start difference. First operand has 246 places, 342 transitions, 4526 flow. Second operand 7 states and 142 transitions.
[2024-06-04 18:22:57,671 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 358 transitions, 5291 flow
[2024-06-04 18:22:58,162 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 358 transitions, 5120 flow, removed 66 selfloop flow, removed 5 redundant places.
[2024-06-04 18:22:58,166 INFO  L231             Difference]: Finished difference. Result has 248 places, 342 transitions, 4454 flow
[2024-06-04 18:22:58,166 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=4355, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=342, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=302, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4454, PETRI_PLACES=248, PETRI_TRANSITIONS=342}
[2024-06-04 18:22:58,167 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 204 predicate places.
[2024-06-04 18:22:58,167 INFO  L495      AbstractCegarLoop]: Abstraction has has 248 places, 342 transitions, 4454 flow
[2024-06-04 18:22:58,167 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-04 18:22:58,167 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:22:58,167 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:22:58,167 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58
[2024-06-04 18:22:58,167 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-04 18:22:58,167 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:22:58,167 INFO  L85        PathProgramCache]: Analyzing trace with hash 1310112768, now seen corresponding path program 1 times
[2024-06-04 18:22:58,167 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:22:58,168 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902580564]
[2024-06-04 18:22:58,168 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:22:58,168 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:22:58,199 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:23:06,536 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:23:06,536 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:23:06,536 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902580564]
[2024-06-04 18:23:06,536 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902580564] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:23:06,536 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:23:06,536 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:23:06,536 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069139127]
[2024-06-04 18:23:06,536 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:23:06,536 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:23:06,536 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:23:06,537 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:23:06,537 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:23:06,766 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43
[2024-06-04 18:23:06,766 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 342 transitions, 4454 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-04 18:23:06,766 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:23:06,766 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43
[2024-06-04 18:23:06,766 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:23:08,327 INFO  L124   PetriNetUnfolderBase]: 2860/4753 cut-off events.
[2024-06-04 18:23:08,327 INFO  L125   PetriNetUnfolderBase]: For 351314/351314 co-relation queries the response was YES.
[2024-06-04 18:23:08,358 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 40138 conditions, 4753 events. 2860/4753 cut-off events. For 351314/351314 co-relation queries the response was YES. Maximal size of possible extension queue 300. Compared 29896 event pairs, 608 based on Foata normal form. 2/4753 useless extension candidates. Maximal degree in co-relation 40021. Up to 4320 conditions per place. 
[2024-06-04 18:23:08,373 INFO  L140   encePairwiseOnDemand]: 34/43 looper letters, 342 selfloop transitions, 21 changer transitions 0/370 dead transitions.
[2024-06-04 18:23:08,373 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 370 transitions, 5301 flow
[2024-06-04 18:23:08,373 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:23:08,373 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:23:08,373 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 163 transitions.
[2024-06-04 18:23:08,374 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4738372093023256
[2024-06-04 18:23:08,374 INFO  L175             Difference]: Start difference. First operand has 248 places, 342 transitions, 4454 flow. Second operand 8 states and 163 transitions.
[2024-06-04 18:23:08,374 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 370 transitions, 5301 flow
[2024-06-04 18:23:08,770 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 370 transitions, 5207 flow, removed 1 selfloop flow, removed 7 redundant places.
[2024-06-04 18:23:08,774 INFO  L231             Difference]: Finished difference. Result has 249 places, 344 transitions, 4455 flow
[2024-06-04 18:23:08,774 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=4360, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=342, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=321, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4455, PETRI_PLACES=249, PETRI_TRANSITIONS=344}
[2024-06-04 18:23:08,774 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 205 predicate places.
[2024-06-04 18:23:08,774 INFO  L495      AbstractCegarLoop]: Abstraction has has 249 places, 344 transitions, 4455 flow
[2024-06-04 18:23:08,775 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-04 18:23:08,775 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:23:08,775 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:23:08,775 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59
[2024-06-04 18:23:08,775 INFO  L420      AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:23:08,775 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:23:08,775 INFO  L85        PathProgramCache]: Analyzing trace with hash 1319635968, now seen corresponding path program 2 times
[2024-06-04 18:23:08,775 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:23:08,775 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057100166]
[2024-06-04 18:23:08,776 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:23:08,776 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:23:08,808 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:23:17,315 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:23:17,316 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:23:17,316 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057100166]
[2024-06-04 18:23:17,316 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057100166] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:23:17,316 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:23:17,316 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:23:17,316 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196322966]
[2024-06-04 18:23:17,316 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:23:17,316 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:23:17,316 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:23:17,316 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:23:17,316 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:23:17,430 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43
[2024-06-04 18:23:17,430 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 344 transitions, 4455 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-04 18:23:17,430 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:23:17,430 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43
[2024-06-04 18:23:17,430 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:23:18,979 INFO  L124   PetriNetUnfolderBase]: 2868/4767 cut-off events.
[2024-06-04 18:23:18,979 INFO  L125   PetriNetUnfolderBase]: For 351656/351656 co-relation queries the response was YES.
[2024-06-04 18:23:19,013 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 40300 conditions, 4767 events. 2868/4767 cut-off events. For 351656/351656 co-relation queries the response was YES. Maximal size of possible extension queue 300. Compared 29984 event pairs, 698 based on Foata normal form. 2/4767 useless extension candidates. Maximal degree in co-relation 40183. Up to 4362 conditions per place. 
[2024-06-04 18:23:19,030 INFO  L140   encePairwiseOnDemand]: 34/43 looper letters, 338 selfloop transitions, 25 changer transitions 0/370 dead transitions.
[2024-06-04 18:23:19,030 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 370 transitions, 5334 flow
[2024-06-04 18:23:19,031 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:23:19,031 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:23:19,031 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 160 transitions.
[2024-06-04 18:23:19,031 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46511627906976744
[2024-06-04 18:23:19,032 INFO  L175             Difference]: Start difference. First operand has 249 places, 344 transitions, 4455 flow. Second operand 8 states and 160 transitions.
[2024-06-04 18:23:19,032 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 370 transitions, 5334 flow
[2024-06-04 18:23:19,422 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 370 transitions, 5255 flow, removed 20 selfloop flow, removed 6 redundant places.
[2024-06-04 18:23:19,426 INFO  L231             Difference]: Finished difference. Result has 252 places, 348 transitions, 4536 flow
[2024-06-04 18:23:19,427 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=4376, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=344, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=319, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4536, PETRI_PLACES=252, PETRI_TRANSITIONS=348}
[2024-06-04 18:23:19,427 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 208 predicate places.
[2024-06-04 18:23:19,427 INFO  L495      AbstractCegarLoop]: Abstraction has has 252 places, 348 transitions, 4536 flow
[2024-06-04 18:23:19,427 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-04 18:23:19,427 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:23:19,427 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:23:19,427 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60
[2024-06-04 18:23:19,428 INFO  L420      AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:23:19,428 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:23:19,428 INFO  L85        PathProgramCache]: Analyzing trace with hash -1960358574, now seen corresponding path program 3 times
[2024-06-04 18:23:19,428 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:23:19,428 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785299365]
[2024-06-04 18:23:19,428 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:23:19,428 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:23:19,460 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:23:28,365 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:23:28,365 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:23:28,365 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785299365]
[2024-06-04 18:23:28,365 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785299365] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:23:28,365 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:23:28,365 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:23:28,366 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792560339]
[2024-06-04 18:23:28,366 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:23:28,366 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:23:28,366 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:23:28,366 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:23:28,366 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:23:28,500 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43
[2024-06-04 18:23:28,500 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 348 transitions, 4536 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-04 18:23:28,500 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:23:28,500 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43
[2024-06-04 18:23:28,500 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:23:30,021 INFO  L124   PetriNetUnfolderBase]: 2876/4774 cut-off events.
[2024-06-04 18:23:30,021 INFO  L125   PetriNetUnfolderBase]: For 362999/362999 co-relation queries the response was YES.
[2024-06-04 18:23:30,053 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 40641 conditions, 4774 events. 2876/4774 cut-off events. For 362999/362999 co-relation queries the response was YES. Maximal size of possible extension queue 300. Compared 30033 event pairs, 703 based on Foata normal form. 2/4774 useless extension candidates. Maximal degree in co-relation 40522. Up to 4354 conditions per place. 
[2024-06-04 18:23:30,068 INFO  L140   encePairwiseOnDemand]: 35/43 looper letters, 323 selfloop transitions, 35 changer transitions 0/365 dead transitions.
[2024-06-04 18:23:30,068 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 365 transitions, 5350 flow
[2024-06-04 18:23:30,069 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 18:23:30,070 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 18:23:30,070 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 140 transitions.
[2024-06-04 18:23:30,070 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46511627906976744
[2024-06-04 18:23:30,070 INFO  L175             Difference]: Start difference. First operand has 252 places, 348 transitions, 4536 flow. Second operand 7 states and 140 transitions.
[2024-06-04 18:23:30,070 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 365 transitions, 5350 flow
[2024-06-04 18:23:30,449 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 365 transitions, 5262 flow, removed 25 selfloop flow, removed 5 redundant places.
[2024-06-04 18:23:30,453 INFO  L231             Difference]: Finished difference. Result has 254 places, 350 transitions, 4588 flow
[2024-06-04 18:23:30,454 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=4448, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=348, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=313, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4588, PETRI_PLACES=254, PETRI_TRANSITIONS=350}
[2024-06-04 18:23:30,454 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 210 predicate places.
[2024-06-04 18:23:30,454 INFO  L495      AbstractCegarLoop]: Abstraction has has 254 places, 350 transitions, 4588 flow
[2024-06-04 18:23:30,454 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-04 18:23:30,454 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:23:30,454 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:23:30,454 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61
[2024-06-04 18:23:30,454 INFO  L420      AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:23:30,455 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:23:30,455 INFO  L85        PathProgramCache]: Analyzing trace with hash 1978152116, now seen corresponding path program 1 times
[2024-06-04 18:23:30,455 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:23:30,455 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38116480]
[2024-06-04 18:23:30,455 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:23:30,455 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:23:30,505 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:23:38,933 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:23:38,933 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:23:38,933 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38116480]
[2024-06-04 18:23:38,933 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38116480] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:23:38,934 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:23:38,934 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:23:38,934 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317047845]
[2024-06-04 18:23:38,934 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:23:38,934 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:23:38,934 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:23:38,934 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:23:38,934 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:23:39,097 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43
[2024-06-04 18:23:39,098 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 350 transitions, 4588 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-04 18:23:39,098 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:23:39,098 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43
[2024-06-04 18:23:39,098 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:23:40,601 INFO  L124   PetriNetUnfolderBase]: 2881/4778 cut-off events.
[2024-06-04 18:23:40,601 INFO  L125   PetriNetUnfolderBase]: For 371607/371607 co-relation queries the response was YES.
[2024-06-04 18:23:40,634 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 40905 conditions, 4778 events. 2881/4778 cut-off events. For 371607/371607 co-relation queries the response was YES. Maximal size of possible extension queue 300. Compared 30038 event pairs, 707 based on Foata normal form. 1/4775 useless extension candidates. Maximal degree in co-relation 40785. Up to 4350 conditions per place. 
[2024-06-04 18:23:40,650 INFO  L140   encePairwiseOnDemand]: 33/43 looper letters, 336 selfloop transitions, 32 changer transitions 0/375 dead transitions.
[2024-06-04 18:23:40,650 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 375 transitions, 5435 flow
[2024-06-04 18:23:40,650 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:23:40,650 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:23:40,650 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 164 transitions.
[2024-06-04 18:23:40,650 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.47674418604651164
[2024-06-04 18:23:40,651 INFO  L175             Difference]: Start difference. First operand has 254 places, 350 transitions, 4588 flow. Second operand 8 states and 164 transitions.
[2024-06-04 18:23:40,651 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 375 transitions, 5435 flow
[2024-06-04 18:23:41,090 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 256 places, 375 transitions, 5321 flow, removed 26 selfloop flow, removed 5 redundant places.
[2024-06-04 18:23:41,094 INFO  L231             Difference]: Finished difference. Result has 257 places, 353 transitions, 4594 flow
[2024-06-04 18:23:41,094 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=4474, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=350, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=318, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4594, PETRI_PLACES=257, PETRI_TRANSITIONS=353}
[2024-06-04 18:23:41,094 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 213 predicate places.
[2024-06-04 18:23:41,094 INFO  L495      AbstractCegarLoop]: Abstraction has has 257 places, 353 transitions, 4594 flow
[2024-06-04 18:23:41,094 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-04 18:23:41,095 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:23:41,095 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:23:41,095 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62
[2024-06-04 18:23:41,095 INFO  L420      AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:23:41,095 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:23:41,095 INFO  L85        PathProgramCache]: Analyzing trace with hash 1007261042, now seen corresponding path program 5 times
[2024-06-04 18:23:41,095 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:23:41,095 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868271082]
[2024-06-04 18:23:41,096 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:23:41,096 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:23:41,129 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:23:49,891 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:23:49,892 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:23:49,892 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868271082]
[2024-06-04 18:23:49,892 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868271082] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:23:49,892 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:23:49,892 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:23:49,892 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313750403]
[2024-06-04 18:23:49,892 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:23:49,892 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:23:49,892 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:23:49,893 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:23:49,893 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:23:50,048 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43
[2024-06-04 18:23:50,048 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 353 transitions, 4594 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-04 18:23:50,049 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:23:50,049 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43
[2024-06-04 18:23:50,049 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:23:51,571 INFO  L124   PetriNetUnfolderBase]: 2896/4801 cut-off events.
[2024-06-04 18:23:51,572 INFO  L125   PetriNetUnfolderBase]: For 375925/375925 co-relation queries the response was YES.
[2024-06-04 18:23:51,608 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 41016 conditions, 4801 events. 2896/4801 cut-off events. For 375925/375925 co-relation queries the response was YES. Maximal size of possible extension queue 305. Compared 30288 event pairs, 713 based on Foata normal form. 3/4795 useless extension candidates. Maximal degree in co-relation 40895. Up to 4259 conditions per place. 
[2024-06-04 18:23:51,627 INFO  L140   encePairwiseOnDemand]: 32/43 looper letters, 316 selfloop transitions, 58 changer transitions 0/381 dead transitions.
[2024-06-04 18:23:51,627 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 381 transitions, 5595 flow
[2024-06-04 18:23:51,628 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 18:23:51,628 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 18:23:51,628 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 180 transitions.
[2024-06-04 18:23:51,629 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46511627906976744
[2024-06-04 18:23:51,629 INFO  L175             Difference]: Start difference. First operand has 257 places, 353 transitions, 4594 flow. Second operand 9 states and 180 transitions.
[2024-06-04 18:23:51,630 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 381 transitions, 5595 flow
[2024-06-04 18:23:52,135 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 381 transitions, 5490 flow, removed 14 selfloop flow, removed 7 redundant places.
[2024-06-04 18:23:52,139 INFO  L231             Difference]: Finished difference. Result has 259 places, 360 transitions, 4801 flow
[2024-06-04 18:23:52,140 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=4491, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=353, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=296, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4801, PETRI_PLACES=259, PETRI_TRANSITIONS=360}
[2024-06-04 18:23:52,140 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 215 predicate places.
[2024-06-04 18:23:52,140 INFO  L495      AbstractCegarLoop]: Abstraction has has 259 places, 360 transitions, 4801 flow
[2024-06-04 18:23:52,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-04 18:23:52,140 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:23:52,140 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:23:52,141 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63
[2024-06-04 18:23:52,141 INFO  L420      AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:23:52,141 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:23:52,141 INFO  L85        PathProgramCache]: Analyzing trace with hash -1082798378, now seen corresponding path program 6 times
[2024-06-04 18:23:52,141 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:23:52,141 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255358765]
[2024-06-04 18:23:52,141 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:23:52,141 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:23:52,173 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:24:01,001 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:24:01,001 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:24:01,001 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255358765]
[2024-06-04 18:24:01,001 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255358765] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:24:01,001 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:24:01,001 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:24:01,001 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320181285]
[2024-06-04 18:24:01,001 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:24:01,001 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:24:01,001 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:24:01,002 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:24:01,002 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:24:01,143 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43
[2024-06-04 18:24:01,143 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 360 transitions, 4801 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-04 18:24:01,143 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:24:01,143 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43
[2024-06-04 18:24:01,143 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:24:02,592 INFO  L124   PetriNetUnfolderBase]: 2890/4793 cut-off events.
[2024-06-04 18:24:02,592 INFO  L125   PetriNetUnfolderBase]: For 384669/384669 co-relation queries the response was YES.
[2024-06-04 18:24:02,626 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 41511 conditions, 4793 events. 2890/4793 cut-off events. For 384669/384669 co-relation queries the response was YES. Maximal size of possible extension queue 304. Compared 30189 event pairs, 713 based on Foata normal form. 2/4786 useless extension candidates. Maximal degree in co-relation 41389. Up to 4324 conditions per place. 
[2024-06-04 18:24:02,642 INFO  L140   encePairwiseOnDemand]: 32/43 looper letters, 330 selfloop transitions, 42 changer transitions 0/379 dead transitions.
[2024-06-04 18:24:02,642 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 379 transitions, 5634 flow
[2024-06-04 18:24:02,643 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:24:02,643 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:24:02,643 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 162 transitions.
[2024-06-04 18:24:02,643 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.47093023255813954
[2024-06-04 18:24:02,643 INFO  L175             Difference]: Start difference. First operand has 259 places, 360 transitions, 4801 flow. Second operand 8 states and 162 transitions.
[2024-06-04 18:24:02,643 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 379 transitions, 5634 flow
[2024-06-04 18:24:03,101 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 379 transitions, 5393 flow, removed 77 selfloop flow, removed 5 redundant places.
[2024-06-04 18:24:03,105 INFO  L231             Difference]: Finished difference. Result has 262 places, 360 transitions, 4651 flow
[2024-06-04 18:24:03,106 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=4560, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=360, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=318, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4651, PETRI_PLACES=262, PETRI_TRANSITIONS=360}
[2024-06-04 18:24:03,106 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 218 predicate places.
[2024-06-04 18:24:03,106 INFO  L495      AbstractCegarLoop]: Abstraction has has 262 places, 360 transitions, 4651 flow
[2024-06-04 18:24:03,106 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-04 18:24:03,106 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:24:03,106 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:24:03,106 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64
[2024-06-04 18:24:03,106 INFO  L420      AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:24:03,106 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:24:03,107 INFO  L85        PathProgramCache]: Analyzing trace with hash 1880191218, now seen corresponding path program 7 times
[2024-06-04 18:24:03,107 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:24:03,107 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229493572]
[2024-06-04 18:24:03,107 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:24:03,107 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:24:03,137 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:24:11,842 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:24:11,842 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:24:11,843 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229493572]
[2024-06-04 18:24:11,843 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229493572] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:24:11,843 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:24:11,843 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:24:11,843 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778930509]
[2024-06-04 18:24:11,843 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:24:11,843 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:24:11,843 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:24:11,843 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:24:11,843 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:24:12,058 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43
[2024-06-04 18:24:12,058 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 360 transitions, 4651 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-04 18:24:12,058 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:24:12,058 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43
[2024-06-04 18:24:12,058 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:24:13,489 INFO  L124   PetriNetUnfolderBase]: 2926/4855 cut-off events.
[2024-06-04 18:24:13,490 INFO  L125   PetriNetUnfolderBase]: For 403812/403812 co-relation queries the response was YES.
[2024-06-04 18:24:13,527 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 42120 conditions, 4855 events. 2926/4855 cut-off events. For 403812/403812 co-relation queries the response was YES. Maximal size of possible extension queue 314. Compared 30774 event pairs, 713 based on Foata normal form. 4/4850 useless extension candidates. Maximal degree in co-relation 41996. Up to 4247 conditions per place. 
[2024-06-04 18:24:13,636 INFO  L140   encePairwiseOnDemand]: 31/43 looper letters, 311 selfloop transitions, 66 changer transitions 0/384 dead transitions.
[2024-06-04 18:24:13,636 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 384 transitions, 5776 flow
[2024-06-04 18:24:13,636 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:24:13,636 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:24:13,637 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 164 transitions.
[2024-06-04 18:24:13,637 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.47674418604651164
[2024-06-04 18:24:13,637 INFO  L175             Difference]: Start difference. First operand has 262 places, 360 transitions, 4651 flow. Second operand 8 states and 164 transitions.
[2024-06-04 18:24:13,637 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 384 transitions, 5776 flow
[2024-06-04 18:24:14,154 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 384 transitions, 5633 flow, removed 14 selfloop flow, removed 6 redundant places.
[2024-06-04 18:24:14,158 INFO  L231             Difference]: Finished difference. Result has 264 places, 367 transitions, 4824 flow
[2024-06-04 18:24:14,159 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=4508, PETRI_DIFFERENCE_MINUEND_PLACES=256, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=360, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=297, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4824, PETRI_PLACES=264, PETRI_TRANSITIONS=367}
[2024-06-04 18:24:14,159 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 220 predicate places.
[2024-06-04 18:24:14,159 INFO  L495      AbstractCegarLoop]: Abstraction has has 264 places, 367 transitions, 4824 flow
[2024-06-04 18:24:14,159 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-04 18:24:14,159 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:24:14,159 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:24:14,159 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65
[2024-06-04 18:24:14,159 INFO  L420      AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:24:14,160 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:24:14,160 INFO  L85        PathProgramCache]: Analyzing trace with hash 1498649298, now seen corresponding path program 8 times
[2024-06-04 18:24:14,160 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:24:14,160 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048171108]
[2024-06-04 18:24:14,160 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:24:14,160 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:24:14,190 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:24:23,376 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:24:23,376 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:24:23,376 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048171108]
[2024-06-04 18:24:23,376 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048171108] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:24:23,376 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:24:23,376 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:24:23,376 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052563607]
[2024-06-04 18:24:23,376 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:24:23,377 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:24:23,377 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:24:23,377 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:24:23,377 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:24:23,530 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43
[2024-06-04 18:24:23,530 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 367 transitions, 4824 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-04 18:24:23,530 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:24:23,530 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43
[2024-06-04 18:24:23,530 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:24:25,060 INFO  L124   PetriNetUnfolderBase]: 3010/4993 cut-off events.
[2024-06-04 18:24:25,060 INFO  L125   PetriNetUnfolderBase]: For 441054/441054 co-relation queries the response was YES.
[2024-06-04 18:24:25,098 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 44812 conditions, 4993 events. 3010/4993 cut-off events. For 441054/441054 co-relation queries the response was YES. Maximal size of possible extension queue 331. Compared 31861 event pairs, 713 based on Foata normal form. 4/4988 useless extension candidates. Maximal degree in co-relation 44687. Up to 4089 conditions per place. 
[2024-06-04 18:24:25,116 INFO  L140   encePairwiseOnDemand]: 31/43 looper letters, 265 selfloop transitions, 134 changer transitions 0/406 dead transitions.
[2024-06-04 18:24:25,117 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 406 transitions, 6521 flow
[2024-06-04 18:24:25,117 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 18:24:25,117 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 18:24:25,117 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 188 transitions.
[2024-06-04 18:24:25,117 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.48578811369509045
[2024-06-04 18:24:25,117 INFO  L175             Difference]: Start difference. First operand has 264 places, 367 transitions, 4824 flow. Second operand 9 states and 188 transitions.
[2024-06-04 18:24:25,117 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 406 transitions, 6521 flow
[2024-06-04 18:24:25,651 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 406 transitions, 6375 flow, removed 50 selfloop flow, removed 4 redundant places.
[2024-06-04 18:24:25,656 INFO  L231             Difference]: Finished difference. Result has 269 places, 382 transitions, 5356 flow
[2024-06-04 18:24:25,656 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=4678, PETRI_DIFFERENCE_MINUEND_PLACES=260, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=367, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=123, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5356, PETRI_PLACES=269, PETRI_TRANSITIONS=382}
[2024-06-04 18:24:25,656 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 225 predicate places.
[2024-06-04 18:24:25,656 INFO  L495      AbstractCegarLoop]: Abstraction has has 269 places, 382 transitions, 5356 flow
[2024-06-04 18:24:25,657 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-04 18:24:25,657 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:24:25,657 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:24:25,657 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66
[2024-06-04 18:24:25,657 INFO  L420      AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:24:25,657 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:24:25,657 INFO  L85        PathProgramCache]: Analyzing trace with hash 1488636146, now seen corresponding path program 9 times
[2024-06-04 18:24:25,657 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:24:25,657 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215052727]
[2024-06-04 18:24:25,657 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:24:25,657 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:24:25,688 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:24:34,637 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:24:34,637 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:24:34,637 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215052727]
[2024-06-04 18:24:34,637 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215052727] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:24:34,637 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:24:34,637 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:24:34,637 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463021734]
[2024-06-04 18:24:34,637 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:24:34,637 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:24:34,638 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:24:34,638 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:24:34,638 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:24:34,823 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43
[2024-06-04 18:24:34,824 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 382 transitions, 5356 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-04 18:24:34,824 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:24:34,824 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43
[2024-06-04 18:24:34,824 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:24:36,423 INFO  L124   PetriNetUnfolderBase]: 2998/4977 cut-off events.
[2024-06-04 18:24:36,423 INFO  L125   PetriNetUnfolderBase]: For 450585/450585 co-relation queries the response was YES.
[2024-06-04 18:24:36,459 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 45313 conditions, 4977 events. 2998/4977 cut-off events. For 450585/450585 co-relation queries the response was YES. Maximal size of possible extension queue 330. Compared 31806 event pairs, 723 based on Foata normal form. 4/4972 useless extension candidates. Maximal degree in co-relation 45186. Up to 4489 conditions per place. 
[2024-06-04 18:24:36,476 INFO  L140   encePairwiseOnDemand]: 32/43 looper letters, 338 selfloop transitions, 48 changer transitions 0/393 dead transitions.
[2024-06-04 18:24:36,476 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 393 transitions, 6170 flow
[2024-06-04 18:24:36,476 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:24:36,476 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:24:36,477 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 157 transitions.
[2024-06-04 18:24:36,477 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4563953488372093
[2024-06-04 18:24:36,477 INFO  L175             Difference]: Start difference. First operand has 269 places, 382 transitions, 5356 flow. Second operand 8 states and 157 transitions.
[2024-06-04 18:24:36,477 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 393 transitions, 6170 flow
[2024-06-04 18:24:36,990 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 393 transitions, 5916 flow, removed 109 selfloop flow, removed 3 redundant places.
[2024-06-04 18:24:36,994 INFO  L231             Difference]: Finished difference. Result has 274 places, 382 transitions, 5205 flow
[2024-06-04 18:24:36,994 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=5102, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=382, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=334, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5205, PETRI_PLACES=274, PETRI_TRANSITIONS=382}
[2024-06-04 18:24:36,995 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 230 predicate places.
[2024-06-04 18:24:36,995 INFO  L495      AbstractCegarLoop]: Abstraction has has 274 places, 382 transitions, 5205 flow
[2024-06-04 18:24:36,995 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-04 18:24:36,995 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:24:36,995 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:24:36,995 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67
[2024-06-04 18:24:36,995 INFO  L420      AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:24:36,995 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:24:36,995 INFO  L85        PathProgramCache]: Analyzing trace with hash -690280206, now seen corresponding path program 10 times
[2024-06-04 18:24:36,996 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:24:36,996 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492979004]
[2024-06-04 18:24:36,996 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:24:36,996 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:24:37,036 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:24:45,449 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:24:45,449 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:24:45,449 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492979004]
[2024-06-04 18:24:45,449 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492979004] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:24:45,449 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:24:45,449 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:24:45,449 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045767606]
[2024-06-04 18:24:45,449 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:24:45,450 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:24:45,450 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:24:45,450 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:24:45,450 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:24:45,634 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43
[2024-06-04 18:24:45,634 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 382 transitions, 5205 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-04 18:24:45,634 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:24:45,634 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43
[2024-06-04 18:24:45,634 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:24:47,129 INFO  L124   PetriNetUnfolderBase]: 2986/4961 cut-off events.
[2024-06-04 18:24:47,129 INFO  L125   PetriNetUnfolderBase]: For 443202/443202 co-relation queries the response was YES.
[2024-06-04 18:24:47,166 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 44056 conditions, 4961 events. 2986/4961 cut-off events. For 443202/443202 co-relation queries the response was YES. Maximal size of possible extension queue 329. Compared 31675 event pairs, 717 based on Foata normal form. 4/4956 useless extension candidates. Maximal degree in co-relation 43927. Up to 4073 conditions per place. 
[2024-06-04 18:24:47,183 INFO  L140   encePairwiseOnDemand]: 31/43 looper letters, 265 selfloop transitions, 130 changer transitions 0/402 dead transitions.
[2024-06-04 18:24:47,184 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 402 transitions, 6348 flow
[2024-06-04 18:24:47,184 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 18:24:47,184 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 18:24:47,184 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 186 transitions.
[2024-06-04 18:24:47,184 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4806201550387597
[2024-06-04 18:24:47,184 INFO  L175             Difference]: Start difference. First operand has 274 places, 382 transitions, 5205 flow. Second operand 9 states and 186 transitions.
[2024-06-04 18:24:47,184 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 402 transitions, 6348 flow
[2024-06-04 18:24:47,696 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 402 transitions, 6148 flow, removed 35 selfloop flow, removed 7 redundant places.
[2024-06-04 18:24:47,700 INFO  L231             Difference]: Finished difference. Result has 276 places, 382 transitions, 5273 flow
[2024-06-04 18:24:47,700 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=5005, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=382, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=130, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5273, PETRI_PLACES=276, PETRI_TRANSITIONS=382}
[2024-06-04 18:24:47,701 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 232 predicate places.
[2024-06-04 18:24:47,701 INFO  L495      AbstractCegarLoop]: Abstraction has has 276 places, 382 transitions, 5273 flow
[2024-06-04 18:24:47,701 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-04 18:24:47,701 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:24:47,701 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:24:47,701 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68
[2024-06-04 18:24:47,701 INFO  L420      AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:24:47,702 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:24:47,702 INFO  L85        PathProgramCache]: Analyzing trace with hash 1488633170, now seen corresponding path program 4 times
[2024-06-04 18:24:47,702 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:24:47,702 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031874167]
[2024-06-04 18:24:47,702 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:24:47,702 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:24:47,732 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:24:56,986 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:24:56,986 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:24:56,986 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031874167]
[2024-06-04 18:24:56,986 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031874167] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:24:56,986 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:24:56,986 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:24:56,987 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576136198]
[2024-06-04 18:24:56,987 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:24:56,987 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:24:56,987 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:24:56,987 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:24:56,987 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:24:57,103 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43
[2024-06-04 18:24:57,104 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 382 transitions, 5273 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-04 18:24:57,104 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:24:57,104 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43
[2024-06-04 18:24:57,104 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:24:58,633 INFO  L124   PetriNetUnfolderBase]: 2989/4972 cut-off events.
[2024-06-04 18:24:58,633 INFO  L125   PetriNetUnfolderBase]: For 451069/451069 co-relation queries the response was YES.
[2024-06-04 18:24:58,668 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 44258 conditions, 4972 events. 2989/4972 cut-off events. For 451069/451069 co-relation queries the response was YES. Maximal size of possible extension queue 332. Compared 31735 event pairs, 717 based on Foata normal form. 4/4967 useless extension candidates. Maximal degree in co-relation 44128. Up to 4478 conditions per place. 
[2024-06-04 18:24:58,685 INFO  L140   encePairwiseOnDemand]: 33/43 looper letters, 342 selfloop transitions, 47 changer transitions 0/396 dead transitions.
[2024-06-04 18:24:58,685 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 396 transitions, 6147 flow
[2024-06-04 18:24:58,686 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:24:58,686 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:24:58,686 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 156 transitions.
[2024-06-04 18:24:58,687 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45348837209302323
[2024-06-04 18:24:58,687 INFO  L175             Difference]: Start difference. First operand has 276 places, 382 transitions, 5273 flow. Second operand 8 states and 156 transitions.
[2024-06-04 18:24:58,687 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 396 transitions, 6147 flow
[2024-06-04 18:24:59,226 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 396 transitions, 5801 flow, removed 16 selfloop flow, removed 9 redundant places.
[2024-06-04 18:24:59,231 INFO  L231             Difference]: Finished difference. Result has 275 places, 385 transitions, 5101 flow
[2024-06-04 18:24:59,231 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=4927, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=382, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=335, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5101, PETRI_PLACES=275, PETRI_TRANSITIONS=385}
[2024-06-04 18:24:59,231 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 231 predicate places.
[2024-06-04 18:24:59,231 INFO  L495      AbstractCegarLoop]: Abstraction has has 275 places, 385 transitions, 5101 flow
[2024-06-04 18:24:59,231 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-04 18:24:59,231 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:24:59,231 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:24:59,232 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69
[2024-06-04 18:24:59,232 INFO  L420      AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:24:59,232 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:24:59,232 INFO  L85        PathProgramCache]: Analyzing trace with hash 1947825170, now seen corresponding path program 2 times
[2024-06-04 18:24:59,232 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:24:59,232 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477360941]
[2024-06-04 18:24:59,232 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:24:59,232 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:24:59,280 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:25:07,270 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:25:07,270 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:25:07,270 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477360941]
[2024-06-04 18:25:07,270 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477360941] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:25:07,270 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:25:07,270 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:25:07,270 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963420453]
[2024-06-04 18:25:07,270 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:25:07,271 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:25:07,271 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:25:07,271 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:25:07,271 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:25:07,412 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43
[2024-06-04 18:25:07,412 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 385 transitions, 5101 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-04 18:25:07,413 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:25:07,413 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43
[2024-06-04 18:25:07,413 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:25:08,987 INFO  L124   PetriNetUnfolderBase]: 2994/4978 cut-off events.
[2024-06-04 18:25:08,987 INFO  L125   PetriNetUnfolderBase]: For 452851/452851 co-relation queries the response was YES.
[2024-06-04 18:25:09,023 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 44114 conditions, 4978 events. 2994/4978 cut-off events. For 452851/452851 co-relation queries the response was YES. Maximal size of possible extension queue 330. Compared 31724 event pairs, 710 based on Foata normal form. 1/4973 useless extension candidates. Maximal degree in co-relation 43985. Up to 4509 conditions per place. 
[2024-06-04 18:25:09,040 INFO  L140   encePairwiseOnDemand]: 33/43 looper letters, 369 selfloop transitions, 32 changer transitions 0/408 dead transitions.
[2024-06-04 18:25:09,040 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 408 transitions, 6014 flow
[2024-06-04 18:25:09,042 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:25:09,042 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:25:09,042 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 161 transitions.
[2024-06-04 18:25:09,042 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4680232558139535
[2024-06-04 18:25:09,042 INFO  L175             Difference]: Start difference. First operand has 275 places, 385 transitions, 5101 flow. Second operand 8 states and 161 transitions.
[2024-06-04 18:25:09,042 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 408 transitions, 6014 flow
[2024-06-04 18:25:09,630 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 408 transitions, 5864 flow, removed 30 selfloop flow, removed 6 redundant places.
[2024-06-04 18:25:09,634 INFO  L231             Difference]: Finished difference. Result has 277 places, 388 transitions, 5077 flow
[2024-06-04 18:25:09,634 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=4951, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=385, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=353, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5077, PETRI_PLACES=277, PETRI_TRANSITIONS=388}
[2024-06-04 18:25:09,635 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 233 predicate places.
[2024-06-04 18:25:09,635 INFO  L495      AbstractCegarLoop]: Abstraction has has 277 places, 388 transitions, 5077 flow
[2024-06-04 18:25:09,635 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-04 18:25:09,635 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:25:09,635 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:25:09,635 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70
[2024-06-04 18:25:09,635 INFO  L420      AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:25:09,636 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:25:09,636 INFO  L85        PathProgramCache]: Analyzing trace with hash -2117453516, now seen corresponding path program 3 times
[2024-06-04 18:25:09,636 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:25:09,636 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35510412]
[2024-06-04 18:25:09,636 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:25:09,636 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:25:09,684 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:25:18,045 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:25:18,046 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:25:18,046 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35510412]
[2024-06-04 18:25:18,046 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35510412] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:25:18,046 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:25:18,046 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:25:18,046 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859136490]
[2024-06-04 18:25:18,046 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:25:18,046 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:25:18,046 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:25:18,046 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:25:18,046 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:25:18,135 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43
[2024-06-04 18:25:18,135 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 388 transitions, 5077 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-04 18:25:18,135 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:25:18,135 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43
[2024-06-04 18:25:18,135 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:25:19,707 INFO  L124   PetriNetUnfolderBase]: 2999/4987 cut-off events.
[2024-06-04 18:25:19,707 INFO  L125   PetriNetUnfolderBase]: For 463611/463611 co-relation queries the response was YES.
[2024-06-04 18:25:19,746 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 44200 conditions, 4987 events. 2999/4987 cut-off events. For 463611/463611 co-relation queries the response was YES. Maximal size of possible extension queue 331. Compared 31906 event pairs, 710 based on Foata normal form. 1/4982 useless extension candidates. Maximal degree in co-relation 44070. Up to 4516 conditions per place. 
[2024-06-04 18:25:19,764 INFO  L140   encePairwiseOnDemand]: 33/43 looper letters, 371 selfloop transitions, 33 changer transitions 0/411 dead transitions.
[2024-06-04 18:25:19,765 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 411 transitions, 6002 flow
[2024-06-04 18:25:19,766 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:25:19,766 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:25:19,766 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 160 transitions.
[2024-06-04 18:25:19,766 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46511627906976744
[2024-06-04 18:25:19,766 INFO  L175             Difference]: Start difference. First operand has 277 places, 388 transitions, 5077 flow. Second operand 8 states and 160 transitions.
[2024-06-04 18:25:19,766 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 411 transitions, 6002 flow
[2024-06-04 18:25:20,479 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 411 transitions, 5908 flow, removed 17 selfloop flow, removed 6 redundant places.
[2024-06-04 18:25:20,483 INFO  L231             Difference]: Finished difference. Result has 279 places, 391 transitions, 5117 flow
[2024-06-04 18:25:20,483 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=4983, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=388, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=355, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5117, PETRI_PLACES=279, PETRI_TRANSITIONS=391}
[2024-06-04 18:25:20,483 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 235 predicate places.
[2024-06-04 18:25:20,483 INFO  L495      AbstractCegarLoop]: Abstraction has has 279 places, 391 transitions, 5117 flow
[2024-06-04 18:25:20,484 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-04 18:25:20,484 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:25:20,484 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:25:20,484 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71
[2024-06-04 18:25:20,484 INFO  L420      AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:25:20,484 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:25:20,484 INFO  L85        PathProgramCache]: Analyzing trace with hash -1145431466, now seen corresponding path program 4 times
[2024-06-04 18:25:20,484 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:25:20,484 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601053347]
[2024-06-04 18:25:20,485 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:25:20,485 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:25:20,529 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:25:28,908 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:25:28,909 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:25:28,909 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601053347]
[2024-06-04 18:25:28,909 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601053347] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:25:28,909 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:25:28,909 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:25:28,909 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041824595]
[2024-06-04 18:25:28,909 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:25:28,909 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:25:28,909 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:25:28,909 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:25:28,909 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:25:29,063 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43
[2024-06-04 18:25:29,063 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 391 transitions, 5117 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-04 18:25:29,063 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:25:29,063 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43
[2024-06-04 18:25:29,064 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:25:30,599 INFO  L124   PetriNetUnfolderBase]: 2991/4976 cut-off events.
[2024-06-04 18:25:30,599 INFO  L125   PetriNetUnfolderBase]: For 473293/473293 co-relation queries the response was YES.
[2024-06-04 18:25:30,635 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 44164 conditions, 4976 events. 2991/4976 cut-off events. For 473293/473293 co-relation queries the response was YES. Maximal size of possible extension queue 330. Compared 31779 event pairs, 710 based on Foata normal form. 2/4972 useless extension candidates. Maximal degree in co-relation 44033. Up to 4478 conditions per place. 
[2024-06-04 18:25:30,652 INFO  L140   encePairwiseOnDemand]: 32/43 looper letters, 356 selfloop transitions, 45 changer transitions 0/408 dead transitions.
[2024-06-04 18:25:30,652 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 408 transitions, 5970 flow
[2024-06-04 18:25:30,652 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:25:30,652 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:25:30,653 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 160 transitions.
[2024-06-04 18:25:30,653 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46511627906976744
[2024-06-04 18:25:30,653 INFO  L175             Difference]: Start difference. First operand has 279 places, 391 transitions, 5117 flow. Second operand 8 states and 160 transitions.
[2024-06-04 18:25:30,653 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 408 transitions, 5970 flow
[2024-06-04 18:25:31,200 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 408 transitions, 5844 flow, removed 32 selfloop flow, removed 6 redundant places.
[2024-06-04 18:25:31,205 INFO  L231             Difference]: Finished difference. Result has 281 places, 391 transitions, 5089 flow
[2024-06-04 18:25:31,205 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=4991, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=391, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=346, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5089, PETRI_PLACES=281, PETRI_TRANSITIONS=391}
[2024-06-04 18:25:31,205 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 237 predicate places.
[2024-06-04 18:25:31,205 INFO  L495      AbstractCegarLoop]: Abstraction has has 281 places, 391 transitions, 5089 flow
[2024-06-04 18:25:31,205 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-04 18:25:31,205 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:25:31,205 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:25:31,205 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72
[2024-06-04 18:25:31,205 INFO  L420      AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:25:31,206 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:25:31,206 INFO  L85        PathProgramCache]: Analyzing trace with hash 1894937236, now seen corresponding path program 1 times
[2024-06-04 18:25:31,206 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:25:31,206 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543411355]
[2024-06-04 18:25:31,206 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:25:31,206 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:25:31,245 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:25:41,498 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:25:41,499 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:25:41,499 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543411355]
[2024-06-04 18:25:41,499 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543411355] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:25:41,499 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:25:41,499 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:25:41,499 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562638803]
[2024-06-04 18:25:41,499 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:25:41,499 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:25:41,499 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:25:41,499 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:25:41,500 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:25:41,598 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43
[2024-06-04 18:25:41,598 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 391 transitions, 5089 flow. Second operand  has 10 states, 10 states have (on average 13.7) internal successors, (137), 10 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:25:41,598 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:25:41,598 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43
[2024-06-04 18:25:41,599 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:25:43,063 INFO  L124   PetriNetUnfolderBase]: 3001/4987 cut-off events.
[2024-06-04 18:25:43,064 INFO  L125   PetriNetUnfolderBase]: For 486191/486191 co-relation queries the response was YES.
[2024-06-04 18:25:43,103 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 44457 conditions, 4987 events. 3001/4987 cut-off events. For 486191/486191 co-relation queries the response was YES. Maximal size of possible extension queue 332. Compared 31869 event pairs, 717 based on Foata normal form. 2/4980 useless extension candidates. Maximal degree in co-relation 44325. Up to 4440 conditions per place. 
[2024-06-04 18:25:43,121 INFO  L140   encePairwiseOnDemand]: 30/43 looper letters, 345 selfloop transitions, 57 changer transitions 0/409 dead transitions.
[2024-06-04 18:25:43,122 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 409 transitions, 6032 flow
[2024-06-04 18:25:43,123 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:25:43,123 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:25:43,123 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 162 transitions.
[2024-06-04 18:25:43,123 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.47093023255813954
[2024-06-04 18:25:43,123 INFO  L175             Difference]: Start difference. First operand has 281 places, 391 transitions, 5089 flow. Second operand 8 states and 162 transitions.
[2024-06-04 18:25:43,123 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 409 transitions, 6032 flow
[2024-06-04 18:25:43,856 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 409 transitions, 5906 flow, removed 11 selfloop flow, removed 7 redundant places.
[2024-06-04 18:25:43,861 INFO  L231             Difference]: Finished difference. Result has 282 places, 395 transitions, 5185 flow
[2024-06-04 18:25:43,861 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=4963, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=391, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=334, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5185, PETRI_PLACES=282, PETRI_TRANSITIONS=395}
[2024-06-04 18:25:43,861 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 238 predicate places.
[2024-06-04 18:25:43,861 INFO  L495      AbstractCegarLoop]: Abstraction has has 282 places, 395 transitions, 5185 flow
[2024-06-04 18:25:43,861 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 13.7) internal successors, (137), 10 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:25:43,861 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:25:43,861 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:25:43,861 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73
[2024-06-04 18:25:43,861 INFO  L420      AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:25:43,862 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:25:43,862 INFO  L85        PathProgramCache]: Analyzing trace with hash -644702252, now seen corresponding path program 2 times
[2024-06-04 18:25:43,862 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:25:43,862 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065110432]
[2024-06-04 18:25:43,862 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:25:43,862 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:25:43,896 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:25:53,572 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:25:53,572 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:25:53,572 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065110432]
[2024-06-04 18:25:53,572 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065110432] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:25:53,572 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:25:53,572 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:25:53,572 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994279343]
[2024-06-04 18:25:53,572 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:25:53,572 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:25:53,572 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:25:53,573 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:25:53,573 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:25:53,745 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43
[2024-06-04 18:25:53,745 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 395 transitions, 5185 flow. Second operand  has 10 states, 10 states have (on average 13.7) internal successors, (137), 10 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:25:53,746 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:25:53,746 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43
[2024-06-04 18:25:53,746 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:25:55,286 INFO  L124   PetriNetUnfolderBase]: 3037/5044 cut-off events.
[2024-06-04 18:25:55,286 INFO  L125   PetriNetUnfolderBase]: For 508341/508341 co-relation queries the response was YES.
[2024-06-04 18:25:55,323 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 45915 conditions, 5044 events. 3037/5044 cut-off events. For 508341/508341 co-relation queries the response was YES. Maximal size of possible extension queue 337. Compared 32232 event pairs, 708 based on Foata normal form. 2/5037 useless extension candidates. Maximal degree in co-relation 45782. Up to 4462 conditions per place. 
[2024-06-04 18:25:55,339 INFO  L140   encePairwiseOnDemand]: 30/43 looper letters, 340 selfloop transitions, 73 changer transitions 0/420 dead transitions.
[2024-06-04 18:25:55,340 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 420 transitions, 6415 flow
[2024-06-04 18:25:55,340 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 18:25:55,340 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 18:25:55,340 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 182 transitions.
[2024-06-04 18:25:55,340 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4702842377260982
[2024-06-04 18:25:55,340 INFO  L175             Difference]: Start difference. First operand has 282 places, 395 transitions, 5185 flow. Second operand 9 states and 182 transitions.
[2024-06-04 18:25:55,340 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 290 places, 420 transitions, 6415 flow
[2024-06-04 18:25:55,877 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 420 transitions, 6223 flow, removed 42 selfloop flow, removed 6 redundant places.
[2024-06-04 18:25:55,882 INFO  L231             Difference]: Finished difference. Result has 286 places, 404 transitions, 5399 flow
[2024-06-04 18:25:55,882 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=4993, PETRI_DIFFERENCE_MINUEND_PLACES=276, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=395, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=322, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5399, PETRI_PLACES=286, PETRI_TRANSITIONS=404}
[2024-06-04 18:25:55,882 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 242 predicate places.
[2024-06-04 18:25:55,882 INFO  L495      AbstractCegarLoop]: Abstraction has has 286 places, 404 transitions, 5399 flow
[2024-06-04 18:25:55,882 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 13.7) internal successors, (137), 10 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:25:55,882 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:25:55,882 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:25:55,882 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74
[2024-06-04 18:25:55,882 INFO  L420      AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:25:55,882 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:25:55,883 INFO  L85        PathProgramCache]: Analyzing trace with hash -461240798, now seen corresponding path program 3 times
[2024-06-04 18:25:55,883 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:25:55,883 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889246950]
[2024-06-04 18:25:55,883 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:25:55,883 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:25:55,917 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:26:04,338 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:26:04,339 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:26:04,339 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889246950]
[2024-06-04 18:26:04,339 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889246950] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:26:04,339 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:26:04,339 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:26:04,339 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40643297]
[2024-06-04 18:26:04,339 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:26:04,339 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:26:04,339 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:26:04,339 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:26:04,339 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:26:04,458 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43
[2024-06-04 18:26:04,458 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 404 transitions, 5399 flow. Second operand  has 9 states, 9 states have (on average 13.88888888888889) internal successors, (125), 9 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-04 18:26:04,459 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:26:04,459 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43
[2024-06-04 18:26:04,459 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:26:05,960 INFO  L124   PetriNetUnfolderBase]: 3042/5051 cut-off events.
[2024-06-04 18:26:05,960 INFO  L125   PetriNetUnfolderBase]: For 521785/521785 co-relation queries the response was YES.
[2024-06-04 18:26:06,000 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 46739 conditions, 5051 events. 3042/5051 cut-off events. For 521785/521785 co-relation queries the response was YES. Maximal size of possible extension queue 338. Compared 32285 event pairs, 715 based on Foata normal form. 1/5044 useless extension candidates. Maximal degree in co-relation 46604. Up to 4524 conditions per place. 
[2024-06-04 18:26:06,019 INFO  L140   encePairwiseOnDemand]: 32/43 looper letters, 358 selfloop transitions, 58 changer transitions 0/423 dead transitions.
[2024-06-04 18:26:06,019 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 423 transitions, 6377 flow
[2024-06-04 18:26:06,020 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:26:06,020 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:26:06,021 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 156 transitions.
[2024-06-04 18:26:06,021 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45348837209302323
[2024-06-04 18:26:06,021 INFO  L175             Difference]: Start difference. First operand has 286 places, 404 transitions, 5399 flow. Second operand 8 states and 156 transitions.
[2024-06-04 18:26:06,021 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 293 places, 423 transitions, 6377 flow
[2024-06-04 18:26:06,735 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 287 places, 423 transitions, 6156 flow, removed 50 selfloop flow, removed 6 redundant places.
[2024-06-04 18:26:06,740 INFO  L231             Difference]: Finished difference. Result has 289 places, 412 transitions, 5459 flow
[2024-06-04 18:26:06,740 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=5186, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=404, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=349, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5459, PETRI_PLACES=289, PETRI_TRANSITIONS=412}
[2024-06-04 18:26:06,741 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 245 predicate places.
[2024-06-04 18:26:06,741 INFO  L495      AbstractCegarLoop]: Abstraction has has 289 places, 412 transitions, 5459 flow
[2024-06-04 18:26:06,741 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 13.88888888888889) internal successors, (125), 9 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-04 18:26:06,741 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:26:06,741 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:26:06,741 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75
[2024-06-04 18:26:06,741 INFO  L420      AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:26:06,741 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:26:06,741 INFO  L85        PathProgramCache]: Analyzing trace with hash -1520309740, now seen corresponding path program 4 times
[2024-06-04 18:26:06,741 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:26:06,742 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868746786]
[2024-06-04 18:26:06,742 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:26:06,742 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:26:06,775 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:26:15,285 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:26:15,285 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:26:15,285 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868746786]
[2024-06-04 18:26:15,285 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868746786] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:26:15,285 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:26:15,285 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:26:15,285 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817568584]
[2024-06-04 18:26:15,285 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:26:15,285 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:26:15,285 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:26:15,286 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:26:15,286 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:26:15,462 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43
[2024-06-04 18:26:15,462 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 412 transitions, 5459 flow. Second operand  has 10 states, 10 states have (on average 13.7) internal successors, (137), 10 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:26:15,462 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:26:15,462 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43
[2024-06-04 18:26:15,462 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:26:17,026 INFO  L124   PetriNetUnfolderBase]: 3055/5071 cut-off events.
[2024-06-04 18:26:17,026 INFO  L125   PetriNetUnfolderBase]: For 522717/522717 co-relation queries the response was YES.
[2024-06-04 18:26:17,064 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 46703 conditions, 5071 events. 3055/5071 cut-off events. For 522717/522717 co-relation queries the response was YES. Maximal size of possible extension queue 340. Compared 32447 event pairs, 713 based on Foata normal form. 1/5063 useless extension candidates. Maximal degree in co-relation 46566. Up to 4461 conditions per place. 
[2024-06-04 18:26:17,080 INFO  L140   encePairwiseOnDemand]: 31/43 looper letters, 334 selfloop transitions, 96 changer transitions 0/437 dead transitions.
[2024-06-04 18:26:17,080 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 437 transitions, 6669 flow
[2024-06-04 18:26:17,081 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 18:26:17,081 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 18:26:17,081 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 179 transitions.
[2024-06-04 18:26:17,081 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4625322997416021
[2024-06-04 18:26:17,081 INFO  L175             Difference]: Start difference. First operand has 289 places, 412 transitions, 5459 flow. Second operand 9 states and 179 transitions.
[2024-06-04 18:26:17,081 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 437 transitions, 6669 flow
[2024-06-04 18:26:17,680 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 437 transitions, 6555 flow, removed 30 selfloop flow, removed 3 redundant places.
[2024-06-04 18:26:17,685 INFO  L231             Difference]: Finished difference. Result has 296 places, 422 transitions, 5740 flow
[2024-06-04 18:26:17,685 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=5345, PETRI_DIFFERENCE_MINUEND_PLACES=286, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=412, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=89, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=319, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5740, PETRI_PLACES=296, PETRI_TRANSITIONS=422}
[2024-06-04 18:26:17,686 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 252 predicate places.
[2024-06-04 18:26:17,686 INFO  L495      AbstractCegarLoop]: Abstraction has has 296 places, 422 transitions, 5740 flow
[2024-06-04 18:26:17,686 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 13.7) internal successors, (137), 10 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:26:17,686 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:26:17,686 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:26:17,686 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76
[2024-06-04 18:26:17,686 INFO  L420      AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:26:17,686 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:26:17,686 INFO  L85        PathProgramCache]: Analyzing trace with hash -1035014350, now seen corresponding path program 5 times
[2024-06-04 18:26:17,686 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:26:17,686 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190710041]
[2024-06-04 18:26:17,686 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:26:17,686 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:26:17,719 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:26:26,484 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:26:26,484 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:26:26,484 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190710041]
[2024-06-04 18:26:26,484 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190710041] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:26:26,484 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:26:26,484 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:26:26,485 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106428717]
[2024-06-04 18:26:26,485 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:26:26,485 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:26:26,485 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:26:26,485 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:26:26,485 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:26:26,594 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43
[2024-06-04 18:26:26,594 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 296 places, 422 transitions, 5740 flow. Second operand  has 10 states, 10 states have (on average 13.7) internal successors, (137), 10 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:26:26,594 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:26:26,594 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43
[2024-06-04 18:26:26,594 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:26:28,122 INFO  L124   PetriNetUnfolderBase]: 3060/5080 cut-off events.
[2024-06-04 18:26:28,122 INFO  L125   PetriNetUnfolderBase]: For 539201/539201 co-relation queries the response was YES.
[2024-06-04 18:26:28,163 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 47429 conditions, 5080 events. 3060/5080 cut-off events. For 539201/539201 co-relation queries the response was YES. Maximal size of possible extension queue 340. Compared 32483 event pairs, 709 based on Foata normal form. 1/5072 useless extension candidates. Maximal degree in co-relation 47290. Up to 4406 conditions per place. 
[2024-06-04 18:26:28,182 INFO  L140   encePairwiseOnDemand]: 32/43 looper letters, 318 selfloop transitions, 123 changer transitions 0/448 dead transitions.
[2024-06-04 18:26:28,182 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 448 transitions, 7132 flow
[2024-06-04 18:26:28,183 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 18:26:28,183 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 18:26:28,183 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 181 transitions.
[2024-06-04 18:26:28,183 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46770025839793283
[2024-06-04 18:26:28,183 INFO  L175             Difference]: Start difference. First operand has 296 places, 422 transitions, 5740 flow. Second operand 9 states and 181 transitions.
[2024-06-04 18:26:28,183 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 448 transitions, 7132 flow
[2024-06-04 18:26:28,933 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 300 places, 448 transitions, 6990 flow, removed 44 selfloop flow, removed 4 redundant places.
[2024-06-04 18:26:28,938 INFO  L231             Difference]: Finished difference. Result has 302 places, 432 transitions, 6057 flow
[2024-06-04 18:26:28,938 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=5598, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=422, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=116, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=302, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6057, PETRI_PLACES=302, PETRI_TRANSITIONS=432}
[2024-06-04 18:26:28,938 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 258 predicate places.
[2024-06-04 18:26:28,939 INFO  L495      AbstractCegarLoop]: Abstraction has has 302 places, 432 transitions, 6057 flow
[2024-06-04 18:26:28,939 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 13.7) internal successors, (137), 10 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:26:28,939 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:26:28,939 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:26:28,939 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77
[2024-06-04 18:26:28,939 INFO  L420      AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:26:28,939 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:26:28,939 INFO  L85        PathProgramCache]: Analyzing trace with hash -1028348110, now seen corresponding path program 6 times
[2024-06-04 18:26:28,940 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:26:28,940 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279900086]
[2024-06-04 18:26:28,940 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:26:28,940 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:26:28,972 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:26:37,496 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:26:37,496 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:26:37,497 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279900086]
[2024-06-04 18:26:37,497 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279900086] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:26:37,497 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:26:37,497 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:26:37,497 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431462410]
[2024-06-04 18:26:37,497 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:26:37,497 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:26:37,497 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:26:37,497 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:26:37,498 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:26:37,690 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43
[2024-06-04 18:26:37,690 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 432 transitions, 6057 flow. Second operand  has 10 states, 10 states have (on average 13.7) internal successors, (137), 10 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:26:37,690 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:26:37,690 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43
[2024-06-04 18:26:37,690 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:26:39,269 INFO  L124   PetriNetUnfolderBase]: 3065/5089 cut-off events.
[2024-06-04 18:26:39,270 INFO  L125   PetriNetUnfolderBase]: For 555156/555156 co-relation queries the response was YES.
[2024-06-04 18:26:39,309 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 48285 conditions, 5089 events. 3065/5089 cut-off events. For 555156/555156 co-relation queries the response was YES. Maximal size of possible extension queue 341. Compared 32621 event pairs, 709 based on Foata normal form. 1/5081 useless extension candidates. Maximal degree in co-relation 48143. Up to 4412 conditions per place. 
[2024-06-04 18:26:39,326 INFO  L140   encePairwiseOnDemand]: 32/43 looper letters, 319 selfloop transitions, 124 changer transitions 0/450 dead transitions.
[2024-06-04 18:26:39,326 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 310 places, 450 transitions, 7216 flow
[2024-06-04 18:26:39,327 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 18:26:39,327 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 18:26:39,327 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 181 transitions.
[2024-06-04 18:26:39,327 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46770025839793283
[2024-06-04 18:26:39,327 INFO  L175             Difference]: Start difference. First operand has 302 places, 432 transitions, 6057 flow. Second operand 9 states and 181 transitions.
[2024-06-04 18:26:39,327 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 310 places, 450 transitions, 7216 flow
[2024-06-04 18:26:40,057 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 450 transitions, 6870 flow, removed 71 selfloop flow, removed 6 redundant places.
[2024-06-04 18:26:40,062 INFO  L231             Difference]: Finished difference. Result has 305 places, 435 transitions, 6052 flow
[2024-06-04 18:26:40,063 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=5739, PETRI_DIFFERENCE_MINUEND_PLACES=296, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=432, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=121, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=311, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6052, PETRI_PLACES=305, PETRI_TRANSITIONS=435}
[2024-06-04 18:26:40,063 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 261 predicate places.
[2024-06-04 18:26:40,063 INFO  L495      AbstractCegarLoop]: Abstraction has has 305 places, 435 transitions, 6052 flow
[2024-06-04 18:26:40,063 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 13.7) internal successors, (137), 10 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:26:40,063 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:26:40,063 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:26:40,063 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78
[2024-06-04 18:26:40,063 INFO  L420      AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:26:40,063 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:26:40,063 INFO  L85        PathProgramCache]: Analyzing trace with hash -1308701418, now seen corresponding path program 7 times
[2024-06-04 18:26:40,063 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:26:40,064 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775596927]
[2024-06-04 18:26:40,064 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:26:40,064 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:26:40,103 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:26:48,747 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:26:48,747 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:26:48,747 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775596927]
[2024-06-04 18:26:48,747 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775596927] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:26:48,747 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:26:48,747 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:26:48,747 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456368105]
[2024-06-04 18:26:48,747 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:26:48,747 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:26:48,747 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:26:48,748 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:26:48,748 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:26:48,939 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43
[2024-06-04 18:26:48,939 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 435 transitions, 6052 flow. Second operand  has 10 states, 10 states have (on average 13.7) internal successors, (137), 10 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:26:48,939 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:26:48,939 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43
[2024-06-04 18:26:48,940 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:26:50,452 INFO  L124   PetriNetUnfolderBase]: 3062/5085 cut-off events.
[2024-06-04 18:26:50,452 INFO  L125   PetriNetUnfolderBase]: For 561798/561798 co-relation queries the response was YES.
[2024-06-04 18:26:50,495 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 47974 conditions, 5085 events. 3062/5085 cut-off events. For 561798/561798 co-relation queries the response was YES. Maximal size of possible extension queue 340. Compared 32553 event pairs, 709 based on Foata normal form. 1/5077 useless extension candidates. Maximal degree in co-relation 47831. Up to 4484 conditions per place. 
[2024-06-04 18:26:50,514 INFO  L140   encePairwiseOnDemand]: 31/43 looper letters, 357 selfloop transitions, 86 changer transitions 0/450 dead transitions.
[2024-06-04 18:26:50,514 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 450 transitions, 7003 flow
[2024-06-04 18:26:50,515 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 18:26:50,515 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 18:26:50,515 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 179 transitions.
[2024-06-04 18:26:50,515 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4625322997416021
[2024-06-04 18:26:50,515 INFO  L175             Difference]: Start difference. First operand has 305 places, 435 transitions, 6052 flow. Second operand 9 states and 179 transitions.
[2024-06-04 18:26:50,516 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 450 transitions, 7003 flow
[2024-06-04 18:26:51,407 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 307 places, 450 transitions, 6717 flow, removed 46 selfloop flow, removed 6 redundant places.
[2024-06-04 18:26:51,412 INFO  L231             Difference]: Finished difference. Result has 308 places, 436 transitions, 5973 flow
[2024-06-04 18:26:51,413 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=5783, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=435, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=85, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=349, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5973, PETRI_PLACES=308, PETRI_TRANSITIONS=436}
[2024-06-04 18:26:51,413 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 264 predicate places.
[2024-06-04 18:26:51,413 INFO  L495      AbstractCegarLoop]: Abstraction has has 308 places, 436 transitions, 5973 flow
[2024-06-04 18:26:51,413 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 13.7) internal successors, (137), 10 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:26:51,413 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:26:51,413 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:26:51,413 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79
[2024-06-04 18:26:51,413 INFO  L420      AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:26:51,413 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:26:51,414 INFO  L85        PathProgramCache]: Analyzing trace with hash -1308196428, now seen corresponding path program 8 times
[2024-06-04 18:26:51,414 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:26:51,414 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81982130]
[2024-06-04 18:26:51,414 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:26:51,414 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:26:51,447 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:27:00,484 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:27:00,485 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:27:00,485 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81982130]
[2024-06-04 18:27:00,485 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81982130] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:27:00,485 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:27:00,485 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:27:00,485 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598888863]
[2024-06-04 18:27:00,485 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:27:00,485 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:27:00,485 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:27:00,485 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:27:00,485 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:27:00,712 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43
[2024-06-04 18:27:00,713 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 308 places, 436 transitions, 5973 flow. Second operand  has 10 states, 10 states have (on average 13.7) internal successors, (137), 10 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:27:00,713 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:27:00,713 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43
[2024-06-04 18:27:00,713 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:27:02,221 INFO  L124   PetriNetUnfolderBase]: 3059/5085 cut-off events.
[2024-06-04 18:27:02,221 INFO  L125   PetriNetUnfolderBase]: For 571841/571841 co-relation queries the response was YES.
[2024-06-04 18:27:02,264 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 47892 conditions, 5085 events. 3059/5085 cut-off events. For 571841/571841 co-relation queries the response was YES. Maximal size of possible extension queue 339. Compared 32570 event pairs, 713 based on Foata normal form. 1/5077 useless extension candidates. Maximal degree in co-relation 47748. Up to 4454 conditions per place. 
[2024-06-04 18:27:02,283 INFO  L140   encePairwiseOnDemand]: 32/43 looper letters, 344 selfloop transitions, 100 changer transitions 0/451 dead transitions.
[2024-06-04 18:27:02,283 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 451 transitions, 6925 flow
[2024-06-04 18:27:02,283 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 18:27:02,283 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 18:27:02,284 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 180 transitions.
[2024-06-04 18:27:02,284 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46511627906976744
[2024-06-04 18:27:02,284 INFO  L175             Difference]: Start difference. First operand has 308 places, 436 transitions, 5973 flow. Second operand 9 states and 180 transitions.
[2024-06-04 18:27:02,284 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 316 places, 451 transitions, 6925 flow
Killed by 15