./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 76401ed0
Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/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-76401ed-m
[2024-06-20 20:01:13,557 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-06-20 20:01:13,602 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-06-20 20:01:13,605 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-06-20 20:01:13,605 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-06-20 20:01:13,618 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-06-20 20:01:13,619 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-06-20 20:01:13,619 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-06-20 20:01:13,620 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-06-20 20:01:13,620 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-06-20 20:01:13,620 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-06-20 20:01:13,621 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-06-20 20:01:13,621 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-06-20 20:01:13,621 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-06-20 20:01:13,622 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-06-20 20:01:13,622 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-06-20 20:01:13,622 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-06-20 20:01:13,623 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-06-20 20:01:13,623 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-06-20 20:01:13,623 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-06-20 20:01:13,623 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-06-20 20:01:13,624 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-06-20 20:01:13,624 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-06-20 20:01:13,625 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-06-20 20:01:13,625 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-06-20 20:01:13,625 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-06-20 20:01:13,626 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-06-20 20:01:13,626 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-06-20 20:01:13,626 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-06-20 20:01:13,626 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-06-20 20:01:13,627 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-06-20 20:01:13,627 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-06-20 20:01:13,627 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-06-20 20:01:13,628 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-06-20 20:01:13,628 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-06-20 20:01:13,628 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-06-20 20:01:13,629 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-06-20 20:01:13,629 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-06-20 20:01:13,629 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-06-20 20:01:13,630 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-06-20 20:01:13,630 INFO  L153        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-06-20 20:01:13,630 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-06-20 20:01:13,631 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-06-20 20:01:13,631 INFO  L153        SettingsManager]:  * Looper check in Petri net analysis=SEMANTIC
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false
[2024-06-20 20:01:13,793 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-06-20 20:01:13,808 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-06-20 20:01:13,810 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-06-20 20:01:13,810 INFO  L270        PluginConnector]: Initializing Witness Parser...
[2024-06-20 20:01:13,811 INFO  L274        PluginConnector]: Witness Parser initialized
[2024-06-20 20:01:13,812 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-20 20:01:14,022 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-06-20 20:01:14,022 INFO  L274        PluginConnector]: CDTParser initialized
[2024-06-20 20:01:14,022 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-20 20:01:15,096 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-06-20 20:01:15,329 INFO  L384              CDTParser]: Found 1 translation units.
[2024-06-20 20:01:15,329 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-20 20:01:15,342 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3656885ef/b7eee5866a484cdb950cd3ab6668b7cf/FLAGd33b686d4
[2024-06-20 20:01:15,352 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3656885ef/b7eee5866a484cdb950cd3ab6668b7cf
[2024-06-20 20:01:15,352 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-06-20 20:01:15,353 INFO  L133        ToolchainWalker]: Walking toolchain with 5 elements.
[2024-06-20 20:01:15,354 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-06-20 20:01:15,354 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-06-20 20:01:15,358 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-06-20 20:01:15,359 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.06 08:01:14" (1/2) ...
[2024-06-20 20:01:15,359 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@504b1e85 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 08:01:15, skipping insertion in model container
[2024-06-20 20:01:15,364 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.06 08:01:14" (1/2) ...
[2024-06-20 20:01:15,365 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@44c8a5f6 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 08:01:15, skipping insertion in model container
[2024-06-20 20:01:15,365 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.06 08:01:15" (2/2) ...
[2024-06-20 20:01:15,365 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@504b1e85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 08:01:15, skipping insertion in model container
[2024-06-20 20:01:15,366 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.06 08:01:15" (2/2) ...
[2024-06-20 20:01:15,366 INFO  L83    nessWitnessExtractor]: Extracting all invariants from correctness witness
[2024-06-20 20:01:15,466 INFO  L95    edCorrectnessWitness]: Found the following entries in the witness:
[2024-06-20 20:01:15,467 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-20 20:01:15,468 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-20 20:01:15,468 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-20 20:01:15,469 INFO  L103   edCorrectnessWitness]: ghost_variable multithreaded = 0
[2024-06-20 20:01:15,469 INFO  L106   edCorrectnessWitness]: ghost_update [L828-L828] multithreaded = 1;
[2024-06-20 20:01:15,490 INFO  L177         MainTranslator]: Built tables and reachable declarations
[2024-06-20 20:01:15,809 INFO  L207          PostProcessor]: Analyzing one entry point: main
[2024-06-20 20:01:15,819 INFO  L202         MainTranslator]: Completed pre-run
Start Parsing Local
Start Parsing Local
Start Parsing Local
Start Parsing Local
Start Parsing Local
[2024-06-20 20:01:16,136 INFO  L207          PostProcessor]: Analyzing one entry point: main
[2024-06-20 20:01:16,173 INFO  L206         MainTranslator]: Completed translation
[2024-06-20 20:01:16,174 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 08:01:16 WrapperNode
[2024-06-20 20:01:16,174 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-06-20 20:01:16,175 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-06-20 20:01:16,176 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-06-20 20:01:16,176 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-06-20 20:01:16,181 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 08:01:16" (1/1) ...
[2024-06-20 20:01:16,221 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 08:01:16" (1/1) ...
[2024-06-20 20:01:16,327 INFO  L138                Inliner]: procedures = 175, calls = 47, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 125
[2024-06-20 20:01:16,328 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-06-20 20:01:16,329 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-06-20 20:01:16,329 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-06-20 20:01:16,329 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-06-20 20:01:16,338 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 08:01:16" (1/1) ...
[2024-06-20 20:01:16,338 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 08:01:16" (1/1) ...
[2024-06-20 20:01:16,364 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 08:01:16" (1/1) ...
[2024-06-20 20:01:16,400 INFO  L175           MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2024-06-20 20:01:16,401 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 08:01:16" (1/1) ...
[2024-06-20 20:01:16,402 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 08:01:16" (1/1) ...
[2024-06-20 20:01:16,431 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 08:01:16" (1/1) ...
[2024-06-20 20:01:16,433 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 08:01:16" (1/1) ...
[2024-06-20 20:01:16,452 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 08:01:16" (1/1) ...
[2024-06-20 20:01:16,458 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 08:01:16" (1/1) ...
[2024-06-20 20:01:16,534 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-06-20 20:01:16,535 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-06-20 20:01:16,535 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-06-20 20:01:16,535 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-06-20 20:01:16,535 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 08:01:16" (1/1) ...
[2024-06-20 20:01:16,548 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-06-20 20:01:16,565 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-06-20 20:01:16,591 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-06-20 20:01:16,600 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-06-20 20:01:16,624 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2024-06-20 20:01:16,624 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-06-20 20:01:16,625 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2024-06-20 20:01:16,625 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2024-06-20 20:01:16,625 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2024-06-20 20:01:16,625 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2024-06-20 20:01:16,625 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2024-06-20 20:01:16,625 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2024-06-20 20:01:16,625 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-06-20 20:01:16,625 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2024-06-20 20:01:16,626 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-06-20 20:01:16,626 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-06-20 20:01:16,627 WARN  L214             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement
[2024-06-20 20:01:16,717 INFO  L244             CfgBuilder]: Building ICFG
[2024-06-20 20:01:16,719 INFO  L270             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-06-20 20:01:17,738 INFO  L289             CfgBuilder]: Ommited future-live optimization because the input is a concurrent program.
[2024-06-20 20:01:17,739 INFO  L293             CfgBuilder]: Performing block encoding
[2024-06-20 20:01:17,957 INFO  L315             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-06-20 20:01:17,958 INFO  L320             CfgBuilder]: Removed 0 assume(true) statements.
[2024-06-20 20:01:17,958 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.06 08:01:17 BoogieIcfgContainer
[2024-06-20 20:01:17,958 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-06-20 20:01:17,960 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-06-20 20:01:17,960 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-06-20 20:01:17,962 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-06-20 20:01:17,962 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.06 08:01:14" (1/4) ...
[2024-06-20 20:01:17,963 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f07c16b and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 20.06 08:01:17, skipping insertion in model container
[2024-06-20 20:01:17,963 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.06 08:01:15" (2/4) ...
[2024-06-20 20:01:17,963 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f07c16b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.06 08:01:17, skipping insertion in model container
[2024-06-20 20:01:17,963 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 08:01:16" (3/4) ...
[2024-06-20 20:01:17,964 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f07c16b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.06 08:01:17, skipping insertion in model container
[2024-06-20 20:01:17,964 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.06 08:01:17" (4/4) ...
[2024-06-20 20:01:17,964 INFO  L112   eAbstractionObserver]: Analyzing ICFG safe034_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i
[2024-06-20 20:01:17,977 INFO  L204   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-06-20 20:01:17,977 INFO  L163   ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations.
[2024-06-20 20:01:17,977 INFO  L522   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-06-20 20:01:18,055 INFO  L144    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-06-20 20:01:18,078 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 52 places, 42 transitions, 96 flow
[2024-06-20 20:01:18,122 INFO  L124   PetriNetUnfolderBase]: 0/39 cut-off events.
[2024-06-20 20:01:18,123 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-06-20 20:01:18,125 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 49 conditions, 39 events. 0/39 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 73 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. 
[2024-06-20 20:01:18,125 INFO  L82        GeneralOperation]: Start removeDead. Operand has 52 places, 42 transitions, 96 flow
[2024-06-20 20:01:18,128 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 43 places, 33 transitions, 75 flow
[2024-06-20 20:01:18,140 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-06-20 20:01:18,146 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;@7e7d7254, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-06-20 20:01:18,146 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2024-06-20 20:01:18,154 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-06-20 20:01:18,154 INFO  L124   PetriNetUnfolderBase]: 0/6 cut-off events.
[2024-06-20 20:01:18,154 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-06-20 20:01:18,154 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:01:18,154 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1]
[2024-06-20 20:01:18,155 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:01:18,201 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:01:18,201 INFO  L85        PathProgramCache]: Analyzing trace with hash 360629915, now seen corresponding path program 1 times
[2024-06-20 20:01:18,208 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:01:18,209 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222053005]
[2024-06-20 20:01:18,209 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:01:18,209 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:01:18,618 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:01:22,645 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:01:22,646 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:01:22,646 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222053005]
[2024-06-20 20:01:22,647 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222053005] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:01:22,647 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:01:22,647 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-06-20 20:01:22,648 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823166104]
[2024-06-20 20:01:22,649 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:01:22,655 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-06-20 20:01:22,658 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:01:22,680 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-06-20 20:01:22,681 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-06-20 20:01:22,738 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 15 out of 42
[2024-06-20 20:01:22,741 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 75 flow. Second operand  has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:01:22,742 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:01:22,742 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 42
[2024-06-20 20:01:22,743 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:01:23,291 INFO  L124   PetriNetUnfolderBase]: 869/1381 cut-off events.
[2024-06-20 20:01:23,292 INFO  L125   PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES.
[2024-06-20 20:01:23,298 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2759 conditions, 1381 events. 869/1381 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 7095 event pairs, 566 based on Foata normal form. 1/1340 useless extension candidates. Maximal degree in co-relation 2747. Up to 1315 conditions per place. 
[2024-06-20 20:01:23,304 INFO  L140   encePairwiseOnDemand]: 35/42 looper letters, 30 selfloop transitions, 4 changer transitions 0/43 dead transitions.
[2024-06-20 20:01:23,305 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 43 transitions, 169 flow
[2024-06-20 20:01:23,306 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-06-20 20:01:23,307 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-06-20 20:01:23,313 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 82 transitions.
[2024-06-20 20:01:23,314 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.6507936507936508
[2024-06-20 20:01:23,315 INFO  L175             Difference]: Start difference. First operand has 43 places, 33 transitions, 75 flow. Second operand 3 states and 82 transitions.
[2024-06-20 20:01:23,316 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 43 transitions, 169 flow
[2024-06-20 20:01:23,317 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 43 transitions, 164 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-06-20 20:01:23,320 INFO  L231             Difference]: Finished difference. Result has 43 places, 36 transitions, 102 flow
[2024-06-20 20:01:23,321 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=43, PETRI_TRANSITIONS=36}
[2024-06-20 20:01:23,323 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 0 predicate places.
[2024-06-20 20:01:23,324 INFO  L495      AbstractCegarLoop]: Abstraction has has 43 places, 36 transitions, 102 flow
[2024-06-20 20:01:23,324 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:01:23,324 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:01:23,324 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:01:23,324 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-06-20 20:01:23,324 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:01:23,325 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:01:23,325 INFO  L85        PathProgramCache]: Analyzing trace with hash -1326954950, now seen corresponding path program 1 times
[2024-06-20 20:01:23,326 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:01:23,326 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919303089]
[2024-06-20 20:01:23,326 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:01:23,326 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:01:23,419 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:01:26,604 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:01:26,604 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:01:26,604 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919303089]
[2024-06-20 20:01:26,605 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919303089] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:01:26,605 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:01:26,605 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-06-20 20:01:26,605 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567670123]
[2024-06-20 20:01:26,606 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:01:26,607 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-06-20 20:01:26,607 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:01:26,608 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-06-20 20:01:26,608 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-06-20 20:01:26,703 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 15 out of 42
[2024-06-20 20:01:26,703 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 36 transitions, 102 flow. Second operand  has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:01:26,703 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:01:26,703 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 42
[2024-06-20 20:01:26,703 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:01:27,232 INFO  L124   PetriNetUnfolderBase]: 863/1368 cut-off events.
[2024-06-20 20:01:27,232 INFO  L125   PetriNetUnfolderBase]: For 300/300 co-relation queries the response was YES.
[2024-06-20 20:01:27,235 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 3143 conditions, 1368 events. 863/1368 cut-off events. For 300/300 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 6887 event pairs, 486 based on Foata normal form. 3/1359 useless extension candidates. Maximal degree in co-relation 3131. Up to 1291 conditions per place. 
[2024-06-20 20:01:27,239 INFO  L140   encePairwiseOnDemand]: 34/42 looper letters, 37 selfloop transitions, 7 changer transitions 0/53 dead transitions.
[2024-06-20 20:01:27,240 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 53 transitions, 236 flow
[2024-06-20 20:01:27,240 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-06-20 20:01:27,240 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-06-20 20:01:27,241 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 107 transitions.
[2024-06-20 20:01:27,241 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.6369047619047619
[2024-06-20 20:01:27,241 INFO  L175             Difference]: Start difference. First operand has 43 places, 36 transitions, 102 flow. Second operand 4 states and 107 transitions.
[2024-06-20 20:01:27,242 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 53 transitions, 236 flow
[2024-06-20 20:01:27,242 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 53 transitions, 232 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-06-20 20:01:27,243 INFO  L231             Difference]: Finished difference. Result has 46 places, 39 transitions, 138 flow
[2024-06-20 20:01:27,243 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=138, PETRI_PLACES=46, PETRI_TRANSITIONS=39}
[2024-06-20 20:01:27,244 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 3 predicate places.
[2024-06-20 20:01:27,244 INFO  L495      AbstractCegarLoop]: Abstraction has has 46 places, 39 transitions, 138 flow
[2024-06-20 20:01:27,244 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:01:27,244 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:01:27,244 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:01:27,245 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-06-20 20:01:27,245 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-20 20:01:27,245 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:01:27,245 INFO  L85        PathProgramCache]: Analyzing trace with hash -1471908094, now seen corresponding path program 1 times
[2024-06-20 20:01:27,245 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:01:27,246 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486343483]
[2024-06-20 20:01:27,246 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:01:27,246 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:01:27,274 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:01:34,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-20 20:01:34,729 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:01:34,729 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486343483]
[2024-06-20 20:01:34,729 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486343483] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:01:34,729 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:01:34,729 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-06-20 20:01:34,730 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028517913]
[2024-06-20 20:01:34,730 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:01:34,730 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-06-20 20:01:34,730 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:01:34,731 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-06-20 20:01:34,731 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2024-06-20 20:01:34,796 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 42
[2024-06-20 20:01:34,796 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 39 transitions, 138 flow. Second operand  has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:01:34,796 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:01:34,796 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 42
[2024-06-20 20:01:34,797 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:01:35,550 INFO  L124   PetriNetUnfolderBase]: 1094/1702 cut-off events.
[2024-06-20 20:01:35,551 INFO  L125   PetriNetUnfolderBase]: For 973/973 co-relation queries the response was YES.
[2024-06-20 20:01:35,553 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4354 conditions, 1702 events. 1094/1702 cut-off events. For 973/973 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 8386 event pairs, 637 based on Foata normal form. 4/1704 useless extension candidates. Maximal degree in co-relation 4339. Up to 1626 conditions per place. 
[2024-06-20 20:01:35,559 INFO  L140   encePairwiseOnDemand]: 34/42 looper letters, 39 selfloop transitions, 8 changer transitions 0/54 dead transitions.
[2024-06-20 20:01:35,559 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 54 transitions, 274 flow
[2024-06-20 20:01:35,560 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-20 20:01:35,560 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-20 20:01:35,564 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 106 transitions.
[2024-06-20 20:01:35,565 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5047619047619047
[2024-06-20 20:01:35,565 INFO  L175             Difference]: Start difference. First operand has 46 places, 39 transitions, 138 flow. Second operand 5 states and 106 transitions.
[2024-06-20 20:01:35,565 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 54 transitions, 274 flow
[2024-06-20 20:01:35,567 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 54 transitions, 260 flow, removed 2 selfloop flow, removed 2 redundant places.
[2024-06-20 20:01:35,568 INFO  L231             Difference]: Finished difference. Result has 49 places, 42 transitions, 166 flow
[2024-06-20 20:01:35,568 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=166, PETRI_PLACES=49, PETRI_TRANSITIONS=42}
[2024-06-20 20:01:35,569 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 6 predicate places.
[2024-06-20 20:01:35,569 INFO  L495      AbstractCegarLoop]: Abstraction has has 49 places, 42 transitions, 166 flow
[2024-06-20 20:01:35,569 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:01:35,569 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:01:35,570 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:01:35,570 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-06-20 20:01:35,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-20 20:01:35,570 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:01:35,570 INFO  L85        PathProgramCache]: Analyzing trace with hash -580904584, now seen corresponding path program 1 times
[2024-06-20 20:01:35,571 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:01:35,571 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618288456]
[2024-06-20 20:01:35,571 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:01:35,571 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:01:35,634 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:01:38,792 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:01:38,793 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:01:38,796 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618288456]
[2024-06-20 20:01:38,796 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618288456] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:01:38,797 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:01:38,797 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-06-20 20:01:38,797 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252028989]
[2024-06-20 20:01:38,797 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:01:38,798 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-06-20 20:01:38,798 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:01:38,799 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-06-20 20:01:38,800 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2024-06-20 20:01:38,974 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 14 out of 42
[2024-06-20 20:01:38,975 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 42 transitions, 166 flow. Second operand  has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:01:38,976 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:01:38,976 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 42
[2024-06-20 20:01:38,976 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:01:39,646 INFO  L124   PetriNetUnfolderBase]: 1085/1715 cut-off events.
[2024-06-20 20:01:39,646 INFO  L125   PetriNetUnfolderBase]: For 1702/1702 co-relation queries the response was YES.
[2024-06-20 20:01:39,649 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4750 conditions, 1715 events. 1085/1715 cut-off events. For 1702/1702 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 8562 event pairs, 369 based on Foata normal form. 6/1719 useless extension candidates. Maximal degree in co-relation 4734. Up to 1569 conditions per place. 
[2024-06-20 20:01:39,655 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 52 selfloop transitions, 12 changer transitions 0/72 dead transitions.
[2024-06-20 20:01:39,655 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 72 transitions, 378 flow
[2024-06-20 20:01:39,657 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-20 20:01:39,657 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-20 20:01:39,658 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 148 transitions.
[2024-06-20 20:01:39,659 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5873015873015873
[2024-06-20 20:01:39,659 INFO  L175             Difference]: Start difference. First operand has 49 places, 42 transitions, 166 flow. Second operand 6 states and 148 transitions.
[2024-06-20 20:01:39,659 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 72 transitions, 378 flow
[2024-06-20 20:01:39,661 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 72 transitions, 360 flow, removed 3 selfloop flow, removed 3 redundant places.
[2024-06-20 20:01:39,663 INFO  L231             Difference]: Finished difference. Result has 52 places, 46 transitions, 207 flow
[2024-06-20 20:01:39,663 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=207, PETRI_PLACES=52, PETRI_TRANSITIONS=46}
[2024-06-20 20:01:39,664 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 9 predicate places.
[2024-06-20 20:01:39,664 INFO  L495      AbstractCegarLoop]: Abstraction has has 52 places, 46 transitions, 207 flow
[2024-06-20 20:01:39,664 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:01:39,664 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:01:39,665 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:01:39,665 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-06-20 20:01:39,665 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:01:39,666 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:01:39,666 INFO  L85        PathProgramCache]: Analyzing trace with hash 52750403, now seen corresponding path program 1 times
[2024-06-20 20:01:39,666 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:01:39,666 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67010591]
[2024-06-20 20:01:39,666 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:01:39,667 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:01:39,694 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:01:48,278 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:01:48,278 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:01:48,278 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67010591]
[2024-06-20 20:01:48,278 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67010591] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:01:48,278 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:01:48,279 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-20 20:01:48,279 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395385555]
[2024-06-20 20:01:48,279 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:01:48,279 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-20 20:01:48,279 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:01:48,279 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-20 20:01:48,280 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-06-20 20:01:48,422 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 42
[2024-06-20 20:01:48,423 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 46 transitions, 207 flow. Second operand  has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:01:48,423 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:01:48,423 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 42
[2024-06-20 20:01:48,423 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:01:49,225 INFO  L124   PetriNetUnfolderBase]: 1107/1757 cut-off events.
[2024-06-20 20:01:49,225 INFO  L125   PetriNetUnfolderBase]: For 2767/2767 co-relation queries the response was YES.
[2024-06-20 20:01:49,229 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5295 conditions, 1757 events. 1107/1757 cut-off events. For 2767/2767 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 8739 event pairs, 430 based on Foata normal form. 4/1759 useless extension candidates. Maximal degree in co-relation 5277. Up to 1581 conditions per place. 
[2024-06-20 20:01:49,234 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 55 selfloop transitions, 17 changer transitions 0/79 dead transitions.
[2024-06-20 20:01:49,234 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 79 transitions, 469 flow
[2024-06-20 20:01:49,235 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 20:01:49,235 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 20:01:49,236 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 151 transitions.
[2024-06-20 20:01:49,236 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5136054421768708
[2024-06-20 20:01:49,236 INFO  L175             Difference]: Start difference. First operand has 52 places, 46 transitions, 207 flow. Second operand 7 states and 151 transitions.
[2024-06-20 20:01:49,236 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 79 transitions, 469 flow
[2024-06-20 20:01:49,240 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 79 transitions, 440 flow, removed 5 selfloop flow, removed 3 redundant places.
[2024-06-20 20:01:49,242 INFO  L231             Difference]: Finished difference. Result has 56 places, 52 transitions, 262 flow
[2024-06-20 20:01:49,243 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=262, PETRI_PLACES=56, PETRI_TRANSITIONS=52}
[2024-06-20 20:01:49,244 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 13 predicate places.
[2024-06-20 20:01:49,244 INFO  L495      AbstractCegarLoop]: Abstraction has has 56 places, 52 transitions, 262 flow
[2024-06-20 20:01:49,245 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:01:49,248 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:01:49,249 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:01:49,249 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-06-20 20:01:49,249 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:01:49,249 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:01:49,249 INFO  L85        PathProgramCache]: Analyzing trace with hash -1459392159, now seen corresponding path program 2 times
[2024-06-20 20:01:49,249 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:01:49,250 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004842218]
[2024-06-20 20:01:49,250 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:01:49,250 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:01:49,279 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:01:57,414 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:01:57,414 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:01:57,414 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004842218]
[2024-06-20 20:01:57,414 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004842218] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:01:57,415 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:01:57,415 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-20 20:01:57,415 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077053284]
[2024-06-20 20:01:57,415 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:01:57,415 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-20 20:01:57,416 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:01:57,416 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-20 20:01:57,416 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-06-20 20:01:57,498 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 42
[2024-06-20 20:01:57,498 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 52 transitions, 262 flow. Second operand  has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:01:57,499 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:01:57,499 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 42
[2024-06-20 20:01:57,499 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:01:58,391 INFO  L124   PetriNetUnfolderBase]: 1097/1743 cut-off events.
[2024-06-20 20:01:58,392 INFO  L125   PetriNetUnfolderBase]: For 3961/3961 co-relation queries the response was YES.
[2024-06-20 20:01:58,394 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5660 conditions, 1743 events. 1097/1743 cut-off events. For 3961/3961 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 8703 event pairs, 430 based on Foata normal form. 4/1745 useless extension candidates. Maximal degree in co-relation 5640. Up to 1573 conditions per place. 
[2024-06-20 20:01:58,401 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 52 selfloop transitions, 17 changer transitions 0/76 dead transitions.
[2024-06-20 20:01:58,401 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 76 transitions, 460 flow
[2024-06-20 20:01:58,401 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 20:01:58,402 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 20:01:58,402 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 148 transitions.
[2024-06-20 20:01:58,402 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5034013605442177
[2024-06-20 20:01:58,403 INFO  L175             Difference]: Start difference. First operand has 56 places, 52 transitions, 262 flow. Second operand 7 states and 148 transitions.
[2024-06-20 20:01:58,403 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 76 transitions, 460 flow
[2024-06-20 20:01:58,407 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 76 transitions, 428 flow, removed 11 selfloop flow, removed 3 redundant places.
[2024-06-20 20:01:58,409 INFO  L231             Difference]: Finished difference. Result has 60 places, 52 transitions, 272 flow
[2024-06-20 20:01:58,409 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=272, PETRI_PLACES=60, PETRI_TRANSITIONS=52}
[2024-06-20 20:01:58,411 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 17 predicate places.
[2024-06-20 20:01:58,411 INFO  L495      AbstractCegarLoop]: Abstraction has has 60 places, 52 transitions, 272 flow
[2024-06-20 20:01:58,411 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:01:58,412 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:01:58,412 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:01:58,412 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-06-20 20:01:58,412 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-20 20:01:58,413 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:01:58,413 INFO  L85        PathProgramCache]: Analyzing trace with hash 815328861, now seen corresponding path program 1 times
[2024-06-20 20:01:58,413 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:01:58,416 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428181779]
[2024-06-20 20:01:58,416 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:01:58,416 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:01:58,466 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:02:06,702 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:02:06,703 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:02:06,703 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428181779]
[2024-06-20 20:02:06,703 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428181779] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:02:06,703 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:02:06,703 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-20 20:02:06,703 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634423967]
[2024-06-20 20:02:06,703 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:02:06,703 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-20 20:02:06,704 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:02:06,704 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-20 20:02:06,704 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2024-06-20 20:02:06,808 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 42
[2024-06-20 20:02:06,808 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 52 transitions, 272 flow. Second operand  has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 7 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:02:06,808 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:02:06,808 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 42
[2024-06-20 20:02:06,808 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:02:07,510 INFO  L124   PetriNetUnfolderBase]: 1019/1656 cut-off events.
[2024-06-20 20:02:07,510 INFO  L125   PetriNetUnfolderBase]: For 4355/4355 co-relation queries the response was YES.
[2024-06-20 20:02:07,514 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5475 conditions, 1656 events. 1019/1656 cut-off events. For 4355/4355 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 8357 event pairs, 458 based on Foata normal form. 1/1655 useless extension candidates. Maximal degree in co-relation 5453. Up to 1516 conditions per place. 
[2024-06-20 20:02:07,521 INFO  L140   encePairwiseOnDemand]: 35/42 looper letters, 44 selfloop transitions, 8 changer transitions 0/63 dead transitions.
[2024-06-20 20:02:07,522 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 63 transitions, 412 flow
[2024-06-20 20:02:07,522 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-20 20:02:07,522 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-20 20:02:07,523 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 104 transitions.
[2024-06-20 20:02:07,523 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.49523809523809526
[2024-06-20 20:02:07,523 INFO  L175             Difference]: Start difference. First operand has 60 places, 52 transitions, 272 flow. Second operand 5 states and 104 transitions.
[2024-06-20 20:02:07,523 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 63 transitions, 412 flow
[2024-06-20 20:02:07,526 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 63 transitions, 366 flow, removed 2 selfloop flow, removed 7 redundant places.
[2024-06-20 20:02:07,527 INFO  L231             Difference]: Finished difference. Result has 58 places, 55 transitions, 270 flow
[2024-06-20 20:02:07,527 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=270, PETRI_PLACES=58, PETRI_TRANSITIONS=55}
[2024-06-20 20:02:07,528 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 15 predicate places.
[2024-06-20 20:02:07,528 INFO  L495      AbstractCegarLoop]: Abstraction has has 58 places, 55 transitions, 270 flow
[2024-06-20 20:02:07,529 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 7 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:02:07,529 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:02:07,529 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:02:07,529 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-06-20 20:02:07,529 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:02:07,529 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:02:07,530 INFO  L85        PathProgramCache]: Analyzing trace with hash -132978206, now seen corresponding path program 1 times
[2024-06-20 20:02:07,530 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:02:07,530 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229944127]
[2024-06-20 20:02:07,530 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:02:07,530 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:02:07,554 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:02:17,240 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:02:17,240 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:02:17,241 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229944127]
[2024-06-20 20:02:17,241 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229944127] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:02:17,241 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:02:17,241 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 20:02:17,241 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980196760]
[2024-06-20 20:02:17,242 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:02:17,242 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 20:02:17,244 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:02:17,244 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 20:02:17,245 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-20 20:02:17,340 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 42
[2024-06-20 20:02:17,341 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 55 transitions, 270 flow. Second operand  has 8 states, 8 states have (on average 13.375) internal successors, (107), 8 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:02:17,341 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:02:17,341 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 42
[2024-06-20 20:02:17,341 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:02:18,263 INFO  L124   PetriNetUnfolderBase]: 1116/1777 cut-off events.
[2024-06-20 20:02:18,263 INFO  L125   PetriNetUnfolderBase]: For 5695/5695 co-relation queries the response was YES.
[2024-06-20 20:02:18,266 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6151 conditions, 1777 events. 1116/1777 cut-off events. For 5695/5695 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 8959 event pairs, 444 based on Foata normal form. 4/1779 useless extension candidates. Maximal degree in co-relation 6129. Up to 1609 conditions per place. 
[2024-06-20 20:02:18,273 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 54 selfloop transitions, 16 changer transitions 0/77 dead transitions.
[2024-06-20 20:02:18,273 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 77 transitions, 480 flow
[2024-06-20 20:02:18,278 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-20 20:02:18,278 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-20 20:02:18,279 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 129 transitions.
[2024-06-20 20:02:18,279 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5119047619047619
[2024-06-20 20:02:18,280 INFO  L175             Difference]: Start difference. First operand has 58 places, 55 transitions, 270 flow. Second operand 6 states and 129 transitions.
[2024-06-20 20:02:18,280 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 77 transitions, 480 flow
[2024-06-20 20:02:18,284 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 77 transitions, 458 flow, removed 5 selfloop flow, removed 3 redundant places.
[2024-06-20 20:02:18,285 INFO  L231             Difference]: Finished difference. Result has 61 places, 58 transitions, 320 flow
[2024-06-20 20:02:18,285 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=320, PETRI_PLACES=61, PETRI_TRANSITIONS=58}
[2024-06-20 20:02:18,286 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 18 predicate places.
[2024-06-20 20:02:18,286 INFO  L495      AbstractCegarLoop]: Abstraction has has 61 places, 58 transitions, 320 flow
[2024-06-20 20:02:18,287 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 13.375) internal successors, (107), 8 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:02:18,287 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:02:18,287 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:02:18,287 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-06-20 20:02:18,287 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-20 20:02:18,287 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:02:18,288 INFO  L85        PathProgramCache]: Analyzing trace with hash -137442206, now seen corresponding path program 2 times
[2024-06-20 20:02:18,288 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:02:18,288 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332821938]
[2024-06-20 20:02:18,288 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:02:18,288 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:02:18,312 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:02:27,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-20 20:02:27,956 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:02:27,956 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332821938]
[2024-06-20 20:02:27,956 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332821938] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:02:27,956 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:02:27,956 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 20:02:27,956 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93084457]
[2024-06-20 20:02:27,957 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:02:27,957 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 20:02:27,957 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:02:27,957 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 20:02:27,957 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2024-06-20 20:02:28,098 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 42
[2024-06-20 20:02:28,099 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 58 transitions, 320 flow. Second operand  has 8 states, 8 states have (on average 13.375) internal successors, (107), 8 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:02:28,099 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:02:28,099 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 42
[2024-06-20 20:02:28,099 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:02:29,010 INFO  L124   PetriNetUnfolderBase]: 1138/1815 cut-off events.
[2024-06-20 20:02:29,010 INFO  L125   PetriNetUnfolderBase]: For 7129/7129 co-relation queries the response was YES.
[2024-06-20 20:02:29,014 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6772 conditions, 1815 events. 1138/1815 cut-off events. For 7129/7129 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 9172 event pairs, 396 based on Foata normal form. 4/1817 useless extension candidates. Maximal degree in co-relation 6749. Up to 1548 conditions per place. 
[2024-06-20 20:02:29,025 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 62 selfloop transitions, 27 changer transitions 0/96 dead transitions.
[2024-06-20 20:02:29,026 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 96 transitions, 662 flow
[2024-06-20 20:02:29,027 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 20:02:29,027 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 20:02:29,028 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 173 transitions.
[2024-06-20 20:02:29,029 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5148809523809523
[2024-06-20 20:02:29,029 INFO  L175             Difference]: Start difference. First operand has 61 places, 58 transitions, 320 flow. Second operand 8 states and 173 transitions.
[2024-06-20 20:02:29,029 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 96 transitions, 662 flow
[2024-06-20 20:02:29,047 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 96 transitions, 614 flow, removed 10 selfloop flow, removed 5 redundant places.
[2024-06-20 20:02:29,049 INFO  L231             Difference]: Finished difference. Result has 64 places, 64 transitions, 400 flow
[2024-06-20 20:02:29,049 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=400, PETRI_PLACES=64, PETRI_TRANSITIONS=64}
[2024-06-20 20:02:29,050 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 21 predicate places.
[2024-06-20 20:02:29,050 INFO  L495      AbstractCegarLoop]: Abstraction has has 64 places, 64 transitions, 400 flow
[2024-06-20 20:02:29,050 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 13.375) internal successors, (107), 8 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:02:29,050 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:02:29,050 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:02:29,050 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-06-20 20:02:29,051 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-20 20:02:29,051 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:02:29,051 INFO  L85        PathProgramCache]: Analyzing trace with hash 1978488768, now seen corresponding path program 3 times
[2024-06-20 20:02:29,051 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:02:29,052 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885813615]
[2024-06-20 20:02:29,052 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:02:29,052 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:02:29,088 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:02:38,549 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:02:38,549 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:02:38,549 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885813615]
[2024-06-20 20:02:38,550 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885813615] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:02:38,550 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:02:38,550 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 20:02:38,550 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738215692]
[2024-06-20 20:02:38,550 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:02:38,550 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 20:02:38,551 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:02:38,551 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 20:02:38,551 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2024-06-20 20:02:38,688 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 42
[2024-06-20 20:02:38,688 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 64 transitions, 400 flow. Second operand  has 8 states, 8 states have (on average 13.375) internal successors, (107), 8 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:02:38,688 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:02:38,688 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 42
[2024-06-20 20:02:38,689 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:02:39,411 INFO  L124   PetriNetUnfolderBase]: 1128/1801 cut-off events.
[2024-06-20 20:02:39,412 INFO  L125   PetriNetUnfolderBase]: For 7877/7877 co-relation queries the response was YES.
[2024-06-20 20:02:39,415 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6953 conditions, 1801 events. 1128/1801 cut-off events. For 7877/7877 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 9054 event pairs, 401 based on Foata normal form. 4/1803 useless extension candidates. Maximal degree in co-relation 6930. Up to 1540 conditions per place. 
[2024-06-20 20:02:39,421 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 59 selfloop transitions, 27 changer transitions 0/93 dead transitions.
[2024-06-20 20:02:39,421 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 93 transitions, 644 flow
[2024-06-20 20:02:39,422 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 20:02:39,422 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 20:02:39,422 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 170 transitions.
[2024-06-20 20:02:39,423 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5059523809523809
[2024-06-20 20:02:39,423 INFO  L175             Difference]: Start difference. First operand has 64 places, 64 transitions, 400 flow. Second operand 8 states and 170 transitions.
[2024-06-20 20:02:39,423 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 93 transitions, 644 flow
[2024-06-20 20:02:39,428 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 93 transitions, 590 flow, removed 18 selfloop flow, removed 4 redundant places.
[2024-06-20 20:02:39,429 INFO  L231             Difference]: Finished difference. Result has 68 places, 64 transitions, 408 flow
[2024-06-20 20:02:39,429 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=346, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=408, PETRI_PLACES=68, PETRI_TRANSITIONS=64}
[2024-06-20 20:02:39,430 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 25 predicate places.
[2024-06-20 20:02:39,430 INFO  L495      AbstractCegarLoop]: Abstraction has has 68 places, 64 transitions, 408 flow
[2024-06-20 20:02:39,430 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 13.375) internal successors, (107), 8 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:02:39,430 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:02:39,430 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:02:39,431 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-06-20 20:02:39,431 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:02:39,431 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:02:39,431 INFO  L85        PathProgramCache]: Analyzing trace with hash 1987077504, now seen corresponding path program 1 times
[2024-06-20 20:02:39,431 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:02:39,431 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785773321]
[2024-06-20 20:02:39,432 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:02:39,432 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:02:39,478 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:02:47,035 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:02:47,035 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:02:47,035 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785773321]
[2024-06-20 20:02:47,035 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785773321] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:02:47,035 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:02:47,035 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 20:02:47,035 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871626187]
[2024-06-20 20:02:47,035 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:02:47,036 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 20:02:47,036 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:02:47,036 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 20:02:47,036 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2024-06-20 20:02:47,184 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 42
[2024-06-20 20:02:47,185 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 64 transitions, 408 flow. Second operand  has 8 states, 8 states have (on average 13.375) internal successors, (107), 8 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:02:47,185 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:02:47,185 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 42
[2024-06-20 20:02:47,185 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:02:47,957 INFO  L124   PetriNetUnfolderBase]: 1120/1789 cut-off events.
[2024-06-20 20:02:47,958 INFO  L125   PetriNetUnfolderBase]: For 9080/9080 co-relation queries the response was YES.
[2024-06-20 20:02:47,961 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7073 conditions, 1789 events. 1120/1789 cut-off events. For 9080/9080 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 9005 event pairs, 408 based on Foata normal form. 4/1791 useless extension candidates. Maximal degree in co-relation 7048. Up to 1645 conditions per place. 
[2024-06-20 20:02:47,967 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 69 selfloop transitions, 13 changer transitions 0/89 dead transitions.
[2024-06-20 20:02:47,967 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 89 transitions, 665 flow
[2024-06-20 20:02:47,969 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 20:02:47,969 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 20:02:47,970 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 142 transitions.
[2024-06-20 20:02:47,970 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.48299319727891155
[2024-06-20 20:02:47,970 INFO  L175             Difference]: Start difference. First operand has 68 places, 64 transitions, 408 flow. Second operand 7 states and 142 transitions.
[2024-06-20 20:02:47,970 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 89 transitions, 665 flow
[2024-06-20 20:02:47,975 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 89 transitions, 590 flow, removed 4 selfloop flow, removed 7 redundant places.
[2024-06-20 20:02:47,976 INFO  L231             Difference]: Finished difference. Result has 69 places, 69 transitions, 419 flow
[2024-06-20 20:02:47,976 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=419, PETRI_PLACES=69, PETRI_TRANSITIONS=69}
[2024-06-20 20:02:47,977 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 26 predicate places.
[2024-06-20 20:02:47,977 INFO  L495      AbstractCegarLoop]: Abstraction has has 69 places, 69 transitions, 419 flow
[2024-06-20 20:02:47,977 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 13.375) internal successors, (107), 8 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:02:47,977 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:02:47,977 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:02:47,977 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-06-20 20:02:47,977 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-20 20:02:47,978 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:02:47,978 INFO  L85        PathProgramCache]: Analyzing trace with hash -494607579, now seen corresponding path program 1 times
[2024-06-20 20:02:47,978 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:02:47,978 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615728013]
[2024-06-20 20:02:47,978 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:02:47,978 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:02:48,011 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:02:56,862 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:02:56,863 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:02:56,863 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615728013]
[2024-06-20 20:02:56,863 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615728013] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:02:56,863 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:02:56,863 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 20:02:56,863 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197912109]
[2024-06-20 20:02:56,863 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:02:56,863 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 20:02:56,863 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:02:56,864 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 20:02:56,864 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-20 20:02:56,997 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 42
[2024-06-20 20:02:56,998 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 69 transitions, 419 flow. Second operand  has 8 states, 8 states have (on average 14.625) internal successors, (117), 8 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:02:56,998 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:02:56,998 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 42
[2024-06-20 20:02:56,998 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:02:57,580 INFO  L124   PetriNetUnfolderBase]: 1027/1665 cut-off events.
[2024-06-20 20:02:57,581 INFO  L125   PetriNetUnfolderBase]: For 10499/10514 co-relation queries the response was YES.
[2024-06-20 20:02:57,594 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6949 conditions, 1665 events. 1027/1665 cut-off events. For 10499/10514 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 8528 event pairs, 411 based on Foata normal form. 14/1661 useless extension candidates. Maximal degree in co-relation 6922. Up to 1493 conditions per place. 
[2024-06-20 20:02:57,601 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 57 selfloop transitions, 19 changer transitions 0/87 dead transitions.
[2024-06-20 20:02:57,601 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 87 transitions, 669 flow
[2024-06-20 20:02:57,601 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-20 20:02:57,601 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-20 20:02:57,602 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 126 transitions.
[2024-06-20 20:02:57,602 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5
[2024-06-20 20:02:57,602 INFO  L175             Difference]: Start difference. First operand has 69 places, 69 transitions, 419 flow. Second operand 6 states and 126 transitions.
[2024-06-20 20:02:57,602 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 87 transitions, 669 flow
[2024-06-20 20:02:57,608 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 87 transitions, 628 flow, removed 10 selfloop flow, removed 4 redundant places.
[2024-06-20 20:02:57,609 INFO  L231             Difference]: Finished difference. Result has 72 places, 77 transitions, 498 flow
[2024-06-20 20:02:57,609 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=378, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=498, PETRI_PLACES=72, PETRI_TRANSITIONS=77}
[2024-06-20 20:02:57,610 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 29 predicate places.
[2024-06-20 20:02:57,610 INFO  L495      AbstractCegarLoop]: Abstraction has has 72 places, 77 transitions, 498 flow
[2024-06-20 20:02:57,610 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 14.625) internal successors, (117), 8 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:02:57,610 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:02:57,610 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:02:57,610 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-06-20 20:02:57,611 INFO  L420      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:02:57,611 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:02:57,611 INFO  L85        PathProgramCache]: Analyzing trace with hash -760619170, now seen corresponding path program 1 times
[2024-06-20 20:02:57,611 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:02:57,611 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718855454]
[2024-06-20 20:02:57,611 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:02:57,612 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:02:57,646 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:03:06,267 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:03:06,270 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:03:06,270 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718855454]
[2024-06-20 20:03:06,270 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718855454] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:03:06,270 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:03:06,270 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 20:03:06,270 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392849740]
[2024-06-20 20:03:06,270 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:03:06,271 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 20:03:06,271 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:03:06,271 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 20:03:06,272 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-20 20:03:06,404 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 42
[2024-06-20 20:03:06,404 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 77 transitions, 498 flow. Second operand  has 8 states, 8 states have (on average 14.625) internal successors, (117), 8 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:03:06,404 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:03:06,404 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 42
[2024-06-20 20:03:06,404 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:03:07,041 INFO  L124   PetriNetUnfolderBase]: 1056/1725 cut-off events.
[2024-06-20 20:03:07,042 INFO  L125   PetriNetUnfolderBase]: For 12668/12683 co-relation queries the response was YES.
[2024-06-20 20:03:07,046 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7688 conditions, 1725 events. 1056/1725 cut-off events. For 12668/12683 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 8859 event pairs, 410 based on Foata normal form. 13/1723 useless extension candidates. Maximal degree in co-relation 7659. Up to 1547 conditions per place. 
[2024-06-20 20:03:07,053 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 74 selfloop transitions, 20 changer transitions 0/105 dead transitions.
[2024-06-20 20:03:07,053 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 105 transitions, 813 flow
[2024-06-20 20:03:07,054 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 20:03:07,054 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 20:03:07,054 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 148 transitions.
[2024-06-20 20:03:07,055 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5034013605442177
[2024-06-20 20:03:07,055 INFO  L175             Difference]: Start difference. First operand has 72 places, 77 transitions, 498 flow. Second operand 7 states and 148 transitions.
[2024-06-20 20:03:07,055 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 105 transitions, 813 flow
[2024-06-20 20:03:07,062 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 105 transitions, 772 flow, removed 13 selfloop flow, removed 2 redundant places.
[2024-06-20 20:03:07,064 INFO  L231             Difference]: Finished difference. Result has 78 places, 87 transitions, 601 flow
[2024-06-20 20:03:07,064 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=464, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=601, PETRI_PLACES=78, PETRI_TRANSITIONS=87}
[2024-06-20 20:03:07,064 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 35 predicate places.
[2024-06-20 20:03:07,065 INFO  L495      AbstractCegarLoop]: Abstraction has has 78 places, 87 transitions, 601 flow
[2024-06-20 20:03:07,065 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 14.625) internal successors, (117), 8 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:03:07,065 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:03:07,065 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:03:07,065 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2024-06-20 20:03:07,065 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-20 20:03:07,065 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:03:07,066 INFO  L85        PathProgramCache]: Analyzing trace with hash 1418102970, now seen corresponding path program 2 times
[2024-06-20 20:03:07,066 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:03:07,066 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694653149]
[2024-06-20 20:03:07,066 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:03:07,066 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:03:07,108 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:03:14,790 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:03:14,790 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:03:14,790 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694653149]
[2024-06-20 20:03:14,790 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694653149] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:03:14,791 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:03:14,791 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-20 20:03:14,791 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595459707]
[2024-06-20 20:03:14,791 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:03:14,791 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-20 20:03:14,791 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:03:14,792 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-20 20:03:14,792 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-06-20 20:03:14,909 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 42
[2024-06-20 20:03:14,909 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 87 transitions, 601 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-20 20:03:14,909 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:03:14,910 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 42
[2024-06-20 20:03:14,910 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:03:15,542 INFO  L124   PetriNetUnfolderBase]: 1058/1733 cut-off events.
[2024-06-20 20:03:15,542 INFO  L125   PetriNetUnfolderBase]: For 14307/14347 co-relation queries the response was YES.
[2024-06-20 20:03:15,546 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7938 conditions, 1733 events. 1058/1733 cut-off events. For 14307/14347 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 8924 event pairs, 408 based on Foata normal form. 13/1730 useless extension candidates. Maximal degree in co-relation 7906. Up to 1543 conditions per place. 
[2024-06-20 20:03:15,551 INFO  L140   encePairwiseOnDemand]: 34/42 looper letters, 72 selfloop transitions, 21 changer transitions 0/104 dead transitions.
[2024-06-20 20:03:15,551 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 104 transitions, 865 flow
[2024-06-20 20:03:15,568 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-20 20:03:15,568 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-20 20:03:15,569 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 127 transitions.
[2024-06-20 20:03:15,569 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.503968253968254
[2024-06-20 20:03:15,569 INFO  L175             Difference]: Start difference. First operand has 78 places, 87 transitions, 601 flow. Second operand 6 states and 127 transitions.
[2024-06-20 20:03:15,569 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 104 transitions, 865 flow
[2024-06-20 20:03:15,577 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 104 transitions, 831 flow, removed 7 selfloop flow, removed 3 redundant places.
[2024-06-20 20:03:15,578 INFO  L231             Difference]: Finished difference. Result has 81 places, 90 transitions, 663 flow
[2024-06-20 20:03:15,579 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=567, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=663, PETRI_PLACES=81, PETRI_TRANSITIONS=90}
[2024-06-20 20:03:15,579 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 38 predicate places.
[2024-06-20 20:03:15,579 INFO  L495      AbstractCegarLoop]: Abstraction has has 81 places, 90 transitions, 663 flow
[2024-06-20 20:03:15,579 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-20 20:03:15,580 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:03:15,580 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:03:15,580 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2024-06-20 20:03:15,580 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-20 20:03:15,580 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:03:15,580 INFO  L85        PathProgramCache]: Analyzing trace with hash 1847019900, now seen corresponding path program 3 times
[2024-06-20 20:03:15,580 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:03:15,581 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671068499]
[2024-06-20 20:03:15,581 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:03:15,581 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:03:15,620 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:03:23,768 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:03:23,769 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:03:23,769 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671068499]
[2024-06-20 20:03:23,769 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671068499] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:03:23,769 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:03:23,769 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-20 20:03:23,769 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919229415]
[2024-06-20 20:03:23,769 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:03:23,770 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-20 20:03:23,770 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:03:23,770 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-20 20:03:23,770 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2024-06-20 20:03:23,884 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 42
[2024-06-20 20:03:23,884 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 90 transitions, 663 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-20 20:03:23,885 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:03:23,885 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 42
[2024-06-20 20:03:23,885 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:03:24,478 INFO  L124   PetriNetUnfolderBase]: 1050/1709 cut-off events.
[2024-06-20 20:03:24,478 INFO  L125   PetriNetUnfolderBase]: For 16048/16068 co-relation queries the response was YES.
[2024-06-20 20:03:24,483 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7993 conditions, 1709 events. 1050/1709 cut-off events. For 16048/16068 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 8734 event pairs, 413 based on Foata normal form. 13/1699 useless extension candidates. Maximal degree in co-relation 7960. Up to 1508 conditions per place. 
[2024-06-20 20:03:24,508 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 60 selfloop transitions, 28 changer transitions 0/99 dead transitions.
[2024-06-20 20:03:24,520 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 99 transitions, 865 flow
[2024-06-20 20:03:24,521 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-20 20:03:24,521 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-20 20:03:24,521 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 125 transitions.
[2024-06-20 20:03:24,522 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.49603174603174605
[2024-06-20 20:03:24,522 INFO  L175             Difference]: Start difference. First operand has 81 places, 90 transitions, 663 flow. Second operand 6 states and 125 transitions.
[2024-06-20 20:03:24,522 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 99 transitions, 865 flow
[2024-06-20 20:03:24,532 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 99 transitions, 801 flow, removed 16 selfloop flow, removed 4 redundant places.
[2024-06-20 20:03:24,534 INFO  L231             Difference]: Finished difference. Result has 83 places, 90 transitions, 663 flow
[2024-06-20 20:03:24,534 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=599, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=663, PETRI_PLACES=83, PETRI_TRANSITIONS=90}
[2024-06-20 20:03:24,534 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 40 predicate places.
[2024-06-20 20:03:24,535 INFO  L495      AbstractCegarLoop]: Abstraction has has 83 places, 90 transitions, 663 flow
[2024-06-20 20:03:24,535 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-20 20:03:24,535 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:03:24,535 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:03:24,535 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2024-06-20 20:03:24,535 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-20 20:03:24,536 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:03:24,536 INFO  L85        PathProgramCache]: Analyzing trace with hash 1424776154, now seen corresponding path program 1 times
[2024-06-20 20:03:24,536 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:03:24,536 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468488360]
[2024-06-20 20:03:24,536 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:03:24,536 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:03:24,576 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:03:33,226 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:03:33,227 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:03:33,227 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468488360]
[2024-06-20 20:03:33,227 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468488360] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:03:33,227 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:03:33,227 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 20:03:33,227 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313005345]
[2024-06-20 20:03:33,227 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:03:33,228 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 20:03:33,228 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:03:33,228 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 20:03:33,228 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-20 20:03:33,328 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 42
[2024-06-20 20:03:33,329 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 90 transitions, 663 flow. Second operand  has 8 states, 8 states have (on average 13.625) internal successors, (109), 8 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:03:33,329 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:03:33,329 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 42
[2024-06-20 20:03:33,329 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:03:33,979 INFO  L124   PetriNetUnfolderBase]: 1169/1877 cut-off events.
[2024-06-20 20:03:33,979 INFO  L125   PetriNetUnfolderBase]: For 15727/15729 co-relation queries the response was YES.
[2024-06-20 20:03:33,984 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 8563 conditions, 1877 events. 1169/1877 cut-off events. For 15727/15729 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 9580 event pairs, 425 based on Foata normal form. 2/1877 useless extension candidates. Maximal degree in co-relation 8529. Up to 1738 conditions per place. 
[2024-06-20 20:03:33,990 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 88 selfloop transitions, 11 changer transitions 0/106 dead transitions.
[2024-06-20 20:03:33,990 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 106 transitions, 929 flow
[2024-06-20 20:03:33,991 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-20 20:03:33,991 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-20 20:03:33,991 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 120 transitions.
[2024-06-20 20:03:33,992 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.47619047619047616
[2024-06-20 20:03:33,992 INFO  L175             Difference]: Start difference. First operand has 83 places, 90 transitions, 663 flow. Second operand 6 states and 120 transitions.
[2024-06-20 20:03:33,992 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 106 transitions, 929 flow
[2024-06-20 20:03:34,006 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 106 transitions, 851 flow, removed 5 selfloop flow, removed 5 redundant places.
[2024-06-20 20:03:34,007 INFO  L231             Difference]: Finished difference. Result has 84 places, 93 transitions, 647 flow
[2024-06-20 20:03:34,007 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=585, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=647, PETRI_PLACES=84, PETRI_TRANSITIONS=93}
[2024-06-20 20:03:34,007 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 41 predicate places.
[2024-06-20 20:03:34,008 INFO  L495      AbstractCegarLoop]: Abstraction has has 84 places, 93 transitions, 647 flow
[2024-06-20 20:03:34,009 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 13.625) internal successors, (109), 8 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:03:34,009 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:03:34,009 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:03:34,009 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2024-06-20 20:03:34,009 INFO  L420      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:03:34,009 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:03:34,009 INFO  L85        PathProgramCache]: Analyzing trace with hash 1847026844, now seen corresponding path program 2 times
[2024-06-20 20:03:34,010 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:03:34,010 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806815691]
[2024-06-20 20:03:34,010 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:03:34,010 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:03:34,046 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:03:43,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-20 20:03:43,030 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:03:43,030 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806815691]
[2024-06-20 20:03:43,030 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806815691] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:03:43,030 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:03:43,030 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 20:03:43,030 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52629356]
[2024-06-20 20:03:43,031 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:03:43,031 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 20:03:43,031 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:03:43,031 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 20:03:43,032 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-20 20:03:43,135 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 42
[2024-06-20 20:03:43,136 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 93 transitions, 647 flow. Second operand  has 8 states, 8 states have (on average 13.625) internal successors, (109), 8 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:03:43,136 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:03:43,136 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 42
[2024-06-20 20:03:43,136 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:03:43,939 INFO  L124   PetriNetUnfolderBase]: 1171/1882 cut-off events.
[2024-06-20 20:03:43,939 INFO  L125   PetriNetUnfolderBase]: For 17820/17822 co-relation queries the response was YES.
[2024-06-20 20:03:43,943 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 8841 conditions, 1882 events. 1171/1882 cut-off events. For 17820/17822 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 9626 event pairs, 425 based on Foata normal form. 2/1882 useless extension candidates. Maximal degree in co-relation 8806. Up to 1732 conditions per place. 
[2024-06-20 20:03:43,948 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 87 selfloop transitions, 17 changer transitions 0/111 dead transitions.
[2024-06-20 20:03:43,948 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 111 transitions, 935 flow
[2024-06-20 20:03:43,949 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 20:03:43,949 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 20:03:43,949 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 138 transitions.
[2024-06-20 20:03:43,950 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46938775510204084
[2024-06-20 20:03:43,950 INFO  L175             Difference]: Start difference. First operand has 84 places, 93 transitions, 647 flow. Second operand 7 states and 138 transitions.
[2024-06-20 20:03:43,950 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 111 transitions, 935 flow
[2024-06-20 20:03:43,961 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 111 transitions, 895 flow, removed 11 selfloop flow, removed 4 redundant places.
[2024-06-20 20:03:43,962 INFO  L231             Difference]: Finished difference. Result has 87 places, 96 transitions, 687 flow
[2024-06-20 20:03:43,962 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=607, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=687, PETRI_PLACES=87, PETRI_TRANSITIONS=96}
[2024-06-20 20:03:43,963 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 44 predicate places.
[2024-06-20 20:03:43,963 INFO  L495      AbstractCegarLoop]: Abstraction has has 87 places, 96 transitions, 687 flow
[2024-06-20 20:03:43,963 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 13.625) internal successors, (109), 8 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:03:43,963 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:03:43,963 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:03:43,963 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2024-06-20 20:03:43,963 INFO  L420      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:03:43,964 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:03:43,964 INFO  L85        PathProgramCache]: Analyzing trace with hash 1847035772, now seen corresponding path program 1 times
[2024-06-20 20:03:43,964 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:03:43,964 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914218061]
[2024-06-20 20:03:43,964 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:03:43,964 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:03:44,006 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:03:53,937 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:03:53,938 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:03:53,938 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914218061]
[2024-06-20 20:03:53,938 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914218061] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:03:53,938 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:03:53,938 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 20:03:53,938 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358766536]
[2024-06-20 20:03:53,938 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:03:53,939 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 20:03:53,939 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:03:53,939 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 20:03:53,939 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-20 20:03:54,088 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 42
[2024-06-20 20:03:54,088 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 96 transitions, 687 flow. Second operand  has 9 states, 9 states have (on average 14.555555555555555) internal successors, (131), 9 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:03:54,088 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:03:54,088 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 42
[2024-06-20 20:03:54,089 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:03:54,757 INFO  L124   PetriNetUnfolderBase]: 1057/1727 cut-off events.
[2024-06-20 20:03:54,757 INFO  L125   PetriNetUnfolderBase]: For 19420/19450 co-relation queries the response was YES.
[2024-06-20 20:03:54,762 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 8646 conditions, 1727 events. 1057/1727 cut-off events. For 19420/19450 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 8904 event pairs, 409 based on Foata normal form. 18/1721 useless extension candidates. Maximal degree in co-relation 8610. Up to 1516 conditions per place. 
[2024-06-20 20:03:54,766 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 65 selfloop transitions, 34 changer transitions 0/110 dead transitions.
[2024-06-20 20:03:54,766 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 110 transitions, 953 flow
[2024-06-20 20:03:54,767 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 20:03:54,767 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 20:03:54,767 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 143 transitions.
[2024-06-20 20:03:54,767 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.48639455782312924
[2024-06-20 20:03:54,768 INFO  L175             Difference]: Start difference. First operand has 87 places, 96 transitions, 687 flow. Second operand 7 states and 143 transitions.
[2024-06-20 20:03:54,768 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 110 transitions, 953 flow
[2024-06-20 20:03:54,778 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 110 transitions, 895 flow, removed 14 selfloop flow, removed 5 redundant places.
[2024-06-20 20:03:54,780 INFO  L231             Difference]: Finished difference. Result has 89 places, 100 transitions, 752 flow
[2024-06-20 20:03:54,780 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=629, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=752, PETRI_PLACES=89, PETRI_TRANSITIONS=100}
[2024-06-20 20:03:54,780 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 46 predicate places.
[2024-06-20 20:03:54,780 INFO  L495      AbstractCegarLoop]: Abstraction has has 89 places, 100 transitions, 752 flow
[2024-06-20 20:03:54,781 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 14.555555555555555) internal successors, (131), 9 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:03:54,781 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:03:54,781 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:03:54,781 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2024-06-20 20:03:54,781 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-20 20:03:54,781 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:03:54,782 INFO  L85        PathProgramCache]: Analyzing trace with hash 1239944095, now seen corresponding path program 1 times
[2024-06-20 20:03:54,782 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:03:54,782 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749806546]
[2024-06-20 20:03:54,782 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:03:54,782 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:03:54,804 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:04:05,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-20 20:04:05,552 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:04:05,552 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749806546]
[2024-06-20 20:04:05,553 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749806546] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:04:05,553 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:04:05,553 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 20:04:05,553 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975923599]
[2024-06-20 20:04:05,553 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:04:05,554 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 20:04:05,555 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:04:05,555 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 20:04:05,555 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-20 20:04:05,742 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 42
[2024-06-20 20:04:05,743 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 100 transitions, 752 flow. Second operand  has 9 states, 9 states have (on average 13.333333333333334) internal successors, (120), 9 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:04:05,743 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:04:05,743 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 42
[2024-06-20 20:04:05,743 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:04:06,777 INFO  L124   PetriNetUnfolderBase]: 1372/2227 cut-off events.
[2024-06-20 20:04:06,777 INFO  L125   PetriNetUnfolderBase]: For 26897/26899 co-relation queries the response was YES.
[2024-06-20 20:04:06,784 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 11332 conditions, 2227 events. 1372/2227 cut-off events. For 26897/26899 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 11955 event pairs, 347 based on Foata normal form. 16/2241 useless extension candidates. Maximal degree in co-relation 11295. Up to 1674 conditions per place. 
[2024-06-20 20:04:06,792 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 107 selfloop transitions, 26 changer transitions 0/140 dead transitions.
[2024-06-20 20:04:06,792 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 140 transitions, 1248 flow
[2024-06-20 20:04:06,792 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 20:04:06,793 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 20:04:06,793 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 176 transitions.
[2024-06-20 20:04:06,793 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5238095238095238
[2024-06-20 20:04:06,793 INFO  L175             Difference]: Start difference. First operand has 89 places, 100 transitions, 752 flow. Second operand 8 states and 176 transitions.
[2024-06-20 20:04:06,794 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 140 transitions, 1248 flow
[2024-06-20 20:04:06,809 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 140 transitions, 1153 flow, removed 16 selfloop flow, removed 5 redundant places.
[2024-06-20 20:04:06,811 INFO  L231             Difference]: Finished difference. Result has 93 places, 103 transitions, 768 flow
[2024-06-20 20:04:06,811 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=657, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=768, PETRI_PLACES=93, PETRI_TRANSITIONS=103}
[2024-06-20 20:04:06,812 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 50 predicate places.
[2024-06-20 20:04:06,812 INFO  L495      AbstractCegarLoop]: Abstraction has has 93 places, 103 transitions, 768 flow
[2024-06-20 20:04:06,812 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 13.333333333333334) internal successors, (120), 9 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:04:06,812 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:04:06,812 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:04:06,812 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2024-06-20 20:04:06,812 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-20 20:04:06,813 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:04:06,813 INFO  L85        PathProgramCache]: Analyzing trace with hash 946784799, now seen corresponding path program 2 times
[2024-06-20 20:04:06,813 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:04:06,813 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007313401]
[2024-06-20 20:04:06,813 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:04:06,813 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:04:06,838 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:04:17,420 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:04:17,420 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:04:17,420 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007313401]
[2024-06-20 20:04:17,420 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007313401] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:04:17,420 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:04:17,420 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 20:04:17,420 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175893979]
[2024-06-20 20:04:17,420 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:04:17,421 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 20:04:17,421 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:04:17,421 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 20:04:17,421 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-20 20:04:17,579 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 42
[2024-06-20 20:04:17,579 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 103 transitions, 768 flow. Second operand  has 9 states, 9 states have (on average 13.333333333333334) internal successors, (120), 9 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:04:17,579 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:04:17,579 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 42
[2024-06-20 20:04:17,579 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:04:18,690 INFO  L124   PetriNetUnfolderBase]: 1328/2160 cut-off events.
[2024-06-20 20:04:18,690 INFO  L125   PetriNetUnfolderBase]: For 28173/28175 co-relation queries the response was YES.
[2024-06-20 20:04:18,697 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 11075 conditions, 2160 events. 1328/2160 cut-off events. For 28173/28175 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 11487 event pairs, 434 based on Foata normal form. 24/2182 useless extension candidates. Maximal degree in co-relation 11036. Up to 1786 conditions per place. 
[2024-06-20 20:04:18,703 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 100 selfloop transitions, 23 changer transitions 0/130 dead transitions.
[2024-06-20 20:04:18,703 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 130 transitions, 1116 flow
[2024-06-20 20:04:18,705 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 20:04:18,705 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 20:04:18,707 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 152 transitions.
[2024-06-20 20:04:18,707 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5170068027210885
[2024-06-20 20:04:18,707 INFO  L175             Difference]: Start difference. First operand has 93 places, 103 transitions, 768 flow. Second operand 7 states and 152 transitions.
[2024-06-20 20:04:18,707 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 130 transitions, 1116 flow
[2024-06-20 20:04:18,723 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 130 transitions, 1077 flow, removed 6 selfloop flow, removed 4 redundant places.
[2024-06-20 20:04:18,724 INFO  L231             Difference]: Finished difference. Result has 96 places, 103 transitions, 784 flow
[2024-06-20 20:04:18,724 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=729, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=784, PETRI_PLACES=96, PETRI_TRANSITIONS=103}
[2024-06-20 20:04:18,725 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 53 predicate places.
[2024-06-20 20:04:18,725 INFO  L495      AbstractCegarLoop]: Abstraction has has 96 places, 103 transitions, 784 flow
[2024-06-20 20:04:18,725 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 13.333333333333334) internal successors, (120), 9 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:04:18,725 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:04:18,725 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:04:18,725 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2024-06-20 20:04:18,726 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-20 20:04:18,726 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:04:18,726 INFO  L85        PathProgramCache]: Analyzing trace with hash -1663148031, now seen corresponding path program 3 times
[2024-06-20 20:04:18,726 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:04:18,726 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235232718]
[2024-06-20 20:04:18,726 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:04:18,726 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:04:18,748 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:04:29,141 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:04:29,141 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:04:29,141 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235232718]
[2024-06-20 20:04:29,141 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235232718] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:04:29,142 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:04:29,142 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 20:04:29,142 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774500881]
[2024-06-20 20:04:29,142 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:04:29,143 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 20:04:29,144 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:04:29,145 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 20:04:29,145 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-06-20 20:04:29,286 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 42
[2024-06-20 20:04:29,286 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 103 transitions, 784 flow. Second operand  has 9 states, 9 states have (on average 13.333333333333334) internal successors, (120), 9 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:04:29,286 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:04:29,286 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 42
[2024-06-20 20:04:29,287 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:04:30,307 INFO  L124   PetriNetUnfolderBase]: 1403/2281 cut-off events.
[2024-06-20 20:04:30,313 INFO  L125   PetriNetUnfolderBase]: For 30833/30835 co-relation queries the response was YES.
[2024-06-20 20:04:30,320 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 11817 conditions, 2281 events. 1403/2281 cut-off events. For 30833/30835 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 12307 event pairs, 409 based on Foata normal form. 20/2299 useless extension candidates. Maximal degree in co-relation 11776. Up to 1842 conditions per place. 
[2024-06-20 20:04:30,326 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 99 selfloop transitions, 35 changer transitions 0/141 dead transitions.
[2024-06-20 20:04:30,326 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 141 transitions, 1206 flow
[2024-06-20 20:04:30,328 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 20:04:30,328 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 20:04:30,329 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 193 transitions.
[2024-06-20 20:04:30,329 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5105820105820106
[2024-06-20 20:04:30,329 INFO  L175             Difference]: Start difference. First operand has 96 places, 103 transitions, 784 flow. Second operand 9 states and 193 transitions.
[2024-06-20 20:04:30,329 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 141 transitions, 1206 flow
[2024-06-20 20:04:30,348 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 141 transitions, 1154 flow, removed 1 selfloop flow, removed 6 redundant places.
[2024-06-20 20:04:30,350 INFO  L231             Difference]: Finished difference. Result has 99 places, 104 transitions, 831 flow
[2024-06-20 20:04:30,350 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=732, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=831, PETRI_PLACES=99, PETRI_TRANSITIONS=104}
[2024-06-20 20:04:30,350 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 56 predicate places.
[2024-06-20 20:04:30,351 INFO  L495      AbstractCegarLoop]: Abstraction has has 99 places, 104 transitions, 831 flow
[2024-06-20 20:04:30,351 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 13.333333333333334) internal successors, (120), 9 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:04:30,351 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:04:30,351 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:04:30,351 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2024-06-20 20:04:30,351 INFO  L420      AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:04:30,352 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:04:30,352 INFO  L85        PathProgramCache]: Analyzing trace with hash -1342756321, now seen corresponding path program 4 times
[2024-06-20 20:04:30,352 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:04:30,352 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186175263]
[2024-06-20 20:04:30,352 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:04:30,352 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:04:30,374 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:04:40,477 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:04:40,478 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:04:40,478 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186175263]
[2024-06-20 20:04:40,478 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186175263] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:04:40,478 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:04:40,478 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 20:04:40,478 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793603745]
[2024-06-20 20:04:40,478 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:04:40,479 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 20:04:40,479 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:04:40,479 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 20:04:40,479 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-06-20 20:04:40,601 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 42
[2024-06-20 20:04:40,602 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 104 transitions, 831 flow. Second operand  has 9 states, 9 states have (on average 13.333333333333334) internal successors, (120), 9 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:04:40,602 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:04:40,602 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 42
[2024-06-20 20:04:40,602 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:04:41,599 INFO  L124   PetriNetUnfolderBase]: 1428/2328 cut-off events.
[2024-06-20 20:04:41,600 INFO  L125   PetriNetUnfolderBase]: For 33304/33306 co-relation queries the response was YES.
[2024-06-20 20:04:41,608 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 12119 conditions, 2328 events. 1428/2328 cut-off events. For 33304/33306 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 12585 event pairs, 415 based on Foata normal form. 20/2346 useless extension candidates. Maximal degree in co-relation 12077. Up to 1889 conditions per place. 
[2024-06-20 20:04:41,616 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 100 selfloop transitions, 35 changer transitions 0/142 dead transitions.
[2024-06-20 20:04:41,616 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 142 transitions, 1257 flow
[2024-06-20 20:04:41,618 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 20:04:41,618 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 20:04:41,618 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 192 transitions.
[2024-06-20 20:04:41,619 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5079365079365079
[2024-06-20 20:04:41,619 INFO  L175             Difference]: Start difference. First operand has 99 places, 104 transitions, 831 flow. Second operand 9 states and 192 transitions.
[2024-06-20 20:04:41,619 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 142 transitions, 1257 flow
[2024-06-20 20:04:41,644 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 142 transitions, 1182 flow, removed 4 selfloop flow, removed 7 redundant places.
[2024-06-20 20:04:41,646 INFO  L231             Difference]: Finished difference. Result has 101 places, 105 transitions, 857 flow
[2024-06-20 20:04:41,646 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=756, PETRI_DIFFERENCE_MINUEND_PLACES=92, 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=857, PETRI_PLACES=101, PETRI_TRANSITIONS=105}
[2024-06-20 20:04:41,647 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 58 predicate places.
[2024-06-20 20:04:41,647 INFO  L495      AbstractCegarLoop]: Abstraction has has 101 places, 105 transitions, 857 flow
[2024-06-20 20:04:41,647 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 13.333333333333334) internal successors, (120), 9 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:04:41,647 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:04:41,647 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:04:41,647 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2024-06-20 20:04:41,647 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-20 20:04:41,648 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:04:41,648 INFO  L85        PathProgramCache]: Analyzing trace with hash -792969063, now seen corresponding path program 1 times
[2024-06-20 20:04:41,648 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:04:41,648 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211963136]
[2024-06-20 20:04:41,648 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:04:41,648 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:04:41,732 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:04:49,984 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:04:49,985 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:04:49,985 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211963136]
[2024-06-20 20:04:49,985 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211963136] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:04:49,985 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:04:49,985 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 20:04:49,985 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618472848]
[2024-06-20 20:04:49,985 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:04:49,985 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 20:04:49,985 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:04:49,986 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 20:04:49,986 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-06-20 20:04:50,181 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 42
[2024-06-20 20:04:50,181 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 105 transitions, 857 flow. Second operand  has 9 states, 9 states have (on average 13.333333333333334) internal successors, (120), 9 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:04:50,181 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:04:50,181 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 42
[2024-06-20 20:04:50,182 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:04:51,227 INFO  L124   PetriNetUnfolderBase]: 1456/2380 cut-off events.
[2024-06-20 20:04:51,227 INFO  L125   PetriNetUnfolderBase]: For 33936/33936 co-relation queries the response was YES.
[2024-06-20 20:04:51,235 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 12448 conditions, 2380 events. 1456/2380 cut-off events. For 33936/33936 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 12939 event pairs, 429 based on Foata normal form. 4/2382 useless extension candidates. Maximal degree in co-relation 12405. Up to 2125 conditions per place. 
[2024-06-20 20:04:51,242 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 114 selfloop transitions, 27 changer transitions 0/148 dead transitions.
[2024-06-20 20:04:51,242 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 148 transitions, 1314 flow
[2024-06-20 20:04:51,244 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 20:04:51,244 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 20:04:51,244 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 205 transitions.
[2024-06-20 20:04:51,244 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4880952380952381
[2024-06-20 20:04:51,244 INFO  L175             Difference]: Start difference. First operand has 101 places, 105 transitions, 857 flow. Second operand 10 states and 205 transitions.
[2024-06-20 20:04:51,245 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 148 transitions, 1314 flow
[2024-06-20 20:04:51,266 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 148 transitions, 1231 flow, removed 5 selfloop flow, removed 7 redundant places.
[2024-06-20 20:04:51,268 INFO  L231             Difference]: Finished difference. Result has 105 places, 111 transitions, 906 flow
[2024-06-20 20:04:51,268 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=780, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=906, PETRI_PLACES=105, PETRI_TRANSITIONS=111}
[2024-06-20 20:04:51,269 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 62 predicate places.
[2024-06-20 20:04:51,269 INFO  L495      AbstractCegarLoop]: Abstraction has has 105 places, 111 transitions, 906 flow
[2024-06-20 20:04:51,269 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 13.333333333333334) internal successors, (120), 9 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:04:51,269 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:04:51,269 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:04:51,269 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2024-06-20 20:04:51,269 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-20 20:04:51,270 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:04:51,270 INFO  L85        PathProgramCache]: Analyzing trace with hash -1689395105, now seen corresponding path program 2 times
[2024-06-20 20:04:51,270 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:04:51,270 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400550149]
[2024-06-20 20:04:51,270 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:04:51,270 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:04:51,307 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:04:59,663 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:04:59,664 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:04:59,664 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400550149]
[2024-06-20 20:04:59,664 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400550149] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:04:59,664 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:04:59,664 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 20:04:59,664 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085565563]
[2024-06-20 20:04:59,664 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:04:59,665 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 20:04:59,665 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:04:59,665 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 20:04:59,665 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-20 20:04:59,839 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 42
[2024-06-20 20:04:59,839 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 111 transitions, 906 flow. Second operand  has 9 states, 9 states have (on average 13.333333333333334) internal successors, (120), 9 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:04:59,839 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:04:59,839 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 42
[2024-06-20 20:04:59,840 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:05:00,955 INFO  L124   PetriNetUnfolderBase]: 1473/2427 cut-off events.
[2024-06-20 20:05:00,955 INFO  L125   PetriNetUnfolderBase]: For 36698/36698 co-relation queries the response was YES.
[2024-06-20 20:05:00,964 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 12887 conditions, 2427 events. 1473/2427 cut-off events. For 36698/36698 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 13341 event pairs, 433 based on Foata normal form. 4/2429 useless extension candidates. Maximal degree in co-relation 12842. Up to 2152 conditions per place. 
[2024-06-20 20:05:00,972 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 118 selfloop transitions, 33 changer transitions 0/158 dead transitions.
[2024-06-20 20:05:00,972 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 158 transitions, 1412 flow
[2024-06-20 20:05:00,974 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-20 20:05:00,974 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-20 20:05:00,974 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 221 transitions.
[2024-06-20 20:05:00,975 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.47835497835497837
[2024-06-20 20:05:00,975 INFO  L175             Difference]: Start difference. First operand has 105 places, 111 transitions, 906 flow. Second operand 11 states and 221 transitions.
[2024-06-20 20:05:00,975 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 158 transitions, 1412 flow
[2024-06-20 20:05:00,999 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 158 transitions, 1327 flow, removed 14 selfloop flow, removed 7 redundant places.
[2024-06-20 20:05:01,001 INFO  L231             Difference]: Finished difference. Result has 110 places, 118 transitions, 989 flow
[2024-06-20 20:05:01,001 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=829, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=989, PETRI_PLACES=110, PETRI_TRANSITIONS=118}
[2024-06-20 20:05:01,002 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 67 predicate places.
[2024-06-20 20:05:01,002 INFO  L495      AbstractCegarLoop]: Abstraction has has 110 places, 118 transitions, 989 flow
[2024-06-20 20:05:01,002 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 13.333333333333334) internal successors, (120), 9 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:05:01,002 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:05:01,002 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:05:01,002 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2024-06-20 20:05:01,002 INFO  L420      AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:05:01,003 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:05:01,003 INFO  L85        PathProgramCache]: Analyzing trace with hash -1678919585, now seen corresponding path program 3 times
[2024-06-20 20:05:01,003 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:05:01,003 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611943367]
[2024-06-20 20:05:01,003 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:05:01,003 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:05:01,044 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:05:09,708 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:05:09,709 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:05:09,709 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611943367]
[2024-06-20 20:05:09,709 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611943367] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:05:09,709 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:05:09,709 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 20:05:09,709 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384461665]
[2024-06-20 20:05:09,709 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:05:09,710 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 20:05:09,710 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:05:09,710 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 20:05:09,710 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-20 20:05:09,826 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 42
[2024-06-20 20:05:09,827 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 118 transitions, 989 flow. Second operand  has 9 states, 9 states have (on average 13.333333333333334) internal successors, (120), 9 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:05:09,827 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:05:09,827 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 42
[2024-06-20 20:05:09,827 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:05:10,961 INFO  L124   PetriNetUnfolderBase]: 1465/2415 cut-off events.
[2024-06-20 20:05:10,962 INFO  L125   PetriNetUnfolderBase]: For 39385/39385 co-relation queries the response was YES.
[2024-06-20 20:05:10,971 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 13121 conditions, 2415 events. 1465/2415 cut-off events. For 39385/39385 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 13261 event pairs, 375 based on Foata normal form. 4/2417 useless extension candidates. Maximal degree in co-relation 13074. Up to 2063 conditions per place. 
[2024-06-20 20:05:10,979 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 114 selfloop transitions, 41 changer transitions 0/162 dead transitions.
[2024-06-20 20:05:10,979 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 162 transitions, 1479 flow
[2024-06-20 20:05:10,982 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-20 20:05:10,982 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-20 20:05:10,982 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 222 transitions.
[2024-06-20 20:05:10,983 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4805194805194805
[2024-06-20 20:05:10,983 INFO  L175             Difference]: Start difference. First operand has 110 places, 118 transitions, 989 flow. Second operand 11 states and 222 transitions.
[2024-06-20 20:05:10,983 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 162 transitions, 1479 flow
[2024-06-20 20:05:11,031 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 162 transitions, 1405 flow, removed 16 selfloop flow, removed 6 redundant places.
[2024-06-20 20:05:11,045 INFO  L231             Difference]: Finished difference. Result has 116 places, 121 transitions, 1076 flow
[2024-06-20 20:05:11,046 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=915, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1076, PETRI_PLACES=116, PETRI_TRANSITIONS=121}
[2024-06-20 20:05:11,046 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 73 predicate places.
[2024-06-20 20:05:11,046 INFO  L495      AbstractCegarLoop]: Abstraction has has 116 places, 121 transitions, 1076 flow
[2024-06-20 20:05:11,047 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 13.333333333333334) internal successors, (120), 9 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:05:11,047 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:05:11,047 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:05:11,047 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2024-06-20 20:05:11,047 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-20 20:05:11,047 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:05:11,047 INFO  L85        PathProgramCache]: Analyzing trace with hash 1218389320, now seen corresponding path program 1 times
[2024-06-20 20:05:11,048 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:05:11,048 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103690754]
[2024-06-20 20:05:11,048 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:05:11,048 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:05:11,098 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:05:20,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-20 20:05:20,218 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:05:20,218 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103690754]
[2024-06-20 20:05:20,218 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103690754] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:05:20,218 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:05:20,218 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 20:05:20,220 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608670248]
[2024-06-20 20:05:20,220 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:05:20,220 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 20:05:20,220 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:05:20,220 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 20:05:20,221 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-20 20:05:20,404 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 42
[2024-06-20 20:05:20,405 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 121 transitions, 1076 flow. Second operand  has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:05:20,405 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:05:20,405 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 42
[2024-06-20 20:05:20,405 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:05:21,255 INFO  L124   PetriNetUnfolderBase]: 1551/2555 cut-off events.
[2024-06-20 20:05:21,255 INFO  L125   PetriNetUnfolderBase]: For 45654/45654 co-relation queries the response was YES.
[2024-06-20 20:05:21,266 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 14252 conditions, 2555 events. 1551/2555 cut-off events. For 45654/45654 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 14246 event pairs, 425 based on Foata normal form. 6/2551 useless extension candidates. Maximal degree in co-relation 14203. Up to 2203 conditions per place. 
[2024-06-20 20:05:21,276 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 106 selfloop transitions, 37 changer transitions 0/150 dead transitions.
[2024-06-20 20:05:21,276 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 150 transitions, 1600 flow
[2024-06-20 20:05:21,277 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 20:05:21,277 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 20:05:21,277 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 147 transitions.
[2024-06-20 20:05:21,277 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5
[2024-06-20 20:05:21,277 INFO  L175             Difference]: Start difference. First operand has 116 places, 121 transitions, 1076 flow. Second operand 7 states and 147 transitions.
[2024-06-20 20:05:21,278 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 150 transitions, 1600 flow
[2024-06-20 20:05:21,315 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 150 transitions, 1487 flow, removed 23 selfloop flow, removed 8 redundant places.
[2024-06-20 20:05:21,317 INFO  L231             Difference]: Finished difference. Result has 117 places, 134 transitions, 1228 flow
[2024-06-20 20:05:21,317 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=963, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1228, PETRI_PLACES=117, PETRI_TRANSITIONS=134}
[2024-06-20 20:05:21,318 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 74 predicate places.
[2024-06-20 20:05:21,318 INFO  L495      AbstractCegarLoop]: Abstraction has has 117 places, 134 transitions, 1228 flow
[2024-06-20 20:05:21,318 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:05:21,318 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:05:21,318 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:05:21,318 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2024-06-20 20:05:21,318 INFO  L420      AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:05:21,319 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:05:21,319 INFO  L85        PathProgramCache]: Analyzing trace with hash 460858996, now seen corresponding path program 2 times
[2024-06-20 20:05:21,319 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:05:21,319 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145595190]
[2024-06-20 20:05:21,319 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:05:21,319 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:05:21,356 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:05:30,520 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:05:30,521 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:05:30,521 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145595190]
[2024-06-20 20:05:30,521 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145595190] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:05:30,521 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:05:30,521 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 20:05:30,521 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898575800]
[2024-06-20 20:05:30,522 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:05:30,522 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 20:05:30,522 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:05:30,522 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 20:05:30,522 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-06-20 20:05:30,637 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 42
[2024-06-20 20:05:30,638 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 134 transitions, 1228 flow. Second operand  has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:05:30,638 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:05:30,638 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 42
[2024-06-20 20:05:30,638 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:05:31,580 INFO  L124   PetriNetUnfolderBase]: 1668/2737 cut-off events.
[2024-06-20 20:05:31,581 INFO  L125   PetriNetUnfolderBase]: For 56043/56043 co-relation queries the response was YES.
[2024-06-20 20:05:31,590 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 16273 conditions, 2737 events. 1668/2737 cut-off events. For 56043/56043 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 15475 event pairs, 429 based on Foata normal form. 6/2733 useless extension candidates. Maximal degree in co-relation 16221. Up to 2221 conditions per place. 
[2024-06-20 20:05:31,598 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 108 selfloop transitions, 65 changer transitions 0/180 dead transitions.
[2024-06-20 20:05:31,599 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 180 transitions, 2032 flow
[2024-06-20 20:05:31,599 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 20:05:31,599 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 20:05:31,600 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 169 transitions.
[2024-06-20 20:05:31,601 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5029761904761905
[2024-06-20 20:05:31,601 INFO  L175             Difference]: Start difference. First operand has 117 places, 134 transitions, 1228 flow. Second operand 8 states and 169 transitions.
[2024-06-20 20:05:31,601 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 180 transitions, 2032 flow
[2024-06-20 20:05:31,642 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 180 transitions, 1935 flow, removed 41 selfloop flow, removed 2 redundant places.
[2024-06-20 20:05:31,645 INFO  L231             Difference]: Finished difference. Result has 125 places, 158 transitions, 1633 flow
[2024-06-20 20:05:31,645 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1143, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1633, PETRI_PLACES=125, PETRI_TRANSITIONS=158}
[2024-06-20 20:05:31,645 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 82 predicate places.
[2024-06-20 20:05:31,645 INFO  L495      AbstractCegarLoop]: Abstraction has has 125 places, 158 transitions, 1633 flow
[2024-06-20 20:05:31,646 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:05:31,646 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:05:31,646 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:05:31,646 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26
[2024-06-20 20:05:31,646 INFO  L420      AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:05:31,646 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:05:31,646 INFO  L85        PathProgramCache]: Analyzing trace with hash 1425042760, now seen corresponding path program 3 times
[2024-06-20 20:05:31,647 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:05:31,647 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47236457]
[2024-06-20 20:05:31,647 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:05:31,647 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:05:31,705 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:05:40,296 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:05:40,296 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:05:40,296 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47236457]
[2024-06-20 20:05:40,296 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47236457] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:05:40,296 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:05:40,296 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 20:05:40,296 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129138410]
[2024-06-20 20:05:40,296 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:05:40,296 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 20:05:40,297 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:05:40,297 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 20:05:40,297 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-06-20 20:05:40,417 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 42
[2024-06-20 20:05:40,417 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 158 transitions, 1633 flow. Second operand  has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:05:40,417 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:05:40,417 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 42
[2024-06-20 20:05:40,417 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:05:41,275 INFO  L124   PetriNetUnfolderBase]: 1658/2719 cut-off events.
[2024-06-20 20:05:41,275 INFO  L125   PetriNetUnfolderBase]: For 59433/59433 co-relation queries the response was YES.
[2024-06-20 20:05:41,284 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 16755 conditions, 2719 events. 1658/2719 cut-off events. For 59433/59433 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 15382 event pairs, 438 based on Foata normal form. 6/2715 useless extension candidates. Maximal degree in co-relation 16699. Up to 2218 conditions per place. 
[2024-06-20 20:05:41,293 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 113 selfloop transitions, 62 changer transitions 0/182 dead transitions.
[2024-06-20 20:05:41,293 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 182 transitions, 2201 flow
[2024-06-20 20:05:41,293 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 20:05:41,293 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 20:05:41,294 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 169 transitions.
[2024-06-20 20:05:41,294 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5029761904761905
[2024-06-20 20:05:41,294 INFO  L175             Difference]: Start difference. First operand has 125 places, 158 transitions, 1633 flow. Second operand 8 states and 169 transitions.
[2024-06-20 20:05:41,294 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 182 transitions, 2201 flow
[2024-06-20 20:05:41,347 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 182 transitions, 2032 flow, removed 69 selfloop flow, removed 3 redundant places.
[2024-06-20 20:05:41,349 INFO  L231             Difference]: Finished difference. Result has 131 places, 163 transitions, 1689 flow
[2024-06-20 20:05:41,349 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1478, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1689, PETRI_PLACES=131, PETRI_TRANSITIONS=163}
[2024-06-20 20:05:41,350 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 88 predicate places.
[2024-06-20 20:05:41,350 INFO  L495      AbstractCegarLoop]: Abstraction has has 131 places, 163 transitions, 1689 flow
[2024-06-20 20:05:41,350 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:05:41,350 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:05:41,350 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:05:41,350 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27
[2024-06-20 20:05:41,351 INFO  L420      AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:05:41,351 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:05:41,351 INFO  L85        PathProgramCache]: Analyzing trace with hash 1423535652, now seen corresponding path program 1 times
[2024-06-20 20:05:41,351 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:05:41,351 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233138853]
[2024-06-20 20:05:41,351 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:05:41,351 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:05:41,392 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:05:51,566 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:05:51,566 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:05:51,566 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233138853]
[2024-06-20 20:05:51,566 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233138853] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:05:51,566 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:05:51,566 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 20:05:51,567 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758380426]
[2024-06-20 20:05:51,567 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:05:51,567 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 20:05:51,567 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:05:51,568 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 20:05:51,568 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-20 20:05:51,775 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 42
[2024-06-20 20:05:51,775 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 163 transitions, 1689 flow. Second operand  has 9 states, 9 states have (on average 14.666666666666666) internal successors, (132), 9 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:05:51,775 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:05:51,775 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 42
[2024-06-20 20:05:51,775 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:05:52,574 INFO  L124   PetriNetUnfolderBase]: 1596/2664 cut-off events.
[2024-06-20 20:05:52,574 INFO  L125   PetriNetUnfolderBase]: For 63471/63492 co-relation queries the response was YES.
[2024-06-20 20:05:52,585 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 16173 conditions, 2664 events. 1596/2664 cut-off events. For 63471/63492 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 15405 event pairs, 438 based on Foata normal form. 14/2650 useless extension candidates. Maximal degree in co-relation 16114. Up to 2204 conditions per place. 
[2024-06-20 20:05:52,595 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 108 selfloop transitions, 48 changer transitions 0/181 dead transitions.
[2024-06-20 20:05:52,595 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 181 transitions, 2095 flow
[2024-06-20 20:05:52,596 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 20:05:52,596 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 20:05:52,596 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 164 transitions.
[2024-06-20 20:05:52,596 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4880952380952381
[2024-06-20 20:05:52,596 INFO  L175             Difference]: Start difference. First operand has 131 places, 163 transitions, 1689 flow. Second operand 8 states and 164 transitions.
[2024-06-20 20:05:52,597 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 181 transitions, 2095 flow
[2024-06-20 20:05:52,640 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 181 transitions, 1981 flow, removed 16 selfloop flow, removed 5 redundant places.
[2024-06-20 20:05:52,642 INFO  L231             Difference]: Finished difference. Result has 134 places, 165 transitions, 1719 flow
[2024-06-20 20:05:52,643 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1575, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1719, PETRI_PLACES=134, PETRI_TRANSITIONS=165}
[2024-06-20 20:05:52,643 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 91 predicate places.
[2024-06-20 20:05:52,643 INFO  L495      AbstractCegarLoop]: Abstraction has has 134 places, 165 transitions, 1719 flow
[2024-06-20 20:05:52,644 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 14.666666666666666) internal successors, (132), 9 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:05:52,644 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:05:52,644 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:05:52,644 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28
[2024-06-20 20:05:52,644 INFO  L420      AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:05:52,644 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:05:52,644 INFO  L85        PathProgramCache]: Analyzing trace with hash -2021382663, now seen corresponding path program 1 times
[2024-06-20 20:05:52,645 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:05:52,645 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899933810]
[2024-06-20 20:05:52,645 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:05:52,645 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:05:52,677 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:06:01,199 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:06:01,199 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:06:01,200 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899933810]
[2024-06-20 20:06:01,200 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899933810] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:06:01,200 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:06:01,200 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 20:06:01,200 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847017884]
[2024-06-20 20:06:01,200 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:06:01,200 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 20:06:01,200 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:06:01,200 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 20:06:01,201 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-06-20 20:06:01,359 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 42
[2024-06-20 20:06:01,359 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 165 transitions, 1719 flow. Second operand  has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:06:01,359 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:06:01,359 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 42
[2024-06-20 20:06:01,359 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:06:02,270 INFO  L124   PetriNetUnfolderBase]: 1697/2790 cut-off events.
[2024-06-20 20:06:02,270 INFO  L125   PetriNetUnfolderBase]: For 62854/62856 co-relation queries the response was YES.
[2024-06-20 20:06:02,280 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 16779 conditions, 2790 events. 1697/2790 cut-off events. For 62854/62856 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 15841 event pairs, 433 based on Foata normal form. 4/2792 useless extension candidates. Maximal degree in co-relation 16720. Up to 2473 conditions per place. 
[2024-06-20 20:06:02,288 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 157 selfloop transitions, 31 changer transitions 0/195 dead transitions.
[2024-06-20 20:06:02,288 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 195 transitions, 2226 flow
[2024-06-20 20:06:02,288 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 20:06:02,288 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 20:06:02,289 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 183 transitions.
[2024-06-20 20:06:02,289 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.48412698412698413
[2024-06-20 20:06:02,289 INFO  L175             Difference]: Start difference. First operand has 134 places, 165 transitions, 1719 flow. Second operand 9 states and 183 transitions.
[2024-06-20 20:06:02,289 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 195 transitions, 2226 flow
[2024-06-20 20:06:02,335 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 195 transitions, 2114 flow, removed 11 selfloop flow, removed 6 redundant places.
[2024-06-20 20:06:02,337 INFO  L231             Difference]: Finished difference. Result has 137 places, 168 transitions, 1730 flow
[2024-06-20 20:06:02,337 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1607, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1730, PETRI_PLACES=137, PETRI_TRANSITIONS=168}
[2024-06-20 20:06:02,338 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 94 predicate places.
[2024-06-20 20:06:02,338 INFO  L495      AbstractCegarLoop]: Abstraction has has 137 places, 168 transitions, 1730 flow
[2024-06-20 20:06:02,338 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:06:02,338 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:06:02,339 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:06:02,339 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29
[2024-06-20 20:06:02,339 INFO  L420      AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:06:02,339 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:06:02,339 INFO  L85        PathProgramCache]: Analyzing trace with hash 1292360633, now seen corresponding path program 2 times
[2024-06-20 20:06:02,339 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:06:02,339 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260059141]
[2024-06-20 20:06:02,340 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:06:02,340 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:06:02,385 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:06:10,676 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:06:10,676 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:06:10,676 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260059141]
[2024-06-20 20:06:10,676 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260059141] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:06:10,676 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:06:10,676 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 20:06:10,677 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111583037]
[2024-06-20 20:06:10,677 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:06:10,677 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 20:06:10,677 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:06:10,677 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 20:06:10,677 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-20 20:06:10,872 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 42
[2024-06-20 20:06:10,872 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 168 transitions, 1730 flow. Second operand  has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:06:10,872 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:06:10,872 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 42
[2024-06-20 20:06:10,872 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:06:11,731 INFO  L124   PetriNetUnfolderBase]: 1723/2845 cut-off events.
[2024-06-20 20:06:11,731 INFO  L125   PetriNetUnfolderBase]: For 66391/66391 co-relation queries the response was YES.
[2024-06-20 20:06:11,742 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 17128 conditions, 2845 events. 1723/2845 cut-off events. For 66391/66391 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 16303 event pairs, 440 based on Foata normal form. 2/2845 useless extension candidates. Maximal degree in co-relation 17068. Up to 2532 conditions per place. 
[2024-06-20 20:06:11,752 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 167 selfloop transitions, 31 changer transitions 0/205 dead transitions.
[2024-06-20 20:06:11,752 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 205 transitions, 2457 flow
[2024-06-20 20:06:11,752 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 20:06:11,753 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 20:06:11,753 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 162 transitions.
[2024-06-20 20:06:11,753 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.48214285714285715
[2024-06-20 20:06:11,753 INFO  L175             Difference]: Start difference. First operand has 137 places, 168 transitions, 1730 flow. Second operand 8 states and 162 transitions.
[2024-06-20 20:06:11,753 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 205 transitions, 2457 flow
[2024-06-20 20:06:11,815 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 205 transitions, 2339 flow, removed 23 selfloop flow, removed 8 redundant places.
[2024-06-20 20:06:11,817 INFO  L231             Difference]: Finished difference. Result has 138 places, 181 transitions, 1917 flow
[2024-06-20 20:06:11,817 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1628, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1917, PETRI_PLACES=138, PETRI_TRANSITIONS=181}
[2024-06-20 20:06:11,818 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 95 predicate places.
[2024-06-20 20:06:11,818 INFO  L495      AbstractCegarLoop]: Abstraction has has 138 places, 181 transitions, 1917 flow
[2024-06-20 20:06:11,818 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:06:11,818 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:06:11,818 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:06:11,819 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30
[2024-06-20 20:06:11,819 INFO  L420      AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:06:11,819 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:06:11,819 INFO  L85        PathProgramCache]: Analyzing trace with hash -897983559, now seen corresponding path program 3 times
[2024-06-20 20:06:11,819 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:06:11,819 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988608882]
[2024-06-20 20:06:11,819 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:06:11,821 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:06:11,853 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:06:19,943 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:06:19,943 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:06:19,943 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988608882]
[2024-06-20 20:06:19,944 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988608882] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:06:19,944 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:06:19,944 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 20:06:19,944 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131695991]
[2024-06-20 20:06:19,944 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:06:19,944 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 20:06:19,945 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:06:19,945 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 20:06:19,945 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-06-20 20:06:20,055 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 42
[2024-06-20 20:06:20,056 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 181 transitions, 1917 flow. Second operand  has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:06:20,056 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:06:20,056 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 42
[2024-06-20 20:06:20,056 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:06:20,891 INFO  L124   PetriNetUnfolderBase]: 1717/2820 cut-off events.
[2024-06-20 20:06:20,891 INFO  L125   PetriNetUnfolderBase]: For 69306/69306 co-relation queries the response was YES.
[2024-06-20 20:06:20,901 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 17133 conditions, 2820 events. 1717/2820 cut-off events. For 69306/69306 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 16143 event pairs, 460 based on Foata normal form. 2/2812 useless extension candidates. Maximal degree in co-relation 17072. Up to 2507 conditions per place. 
[2024-06-20 20:06:20,909 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 162 selfloop transitions, 29 changer transitions 0/198 dead transitions.
[2024-06-20 20:06:20,909 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 198 transitions, 2353 flow
[2024-06-20 20:06:20,910 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 20:06:20,910 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 20:06:20,910 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 143 transitions.
[2024-06-20 20:06:20,910 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.48639455782312924
[2024-06-20 20:06:20,911 INFO  L175             Difference]: Start difference. First operand has 138 places, 181 transitions, 1917 flow. Second operand 7 states and 143 transitions.
[2024-06-20 20:06:20,911 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 198 transitions, 2353 flow
[2024-06-20 20:06:20,975 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 198 transitions, 2265 flow, removed 23 selfloop flow, removed 5 redundant places.
[2024-06-20 20:06:20,979 INFO  L231             Difference]: Finished difference. Result has 140 places, 181 transitions, 1893 flow
[2024-06-20 20:06:20,979 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1829, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1893, PETRI_PLACES=140, PETRI_TRANSITIONS=181}
[2024-06-20 20:06:20,979 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 97 predicate places.
[2024-06-20 20:06:20,979 INFO  L495      AbstractCegarLoop]: Abstraction has has 140 places, 181 transitions, 1893 flow
[2024-06-20 20:06:20,980 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:06:20,980 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:06:20,980 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:06:20,980 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31
[2024-06-20 20:06:20,980 INFO  L420      AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:06:20,980 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:06:20,980 INFO  L85        PathProgramCache]: Analyzing trace with hash -884651079, now seen corresponding path program 4 times
[2024-06-20 20:06:20,981 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:06:20,981 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085088390]
[2024-06-20 20:06:20,981 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:06:20,981 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:06:21,016 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:06:29,257 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:06:29,258 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:06:29,258 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085088390]
[2024-06-20 20:06:29,258 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085088390] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:06:29,258 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:06:29,258 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 20:06:29,258 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839270577]
[2024-06-20 20:06:29,258 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:06:29,258 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 20:06:29,259 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:06:29,259 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 20:06:29,259 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-20 20:06:29,408 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 42
[2024-06-20 20:06:29,408 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 181 transitions, 1893 flow. Second operand  has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:06:29,408 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:06:29,408 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 42
[2024-06-20 20:06:29,408 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:06:30,218 INFO  L124   PetriNetUnfolderBase]: 1701/2802 cut-off events.
[2024-06-20 20:06:30,218 INFO  L125   PetriNetUnfolderBase]: For 71869/71869 co-relation queries the response was YES.
[2024-06-20 20:06:30,230 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 16933 conditions, 2802 events. 1701/2802 cut-off events. For 71869/71869 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 16037 event pairs, 453 based on Foata normal form. 4/2796 useless extension candidates. Maximal degree in co-relation 16871. Up to 2419 conditions per place. 
[2024-06-20 20:06:30,238 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 147 selfloop transitions, 42 changer transitions 0/196 dead transitions.
[2024-06-20 20:06:30,239 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 196 transitions, 2321 flow
[2024-06-20 20:06:30,239 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 20:06:30,239 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 20:06:30,239 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 145 transitions.
[2024-06-20 20:06:30,240 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4931972789115646
[2024-06-20 20:06:30,240 INFO  L175             Difference]: Start difference. First operand has 140 places, 181 transitions, 1893 flow. Second operand 7 states and 145 transitions.
[2024-06-20 20:06:30,240 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 196 transitions, 2321 flow
[2024-06-20 20:06:30,295 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 196 transitions, 2239 flow, removed 14 selfloop flow, removed 5 redundant places.
[2024-06-20 20:06:30,297 INFO  L231             Difference]: Finished difference. Result has 142 places, 181 transitions, 1903 flow
[2024-06-20 20:06:30,297 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1811, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1903, PETRI_PLACES=142, PETRI_TRANSITIONS=181}
[2024-06-20 20:06:30,297 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 99 predicate places.
[2024-06-20 20:06:30,298 INFO  L495      AbstractCegarLoop]: Abstraction has has 142 places, 181 transitions, 1903 flow
[2024-06-20 20:06:30,298 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:06:30,298 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:06:30,298 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:06:30,298 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32
[2024-06-20 20:06:30,298 INFO  L420      AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:06:30,298 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:06:30,299 INFO  L85        PathProgramCache]: Analyzing trace with hash 1399698075, now seen corresponding path program 5 times
[2024-06-20 20:06:30,299 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:06:30,299 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834619525]
[2024-06-20 20:06:30,299 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:06:30,299 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:06:30,331 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:06:38,766 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:06:38,766 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:06:38,766 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834619525]
[2024-06-20 20:06:38,766 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834619525] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:06:38,767 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:06:38,767 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 20:06:38,767 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953936468]
[2024-06-20 20:06:38,767 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:06:38,768 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 20:06:38,768 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:06:38,768 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 20:06:38,768 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-06-20 20:06:38,912 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 42
[2024-06-20 20:06:38,913 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 181 transitions, 1903 flow. Second operand  has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:06:38,913 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:06:38,913 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 42
[2024-06-20 20:06:38,913 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:06:39,774 INFO  L124   PetriNetUnfolderBase]: 1721/2838 cut-off events.
[2024-06-20 20:06:39,774 INFO  L125   PetriNetUnfolderBase]: For 75934/75934 co-relation queries the response was YES.
[2024-06-20 20:06:39,785 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 17257 conditions, 2838 events. 1721/2838 cut-off events. For 75934/75934 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 16266 event pairs, 453 based on Foata normal form. 4/2832 useless extension candidates. Maximal degree in co-relation 17194. Up to 2292 conditions per place. 
[2024-06-20 20:06:39,793 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 120 selfloop transitions, 76 changer transitions 0/203 dead transitions.
[2024-06-20 20:06:39,793 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 203 transitions, 2470 flow
[2024-06-20 20:06:39,793 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 20:06:39,793 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 20:06:39,794 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 167 transitions.
[2024-06-20 20:06:39,794 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.49702380952380953
[2024-06-20 20:06:39,794 INFO  L175             Difference]: Start difference. First operand has 142 places, 181 transitions, 1903 flow. Second operand 8 states and 167 transitions.
[2024-06-20 20:06:39,794 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 203 transitions, 2470 flow
[2024-06-20 20:06:39,854 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 203 transitions, 2356 flow, removed 8 selfloop flow, removed 6 redundant places.
[2024-06-20 20:06:39,856 INFO  L231             Difference]: Finished difference. Result has 144 places, 185 transitions, 2005 flow
[2024-06-20 20:06:39,856 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1789, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2005, PETRI_PLACES=144, PETRI_TRANSITIONS=185}
[2024-06-20 20:06:39,857 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 101 predicate places.
[2024-06-20 20:06:39,857 INFO  L495      AbstractCegarLoop]: Abstraction has has 144 places, 185 transitions, 2005 flow
[2024-06-20 20:06:39,857 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:06:39,857 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:06:39,857 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:06:39,857 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33
[2024-06-20 20:06:39,858 INFO  L420      AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:06:39,858 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:06:39,858 INFO  L85        PathProgramCache]: Analyzing trace with hash -596988125, now seen corresponding path program 6 times
[2024-06-20 20:06:39,858 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:06:39,858 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220934355]
[2024-06-20 20:06:39,858 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:06:39,858 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:06:39,890 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:06:48,464 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:06:48,465 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:06:48,465 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220934355]
[2024-06-20 20:06:48,465 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220934355] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:06:48,465 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:06:48,465 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 20:06:48,465 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354844860]
[2024-06-20 20:06:48,465 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:06:48,466 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 20:06:48,467 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:06:48,468 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 20:06:48,468 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-06-20 20:06:48,608 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 42
[2024-06-20 20:06:48,608 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 185 transitions, 2005 flow. Second operand  has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:06:48,609 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:06:48,609 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 42
[2024-06-20 20:06:48,609 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:06:49,477 INFO  L124   PetriNetUnfolderBase]: 1705/2814 cut-off events.
[2024-06-20 20:06:49,478 INFO  L125   PetriNetUnfolderBase]: For 77959/77959 co-relation queries the response was YES.
[2024-06-20 20:06:49,489 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 17271 conditions, 2814 events. 1705/2814 cut-off events. For 77959/77959 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 16163 event pairs, 446 based on Foata normal form. 4/2808 useless extension candidates. Maximal degree in co-relation 17207. Up to 2279 conditions per place. 
[2024-06-20 20:06:49,499 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 120 selfloop transitions, 78 changer transitions 0/205 dead transitions.
[2024-06-20 20:06:49,499 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 205 transitions, 2562 flow
[2024-06-20 20:06:49,500 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 20:06:49,500 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 20:06:49,500 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 166 transitions.
[2024-06-20 20:06:49,500 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.49404761904761907
[2024-06-20 20:06:49,500 INFO  L175             Difference]: Start difference. First operand has 144 places, 185 transitions, 2005 flow. Second operand 8 states and 166 transitions.
[2024-06-20 20:06:49,501 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 205 transitions, 2562 flow
[2024-06-20 20:06:49,578 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 205 transitions, 2416 flow, removed 13 selfloop flow, removed 5 redundant places.
[2024-06-20 20:06:49,580 INFO  L231             Difference]: Finished difference. Result has 147 places, 187 transitions, 2061 flow
[2024-06-20 20:06:49,581 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1860, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2061, PETRI_PLACES=147, PETRI_TRANSITIONS=187}
[2024-06-20 20:06:49,581 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 104 predicate places.
[2024-06-20 20:06:49,581 INFO  L495      AbstractCegarLoop]: Abstraction has has 147 places, 187 transitions, 2061 flow
[2024-06-20 20:06:49,581 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:06:49,581 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:06:49,581 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:06:49,582 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34
[2024-06-20 20:06:49,582 INFO  L420      AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:06:49,582 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:06:49,582 INFO  L85        PathProgramCache]: Analyzing trace with hash 1234727963, now seen corresponding path program 1 times
[2024-06-20 20:06:49,582 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:06:49,582 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137510395]
[2024-06-20 20:06:49,582 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:06:49,583 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:06:49,622 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:06:58,078 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:06:58,079 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:06:58,079 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137510395]
[2024-06-20 20:06:58,079 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137510395] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:06:58,079 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:06:58,079 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 20:06:58,079 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873089206]
[2024-06-20 20:06:58,079 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:06:58,080 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 20:06:58,081 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:06:58,081 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 20:06:58,081 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-20 20:06:58,196 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 42
[2024-06-20 20:06:58,197 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 187 transitions, 2061 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-20 20:06:58,197 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:06:58,197 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 42
[2024-06-20 20:06:58,198 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:06:59,028 INFO  L124   PetriNetUnfolderBase]: 1613/2709 cut-off events.
[2024-06-20 20:06:59,028 INFO  L125   PetriNetUnfolderBase]: For 81687/81696 co-relation queries the response was YES.
[2024-06-20 20:06:59,040 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 16811 conditions, 2709 events. 1613/2709 cut-off events. For 81687/81696 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 15919 event pairs, 427 based on Foata normal form. 2/2689 useless extension candidates. Maximal degree in co-relation 16746. Up to 2273 conditions per place. 
[2024-06-20 20:06:59,048 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 128 selfloop transitions, 46 changer transitions 0/204 dead transitions.
[2024-06-20 20:06:59,048 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 204 transitions, 2573 flow
[2024-06-20 20:06:59,051 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 20:06:59,051 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 20:06:59,067 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 143 transitions.
[2024-06-20 20:06:59,068 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.48639455782312924
[2024-06-20 20:06:59,068 INFO  L175             Difference]: Start difference. First operand has 147 places, 187 transitions, 2061 flow. Second operand 7 states and 143 transitions.
[2024-06-20 20:06:59,068 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 204 transitions, 2573 flow
[2024-06-20 20:06:59,151 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 204 transitions, 2461 flow, removed 15 selfloop flow, removed 4 redundant places.
[2024-06-20 20:06:59,156 INFO  L231             Difference]: Finished difference. Result has 150 places, 193 transitions, 2121 flow
[2024-06-20 20:06:59,157 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1949, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2121, PETRI_PLACES=150, PETRI_TRANSITIONS=193}
[2024-06-20 20:06:59,157 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 107 predicate places.
[2024-06-20 20:06:59,157 INFO  L495      AbstractCegarLoop]: Abstraction has has 150 places, 193 transitions, 2121 flow
[2024-06-20 20:06:59,157 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-20 20:06:59,157 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:06:59,158 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:06:59,158 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35
[2024-06-20 20:06:59,158 INFO  L420      AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:06:59,158 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:06:59,158 INFO  L85        PathProgramCache]: Analyzing trace with hash 1179411005, now seen corresponding path program 2 times
[2024-06-20 20:06:59,159 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:06:59,159 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942343841]
[2024-06-20 20:06:59,159 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:06:59,159 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:06:59,202 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:07:07,231 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:07:07,232 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:07:07,232 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942343841]
[2024-06-20 20:07:07,232 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942343841] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:07:07,232 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:07:07,232 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 20:07:07,232 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661991466]
[2024-06-20 20:07:07,233 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:07:07,234 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 20:07:07,234 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:07:07,239 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 20:07:07,240 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-20 20:07:07,394 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 42
[2024-06-20 20:07:07,395 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 193 transitions, 2121 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-20 20:07:07,395 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:07:07,395 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 42
[2024-06-20 20:07:07,395 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:07:08,150 INFO  L124   PetriNetUnfolderBase]: 1614/2709 cut-off events.
[2024-06-20 20:07:08,151 INFO  L125   PetriNetUnfolderBase]: For 86951/86985 co-relation queries the response was YES.
[2024-06-20 20:07:08,162 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 16997 conditions, 2709 events. 1614/2709 cut-off events. For 86951/86985 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 15908 event pairs, 431 based on Foata normal form. 2/2686 useless extension candidates. Maximal degree in co-relation 16931. Up to 2287 conditions per place. 
[2024-06-20 20:07:08,171 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 130 selfloop transitions, 43 changer transitions 0/203 dead transitions.
[2024-06-20 20:07:08,171 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 203 transitions, 2495 flow
[2024-06-20 20:07:08,172 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 20:07:08,172 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 20:07:08,172 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 142 transitions.
[2024-06-20 20:07:08,172 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.48299319727891155
[2024-06-20 20:07:08,172 INFO  L175             Difference]: Start difference. First operand has 150 places, 193 transitions, 2121 flow. Second operand 7 states and 142 transitions.
[2024-06-20 20:07:08,173 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 203 transitions, 2495 flow
[2024-06-20 20:07:08,235 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 203 transitions, 2407 flow, removed 23 selfloop flow, removed 3 redundant places.
[2024-06-20 20:07:08,238 INFO  L231             Difference]: Finished difference. Result has 154 places, 193 transitions, 2126 flow
[2024-06-20 20:07:08,238 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2033, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2126, PETRI_PLACES=154, PETRI_TRANSITIONS=193}
[2024-06-20 20:07:08,238 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 111 predicate places.
[2024-06-20 20:07:08,238 INFO  L495      AbstractCegarLoop]: Abstraction has has 154 places, 193 transitions, 2126 flow
[2024-06-20 20:07:08,238 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-20 20:07:08,239 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:07:08,239 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:07:08,239 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36
[2024-06-20 20:07:08,239 INFO  L420      AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:07:08,239 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:07:08,239 INFO  L85        PathProgramCache]: Analyzing trace with hash 1224239451, now seen corresponding path program 1 times
[2024-06-20 20:07:08,240 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:07:08,240 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516917181]
[2024-06-20 20:07:08,240 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:07:08,240 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:07:08,286 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:07:16,443 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:07:16,443 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:07:16,443 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516917181]
[2024-06-20 20:07:16,443 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516917181] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:07:16,443 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:07:16,444 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 20:07:16,444 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191182628]
[2024-06-20 20:07:16,444 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:07:16,445 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 20:07:16,445 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:07:16,446 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 20:07:16,446 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-20 20:07:16,573 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 42
[2024-06-20 20:07:16,573 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 193 transitions, 2126 flow. Second operand  has 8 states, 8 states have (on average 13.75) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:07:16,573 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:07:16,573 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 42
[2024-06-20 20:07:16,574 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:07:17,488 INFO  L124   PetriNetUnfolderBase]: 1706/2820 cut-off events.
[2024-06-20 20:07:17,488 INFO  L125   PetriNetUnfolderBase]: For 87098/87100 co-relation queries the response was YES.
[2024-06-20 20:07:17,499 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 17631 conditions, 2820 events. 1706/2820 cut-off events. For 87098/87100 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 16189 event pairs, 433 based on Foata normal form. 1/2819 useless extension candidates. Maximal degree in co-relation 17563. Up to 2570 conditions per place. 
[2024-06-20 20:07:17,508 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 191 selfloop transitions, 14 changer transitions 0/212 dead transitions.
[2024-06-20 20:07:17,508 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 212 transitions, 2636 flow
[2024-06-20 20:07:17,510 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 20:07:17,510 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 20:07:17,510 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 138 transitions.
[2024-06-20 20:07:17,511 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46938775510204084
[2024-06-20 20:07:17,511 INFO  L175             Difference]: Start difference. First operand has 154 places, 193 transitions, 2126 flow. Second operand 7 states and 138 transitions.
[2024-06-20 20:07:17,511 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 212 transitions, 2636 flow
[2024-06-20 20:07:17,612 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 212 transitions, 2538 flow, removed 3 selfloop flow, removed 6 redundant places.
[2024-06-20 20:07:17,614 INFO  L231             Difference]: Finished difference. Result has 155 places, 196 transitions, 2120 flow
[2024-06-20 20:07:17,615 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2028, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2120, PETRI_PLACES=155, PETRI_TRANSITIONS=196}
[2024-06-20 20:07:17,615 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 112 predicate places.
[2024-06-20 20:07:17,615 INFO  L495      AbstractCegarLoop]: Abstraction has has 155 places, 196 transitions, 2120 flow
[2024-06-20 20:07:17,615 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 13.75) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:07:17,615 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:07:17,616 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:07:17,616 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37
[2024-06-20 20:07:17,616 INFO  L420      AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:07:17,616 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:07:17,616 INFO  L85        PathProgramCache]: Analyzing trace with hash -884635207, now seen corresponding path program 1 times
[2024-06-20 20:07:17,616 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:07:17,616 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992329001]
[2024-06-20 20:07:17,617 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:07:17,617 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:07:17,660 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:07:26,494 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:07:26,494 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:07:26,494 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992329001]
[2024-06-20 20:07:26,494 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992329001] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:07:26,494 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:07:26,495 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 20:07:26,495 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342997101]
[2024-06-20 20:07:26,495 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:07:26,495 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 20:07:26,495 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:07:26,495 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 20:07:26,496 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-20 20:07:26,696 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 42
[2024-06-20 20:07:26,697 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 196 transitions, 2120 flow. Second operand  has 10 states, 10 states have (on average 13.5) internal successors, (135), 10 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:07:26,697 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:07:26,697 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 42
[2024-06-20 20:07:26,697 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:07:27,521 INFO  L124   PetriNetUnfolderBase]: 1721/2837 cut-off events.
[2024-06-20 20:07:27,522 INFO  L125   PetriNetUnfolderBase]: For 93062/93062 co-relation queries the response was YES.
[2024-06-20 20:07:27,534 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 17989 conditions, 2837 events. 1721/2837 cut-off events. For 93062/93062 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 16266 event pairs, 425 based on Foata normal form. 3/2830 useless extension candidates. Maximal degree in co-relation 17920. Up to 2480 conditions per place. 
[2024-06-20 20:07:27,544 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 179 selfloop transitions, 46 changer transitions 0/232 dead transitions.
[2024-06-20 20:07:27,545 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 232 transitions, 2860 flow
[2024-06-20 20:07:27,545 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 20:07:27,545 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 20:07:27,546 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 162 transitions.
[2024-06-20 20:07:27,546 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.48214285714285715
[2024-06-20 20:07:27,546 INFO  L175             Difference]: Start difference. First operand has 155 places, 196 transitions, 2120 flow. Second operand 8 states and 162 transitions.
[2024-06-20 20:07:27,546 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 232 transitions, 2860 flow
[2024-06-20 20:07:27,624 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 232 transitions, 2790 flow, removed 23 selfloop flow, removed 5 redundant places.
[2024-06-20 20:07:27,627 INFO  L231             Difference]: Finished difference. Result has 160 places, 217 transitions, 2456 flow
[2024-06-20 20:07:27,627 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2050, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2456, PETRI_PLACES=160, PETRI_TRANSITIONS=217}
[2024-06-20 20:07:27,627 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 117 predicate places.
[2024-06-20 20:07:27,627 INFO  L495      AbstractCegarLoop]: Abstraction has has 160 places, 217 transitions, 2456 flow
[2024-06-20 20:07:27,628 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 13.5) internal successors, (135), 10 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:07:27,628 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:07:27,628 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:07:27,628 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38
[2024-06-20 20:07:27,628 INFO  L420      AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:07:27,628 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:07:27,628 INFO  L85        PathProgramCache]: Analyzing trace with hash 1171352059, now seen corresponding path program 2 times
[2024-06-20 20:07:27,629 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:07:27,629 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848067490]
[2024-06-20 20:07:27,629 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:07:27,629 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:07:27,665 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:07:36,540 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:07:36,541 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:07:36,541 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848067490]
[2024-06-20 20:07:36,541 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848067490] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:07:36,541 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:07:36,541 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 20:07:36,541 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815372300]
[2024-06-20 20:07:36,541 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:07:36,541 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 20:07:36,542 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:07:36,542 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 20:07:36,542 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-06-20 20:07:36,704 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 42
[2024-06-20 20:07:36,704 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 217 transitions, 2456 flow. Second operand  has 10 states, 10 states have (on average 13.5) internal successors, (135), 10 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:07:36,704 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:07:36,704 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 42
[2024-06-20 20:07:36,704 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:07:37,526 INFO  L124   PetriNetUnfolderBase]: 1738/2865 cut-off events.
[2024-06-20 20:07:37,526 INFO  L125   PetriNetUnfolderBase]: For 99444/99444 co-relation queries the response was YES.
[2024-06-20 20:07:37,540 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 18890 conditions, 2865 events. 1738/2865 cut-off events. For 99444/99444 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 16448 event pairs, 413 based on Foata normal form. 3/2858 useless extension candidates. Maximal degree in co-relation 18818. Up to 2416 conditions per place. 
[2024-06-20 20:07:37,550 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 179 selfloop transitions, 75 changer transitions 0/261 dead transitions.
[2024-06-20 20:07:37,550 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 261 transitions, 3398 flow
[2024-06-20 20:07:37,551 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 20:07:37,551 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 20:07:37,552 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 183 transitions.
[2024-06-20 20:07:37,553 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.48412698412698413
[2024-06-20 20:07:37,553 INFO  L175             Difference]: Start difference. First operand has 160 places, 217 transitions, 2456 flow. Second operand 9 states and 183 transitions.
[2024-06-20 20:07:37,553 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 261 transitions, 3398 flow
[2024-06-20 20:07:37,643 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 261 transitions, 3301 flow, removed 33 selfloop flow, removed 3 redundant places.
[2024-06-20 20:07:37,646 INFO  L231             Difference]: Finished difference. Result has 168 places, 242 transitions, 2884 flow
[2024-06-20 20:07:37,647 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2359, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2884, PETRI_PLACES=168, PETRI_TRANSITIONS=242}
[2024-06-20 20:07:37,656 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 125 predicate places.
[2024-06-20 20:07:37,656 INFO  L495      AbstractCegarLoop]: Abstraction has has 168 places, 242 transitions, 2884 flow
[2024-06-20 20:07:37,657 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 13.5) internal successors, (135), 10 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:07:37,657 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:07:37,657 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:07:37,657 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39
[2024-06-20 20:07:37,657 INFO  L420      AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:07:37,657 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:07:37,657 INFO  L85        PathProgramCache]: Analyzing trace with hash 1179626269, now seen corresponding path program 3 times
[2024-06-20 20:07:37,658 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:07:37,658 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426453570]
[2024-06-20 20:07:37,658 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:07:37,658 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:07:37,698 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:07:46,386 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:07:46,387 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:07:46,387 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426453570]
[2024-06-20 20:07:46,387 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426453570] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:07:46,387 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:07:46,387 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 20:07:46,387 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740200419]
[2024-06-20 20:07:46,387 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:07:46,387 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 20:07:46,387 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:07:46,387 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 20:07:46,387 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-06-20 20:07:46,515 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 42
[2024-06-20 20:07:46,515 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 242 transitions, 2884 flow. Second operand  has 10 states, 10 states have (on average 13.5) internal successors, (135), 10 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:07:46,516 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:07:46,516 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 42
[2024-06-20 20:07:46,516 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:07:47,396 INFO  L124   PetriNetUnfolderBase]: 1753/2892 cut-off events.
[2024-06-20 20:07:47,396 INFO  L125   PetriNetUnfolderBase]: For 106123/106123 co-relation queries the response was YES.
[2024-06-20 20:07:47,410 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 19882 conditions, 2892 events. 1753/2892 cut-off events. For 106123/106123 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 16658 event pairs, 413 based on Foata normal form. 3/2885 useless extension candidates. Maximal degree in co-relation 19806. Up to 2438 conditions per place. 
[2024-06-20 20:07:47,419 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 176 selfloop transitions, 84 changer transitions 0/267 dead transitions.
[2024-06-20 20:07:47,419 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 267 transitions, 3651 flow
[2024-06-20 20:07:47,420 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 20:07:47,420 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 20:07:47,420 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 183 transitions.
[2024-06-20 20:07:47,420 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.48412698412698413
[2024-06-20 20:07:47,421 INFO  L175             Difference]: Start difference. First operand has 168 places, 242 transitions, 2884 flow. Second operand 9 states and 183 transitions.
[2024-06-20 20:07:47,421 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 267 transitions, 3651 flow
[2024-06-20 20:07:47,520 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 267 transitions, 3488 flow, removed 43 selfloop flow, removed 4 redundant places.
[2024-06-20 20:07:47,523 INFO  L231             Difference]: Finished difference. Result has 174 places, 249 transitions, 3025 flow
[2024-06-20 20:07:47,523 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2727, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3025, PETRI_PLACES=174, PETRI_TRANSITIONS=249}
[2024-06-20 20:07:47,524 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 131 predicate places.
[2024-06-20 20:07:47,524 INFO  L495      AbstractCegarLoop]: Abstraction has has 174 places, 249 transitions, 3025 flow
[2024-06-20 20:07:47,525 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 13.5) internal successors, (135), 10 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:07:47,525 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:07:47,525 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:07:47,525 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40
[2024-06-20 20:07:47,525 INFO  L420      AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:07:47,525 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:07:47,525 INFO  L85        PathProgramCache]: Analyzing trace with hash 1235225017, now seen corresponding path program 4 times
[2024-06-20 20:07:47,526 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:07:47,526 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682113137]
[2024-06-20 20:07:47,526 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:07:47,526 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:07:47,570 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:07:57,500 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:07:57,500 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:07:57,500 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682113137]
[2024-06-20 20:07:57,500 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682113137] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:07:57,500 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:07:57,500 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 20:07:57,500 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830123716]
[2024-06-20 20:07:57,500 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:07:57,500 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 20:07:57,501 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:07:57,501 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 20:07:57,501 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-06-20 20:07:57,731 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 42
[2024-06-20 20:07:57,731 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 249 transitions, 3025 flow. Second operand  has 10 states, 10 states have (on average 13.5) internal successors, (135), 10 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:07:57,731 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:07:57,731 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 42
[2024-06-20 20:07:57,731 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:07:58,717 INFO  L124   PetriNetUnfolderBase]: 1804/2965 cut-off events.
[2024-06-20 20:07:58,717 INFO  L125   PetriNetUnfolderBase]: For 114936/114936 co-relation queries the response was YES.
[2024-06-20 20:07:58,730 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 21169 conditions, 2965 events. 1804/2965 cut-off events. For 114936/114936 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 17000 event pairs, 419 based on Foata normal form. 6/2961 useless extension candidates. Maximal degree in co-relation 21090. Up to 2344 conditions per place. 
[2024-06-20 20:07:58,739 INFO  L140   encePairwiseOnDemand]: 29/42 looper letters, 124 selfloop transitions, 150 changer transitions 0/281 dead transitions.
[2024-06-20 20:07:58,739 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 281 transitions, 4016 flow
[2024-06-20 20:07:58,740 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 20:07:58,740 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 20:07:58,740 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 208 transitions.
[2024-06-20 20:07:58,742 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.49523809523809526
[2024-06-20 20:07:58,743 INFO  L175             Difference]: Start difference. First operand has 174 places, 249 transitions, 3025 flow. Second operand 10 states and 208 transitions.
[2024-06-20 20:07:58,743 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 281 transitions, 4016 flow
[2024-06-20 20:07:58,860 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 281 transitions, 3811 flow, removed 39 selfloop flow, removed 5 redundant places.
[2024-06-20 20:07:58,864 INFO  L231             Difference]: Finished difference. Result has 180 places, 263 transitions, 3417 flow
[2024-06-20 20:07:58,865 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2820, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=141, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3417, PETRI_PLACES=180, PETRI_TRANSITIONS=263}
[2024-06-20 20:07:58,865 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 137 predicate places.
[2024-06-20 20:07:58,865 INFO  L495      AbstractCegarLoop]: Abstraction has has 180 places, 263 transitions, 3417 flow
[2024-06-20 20:07:58,870 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 13.5) internal successors, (135), 10 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:07:58,870 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:07:58,870 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:07:58,870 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41
[2024-06-20 20:07:58,870 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-20 20:07:58,871 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:07:58,871 INFO  L85        PathProgramCache]: Analyzing trace with hash -1038740726, now seen corresponding path program 1 times
[2024-06-20 20:07:58,871 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:07:58,871 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336617536]
[2024-06-20 20:07:58,871 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:07:58,871 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:07:58,904 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:08:07,457 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:08:07,458 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:08:07,458 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336617536]
[2024-06-20 20:08:07,458 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336617536] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:08:07,458 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:08:07,458 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 20:08:07,458 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63217527]
[2024-06-20 20:08:07,459 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:08:07,459 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 20:08:07,459 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:08:07,459 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 20:08:07,459 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-20 20:08:07,722 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 42
[2024-06-20 20:08:07,723 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 263 transitions, 3417 flow. Second operand  has 10 states, 10 states have (on average 13.3) internal successors, (133), 10 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-20 20:08:07,723 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:08:07,723 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 42
[2024-06-20 20:08:07,723 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:08:08,949 INFO  L124   PetriNetUnfolderBase]: 1927/3192 cut-off events.
[2024-06-20 20:08:08,950 INFO  L125   PetriNetUnfolderBase]: For 126501/126503 co-relation queries the response was YES.
[2024-06-20 20:08:08,966 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 23200 conditions, 3192 events. 1927/3192 cut-off events. For 126501/126503 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 18758 event pairs, 431 based on Foata normal form. 12/3200 useless extension candidates. Maximal degree in co-relation 23119. Up to 2482 conditions per place. 
[2024-06-20 20:08:08,976 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 251 selfloop transitions, 48 changer transitions 0/306 dead transitions.
[2024-06-20 20:08:08,977 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 306 transitions, 4281 flow
[2024-06-20 20:08:08,978 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 20:08:08,978 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 20:08:08,979 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 194 transitions.
[2024-06-20 20:08:08,979 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5132275132275133
[2024-06-20 20:08:08,979 INFO  L175             Difference]: Start difference. First operand has 180 places, 263 transitions, 3417 flow. Second operand 9 states and 194 transitions.
[2024-06-20 20:08:08,979 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 306 transitions, 4281 flow
[2024-06-20 20:08:09,109 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 306 transitions, 3998 flow, removed 57 selfloop flow, removed 6 redundant places.
[2024-06-20 20:08:09,113 INFO  L231             Difference]: Finished difference. Result has 185 places, 269 transitions, 3353 flow
[2024-06-20 20:08:09,113 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3134, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3353, PETRI_PLACES=185, PETRI_TRANSITIONS=269}
[2024-06-20 20:08:09,114 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 142 predicate places.
[2024-06-20 20:08:09,114 INFO  L495      AbstractCegarLoop]: Abstraction has has 185 places, 269 transitions, 3353 flow
[2024-06-20 20:08:09,114 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 13.3) internal successors, (133), 10 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-20 20:08:09,114 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:08:09,114 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:08:09,115 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42
[2024-06-20 20:08:09,115 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-20 20:08:09,116 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:08:09,116 INFO  L85        PathProgramCache]: Analyzing trace with hash 1076453792, now seen corresponding path program 2 times
[2024-06-20 20:08:09,116 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:08:09,116 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626281099]
[2024-06-20 20:08:09,117 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:08:09,117 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:08:09,164 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:08:17,782 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:08:17,782 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:08:17,782 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626281099]
[2024-06-20 20:08:17,782 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626281099] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:08:17,782 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:08:17,782 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 20:08:17,782 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278994330]
[2024-06-20 20:08:17,782 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:08:17,782 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 20:08:17,782 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:08:17,783 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 20:08:17,783 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-20 20:08:18,028 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 42
[2024-06-20 20:08:18,029 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 269 transitions, 3353 flow. Second operand  has 10 states, 10 states have (on average 13.3) internal successors, (133), 10 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-20 20:08:18,029 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:08:18,029 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 42
[2024-06-20 20:08:18,029 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:08:19,355 INFO  L124   PetriNetUnfolderBase]: 2037/3406 cut-off events.
[2024-06-20 20:08:19,355 INFO  L125   PetriNetUnfolderBase]: For 133980/133982 co-relation queries the response was YES.
[2024-06-20 20:08:19,374 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 24460 conditions, 3406 events. 2037/3406 cut-off events. For 133980/133982 co-relation queries the response was YES. Maximal size of possible extension queue 225. Compared 20502 event pairs, 457 based on Foata normal form. 12/3416 useless extension candidates. Maximal degree in co-relation 24375. Up to 2755 conditions per place. 
[2024-06-20 20:08:19,386 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 262 selfloop transitions, 50 changer transitions 0/319 dead transitions.
[2024-06-20 20:08:19,386 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 319 transitions, 4252 flow
[2024-06-20 20:08:19,386 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-20 20:08:19,387 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-20 20:08:19,387 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 232 transitions.
[2024-06-20 20:08:19,387 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5021645021645021
[2024-06-20 20:08:19,387 INFO  L175             Difference]: Start difference. First operand has 185 places, 269 transitions, 3353 flow. Second operand 11 states and 232 transitions.
[2024-06-20 20:08:19,387 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 319 transitions, 4252 flow
[2024-06-20 20:08:19,508 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 319 transitions, 4152 flow, removed 16 selfloop flow, removed 4 redundant places.
[2024-06-20 20:08:19,511 INFO  L231             Difference]: Finished difference. Result has 194 places, 275 transitions, 3468 flow
[2024-06-20 20:08:19,512 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3259, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=222, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3468, PETRI_PLACES=194, PETRI_TRANSITIONS=275}
[2024-06-20 20:08:19,512 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 151 predicate places.
[2024-06-20 20:08:19,512 INFO  L495      AbstractCegarLoop]: Abstraction has has 194 places, 275 transitions, 3468 flow
[2024-06-20 20:08:19,512 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 13.3) internal successors, (133), 10 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-20 20:08:19,513 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:08:19,513 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:08:19,513 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43
[2024-06-20 20:08:19,513 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-20 20:08:19,513 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:08:19,513 INFO  L85        PathProgramCache]: Analyzing trace with hash -11010242, now seen corresponding path program 3 times
[2024-06-20 20:08:19,517 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:08:19,517 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507915601]
[2024-06-20 20:08:19,517 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:08:19,517 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:08:19,555 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:08:28,289 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:08:28,289 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:08:28,289 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507915601]
[2024-06-20 20:08:28,289 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507915601] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:08:28,289 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:08:28,289 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 20:08:28,289 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316861833]
[2024-06-20 20:08:28,289 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:08:28,290 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 20:08:28,290 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:08:28,290 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 20:08:28,290 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-20 20:08:28,558 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 42
[2024-06-20 20:08:28,559 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 275 transitions, 3468 flow. Second operand  has 10 states, 10 states have (on average 13.3) internal successors, (133), 10 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-20 20:08:28,559 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:08:28,559 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 42
[2024-06-20 20:08:28,559 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:08:30,021 INFO  L124   PetriNetUnfolderBase]: 2119/3558 cut-off events.
[2024-06-20 20:08:30,021 INFO  L125   PetriNetUnfolderBase]: For 142274/142276 co-relation queries the response was YES.
[2024-06-20 20:08:30,040 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 25512 conditions, 3558 events. 2119/3558 cut-off events. For 142274/142276 co-relation queries the response was YES. Maximal size of possible extension queue 238. Compared 21712 event pairs, 482 based on Foata normal form. 12/3568 useless extension candidates. Maximal degree in co-relation 25424. Up to 2897 conditions per place. 
[2024-06-20 20:08:30,052 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 264 selfloop transitions, 56 changer transitions 0/327 dead transitions.
[2024-06-20 20:08:30,052 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 327 transitions, 4376 flow
[2024-06-20 20:08:30,055 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2024-06-20 20:08:30,055 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 12 states.
[2024-06-20 20:08:30,055 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 248 transitions.
[2024-06-20 20:08:30,055 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.49206349206349204
[2024-06-20 20:08:30,055 INFO  L175             Difference]: Start difference. First operand has 194 places, 275 transitions, 3468 flow. Second operand 12 states and 248 transitions.
[2024-06-20 20:08:30,055 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 327 transitions, 4376 flow
[2024-06-20 20:08:30,222 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 327 transitions, 4245 flow, removed 19 selfloop flow, removed 7 redundant places.
[2024-06-20 20:08:30,225 INFO  L231             Difference]: Finished difference. Result has 200 places, 279 transitions, 3533 flow
[2024-06-20 20:08:30,226 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3339, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=275, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=3533, PETRI_PLACES=200, PETRI_TRANSITIONS=279}
[2024-06-20 20:08:30,226 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 157 predicate places.
[2024-06-20 20:08:30,226 INFO  L495      AbstractCegarLoop]: Abstraction has has 200 places, 279 transitions, 3533 flow
[2024-06-20 20:08:30,226 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 13.3) internal successors, (133), 10 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-20 20:08:30,226 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:08:30,227 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:08:30,227 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44
[2024-06-20 20:08:30,227 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-20 20:08:30,227 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:08:30,227 INFO  L85        PathProgramCache]: Analyzing trace with hash 1466029886, now seen corresponding path program 4 times
[2024-06-20 20:08:30,227 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:08:30,227 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451644982]
[2024-06-20 20:08:30,227 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:08:30,228 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:08:30,268 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:08:38,025 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:08:38,026 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:08:38,026 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451644982]
[2024-06-20 20:08:38,026 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451644982] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:08:38,026 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:08:38,026 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 20:08:38,026 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387803589]
[2024-06-20 20:08:38,026 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:08:38,026 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 20:08:38,026 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:08:38,026 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 20:08:38,027 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-20 20:08:38,305 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 42
[2024-06-20 20:08:38,305 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 279 transitions, 3533 flow. Second operand  has 10 states, 10 states have (on average 13.3) internal successors, (133), 10 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-20 20:08:38,305 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:08:38,305 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 42
[2024-06-20 20:08:38,305 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:08:39,705 INFO  L124   PetriNetUnfolderBase]: 2099/3526 cut-off events.
[2024-06-20 20:08:39,705 INFO  L125   PetriNetUnfolderBase]: For 140379/140381 co-relation queries the response was YES.
[2024-06-20 20:08:39,723 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 24785 conditions, 3526 events. 2099/3526 cut-off events. For 140379/140381 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 21483 event pairs, 418 based on Foata normal form. 12/3536 useless extension candidates. Maximal degree in co-relation 24696. Up to 2305 conditions per place. 
[2024-06-20 20:08:39,736 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 253 selfloop transitions, 67 changer transitions 0/327 dead transitions.
[2024-06-20 20:08:39,736 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 327 transitions, 4335 flow
[2024-06-20 20:08:39,738 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2024-06-20 20:08:39,738 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 12 states.
[2024-06-20 20:08:39,738 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 247 transitions.
[2024-06-20 20:08:39,738 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.49007936507936506
[2024-06-20 20:08:39,739 INFO  L175             Difference]: Start difference. First operand has 200 places, 279 transitions, 3533 flow. Second operand 12 states and 247 transitions.
[2024-06-20 20:08:39,739 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 327 transitions, 4335 flow
[2024-06-20 20:08:39,895 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 327 transitions, 4227 flow, removed 14 selfloop flow, removed 7 redundant places.
[2024-06-20 20:08:39,899 INFO  L231             Difference]: Finished difference. Result has 204 places, 278 transitions, 3523 flow
[2024-06-20 20:08:39,899 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3385, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=3523, PETRI_PLACES=204, PETRI_TRANSITIONS=278}
[2024-06-20 20:08:39,900 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 161 predicate places.
[2024-06-20 20:08:39,900 INFO  L495      AbstractCegarLoop]: Abstraction has has 204 places, 278 transitions, 3523 flow
[2024-06-20 20:08:39,900 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 13.3) internal successors, (133), 10 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-20 20:08:39,900 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:08:39,900 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:08:39,900 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45
[2024-06-20 20:08:39,900 INFO  L420      AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:08:39,901 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:08:39,901 INFO  L85        PathProgramCache]: Analyzing trace with hash -2076773501, now seen corresponding path program 1 times
[2024-06-20 20:08:39,901 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:08:39,901 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848084081]
[2024-06-20 20:08:39,901 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:08:39,901 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:08:39,938 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:08:49,334 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:08:49,334 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:08:49,334 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848084081]
[2024-06-20 20:08:49,334 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848084081] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:08:49,334 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:08:49,334 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 20:08:49,335 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856075080]
[2024-06-20 20:08:49,335 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:08:49,335 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 20:08:49,335 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:08:49,335 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 20:08:49,335 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-20 20:08:49,535 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 42
[2024-06-20 20:08:49,535 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 278 transitions, 3523 flow. Second operand  has 10 states, 10 states have (on average 14.6) internal successors, (146), 10 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:08:49,535 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:08:49,535 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 42
[2024-06-20 20:08:49,536 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:08:50,580 INFO  L124   PetriNetUnfolderBase]: 2066/3493 cut-off events.
[2024-06-20 20:08:50,580 INFO  L125   PetriNetUnfolderBase]: For 153407/153437 co-relation queries the response was YES.
[2024-06-20 20:08:50,601 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 25151 conditions, 3493 events. 2066/3493 cut-off events. For 153407/153437 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 21532 event pairs, 475 based on Foata normal form. 17/3473 useless extension candidates. Maximal degree in co-relation 25061. Up to 2822 conditions per place. 
[2024-06-20 20:08:50,613 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 204 selfloop transitions, 52 changer transitions 0/300 dead transitions.
[2024-06-20 20:08:50,613 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 300 transitions, 4271 flow
[2024-06-20 20:08:50,614 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 20:08:50,614 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 20:08:50,614 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 163 transitions.
[2024-06-20 20:08:50,614 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4851190476190476
[2024-06-20 20:08:50,614 INFO  L175             Difference]: Start difference. First operand has 204 places, 278 transitions, 3523 flow. Second operand 8 states and 163 transitions.
[2024-06-20 20:08:50,615 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 300 transitions, 4271 flow
[2024-06-20 20:08:50,809 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 300 transitions, 4092 flow, removed 14 selfloop flow, removed 11 redundant places.
[2024-06-20 20:08:50,814 INFO  L231             Difference]: Finished difference. Result has 202 places, 281 transitions, 3513 flow
[2024-06-20 20:08:50,814 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3344, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=227, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3513, PETRI_PLACES=202, PETRI_TRANSITIONS=281}
[2024-06-20 20:08:50,815 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 159 predicate places.
[2024-06-20 20:08:50,815 INFO  L495      AbstractCegarLoop]: Abstraction has has 202 places, 281 transitions, 3513 flow
[2024-06-20 20:08:50,816 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 14.6) internal successors, (146), 10 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:08:50,816 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:08:50,816 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:08:50,816 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46
[2024-06-20 20:08:50,819 INFO  L420      AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:08:50,819 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:08:50,819 INFO  L85        PathProgramCache]: Analyzing trace with hash -362943833, now seen corresponding path program 2 times
[2024-06-20 20:08:50,820 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:08:50,820 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390871476]
[2024-06-20 20:08:50,820 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:08:50,820 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:08:50,862 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:09:01,091 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:09:01,091 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:09:01,091 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390871476]
[2024-06-20 20:09:01,091 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390871476] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:09:01,091 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:09:01,091 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 20:09:01,091 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029088176]
[2024-06-20 20:09:01,092 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:09:01,092 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 20:09:01,092 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:09:01,092 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 20:09:01,092 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-20 20:09:01,302 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 42
[2024-06-20 20:09:01,303 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 281 transitions, 3513 flow. Second operand  has 10 states, 10 states have (on average 14.6) internal successors, (146), 10 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:09:01,303 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:09:01,303 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 42
[2024-06-20 20:09:01,303 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:09:02,339 INFO  L124   PetriNetUnfolderBase]: 2074/3504 cut-off events.
[2024-06-20 20:09:02,340 INFO  L125   PetriNetUnfolderBase]: For 157167/157176 co-relation queries the response was YES.
[2024-06-20 20:09:02,362 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 24515 conditions, 3504 events. 2074/3504 cut-off events. For 157167/157176 co-relation queries the response was YES. Maximal size of possible extension queue 239. Compared 21628 event pairs, 476 based on Foata normal form. 20/3488 useless extension candidates. Maximal degree in co-relation 24424. Up to 2905 conditions per place. 
[2024-06-20 20:09:02,374 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 200 selfloop transitions, 56 changer transitions 0/300 dead transitions.
[2024-06-20 20:09:02,374 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 300 transitions, 4139 flow
[2024-06-20 20:09:02,375 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 20:09:02,375 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 20:09:02,375 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 180 transitions.
[2024-06-20 20:09:02,375 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.47619047619047616
[2024-06-20 20:09:02,375 INFO  L175             Difference]: Start difference. First operand has 202 places, 281 transitions, 3513 flow. Second operand 9 states and 180 transitions.
[2024-06-20 20:09:02,376 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 300 transitions, 4139 flow
[2024-06-20 20:09:02,549 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 300 transitions, 4067 flow, removed 7 selfloop flow, removed 4 redundant places.
[2024-06-20 20:09:02,553 INFO  L231             Difference]: Finished difference. Result has 207 places, 283 transitions, 3601 flow
[2024-06-20 20:09:02,553 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3441, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3601, PETRI_PLACES=207, PETRI_TRANSITIONS=283}
[2024-06-20 20:09:02,553 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 164 predicate places.
[2024-06-20 20:09:02,553 INFO  L495      AbstractCegarLoop]: Abstraction has has 207 places, 283 transitions, 3601 flow
[2024-06-20 20:09:02,554 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 14.6) internal successors, (146), 10 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:09:02,554 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:09:02,554 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:09:02,558 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47
[2024-06-20 20:09:02,559 INFO  L420      AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:09:02,559 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:09:02,559 INFO  L85        PathProgramCache]: Analyzing trace with hash -823513181, now seen corresponding path program 1 times
[2024-06-20 20:09:02,559 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:09:02,559 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256466119]
[2024-06-20 20:09:02,559 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:09:02,559 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:09:02,609 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:09:11,876 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:09:11,876 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:09:11,876 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256466119]
[2024-06-20 20:09:11,876 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256466119] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:09:11,876 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:09:11,876 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 20:09:11,876 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177121290]
[2024-06-20 20:09:11,877 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:09:11,877 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 20:09:11,877 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:09:11,877 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 20:09:11,877 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-06-20 20:09:12,037 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 42
[2024-06-20 20:09:12,038 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 283 transitions, 3601 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-20 20:09:12,038 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:09:12,038 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 42
[2024-06-20 20:09:12,038 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:09:13,152 INFO  L124   PetriNetUnfolderBase]: 2197/3685 cut-off events.
[2024-06-20 20:09:13,152 INFO  L125   PetriNetUnfolderBase]: For 145327/145327 co-relation queries the response was YES.
[2024-06-20 20:09:13,172 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 25718 conditions, 3685 events. 2197/3685 cut-off events. For 145327/145327 co-relation queries the response was YES. Maximal size of possible extension queue 246. Compared 22641 event pairs, 499 based on Foata normal form. 2/3681 useless extension candidates. Maximal degree in co-relation 25625. Up to 3280 conditions per place. 
[2024-06-20 20:09:13,183 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 266 selfloop transitions, 38 changer transitions 0/311 dead transitions.
[2024-06-20 20:09:13,184 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 311 transitions, 4509 flow
[2024-06-20 20:09:13,184 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 20:09:13,184 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 20:09:13,185 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 160 transitions.
[2024-06-20 20:09:13,185 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.47619047619047616
[2024-06-20 20:09:13,185 INFO  L175             Difference]: Start difference. First operand has 207 places, 283 transitions, 3601 flow. Second operand 8 states and 160 transitions.
[2024-06-20 20:09:13,185 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 311 transitions, 4509 flow
[2024-06-20 20:09:13,334 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 311 transitions, 4383 flow, removed 11 selfloop flow, removed 7 redundant places.
[2024-06-20 20:09:13,338 INFO  L231             Difference]: Finished difference. Result has 209 places, 291 transitions, 3726 flow
[2024-06-20 20:09:13,338 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3475, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3726, PETRI_PLACES=209, PETRI_TRANSITIONS=291}
[2024-06-20 20:09:13,339 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 166 predicate places.
[2024-06-20 20:09:13,339 INFO  L495      AbstractCegarLoop]: Abstraction has has 209 places, 291 transitions, 3726 flow
[2024-06-20 20:09:13,339 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-20 20:09:13,339 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:09:13,339 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:09:13,339 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48
[2024-06-20 20:09:13,339 INFO  L420      AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:09:13,340 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:09:13,340 INFO  L85        PathProgramCache]: Analyzing trace with hash -1653886073, now seen corresponding path program 1 times
[2024-06-20 20:09:13,340 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:09:13,340 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957306745]
[2024-06-20 20:09:13,340 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:09:13,340 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:09:13,380 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:09:21,931 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:09:21,932 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:09:21,932 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957306745]
[2024-06-20 20:09:21,932 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957306745] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:09:21,932 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:09:21,932 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 20:09:21,932 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085457926]
[2024-06-20 20:09:21,932 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:09:21,932 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 20:09:21,932 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:09:21,933 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 20:09:21,933 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-20 20:09:22,123 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 42
[2024-06-20 20:09:22,124 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 291 transitions, 3726 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-20 20:09:22,124 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:09:22,124 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 42
[2024-06-20 20:09:22,124 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:09:23,294 INFO  L124   PetriNetUnfolderBase]: 2213/3711 cut-off events.
[2024-06-20 20:09:23,294 INFO  L125   PetriNetUnfolderBase]: For 155301/155301 co-relation queries the response was YES.
[2024-06-20 20:09:23,314 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 26280 conditions, 3711 events. 2213/3711 cut-off events. For 155301/155301 co-relation queries the response was YES. Maximal size of possible extension queue 249. Compared 22818 event pairs, 500 based on Foata normal form. 4/3709 useless extension candidates. Maximal degree in co-relation 26185. Up to 3321 conditions per place. 
[2024-06-20 20:09:23,325 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 274 selfloop transitions, 37 changer transitions 0/318 dead transitions.
[2024-06-20 20:09:23,325 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 318 transitions, 4534 flow
[2024-06-20 20:09:23,326 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 20:09:23,326 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 20:09:23,328 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 173 transitions.
[2024-06-20 20:09:23,330 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4576719576719577
[2024-06-20 20:09:23,330 INFO  L175             Difference]: Start difference. First operand has 209 places, 291 transitions, 3726 flow. Second operand 9 states and 173 transitions.
[2024-06-20 20:09:23,330 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 318 transitions, 4534 flow
[2024-06-20 20:09:23,505 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 318 transitions, 4401 flow, removed 49 selfloop flow, removed 4 redundant places.
[2024-06-20 20:09:23,529 INFO  L231             Difference]: Finished difference. Result has 217 places, 299 transitions, 3839 flow
[2024-06-20 20:09:23,529 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3593, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=254, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3839, PETRI_PLACES=217, PETRI_TRANSITIONS=299}
[2024-06-20 20:09:23,530 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 174 predicate places.
[2024-06-20 20:09:23,530 INFO  L495      AbstractCegarLoop]: Abstraction has has 217 places, 299 transitions, 3839 flow
[2024-06-20 20:09:23,530 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-20 20:09:23,530 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:09:23,530 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:09:23,530 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49
[2024-06-20 20:09:23,530 INFO  L420      AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:09:23,531 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:09:23,531 INFO  L85        PathProgramCache]: Analyzing trace with hash 441460965, now seen corresponding path program 2 times
[2024-06-20 20:09:23,531 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:09:23,531 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175518352]
[2024-06-20 20:09:23,531 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:09:23,532 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:09:23,619 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:09:32,716 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:09:32,717 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:09:32,717 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175518352]
[2024-06-20 20:09:32,717 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175518352] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:09:32,717 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:09:32,717 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 20:09:32,717 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627715629]
[2024-06-20 20:09:32,717 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:09:32,718 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 20:09:32,718 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:09:32,718 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 20:09:32,718 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-20 20:09:32,928 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 42
[2024-06-20 20:09:32,929 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 299 transitions, 3839 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-20 20:09:32,929 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:09:32,929 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 42
[2024-06-20 20:09:32,929 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:09:34,033 INFO  L124   PetriNetUnfolderBase]: 2229/3735 cut-off events.
[2024-06-20 20:09:34,033 INFO  L125   PetriNetUnfolderBase]: For 163531/163531 co-relation queries the response was YES.
[2024-06-20 20:09:34,055 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 26831 conditions, 3735 events. 2229/3735 cut-off events. For 163531/163531 co-relation queries the response was YES. Maximal size of possible extension queue 252. Compared 23009 event pairs, 512 based on Foata normal form. 4/3731 useless extension candidates. Maximal degree in co-relation 26731. Up to 3282 conditions per place. 
[2024-06-20 20:09:34,067 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 265 selfloop transitions, 56 changer transitions 0/328 dead transitions.
[2024-06-20 20:09:34,068 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 328 transitions, 4724 flow
[2024-06-20 20:09:34,068 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 20:09:34,068 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 20:09:34,069 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 173 transitions.
[2024-06-20 20:09:34,069 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4576719576719577
[2024-06-20 20:09:34,069 INFO  L175             Difference]: Start difference. First operand has 217 places, 299 transitions, 3839 flow. Second operand 9 states and 173 transitions.
[2024-06-20 20:09:34,069 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 328 transitions, 4724 flow
[2024-06-20 20:09:34,289 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 328 transitions, 4612 flow, removed 34 selfloop flow, removed 4 redundant places.
[2024-06-20 20:09:34,293 INFO  L231             Difference]: Finished difference. Result has 226 places, 311 transitions, 4107 flow
[2024-06-20 20:09:34,293 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3727, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=243, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4107, PETRI_PLACES=226, PETRI_TRANSITIONS=311}
[2024-06-20 20:09:34,293 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 183 predicate places.
[2024-06-20 20:09:34,294 INFO  L495      AbstractCegarLoop]: Abstraction has has 226 places, 311 transitions, 4107 flow
[2024-06-20 20:09:34,294 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-20 20:09:34,294 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:09:34,294 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:09:34,294 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50
[2024-06-20 20:09:34,294 INFO  L420      AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:09:34,294 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:09:34,295 INFO  L85        PathProgramCache]: Analyzing trace with hash -2076766557, now seen corresponding path program 3 times
[2024-06-20 20:09:34,295 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:09:34,295 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592012056]
[2024-06-20 20:09:34,295 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:09:34,295 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:09:34,332 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:09:44,444 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:09:44,444 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:09:44,444 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592012056]
[2024-06-20 20:09:44,444 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592012056] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:09:44,445 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:09:44,445 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-20 20:09:44,445 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768383441]
[2024-06-20 20:09:44,445 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:09:44,445 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-20 20:09:44,445 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:09:44,445 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-20 20:09:44,445 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110
[2024-06-20 20:09:44,752 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 42
[2024-06-20 20:09:44,752 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 311 transitions, 4107 flow. Second operand  has 11 states, 11 states have (on average 13.454545454545455) internal successors, (148), 11 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:09:44,752 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:09:44,752 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 42
[2024-06-20 20:09:44,752 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:09:46,009 INFO  L124   PetriNetUnfolderBase]: 2360/3965 cut-off events.
[2024-06-20 20:09:46,009 INFO  L125   PetriNetUnfolderBase]: For 193622/193622 co-relation queries the response was YES.
[2024-06-20 20:09:46,033 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 29138 conditions, 3965 events. 2360/3965 cut-off events. For 193622/193622 co-relation queries the response was YES. Maximal size of possible extension queue 268. Compared 24738 event pairs, 513 based on Foata normal form. 12/3967 useless extension candidates. Maximal degree in co-relation 29033. Up to 3171 conditions per place. 
[2024-06-20 20:09:46,047 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 215 selfloop transitions, 129 changer transitions 0/351 dead transitions.
[2024-06-20 20:09:46,048 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 351 transitions, 5370 flow
[2024-06-20 20:09:46,048 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 20:09:46,048 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 20:09:46,048 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 207 transitions.
[2024-06-20 20:09:46,049 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4928571428571429
[2024-06-20 20:09:46,049 INFO  L175             Difference]: Start difference. First operand has 226 places, 311 transitions, 4107 flow. Second operand 10 states and 207 transitions.
[2024-06-20 20:09:46,049 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 351 transitions, 5370 flow
[2024-06-20 20:09:46,286 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 351 transitions, 5244 flow, removed 37 selfloop flow, removed 3 redundant places.
[2024-06-20 20:09:46,291 INFO  L231             Difference]: Finished difference. Result has 235 places, 323 transitions, 4552 flow
[2024-06-20 20:09:46,291 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3981, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=311, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=120, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4552, PETRI_PLACES=235, PETRI_TRANSITIONS=323}
[2024-06-20 20:09:46,291 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 192 predicate places.
[2024-06-20 20:09:46,291 INFO  L495      AbstractCegarLoop]: Abstraction has has 235 places, 323 transitions, 4552 flow
[2024-06-20 20:09:46,292 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 13.454545454545455) internal successors, (148), 11 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:09:46,292 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:09:46,292 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:09:46,292 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51
[2024-06-20 20:09:46,292 INFO  L420      AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:09:46,292 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:09:46,292 INFO  L85        PathProgramCache]: Analyzing trace with hash -2077092987, now seen corresponding path program 4 times
[2024-06-20 20:09:46,293 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:09:46,293 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394647574]
[2024-06-20 20:09:46,293 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:09:46,293 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:09:46,336 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:09:56,096 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:09:56,097 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:09:56,097 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394647574]
[2024-06-20 20:09:56,097 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394647574] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:09:56,097 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:09:56,097 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-20 20:09:56,097 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761989830]
[2024-06-20 20:09:56,097 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:09:56,098 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-20 20:09:56,099 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:09:56,099 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-20 20:09:56,099 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110
[2024-06-20 20:09:56,320 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 42
[2024-06-20 20:09:56,321 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 323 transitions, 4552 flow. Second operand  has 11 states, 11 states have (on average 13.454545454545455) internal successors, (148), 11 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:09:56,321 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:09:56,321 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 42
[2024-06-20 20:09:56,321 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:09:57,621 INFO  L124   PetriNetUnfolderBase]: 2404/4014 cut-off events.
[2024-06-20 20:09:57,621 INFO  L125   PetriNetUnfolderBase]: For 205271/205271 co-relation queries the response was YES.
[2024-06-20 20:09:57,645 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 30451 conditions, 4014 events. 2404/4014 cut-off events. For 205271/205271 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 24926 event pairs, 551 based on Foata normal form. 12/4016 useless extension candidates. Maximal degree in co-relation 30343. Up to 3409 conditions per place. 
[2024-06-20 20:09:57,659 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 223 selfloop transitions, 119 changer transitions 0/349 dead transitions.
[2024-06-20 20:09:57,659 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 349 transitions, 5536 flow
[2024-06-20 20:09:57,659 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 20:09:57,660 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 20:09:57,660 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 203 transitions.
[2024-06-20 20:09:57,660 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.48333333333333334
[2024-06-20 20:09:57,660 INFO  L175             Difference]: Start difference. First operand has 235 places, 323 transitions, 4552 flow. Second operand 10 states and 203 transitions.
[2024-06-20 20:09:57,660 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 349 transitions, 5536 flow
[2024-06-20 20:09:57,915 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 349 transitions, 5324 flow, removed 45 selfloop flow, removed 5 redundant places.
[2024-06-20 20:09:57,919 INFO  L231             Difference]: Finished difference. Result has 240 places, 326 transitions, 4686 flow
[2024-06-20 20:09:57,919 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4354, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=323, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=116, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4686, PETRI_PLACES=240, PETRI_TRANSITIONS=326}
[2024-06-20 20:09:57,919 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 197 predicate places.
[2024-06-20 20:09:57,919 INFO  L495      AbstractCegarLoop]: Abstraction has has 240 places, 326 transitions, 4686 flow
[2024-06-20 20:09:57,920 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 13.454545454545455) internal successors, (148), 11 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:09:57,920 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:09:57,920 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 20:09:57,920 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52
[2024-06-20 20:09:57,920 INFO  L420      AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:09:57,920 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:09:57,920 INFO  L85        PathProgramCache]: Analyzing trace with hash -371925339, now seen corresponding path program 5 times
[2024-06-20 20:09:57,921 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:09:57,921 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210502758]
[2024-06-20 20:09:57,921 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:09:57,921 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:09:57,957 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:10:07,631 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:10:07,631 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:10:07,631 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210502758]
[2024-06-20 20:10:07,631 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210502758] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:10:07,631 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:10:07,631 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 20:10:07,631 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150706731]
[2024-06-20 20:10:07,631 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:10:07,631 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 20:10:07,631 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:10:07,632 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 20:10:07,632 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-20 20:10:07,797 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 42
[2024-06-20 20:10:07,798 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 326 transitions, 4686 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-20 20:10:07,798 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:10:07,798 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 42
[2024-06-20 20:10:07,798 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:10:08,933 INFO  L124   PetriNetUnfolderBase]: 2394/4006 cut-off events.
[2024-06-20 20:10:08,934 INFO  L125   PetriNetUnfolderBase]: For 193904/193904 co-relation queries the response was YES.
[2024-06-20 20:10:08,961 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 30096 conditions, 4006 events. 2394/4006 cut-off events. For 193904/193904 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 24956 event pairs, 552 based on Foata normal form. 4/4002 useless extension candidates. Maximal degree in co-relation 29986. Up to 3537 conditions per place. 
[2024-06-20 20:10:08,976 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 277 selfloop transitions, 63 changer transitions 0/347 dead transitions.
[2024-06-20 20:10:08,976 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 347 transitions, 5494 flow
[2024-06-20 20:10:08,977 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 20:10:08,977 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 20:10:08,977 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 173 transitions.
[2024-06-20 20:10:08,977 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4576719576719577
[2024-06-20 20:10:08,977 INFO  L175             Difference]: Start difference. First operand has 240 places, 326 transitions, 4686 flow. Second operand 9 states and 173 transitions.
[2024-06-20 20:10:08,978 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 347 transitions, 5494 flow
[2024-06-20 20:10:09,337 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 347 transitions, 5207 flow, removed 26 selfloop flow, removed 7 redundant places.
[2024-06-20 20:10:09,341 INFO  L231             Difference]: Finished difference. Result has 243 places, 330 transitions, 4611 flow
[2024-06-20 20:10:09,341 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4403, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=326, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=263, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4611, PETRI_PLACES=243, PETRI_TRANSITIONS=330}
[2024-06-20 20:10:09,342 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 200 predicate places.
[2024-06-20 20:10:09,342 INFO  L495      AbstractCegarLoop]: Abstraction has has 243 places, 330 transitions, 4611 flow
[2024-06-20 20:10:09,342 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-20 20:10:09,342 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:10:09,342 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-20 20:10:09,342 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53
[2024-06-20 20:10:09,342 INFO  L420      AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:10:09,343 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:10:09,343 INFO  L85        PathProgramCache]: Analyzing trace with hash 512142778, now seen corresponding path program 1 times
[2024-06-20 20:10:09,343 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:10:09,343 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196979064]
[2024-06-20 20:10:09,343 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:10:09,343 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:10:09,375 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:10:18,006 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:10:18,006 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:10:18,006 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196979064]
[2024-06-20 20:10:18,006 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196979064] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:10:18,006 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:10:18,006 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 20:10:18,007 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074297983]
[2024-06-20 20:10:18,007 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:10:18,007 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 20:10:18,007 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:10:18,007 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 20:10:18,007 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-20 20:10:18,212 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 42
[2024-06-20 20:10:18,212 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 330 transitions, 4611 flow. Second operand  has 10 states, 10 states have (on average 13.5) internal successors, (135), 10 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:10:18,212 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:10:18,212 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 42
[2024-06-20 20:10:18,212 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:10:19,484 INFO  L124   PetriNetUnfolderBase]: 2382/3990 cut-off events.
[2024-06-20 20:10:19,484 INFO  L125   PetriNetUnfolderBase]: For 192575/192577 co-relation queries the response was YES.
[2024-06-20 20:10:19,508 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 29704 conditions, 3990 events. 2382/3990 cut-off events. For 192575/192577 co-relation queries the response was YES. Maximal size of possible extension queue 268. Compared 24846 event pairs, 543 based on Foata normal form. 2/3990 useless extension candidates. Maximal degree in co-relation 29592. Up to 3564 conditions per place. 
[2024-06-20 20:10:19,521 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 292 selfloop transitions, 52 changer transitions 0/351 dead transitions.
[2024-06-20 20:10:19,522 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 351 transitions, 5381 flow
[2024-06-20 20:10:19,522 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 20:10:19,522 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 20:10:19,523 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 163 transitions.
[2024-06-20 20:10:19,523 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4851190476190476
[2024-06-20 20:10:19,523 INFO  L175             Difference]: Start difference. First operand has 243 places, 330 transitions, 4611 flow. Second operand 8 states and 163 transitions.
[2024-06-20 20:10:19,523 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 351 transitions, 5381 flow
[2024-06-20 20:10:19,767 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 351 transitions, 5229 flow, removed 49 selfloop flow, removed 3 redundant places.
[2024-06-20 20:10:19,771 INFO  L231             Difference]: Finished difference. Result has 248 places, 330 transitions, 4581 flow
[2024-06-20 20:10:19,772 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4461, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=330, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=278, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4581, PETRI_PLACES=248, PETRI_TRANSITIONS=330}
[2024-06-20 20:10:19,772 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 205 predicate places.
[2024-06-20 20:10:19,772 INFO  L495      AbstractCegarLoop]: Abstraction has has 248 places, 330 transitions, 4581 flow
[2024-06-20 20:10:19,772 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 13.5) internal successors, (135), 10 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:10:19,772 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:10:19,772 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-20 20:10:19,773 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54
[2024-06-20 20:10:19,773 INFO  L420      AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:10:19,773 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:10:19,773 INFO  L85        PathProgramCache]: Analyzing trace with hash -1398621190, now seen corresponding path program 2 times
[2024-06-20 20:10:19,773 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:10:19,773 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832248642]
[2024-06-20 20:10:19,773 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:10:19,773 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:10:19,809 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:10:28,064 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:10:28,064 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:10:28,064 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832248642]
[2024-06-20 20:10:28,064 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832248642] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:10:28,065 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:10:28,065 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 20:10:28,065 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940949427]
[2024-06-20 20:10:28,065 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:10:28,065 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 20:10:28,065 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:10:28,065 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 20:10:28,066 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90
[2024-06-20 20:10:28,191 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 42
[2024-06-20 20:10:28,191 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 330 transitions, 4581 flow. Second operand  has 10 states, 10 states have (on average 13.5) internal successors, (135), 10 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:10:28,191 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:10:28,191 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 42
[2024-06-20 20:10:28,191 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:10:29,514 INFO  L124   PetriNetUnfolderBase]: 2392/4002 cut-off events.
[2024-06-20 20:10:29,515 INFO  L125   PetriNetUnfolderBase]: For 197515/197517 co-relation queries the response was YES.
[2024-06-20 20:10:29,540 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 29781 conditions, 4002 events. 2392/4002 cut-off events. For 197515/197517 co-relation queries the response was YES. Maximal size of possible extension queue 268. Compared 24919 event pairs, 542 based on Foata normal form. 2/4002 useless extension candidates. Maximal degree in co-relation 29668. Up to 3576 conditions per place. 
[2024-06-20 20:10:29,553 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 322 selfloop transitions, 35 changer transitions 0/364 dead transitions.
[2024-06-20 20:10:29,553 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 364 transitions, 5469 flow
[2024-06-20 20:10:29,554 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 20:10:29,554 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 20:10:29,554 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 201 transitions.
[2024-06-20 20:10:29,554 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4785714285714286
[2024-06-20 20:10:29,554 INFO  L175             Difference]: Start difference. First operand has 248 places, 330 transitions, 4581 flow. Second operand 10 states and 201 transitions.
[2024-06-20 20:10:29,554 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 364 transitions, 5469 flow
[2024-06-20 20:10:29,806 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 364 transitions, 5149 flow, removed 8 selfloop flow, removed 9 redundant places.
[2024-06-20 20:10:29,811 INFO  L231             Difference]: Finished difference. Result has 249 places, 333 transitions, 4407 flow
[2024-06-20 20:10:29,811 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4261, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=330, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=295, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4407, PETRI_PLACES=249, PETRI_TRANSITIONS=333}
[2024-06-20 20:10:29,811 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 206 predicate places.
[2024-06-20 20:10:29,811 INFO  L495      AbstractCegarLoop]: Abstraction has has 249 places, 333 transitions, 4407 flow
[2024-06-20 20:10:29,811 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 13.5) internal successors, (135), 10 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:10:29,811 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:10:29,812 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-20 20:10:29,812 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55
[2024-06-20 20:10:29,812 INFO  L420      AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:10:29,812 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:10:29,812 INFO  L85        PathProgramCache]: Analyzing trace with hash -1398235240, now seen corresponding path program 3 times
[2024-06-20 20:10:29,813 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:10:29,813 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21084926]
[2024-06-20 20:10:29,813 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:10:29,813 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:10:29,848 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:10:38,283 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:10:38,283 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:10:38,283 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21084926]
[2024-06-20 20:10:38,283 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21084926] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:10:38,284 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:10:38,284 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 20:10:38,284 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990011035]
[2024-06-20 20:10:38,284 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:10:38,284 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 20:10:38,284 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:10:38,284 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 20:10:38,285 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2024-06-20 20:10:38,470 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 42
[2024-06-20 20:10:38,470 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 333 transitions, 4407 flow. Second operand  has 10 states, 10 states have (on average 13.5) internal successors, (135), 10 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:10:38,470 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:10:38,470 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 42
[2024-06-20 20:10:38,470 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:10:39,683 INFO  L124   PetriNetUnfolderBase]: 2402/4024 cut-off events.
[2024-06-20 20:10:39,684 INFO  L125   PetriNetUnfolderBase]: For 196313/196315 co-relation queries the response was YES.
[2024-06-20 20:10:39,712 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 30202 conditions, 4024 events. 2402/4024 cut-off events. For 196313/196315 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 25029 event pairs, 542 based on Foata normal form. 2/4024 useless extension candidates. Maximal degree in co-relation 30088. Up to 3570 conditions per place. 
[2024-06-20 20:10:39,726 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 312 selfloop transitions, 47 changer transitions 0/366 dead transitions.
[2024-06-20 20:10:39,727 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 366 transitions, 5329 flow
[2024-06-20 20:10:39,727 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 20:10:39,727 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 20:10:39,727 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 200 transitions.
[2024-06-20 20:10:39,728 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.47619047619047616
[2024-06-20 20:10:39,728 INFO  L175             Difference]: Start difference. First operand has 249 places, 333 transitions, 4407 flow. Second operand 10 states and 200 transitions.
[2024-06-20 20:10:39,728 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 366 transitions, 5329 flow
[2024-06-20 20:10:40,025 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 366 transitions, 5171 flow, removed 30 selfloop flow, removed 9 redundant places.
[2024-06-20 20:10:40,029 INFO  L231             Difference]: Finished difference. Result has 250 places, 336 transitions, 4426 flow
[2024-06-20 20:10:40,029 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4249, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=333, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=286, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4426, PETRI_PLACES=250, PETRI_TRANSITIONS=336}
[2024-06-20 20:10:40,029 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 207 predicate places.
[2024-06-20 20:10:40,030 INFO  L495      AbstractCegarLoop]: Abstraction has has 250 places, 336 transitions, 4426 flow
[2024-06-20 20:10:40,030 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 13.5) internal successors, (135), 10 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:10:40,030 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:10:40,030 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-20 20:10:40,030 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56
[2024-06-20 20:10:40,030 INFO  L420      AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:10:40,030 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:10:40,030 INFO  L85        PathProgramCache]: Analyzing trace with hash 778277498, now seen corresponding path program 4 times
[2024-06-20 20:10:40,031 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:10:40,031 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813292834]
[2024-06-20 20:10:40,031 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:10:40,031 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:10:40,078 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:10:49,465 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:10:49,466 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:10:49,466 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813292834]
[2024-06-20 20:10:49,466 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813292834] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:10:49,466 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:10:49,466 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 20:10:49,466 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56974403]
[2024-06-20 20:10:49,466 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:10:49,467 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 20:10:49,467 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:10:49,467 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 20:10:49,467 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-20 20:10:49,655 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 42
[2024-06-20 20:10:49,655 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 336 transitions, 4426 flow. Second operand  has 10 states, 10 states have (on average 13.5) internal successors, (135), 10 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:10:49,655 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:10:49,656 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 42
[2024-06-20 20:10:49,656 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:10:50,863 INFO  L124   PetriNetUnfolderBase]: 2412/4040 cut-off events.
[2024-06-20 20:10:50,863 INFO  L125   PetriNetUnfolderBase]: For 204896/204898 co-relation queries the response was YES.
[2024-06-20 20:10:50,892 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 30736 conditions, 4040 events. 2412/4040 cut-off events. For 204896/204898 co-relation queries the response was YES. Maximal size of possible extension queue 273. Compared 25153 event pairs, 542 based on Foata normal form. 2/4040 useless extension candidates. Maximal degree in co-relation 30621. Up to 3632 conditions per place. 
[2024-06-20 20:10:50,905 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 305 selfloop transitions, 44 changer transitions 0/356 dead transitions.
[2024-06-20 20:10:50,906 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 356 transitions, 5274 flow
[2024-06-20 20:10:50,906 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 20:10:50,906 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 20:10:50,906 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 141 transitions.
[2024-06-20 20:10:50,907 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.47959183673469385
[2024-06-20 20:10:50,907 INFO  L175             Difference]: Start difference. First operand has 250 places, 336 transitions, 4426 flow. Second operand 7 states and 141 transitions.
[2024-06-20 20:10:50,907 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 356 transitions, 5274 flow
[2024-06-20 20:10:51,219 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 356 transitions, 5123 flow, removed 31 selfloop flow, removed 8 redundant places.
[2024-06-20 20:10:51,226 INFO  L231             Difference]: Finished difference. Result has 249 places, 339 transitions, 4466 flow
[2024-06-20 20:10:51,227 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4275, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=336, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=292, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4466, PETRI_PLACES=249, PETRI_TRANSITIONS=339}
[2024-06-20 20:10:51,227 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 206 predicate places.
[2024-06-20 20:10:51,227 INFO  L495      AbstractCegarLoop]: Abstraction has has 249 places, 339 transitions, 4466 flow
[2024-06-20 20:10:51,227 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 13.5) internal successors, (135), 10 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:10:51,227 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:10:51,227 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-20 20:10:51,227 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57
[2024-06-20 20:10:51,228 INFO  L420      AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:10:51,229 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:10:51,229 INFO  L85        PathProgramCache]: Analyzing trace with hash 151670432, now seen corresponding path program 5 times
[2024-06-20 20:10:51,229 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:10:51,229 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732682025]
[2024-06-20 20:10:51,229 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:10:51,230 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:10:51,261 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:10:59,967 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:10:59,968 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:10:59,968 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732682025]
[2024-06-20 20:10:59,968 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732682025] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:10:59,968 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:10:59,968 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 20:10:59,968 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805995885]
[2024-06-20 20:10:59,968 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:10:59,969 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 20:10:59,969 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:10:59,969 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 20:10:59,969 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2024-06-20 20:11:00,085 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 42
[2024-06-20 20:11:00,085 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 339 transitions, 4466 flow. Second operand  has 10 states, 10 states have (on average 13.5) internal successors, (135), 10 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:11:00,085 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:11:00,085 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 42
[2024-06-20 20:11:00,085 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:11:01,417 INFO  L124   PetriNetUnfolderBase]: 2438/4088 cut-off events.
[2024-06-20 20:11:01,417 INFO  L125   PetriNetUnfolderBase]: For 217645/217647 co-relation queries the response was YES.
[2024-06-20 20:11:01,445 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 31662 conditions, 4088 events. 2438/4088 cut-off events. For 217645/217647 co-relation queries the response was YES. Maximal size of possible extension queue 280. Compared 25580 event pairs, 543 based on Foata normal form. 2/4088 useless extension candidates. Maximal degree in co-relation 31546. Up to 3551 conditions per place. 
[2024-06-20 20:11:01,458 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 285 selfloop transitions, 83 changer transitions 0/375 dead transitions.
[2024-06-20 20:11:01,459 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 375 transitions, 5632 flow
[2024-06-20 20:11:01,459 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 20:11:01,459 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 20:11:01,460 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 200 transitions.
[2024-06-20 20:11:01,460 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.47619047619047616
[2024-06-20 20:11:01,460 INFO  L175             Difference]: Start difference. First operand has 249 places, 339 transitions, 4466 flow. Second operand 10 states and 200 transitions.
[2024-06-20 20:11:01,460 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 375 transitions, 5632 flow
[2024-06-20 20:11:01,768 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 375 transitions, 5487 flow, removed 31 selfloop flow, removed 6 redundant places.
[2024-06-20 20:11:01,772 INFO  L231             Difference]: Finished difference. Result has 253 places, 345 transitions, 4666 flow
[2024-06-20 20:11:01,772 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4323, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=339, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=259, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4666, PETRI_PLACES=253, PETRI_TRANSITIONS=345}
[2024-06-20 20:11:01,773 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 210 predicate places.
[2024-06-20 20:11:01,773 INFO  L495      AbstractCegarLoop]: Abstraction has has 253 places, 345 transitions, 4666 flow
[2024-06-20 20:11:01,773 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 13.5) internal successors, (135), 10 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:11:01,773 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:11:01,773 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-20 20:11:01,773 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58
[2024-06-20 20:11:01,773 INFO  L420      AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:11:01,774 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:11:01,774 INFO  L85        PathProgramCache]: Analyzing trace with hash -1693453320, now seen corresponding path program 1 times
[2024-06-20 20:11:01,774 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:11:01,774 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978549272]
[2024-06-20 20:11:01,774 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:11:01,774 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:11:01,810 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:11:10,239 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:11:10,239 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:11:10,239 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978549272]
[2024-06-20 20:11:10,239 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978549272] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:11:10,239 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:11:10,239 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 20:11:10,239 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664279739]
[2024-06-20 20:11:10,239 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:11:10,239 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 20:11:10,240 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:11:10,240 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 20:11:10,240 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-06-20 20:11:10,383 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 42
[2024-06-20 20:11:10,384 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 345 transitions, 4666 flow. Second operand  has 10 states, 10 states have (on average 13.5) internal successors, (135), 10 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:11:10,384 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:11:10,384 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 42
[2024-06-20 20:11:10,384 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:11:11,606 INFO  L124   PetriNetUnfolderBase]: 2446/4094 cut-off events.
[2024-06-20 20:11:11,606 INFO  L125   PetriNetUnfolderBase]: For 222342/222344 co-relation queries the response was YES.
[2024-06-20 20:11:11,633 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 32170 conditions, 4094 events. 2446/4094 cut-off events. For 222342/222344 co-relation queries the response was YES. Maximal size of possible extension queue 278. Compared 25585 event pairs, 447 based on Foata normal form. 2/4094 useless extension candidates. Maximal degree in co-relation 32054. Up to 3678 conditions per place. 
[2024-06-20 20:11:11,645 INFO  L140   encePairwiseOnDemand]: 34/42 looper letters, 341 selfloop transitions, 19 changer transitions 0/367 dead transitions.
[2024-06-20 20:11:11,645 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 367 transitions, 5492 flow
[2024-06-20 20:11:11,646 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 20:11:11,646 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 20:11:11,646 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 141 transitions.
[2024-06-20 20:11:11,646 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.47959183673469385
[2024-06-20 20:11:11,646 INFO  L175             Difference]: Start difference. First operand has 253 places, 345 transitions, 4666 flow. Second operand 7 states and 141 transitions.
[2024-06-20 20:11:11,646 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 367 transitions, 5492 flow
[2024-06-20 20:11:12,001 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 367 transitions, 5350 flow, removed 42 selfloop flow, removed 6 redundant places.
[2024-06-20 20:11:12,005 INFO  L231             Difference]: Finished difference. Result has 254 places, 347 transitions, 4619 flow
[2024-06-20 20:11:12,005 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4524, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=345, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=326, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4619, PETRI_PLACES=254, PETRI_TRANSITIONS=347}
[2024-06-20 20:11:12,007 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 211 predicate places.
[2024-06-20 20:11:12,007 INFO  L495      AbstractCegarLoop]: Abstraction has has 254 places, 347 transitions, 4619 flow
[2024-06-20 20:11:12,007 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 13.5) internal successors, (135), 10 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:11:12,007 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:11:12,007 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-20 20:11:12,007 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59
[2024-06-20 20:11:12,007 INFO  L420      AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:11:12,008 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:11:12,008 INFO  L85        PathProgramCache]: Analyzing trace with hash 407376572, now seen corresponding path program 2 times
[2024-06-20 20:11:12,008 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:11:12,008 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375690821]
[2024-06-20 20:11:12,008 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:11:12,008 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:11:12,041 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:11:20,485 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:11:20,486 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:11:20,486 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375690821]
[2024-06-20 20:11:20,486 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375690821] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:11:20,486 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:11:20,486 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 20:11:20,486 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569236830]
[2024-06-20 20:11:20,486 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:11:20,487 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 20:11:20,487 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:11:20,487 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 20:11:20,487 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-06-20 20:11:20,614 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 42
[2024-06-20 20:11:20,614 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 347 transitions, 4619 flow. Second operand  has 10 states, 10 states have (on average 13.5) internal successors, (135), 10 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:11:20,614 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:11:20,614 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 42
[2024-06-20 20:11:20,615 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:11:21,809 INFO  L124   PetriNetUnfolderBase]: 2441/4087 cut-off events.
[2024-06-20 20:11:21,809 INFO  L125   PetriNetUnfolderBase]: For 223972/223974 co-relation queries the response was YES.
[2024-06-20 20:11:21,838 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 32090 conditions, 4087 events. 2441/4087 cut-off events. For 223972/223974 co-relation queries the response was YES. Maximal size of possible extension queue 276. Compared 25575 event pairs, 540 based on Foata normal form. 2/4087 useless extension candidates. Maximal degree in co-relation 31972. Up to 3685 conditions per place. 
[2024-06-20 20:11:21,853 INFO  L140   encePairwiseOnDemand]: 34/42 looper letters, 325 selfloop transitions, 33 changer transitions 0/365 dead transitions.
[2024-06-20 20:11:21,853 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 365 transitions, 5433 flow
[2024-06-20 20:11:21,854 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 20:11:21,854 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 20:11:21,855 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 139 transitions.
[2024-06-20 20:11:21,855 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.47278911564625853
[2024-06-20 20:11:21,855 INFO  L175             Difference]: Start difference. First operand has 254 places, 347 transitions, 4619 flow. Second operand 7 states and 139 transitions.
[2024-06-20 20:11:21,855 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 365 transitions, 5433 flow
[2024-06-20 20:11:22,227 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 365 transitions, 5354 flow, removed 22 selfloop flow, removed 5 redundant places.
[2024-06-20 20:11:22,232 INFO  L231             Difference]: Finished difference. Result has 256 places, 349 transitions, 4670 flow
[2024-06-20 20:11:22,232 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4540, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=347, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=314, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4670, PETRI_PLACES=256, PETRI_TRANSITIONS=349}
[2024-06-20 20:11:22,232 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 213 predicate places.
[2024-06-20 20:11:22,232 INFO  L495      AbstractCegarLoop]: Abstraction has has 256 places, 349 transitions, 4670 flow
[2024-06-20 20:11:22,233 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 13.5) internal successors, (135), 10 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:11:22,233 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:11:22,233 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-20 20:11:22,233 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60
[2024-06-20 20:11:22,233 INFO  L420      AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:11:22,233 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:11:22,233 INFO  L85        PathProgramCache]: Analyzing trace with hash -1402989896, now seen corresponding path program 1 times
[2024-06-20 20:11:22,233 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:11:22,234 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70745298]
[2024-06-20 20:11:22,234 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:11:22,234 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:11:22,284 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:11:31,232 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:11:31,232 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:11:31,232 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70745298]
[2024-06-20 20:11:31,233 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70745298] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:11:31,233 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:11:31,233 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 20:11:31,233 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253291200]
[2024-06-20 20:11:31,233 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:11:31,235 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 20:11:31,235 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:11:31,235 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 20:11:31,235 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72
[2024-06-20 20:11:31,333 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 42
[2024-06-20 20:11:31,333 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 349 transitions, 4670 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-20 20:11:31,333 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:11:31,333 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 42
[2024-06-20 20:11:31,333 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:11:32,619 INFO  L124   PetriNetUnfolderBase]: 2446/4092 cut-off events.
[2024-06-20 20:11:32,619 INFO  L125   PetriNetUnfolderBase]: For 229094/229094 co-relation queries the response was YES.
[2024-06-20 20:11:32,649 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 32273 conditions, 4092 events. 2446/4092 cut-off events. For 229094/229094 co-relation queries the response was YES. Maximal size of possible extension queue 276. Compared 25533 event pairs, 541 based on Foata normal form. 1/4089 useless extension candidates. Maximal degree in co-relation 32154. Up to 3677 conditions per place. 
[2024-06-20 20:11:32,664 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 338 selfloop transitions, 31 changer transitions 0/376 dead transitions.
[2024-06-20 20:11:32,664 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 376 transitions, 5532 flow
[2024-06-20 20:11:32,665 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 20:11:32,665 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 20:11:32,665 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 163 transitions.
[2024-06-20 20:11:32,665 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4851190476190476
[2024-06-20 20:11:32,666 INFO  L175             Difference]: Start difference. First operand has 256 places, 349 transitions, 4670 flow. Second operand 8 states and 163 transitions.
[2024-06-20 20:11:32,666 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 376 transitions, 5532 flow
[2024-06-20 20:11:33,068 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 376 transitions, 5424 flow, removed 24 selfloop flow, removed 5 redundant places.
[2024-06-20 20:11:33,072 INFO  L231             Difference]: Finished difference. Result has 259 places, 352 transitions, 4684 flow
[2024-06-20 20:11:33,073 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4562, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=349, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=318, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4684, PETRI_PLACES=259, PETRI_TRANSITIONS=352}
[2024-06-20 20:11:33,073 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 216 predicate places.
[2024-06-20 20:11:33,073 INFO  L495      AbstractCegarLoop]: Abstraction has has 259 places, 352 transitions, 4684 flow
[2024-06-20 20:11:33,073 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-20 20:11:33,073 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:11:33,073 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-20 20:11:33,073 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61
[2024-06-20 20:11:33,074 INFO  L420      AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:11:33,074 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:11:33,074 INFO  L85        PathProgramCache]: Analyzing trace with hash 1110598274, now seen corresponding path program 6 times
[2024-06-20 20:11:33,074 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:11:33,074 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751362381]
[2024-06-20 20:11:33,074 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:11:33,074 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:11:33,106 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:11:42,052 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:11:42,052 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:11:42,052 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751362381]
[2024-06-20 20:11:42,052 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751362381] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:11:42,052 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:11:42,053 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 20:11:42,053 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98463283]
[2024-06-20 20:11:42,053 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:11:42,053 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 20:11:42,053 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:11:42,053 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 20:11:42,053 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-06-20 20:11:42,219 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 42
[2024-06-20 20:11:42,219 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 352 transitions, 4684 flow. Second operand  has 10 states, 10 states have (on average 13.5) internal successors, (135), 10 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:11:42,219 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:11:42,220 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 42
[2024-06-20 20:11:42,220 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:11:43,474 INFO  L124   PetriNetUnfolderBase]: 2483/4155 cut-off events.
[2024-06-20 20:11:43,474 INFO  L125   PetriNetUnfolderBase]: For 239371/239371 co-relation queries the response was YES.
[2024-06-20 20:11:43,506 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 32776 conditions, 4155 events. 2483/4155 cut-off events. For 239371/239371 co-relation queries the response was YES. Maximal size of possible extension queue 284. Compared 26090 event pairs, 545 based on Foata normal form. 3/4151 useless extension candidates. Maximal degree in co-relation 32656. Up to 3628 conditions per place. 
[2024-06-20 20:11:43,521 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 324 selfloop transitions, 61 changer transitions 0/392 dead transitions.
[2024-06-20 20:11:43,521 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 392 transitions, 5806 flow
[2024-06-20 20:11:43,528 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 20:11:43,528 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 20:11:43,528 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 199 transitions.
[2024-06-20 20:11:43,528 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4738095238095238
[2024-06-20 20:11:43,528 INFO  L175             Difference]: Start difference. First operand has 259 places, 352 transitions, 4684 flow. Second operand 10 states and 199 transitions.
[2024-06-20 20:11:43,528 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 392 transitions, 5806 flow
[2024-06-20 20:11:43,936 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 392 transitions, 5697 flow, removed 16 selfloop flow, removed 7 redundant places.
[2024-06-20 20:11:43,941 INFO  L231             Difference]: Finished difference. Result has 265 places, 366 transitions, 5008 flow
[2024-06-20 20:11:43,941 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4579, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=352, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=292, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5008, PETRI_PLACES=265, PETRI_TRANSITIONS=366}
[2024-06-20 20:11:43,941 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 222 predicate places.
[2024-06-20 20:11:43,942 INFO  L495      AbstractCegarLoop]: Abstraction has has 265 places, 366 transitions, 5008 flow
[2024-06-20 20:11:43,942 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 13.5) internal successors, (135), 10 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:11:43,942 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:11:43,942 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-20 20:11:43,942 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62
[2024-06-20 20:11:43,942 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-20 20:11:43,942 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:11:43,942 INFO  L85        PathProgramCache]: Analyzing trace with hash 326260632, now seen corresponding path program 7 times
[2024-06-20 20:11:43,943 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:11:43,943 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107589273]
[2024-06-20 20:11:43,943 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:11:43,943 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:11:43,978 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:11:52,251 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:11:52,251 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:11:52,251 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107589273]
[2024-06-20 20:11:52,251 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107589273] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:11:52,251 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:11:52,251 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 20:11:52,251 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818768079]
[2024-06-20 20:11:52,251 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:11:52,252 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 20:11:52,252 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:11:52,252 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 20:11:52,252 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2024-06-20 20:11:52,471 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 42
[2024-06-20 20:11:52,471 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 366 transitions, 5008 flow. Second operand  has 10 states, 10 states have (on average 13.5) internal successors, (135), 10 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:11:52,471 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:11:52,471 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 42
[2024-06-20 20:11:52,471 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:11:53,729 INFO  L124   PetriNetUnfolderBase]: 2477/4147 cut-off events.
[2024-06-20 20:11:53,729 INFO  L125   PetriNetUnfolderBase]: For 245092/245092 co-relation queries the response was YES.
[2024-06-20 20:11:53,758 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 33214 conditions, 4147 events. 2477/4147 cut-off events. For 245092/245092 co-relation queries the response was YES. Maximal size of possible extension queue 283. Compared 26077 event pairs, 548 based on Foata normal form. 2/4139 useless extension candidates. Maximal degree in co-relation 33090. Up to 3683 conditions per place. 
[2024-06-20 20:11:53,772 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 336 selfloop transitions, 42 changer transitions 0/385 dead transitions.
[2024-06-20 20:11:53,772 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 385 transitions, 5864 flow
[2024-06-20 20:11:53,773 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 20:11:53,773 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 20:11:53,773 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 161 transitions.
[2024-06-20 20:11:53,774 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4791666666666667
[2024-06-20 20:11:53,774 INFO  L175             Difference]: Start difference. First operand has 265 places, 366 transitions, 5008 flow. Second operand 8 states and 161 transitions.
[2024-06-20 20:11:53,775 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 385 transitions, 5864 flow
[2024-06-20 20:11:54,147 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 385 transitions, 5597 flow, removed 92 selfloop flow, removed 5 redundant places.
[2024-06-20 20:11:54,152 INFO  L231             Difference]: Finished difference. Result has 268 places, 366 transitions, 4832 flow
[2024-06-20 20:11:54,152 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4741, PETRI_DIFFERENCE_MINUEND_PLACES=260, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=366, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=324, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4832, PETRI_PLACES=268, PETRI_TRANSITIONS=366}
[2024-06-20 20:11:54,153 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 225 predicate places.
[2024-06-20 20:11:54,153 INFO  L495      AbstractCegarLoop]: Abstraction has has 268 places, 366 transitions, 4832 flow
[2024-06-20 20:11:54,154 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 13.5) internal successors, (135), 10 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:11:54,154 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:11:54,154 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-20 20:11:54,154 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63
[2024-06-20 20:11:54,154 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-20 20:11:54,154 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:11:54,154 INFO  L85        PathProgramCache]: Analyzing trace with hash 2008694842, now seen corresponding path program 8 times
[2024-06-20 20:11:54,154 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:11:54,155 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040632118]
[2024-06-20 20:11:54,155 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:11:54,155 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:11:54,187 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:12:03,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-20 20:12:03,045 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:12:03,045 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040632118]
[2024-06-20 20:12:03,046 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040632118] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:12:03,046 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:12:03,046 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 20:12:03,046 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691768333]
[2024-06-20 20:12:03,046 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:12:03,046 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 20:12:03,046 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:12:03,046 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 20:12:03,046 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2024-06-20 20:12:03,193 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 42
[2024-06-20 20:12:03,193 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 366 transitions, 4832 flow. Second operand  has 10 states, 10 states have (on average 13.5) internal successors, (135), 10 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:12:03,193 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:12:03,193 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 42
[2024-06-20 20:12:03,193 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:12:04,503 INFO  L124   PetriNetUnfolderBase]: 2513/4215 cut-off events.
[2024-06-20 20:12:04,503 INFO  L125   PetriNetUnfolderBase]: For 259020/259024 co-relation queries the response was YES.
[2024-06-20 20:12:04,533 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 33729 conditions, 4215 events. 2513/4215 cut-off events. For 259020/259024 co-relation queries the response was YES. Maximal size of possible extension queue 292. Compared 26633 event pairs, 538 based on Foata normal form. 5/4218 useless extension candidates. Maximal degree in co-relation 33604. Up to 3606 conditions per place. 
[2024-06-20 20:12:04,546 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 321 selfloop transitions, 68 changer transitions 0/396 dead transitions.
[2024-06-20 20:12:04,546 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 396 transitions, 6020 flow
[2024-06-20 20:12:04,546 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 20:12:04,546 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 20:12:04,547 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 184 transitions.
[2024-06-20 20:12:04,547 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.48677248677248675
[2024-06-20 20:12:04,547 INFO  L175             Difference]: Start difference. First operand has 268 places, 366 transitions, 4832 flow. Second operand 9 states and 184 transitions.
[2024-06-20 20:12:04,547 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 396 transitions, 6020 flow
[2024-06-20 20:12:04,944 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 396 transitions, 5763 flow, removed 23 selfloop flow, removed 8 redundant places.
[2024-06-20 20:12:04,948 INFO  L231             Difference]: Finished difference. Result has 269 places, 373 transitions, 4917 flow
[2024-06-20 20:12:04,948 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4585, PETRI_DIFFERENCE_MINUEND_PLACES=260, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=366, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=301, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4917, PETRI_PLACES=269, PETRI_TRANSITIONS=373}
[2024-06-20 20:12:04,949 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 226 predicate places.
[2024-06-20 20:12:04,949 INFO  L495      AbstractCegarLoop]: Abstraction has has 269 places, 373 transitions, 4917 flow
[2024-06-20 20:12:04,949 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 13.5) internal successors, (135), 10 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:12:04,949 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:12:04,949 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-20 20:12:04,949 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64
[2024-06-20 20:12:04,950 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-20 20:12:04,950 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:12:04,951 INFO  L85        PathProgramCache]: Analyzing trace with hash -132921448, now seen corresponding path program 9 times
[2024-06-20 20:12:04,951 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:12:04,951 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60632605]
[2024-06-20 20:12:04,951 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:12:04,951 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:12:04,982 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:12:13,995 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:12:13,995 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:12:13,996 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60632605]
[2024-06-20 20:12:13,996 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60632605] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:12:13,996 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:12:13,996 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 20:12:13,996 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371815414]
[2024-06-20 20:12:13,996 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:12:13,996 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 20:12:13,996 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:12:13,997 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 20:12:13,997 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90
[2024-06-20 20:12:14,220 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 42
[2024-06-20 20:12:14,221 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 373 transitions, 4917 flow. Second operand  has 10 states, 10 states have (on average 13.5) internal successors, (135), 10 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:12:14,221 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:12:14,221 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 42
[2024-06-20 20:12:14,221 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:12:15,537 INFO  L124   PetriNetUnfolderBase]: 2597/4361 cut-off events.
[2024-06-20 20:12:15,537 INFO  L125   PetriNetUnfolderBase]: For 290132/290136 co-relation queries the response was YES.
[2024-06-20 20:12:15,568 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 35758 conditions, 4361 events. 2597/4361 cut-off events. For 290132/290136 co-relation queries the response was YES. Maximal size of possible extension queue 311. Compared 27783 event pairs, 539 based on Foata normal form. 5/4364 useless extension candidates. Maximal degree in co-relation 35634. Up to 3448 conditions per place. 
[2024-06-20 20:12:15,582 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 274 selfloop transitions, 133 changer transitions 0/414 dead transitions.
[2024-06-20 20:12:15,582 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 414 transitions, 6663 flow
[2024-06-20 20:12:15,582 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 20:12:15,583 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 20:12:15,583 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 189 transitions.
[2024-06-20 20:12:15,583 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5
[2024-06-20 20:12:15,583 INFO  L175             Difference]: Start difference. First operand has 269 places, 373 transitions, 4917 flow. Second operand 9 states and 189 transitions.
[2024-06-20 20:12:15,583 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 414 transitions, 6663 flow
[2024-06-20 20:12:15,939 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 414 transitions, 6503 flow, removed 56 selfloop flow, removed 5 redundant places.
[2024-06-20 20:12:15,943 INFO  L231             Difference]: Finished difference. Result has 273 places, 388 transitions, 5461 flow
[2024-06-20 20:12:15,944 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4757, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=373, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=122, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=251, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5461, PETRI_PLACES=273, PETRI_TRANSITIONS=388}
[2024-06-20 20:12:15,944 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 230 predicate places.
[2024-06-20 20:12:15,944 INFO  L495      AbstractCegarLoop]: Abstraction has has 273 places, 388 transitions, 5461 flow
[2024-06-20 20:12:15,944 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 13.5) internal successors, (135), 10 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:12:15,944 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:12:15,944 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-20 20:12:15,945 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65
[2024-06-20 20:12:15,945 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-20 20:12:15,945 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:12:15,945 INFO  L85        PathProgramCache]: Analyzing trace with hash -137683048, now seen corresponding path program 10 times
[2024-06-20 20:12:15,945 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:12:15,945 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289803060]
[2024-06-20 20:12:15,945 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:12:15,945 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:12:15,977 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:12:25,155 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:12:25,155 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:12:25,155 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289803060]
[2024-06-20 20:12:25,155 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289803060] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:12:25,155 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:12:25,156 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 20:12:25,156 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305135904]
[2024-06-20 20:12:25,156 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:12:25,156 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 20:12:25,156 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:12:25,156 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 20:12:25,156 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-20 20:12:25,341 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 42
[2024-06-20 20:12:25,341 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 388 transitions, 5461 flow. Second operand  has 10 states, 10 states have (on average 13.5) internal successors, (135), 10 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:12:25,341 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:12:25,341 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 42
[2024-06-20 20:12:25,341 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:12:26,681 INFO  L124   PetriNetUnfolderBase]: 2585/4333 cut-off events.
[2024-06-20 20:12:26,681 INFO  L125   PetriNetUnfolderBase]: For 294304/294304 co-relation queries the response was YES.
[2024-06-20 20:12:26,713 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 35979 conditions, 4333 events. 2585/4333 cut-off events. For 294304/294304 co-relation queries the response was YES. Maximal size of possible extension queue 308. Compared 27628 event pairs, 550 based on Foata normal form. 4/4327 useless extension candidates. Maximal degree in co-relation 35853. Up to 3848 conditions per place. 
[2024-06-20 20:12:26,728 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 344 selfloop transitions, 48 changer transitions 0/399 dead transitions.
[2024-06-20 20:12:26,728 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 399 transitions, 6287 flow
[2024-06-20 20:12:26,728 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 20:12:26,729 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 20:12:26,729 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 156 transitions.
[2024-06-20 20:12:26,729 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4642857142857143
[2024-06-20 20:12:26,729 INFO  L175             Difference]: Start difference. First operand has 273 places, 388 transitions, 5461 flow. Second operand 8 states and 156 transitions.
[2024-06-20 20:12:26,729 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 399 transitions, 6287 flow
[2024-06-20 20:12:27,197 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 399 transitions, 6023 flow, removed 117 selfloop flow, removed 3 redundant places.
[2024-06-20 20:12:27,202 INFO  L231             Difference]: Finished difference. Result has 278 places, 388 transitions, 5300 flow
[2024-06-20 20:12:27,202 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=5197, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=388, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=340, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5300, PETRI_PLACES=278, PETRI_TRANSITIONS=388}
[2024-06-20 20:12:27,202 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 235 predicate places.
[2024-06-20 20:12:27,202 INFO  L495      AbstractCegarLoop]: Abstraction has has 278 places, 388 transitions, 5300 flow
[2024-06-20 20:12:27,203 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 13.5) internal successors, (135), 10 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:12:27,203 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:12:27,203 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-20 20:12:27,203 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66
[2024-06-20 20:12:27,203 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-20 20:12:27,203 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:12:27,203 INFO  L85        PathProgramCache]: Analyzing trace with hash 39568442, now seen corresponding path program 11 times
[2024-06-20 20:12:27,203 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:12:27,204 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576900231]
[2024-06-20 20:12:27,204 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:12:27,204 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:12:27,236 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:12:35,631 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:12:35,631 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:12:35,632 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576900231]
[2024-06-20 20:12:35,632 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576900231] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:12:35,632 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:12:35,632 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 20:12:35,632 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662583498]
[2024-06-20 20:12:35,632 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:12:35,632 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 20:12:35,632 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:12:35,633 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 20:12:35,633 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90
[2024-06-20 20:12:35,807 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 42
[2024-06-20 20:12:35,807 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 388 transitions, 5300 flow. Second operand  has 10 states, 10 states have (on average 13.5) internal successors, (135), 10 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:12:35,808 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:12:35,808 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 42
[2024-06-20 20:12:35,808 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:12:37,107 INFO  L124   PetriNetUnfolderBase]: 2573/4317 cut-off events.
[2024-06-20 20:12:37,107 INFO  L125   PetriNetUnfolderBase]: For 283050/283050 co-relation queries the response was YES.
[2024-06-20 20:12:37,139 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 34762 conditions, 4317 events. 2573/4317 cut-off events. For 283050/283050 co-relation queries the response was YES. Maximal size of possible extension queue 307. Compared 27525 event pairs, 544 based on Foata normal form. 4/4311 useless extension candidates. Maximal degree in co-relation 34634. Up to 3432 conditions per place. 
[2024-06-20 20:12:37,153 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 269 selfloop transitions, 132 changer transitions 0/408 dead transitions.
[2024-06-20 20:12:37,153 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 408 transitions, 6453 flow
[2024-06-20 20:12:37,154 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 20:12:37,154 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 20:12:37,154 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 185 transitions.
[2024-06-20 20:12:37,154 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4894179894179894
[2024-06-20 20:12:37,154 INFO  L175             Difference]: Start difference. First operand has 278 places, 388 transitions, 5300 flow. Second operand 9 states and 185 transitions.
[2024-06-20 20:12:37,154 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 408 transitions, 6453 flow
[2024-06-20 20:12:37,596 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 408 transitions, 6245 flow, removed 39 selfloop flow, removed 7 redundant places.
[2024-06-20 20:12:37,601 INFO  L231             Difference]: Finished difference. Result has 280 places, 388 transitions, 5364 flow
[2024-06-20 20:12:37,609 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=5092, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=388, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=132, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=256, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5364, PETRI_PLACES=280, PETRI_TRANSITIONS=388}
[2024-06-20 20:12:37,610 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 237 predicate places.
[2024-06-20 20:12:37,610 INFO  L495      AbstractCegarLoop]: Abstraction has has 280 places, 388 transitions, 5364 flow
[2024-06-20 20:12:37,610 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 13.5) internal successors, (135), 10 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 20:12:37,610 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:12:37,610 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-20 20:12:37,610 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67
[2024-06-20 20:12:37,610 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-20 20:12:37,610 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:12:37,611 INFO  L85        PathProgramCache]: Analyzing trace with hash -316912806, now seen corresponding path program 2 times
[2024-06-20 20:12:37,611 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:12:37,611 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90503827]
[2024-06-20 20:12:37,611 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:12:37,611 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:12:37,661 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:12:46,219 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:12:46,219 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:12:46,219 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90503827]
[2024-06-20 20:12:46,220 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90503827] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:12:46,220 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:12:46,220 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 20:12:46,220 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712882460]
[2024-06-20 20:12:46,220 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:12:46,220 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 20:12:46,220 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:12:46,221 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 20:12:46,221 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72
[2024-06-20 20:12:46,355 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 42
[2024-06-20 20:12:46,355 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 388 transitions, 5364 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-20 20:12:46,355 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:12:46,355 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 42
[2024-06-20 20:12:46,355 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:12:47,649 INFO  L124   PetriNetUnfolderBase]: 2578/4331 cut-off events.
[2024-06-20 20:12:47,650 INFO  L125   PetriNetUnfolderBase]: For 282946/282946 co-relation queries the response was YES.
[2024-06-20 20:12:47,684 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 35041 conditions, 4331 events. 2578/4331 cut-off events. For 282946/282946 co-relation queries the response was YES. Maximal size of possible extension queue 307. Compared 27591 event pairs, 537 based on Foata normal form. 1/4326 useless extension candidates. Maximal degree in co-relation 34912. Up to 3863 conditions per place. 
[2024-06-20 20:12:47,700 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 374 selfloop transitions, 31 changer transitions 0/412 dead transitions.
[2024-06-20 20:12:47,700 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 412 transitions, 6297 flow
[2024-06-20 20:12:47,700 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 20:12:47,700 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 20:12:47,701 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 160 transitions.
[2024-06-20 20:12:47,701 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.47619047619047616
[2024-06-20 20:12:47,701 INFO  L175             Difference]: Start difference. First operand has 280 places, 388 transitions, 5364 flow. Second operand 8 states and 160 transitions.
[2024-06-20 20:12:47,701 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 412 transitions, 6297 flow
[2024-06-20 20:12:48,283 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 412 transitions, 5939 flow, removed 20 selfloop flow, removed 9 redundant places.
[2024-06-20 20:12:48,287 INFO  L231             Difference]: Finished difference. Result has 279 places, 391 transitions, 5134 flow
[2024-06-20 20:12:48,288 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=5006, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=388, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=357, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5134, PETRI_PLACES=279, PETRI_TRANSITIONS=391}
[2024-06-20 20:12:48,288 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 236 predicate places.
[2024-06-20 20:12:48,288 INFO  L495      AbstractCegarLoop]: Abstraction has has 279 places, 391 transitions, 5134 flow
[2024-06-20 20:12:48,288 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-20 20:12:48,288 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:12:48,288 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-20 20:12:48,289 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68
[2024-06-20 20:12:48,289 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-20 20:12:48,289 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:12:48,289 INFO  L85        PathProgramCache]: Analyzing trace with hash 1380725756, now seen corresponding path program 3 times
[2024-06-20 20:12:48,289 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:12:48,290 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436236995]
[2024-06-20 20:12:48,290 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:12:48,290 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:12:48,350 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:12:57,333 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:12:57,334 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:12:57,334 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436236995]
[2024-06-20 20:12:57,334 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436236995] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:12:57,334 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:12:57,334 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 20:12:57,334 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87225613]
[2024-06-20 20:12:57,334 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:12:57,334 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 20:12:57,334 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:12:57,335 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 20:12:57,335 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-06-20 20:12:57,463 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 42
[2024-06-20 20:12:57,463 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 391 transitions, 5134 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-20 20:12:57,463 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:12:57,463 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 42
[2024-06-20 20:12:57,463 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:12:58,776 INFO  L124   PetriNetUnfolderBase]: 2583/4340 cut-off events.
[2024-06-20 20:12:58,776 INFO  L125   PetriNetUnfolderBase]: For 288565/288565 co-relation queries the response was YES.
[2024-06-20 20:12:58,807 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 34617 conditions, 4340 events. 2583/4340 cut-off events. For 288565/288565 co-relation queries the response was YES. Maximal size of possible extension queue 308. Compared 27646 event pairs, 537 based on Foata normal form. 1/4335 useless extension candidates. Maximal degree in co-relation 34489. Up to 3870 conditions per place. 
[2024-06-20 20:12:58,821 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 376 selfloop transitions, 32 changer transitions 0/415 dead transitions.
[2024-06-20 20:12:58,821 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 415 transitions, 6079 flow
[2024-06-20 20:12:58,822 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 20:12:58,822 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 20:12:58,822 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 159 transitions.
[2024-06-20 20:12:58,822 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4732142857142857
[2024-06-20 20:12:58,822 INFO  L175             Difference]: Start difference. First operand has 279 places, 391 transitions, 5134 flow. Second operand 8 states and 159 transitions.
[2024-06-20 20:12:58,822 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 415 transitions, 6079 flow
[2024-06-20 20:12:59,269 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 415 transitions, 5983 flow, removed 19 selfloop flow, removed 6 redundant places.
[2024-06-20 20:12:59,274 INFO  L231             Difference]: Finished difference. Result has 281 places, 394 transitions, 5174 flow
[2024-06-20 20:12:59,274 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=5038, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=391, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=359, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5174, PETRI_PLACES=281, PETRI_TRANSITIONS=394}
[2024-06-20 20:12:59,274 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 238 predicate places.
[2024-06-20 20:12:59,274 INFO  L495      AbstractCegarLoop]: Abstraction has has 281 places, 394 transitions, 5174 flow
[2024-06-20 20:12:59,275 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-20 20:12:59,275 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:12:59,275 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-20 20:12:59,275 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69
[2024-06-20 20:12:59,275 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-20 20:12:59,275 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:12:59,275 INFO  L85        PathProgramCache]: Analyzing trace with hash -18480456, now seen corresponding path program 4 times
[2024-06-20 20:12:59,275 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:12:59,276 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501001932]
[2024-06-20 20:12:59,276 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:12:59,276 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:12:59,331 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:13:08,117 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:13:08,117 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:13:08,117 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501001932]
[2024-06-20 20:13:08,117 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501001932] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:13:08,117 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:13:08,117 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 20:13:08,118 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742020469]
[2024-06-20 20:13:08,118 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:13:08,118 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 20:13:08,118 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:13:08,118 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 20:13:08,118 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-06-20 20:13:08,284 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 42
[2024-06-20 20:13:08,284 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 394 transitions, 5174 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-20 20:13:08,284 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:13:08,284 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 42
[2024-06-20 20:13:08,284 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:13:09,545 INFO  L124   PetriNetUnfolderBase]: 2575/4329 cut-off events.
[2024-06-20 20:13:09,545 INFO  L125   PetriNetUnfolderBase]: For 293474/293474 co-relation queries the response was YES.
[2024-06-20 20:13:09,576 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 34506 conditions, 4329 events. 2575/4329 cut-off events. For 293474/293474 co-relation queries the response was YES. Maximal size of possible extension queue 307. Compared 27598 event pairs, 537 based on Foata normal form. 2/4325 useless extension candidates. Maximal degree in co-relation 34377. Up to 3832 conditions per place. 
[2024-06-20 20:13:09,590 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 361 selfloop transitions, 44 changer transitions 0/412 dead transitions.
[2024-06-20 20:13:09,590 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 412 transitions, 6043 flow
[2024-06-20 20:13:09,591 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 20:13:09,591 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 20:13:09,591 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 159 transitions.
[2024-06-20 20:13:09,591 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4732142857142857
[2024-06-20 20:13:09,591 INFO  L175             Difference]: Start difference. First operand has 281 places, 394 transitions, 5174 flow. Second operand 8 states and 159 transitions.
[2024-06-20 20:13:09,591 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 412 transitions, 6043 flow
[2024-06-20 20:13:10,129 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 412 transitions, 5911 flow, removed 36 selfloop flow, removed 6 redundant places.
[2024-06-20 20:13:10,134 INFO  L231             Difference]: Finished difference. Result has 283 places, 394 transitions, 5138 flow
[2024-06-20 20:13:10,134 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=5042, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=394, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=350, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5138, PETRI_PLACES=283, PETRI_TRANSITIONS=394}
[2024-06-20 20:13:10,136 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 240 predicate places.
[2024-06-20 20:13:10,136 INFO  L495      AbstractCegarLoop]: Abstraction has has 283 places, 394 transitions, 5138 flow
[2024-06-20 20:13:10,136 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-20 20:13:10,136 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:13:10,136 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-20 20:13:10,137 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70
[2024-06-20 20:13:10,137 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-20 20:13:10,137 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:13:10,137 INFO  L85        PathProgramCache]: Analyzing trace with hash 254318362, now seen corresponding path program 1 times
[2024-06-20 20:13:10,137 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:13:10,137 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753496049]
[2024-06-20 20:13:10,137 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:13:10,137 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:13:10,175 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:13:20,047 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:13:20,047 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:13:20,047 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753496049]
[2024-06-20 20:13:20,047 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753496049] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:13:20,047 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:13:20,047 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 20:13:20,047 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367879715]
[2024-06-20 20:13:20,047 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:13:20,048 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 20:13:20,048 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:13:20,048 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 20:13:20,048 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-06-20 20:13:20,237 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 42
[2024-06-20 20:13:20,238 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 394 transitions, 5138 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-20 20:13:20,238 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:13:20,238 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 42
[2024-06-20 20:13:20,238 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:13:21,571 INFO  L124   PetriNetUnfolderBase]: 2585/4348 cut-off events.
[2024-06-20 20:13:21,571 INFO  L125   PetriNetUnfolderBase]: For 300710/300710 co-relation queries the response was YES.
[2024-06-20 20:13:21,602 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 34727 conditions, 4348 events. 2585/4348 cut-off events. For 300710/300710 co-relation queries the response was YES. Maximal size of possible extension queue 309. Compared 27731 event pairs, 529 based on Foata normal form. 2/4348 useless extension candidates. Maximal degree in co-relation 34597. Up to 3848 conditions per place. 
[2024-06-20 20:13:21,615 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 371 selfloop transitions, 44 changer transitions 0/422 dead transitions.
[2024-06-20 20:13:21,615 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 422 transitions, 6168 flow
[2024-06-20 20:13:21,616 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 20:13:21,616 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 20:13:21,616 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 179 transitions.
[2024-06-20 20:13:21,616 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.47354497354497355
[2024-06-20 20:13:21,617 INFO  L175             Difference]: Start difference. First operand has 283 places, 394 transitions, 5138 flow. Second operand 9 states and 179 transitions.
[2024-06-20 20:13:21,617 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 291 places, 422 transitions, 6168 flow
[2024-06-20 20:13:22,060 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 422 transitions, 6044 flow, removed 11 selfloop flow, removed 7 redundant places.
[2024-06-20 20:13:22,065 INFO  L231             Difference]: Finished difference. Result has 286 places, 400 transitions, 5263 flow
[2024-06-20 20:13:22,066 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=5014, PETRI_DIFFERENCE_MINUEND_PLACES=276, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=394, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=350, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5263, PETRI_PLACES=286, PETRI_TRANSITIONS=400}
[2024-06-20 20:13:22,066 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 243 predicate places.
[2024-06-20 20:13:22,066 INFO  L495      AbstractCegarLoop]: Abstraction has has 286 places, 400 transitions, 5263 flow
[2024-06-20 20:13:22,066 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-20 20:13:22,066 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:13:22,066 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-20 20:13:22,066 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71
[2024-06-20 20:13:22,067 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-20 20:13:22,067 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:13:22,067 INFO  L85        PathProgramCache]: Analyzing trace with hash 269123032, now seen corresponding path program 2 times
[2024-06-20 20:13:22,067 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:13:22,067 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438838217]
[2024-06-20 20:13:22,067 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:13:22,067 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:13:22,103 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:13:31,799 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:13:31,799 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:13:31,799 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438838217]
[2024-06-20 20:13:31,799 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438838217] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:13:31,799 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:13:31,799 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 20:13:31,800 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349917222]
[2024-06-20 20:13:31,800 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:13:31,800 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 20:13:31,800 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:13:31,800 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 20:13:31,800 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-06-20 20:13:31,926 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 42
[2024-06-20 20:13:31,926 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 400 transitions, 5263 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-20 20:13:31,926 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:13:31,926 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 42
[2024-06-20 20:13:31,927 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:13:33,266 INFO  L124   PetriNetUnfolderBase]: 2613/4396 cut-off events.
[2024-06-20 20:13:33,266 INFO  L125   PetriNetUnfolderBase]: For 315400/315400 co-relation queries the response was YES.
[2024-06-20 20:13:33,302 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 35827 conditions, 4396 events. 2613/4396 cut-off events. For 315400/315400 co-relation queries the response was YES. Maximal size of possible extension queue 315. Compared 28085 event pairs, 531 based on Foata normal form. 2/4396 useless extension candidates. Maximal degree in co-relation 35695. Up to 3866 conditions per place. 
[2024-06-20 20:13:33,318 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 369 selfloop transitions, 56 changer transitions 0/432 dead transitions.
[2024-06-20 20:13:33,318 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 432 transitions, 6516 flow
[2024-06-20 20:13:33,320 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 20:13:33,320 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 20:13:33,320 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 198 transitions.
[2024-06-20 20:13:33,320 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4714285714285714
[2024-06-20 20:13:33,320 INFO  L175             Difference]: Start difference. First operand has 286 places, 400 transitions, 5263 flow. Second operand 10 states and 198 transitions.
[2024-06-20 20:13:33,320 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 432 transitions, 6516 flow
[2024-06-20 20:13:33,940 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 432 transitions, 6368 flow, removed 43 selfloop flow, removed 6 redundant places.
[2024-06-20 20:13:33,944 INFO  L231             Difference]: Finished difference. Result has 291 places, 408 transitions, 5451 flow
[2024-06-20 20:13:33,945 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=5115, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=400, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=344, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5451, PETRI_PLACES=291, PETRI_TRANSITIONS=408}
[2024-06-20 20:13:33,945 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 248 predicate places.
[2024-06-20 20:13:33,945 INFO  L495      AbstractCegarLoop]: Abstraction has has 291 places, 408 transitions, 5451 flow
[2024-06-20 20:13:33,945 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-20 20:13:33,945 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:13:33,945 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-20 20:13:33,946 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72
[2024-06-20 20:13:33,946 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-20 20:13:33,946 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:13:33,946 INFO  L85        PathProgramCache]: Analyzing trace with hash 1993618904, now seen corresponding path program 3 times
[2024-06-20 20:13:33,946 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:13:33,946 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439468659]
[2024-06-20 20:13:33,946 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:13:33,946 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:13:33,980 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:13:43,291 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:13:43,291 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:13:43,291 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439468659]
[2024-06-20 20:13:43,291 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439468659] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:13:43,291 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:13:43,291 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 20:13:43,292 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624299754]
[2024-06-20 20:13:43,292 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:13:43,292 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 20:13:43,292 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:13:43,292 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 20:13:43,292 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-20 20:13:43,468 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 42
[2024-06-20 20:13:43,468 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 408 transitions, 5451 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-20 20:13:43,468 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:13:43,468 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 42
[2024-06-20 20:13:43,469 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:13:44,842 INFO  L124   PetriNetUnfolderBase]: 2626/4412 cut-off events.
[2024-06-20 20:13:44,842 INFO  L125   PetriNetUnfolderBase]: For 326873/326873 co-relation queries the response was YES.
[2024-06-20 20:13:44,875 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 36645 conditions, 4412 events. 2626/4412 cut-off events. For 326873/326873 co-relation queries the response was YES. Maximal size of possible extension queue 317. Compared 28194 event pairs, 527 based on Foata normal form. 1/4411 useless extension candidates. Maximal degree in co-relation 36511. Up to 3858 conditions per place. 
[2024-06-20 20:13:44,889 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 368 selfloop transitions, 60 changer transitions 0/435 dead transitions.
[2024-06-20 20:13:44,889 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 299 places, 435 transitions, 6668 flow
[2024-06-20 20:13:44,891 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 20:13:44,891 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 20:13:44,891 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 178 transitions.
[2024-06-20 20:13:44,891 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4708994708994709
[2024-06-20 20:13:44,891 INFO  L175             Difference]: Start difference. First operand has 291 places, 408 transitions, 5451 flow. Second operand 9 states and 178 transitions.
[2024-06-20 20:13:44,891 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 299 places, 435 transitions, 6668 flow
[2024-06-20 20:13:45,540 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 435 transitions, 6464 flow, removed 56 selfloop flow, removed 7 redundant places.
[2024-06-20 20:13:45,545 INFO  L231             Difference]: Finished difference. Result has 293 places, 414 transitions, 5528 flow
[2024-06-20 20:13:45,545 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=5263, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=408, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=351, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5528, PETRI_PLACES=293, PETRI_TRANSITIONS=414}
[2024-06-20 20:13:45,545 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 250 predicate places.
[2024-06-20 20:13:45,545 INFO  L495      AbstractCegarLoop]: Abstraction has has 293 places, 414 transitions, 5528 flow
[2024-06-20 20:13:45,546 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-20 20:13:45,546 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:13:45,546 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-20 20:13:45,546 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73
[2024-06-20 20:13:45,546 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-20 20:13:45,546 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:13:45,546 INFO  L85        PathProgramCache]: Analyzing trace with hash 1993113914, now seen corresponding path program 4 times
[2024-06-20 20:13:45,546 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:13:45,547 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589365312]
[2024-06-20 20:13:45,547 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:13:45,547 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:13:45,583 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:13:55,555 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:13:55,555 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:13:55,555 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589365312]
[2024-06-20 20:13:55,555 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589365312] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:13:55,555 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:13:55,555 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 20:13:55,555 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801038763]
[2024-06-20 20:13:55,555 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:13:55,556 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 20:13:55,556 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:13:55,556 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 20:13:55,556 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2024-06-20 20:13:55,689 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 42
[2024-06-20 20:13:55,690 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 293 places, 414 transitions, 5528 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-20 20:13:55,690 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:13:55,690 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 42
[2024-06-20 20:13:55,690 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:13:56,974 INFO  L124   PetriNetUnfolderBase]: 2636/4430 cut-off events.
[2024-06-20 20:13:56,975 INFO  L125   PetriNetUnfolderBase]: For 328511/328511 co-relation queries the response was YES.
[2024-06-20 20:13:57,011 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 36543 conditions, 4430 events. 2636/4430 cut-off events. For 328511/328511 co-relation queries the response was YES. Maximal size of possible extension queue 318. Compared 28326 event pairs, 535 based on Foata normal form. 2/4430 useless extension candidates. Maximal degree in co-relation 36408. Up to 3812 conditions per place. 
[2024-06-20 20:13:57,027 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 356 selfloop transitions, 80 changer transitions 0/443 dead transitions.
[2024-06-20 20:13:57,028 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 443 transitions, 6672 flow
[2024-06-20 20:13:57,029 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 20:13:57,029 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 20:13:57,029 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 181 transitions.
[2024-06-20 20:13:57,030 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.47883597883597884
[2024-06-20 20:13:57,030 INFO  L175             Difference]: Start difference. First operand has 293 places, 414 transitions, 5528 flow. Second operand 9 states and 181 transitions.
[2024-06-20 20:13:57,030 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 443 transitions, 6672 flow
[2024-06-20 20:13:57,716 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 296 places, 443 transitions, 6523 flow, removed 44 selfloop flow, removed 5 redundant places.
[2024-06-20 20:13:57,721 INFO  L231             Difference]: Finished difference. Result has 298 places, 424 transitions, 5805 flow
[2024-06-20 20:13:57,722 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=5394, PETRI_DIFFERENCE_MINUEND_PLACES=288, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=414, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=334, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5805, PETRI_PLACES=298, PETRI_TRANSITIONS=424}
[2024-06-20 20:13:57,722 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 255 predicate places.
[2024-06-20 20:13:57,722 INFO  L495      AbstractCegarLoop]: Abstraction has has 298 places, 424 transitions, 5805 flow
[2024-06-20 20:13:57,722 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-20 20:13:57,722 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:13:57,722 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-20 20:13:57,722 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74
[2024-06-20 20:13:57,723 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-20 20:13:57,723 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:13:57,723 INFO  L85        PathProgramCache]: Analyzing trace with hash 1633633752, now seen corresponding path program 5 times
[2024-06-20 20:13:57,724 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:13:57,724 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964680156]
[2024-06-20 20:13:57,724 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:13:57,724 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:13:57,761 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:14:07,437 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:14:07,437 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:14:07,438 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964680156]
[2024-06-20 20:14:07,438 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964680156] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:14:07,438 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:14:07,438 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 20:14:07,438 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462522535]
[2024-06-20 20:14:07,438 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:14:07,438 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 20:14:07,438 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:14:07,439 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 20:14:07,439 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2024-06-20 20:14:07,637 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 42
[2024-06-20 20:14:07,645 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 424 transitions, 5805 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-20 20:14:07,645 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:14:07,645 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 42
[2024-06-20 20:14:07,645 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:14:09,076 INFO  L124   PetriNetUnfolderBase]: 2651/4439 cut-off events.
[2024-06-20 20:14:09,076 INFO  L125   PetriNetUnfolderBase]: For 342610/342610 co-relation queries the response was YES.
[2024-06-20 20:14:09,113 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 37453 conditions, 4439 events. 2651/4439 cut-off events. For 342610/342610 co-relation queries the response was YES. Maximal size of possible extension queue 320. Compared 28424 event pairs, 543 based on Foata normal form. 3/4432 useless extension candidates. Maximal degree in co-relation 37315. Up to 3624 conditions per place. 
[2024-06-20 20:14:09,129 INFO  L140   encePairwiseOnDemand]: 29/42 looper letters, 259 selfloop transitions, 191 changer transitions 0/457 dead transitions.
[2024-06-20 20:14:09,129 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 457 transitions, 7322 flow
[2024-06-20 20:14:09,129 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-20 20:14:09,129 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-20 20:14:09,130 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 221 transitions.
[2024-06-20 20:14:09,130 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.47835497835497837
[2024-06-20 20:14:09,130 INFO  L175             Difference]: Start difference. First operand has 298 places, 424 transitions, 5805 flow. Second operand 11 states and 221 transitions.
[2024-06-20 20:14:09,130 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 457 transitions, 7322 flow
[2024-06-20 20:14:09,819 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 457 transitions, 7051 flow, removed 75 selfloop flow, removed 6 redundant places.
[2024-06-20 20:14:09,825 INFO  L231             Difference]: Finished difference. Result has 304 places, 436 transitions, 6241 flow
[2024-06-20 20:14:09,825 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=5534, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=424, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=183, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=6241, PETRI_PLACES=304, PETRI_TRANSITIONS=436}
[2024-06-20 20:14:09,825 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 261 predicate places.
[2024-06-20 20:14:09,825 INFO  L495      AbstractCegarLoop]: Abstraction has has 304 places, 436 transitions, 6241 flow
[2024-06-20 20:14:09,825 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-20 20:14:09,825 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:14:09,826 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-20 20:14:09,826 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75
[2024-06-20 20:14:09,826 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-20 20:14:09,826 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:14:09,826 INFO  L85        PathProgramCache]: Analyzing trace with hash 34610586, now seen corresponding path program 6 times
[2024-06-20 20:14:09,826 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:14:09,826 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435875924]
[2024-06-20 20:14:09,826 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:14:09,827 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:14:09,861 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:14:18,844 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:14:18,844 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:14:18,844 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435875924]
[2024-06-20 20:14:18,845 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435875924] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:14:18,845 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:14:18,845 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 20:14:18,845 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89302702]
[2024-06-20 20:14:18,845 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:14:18,845 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 20:14:18,845 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:14:18,846 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 20:14:18,846 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-06-20 20:14:18,982 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 42
[2024-06-20 20:14:18,982 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 436 transitions, 6241 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-20 20:14:18,982 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:14:18,982 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 42
[2024-06-20 20:14:18,982 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:14:20,301 INFO  L124   PetriNetUnfolderBase]: 2648/4437 cut-off events.
[2024-06-20 20:14:20,301 INFO  L125   PetriNetUnfolderBase]: For 347563/347563 co-relation queries the response was YES.
[2024-06-20 20:14:20,338 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 38150 conditions, 4437 events. 2648/4437 cut-off events. For 347563/347563 co-relation queries the response was YES. Maximal size of possible extension queue 321. Compared 28393 event pairs, 543 based on Foata normal form. 1/4428 useless extension candidates. Maximal degree in co-relation 38010. Up to 3768 conditions per place. 
[2024-06-20 20:14:20,354 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 333 selfloop transitions, 121 changer transitions 0/461 dead transitions.
[2024-06-20 20:14:20,355 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 461 transitions, 7410 flow
[2024-06-20 20:14:20,355 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 20:14:20,355 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 20:14:20,356 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 179 transitions.
[2024-06-20 20:14:20,356 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.47354497354497355
[2024-06-20 20:14:20,356 INFO  L175             Difference]: Start difference. First operand has 304 places, 436 transitions, 6241 flow. Second operand 9 states and 179 transitions.
[2024-06-20 20:14:20,356 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 461 transitions, 7410 flow
[2024-06-20 20:14:21,162 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 461 transitions, 6960 flow, removed 120 selfloop flow, removed 7 redundant places.
[2024-06-20 20:14:21,167 INFO  L231             Difference]: Finished difference. Result has 308 places, 445 transitions, 6323 flow
[2024-06-20 20:14:21,168 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=5869, PETRI_DIFFERENCE_MINUEND_PLACES=297, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=436, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=113, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=316, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6323, PETRI_PLACES=308, PETRI_TRANSITIONS=445}
[2024-06-20 20:14:21,168 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 265 predicate places.
[2024-06-20 20:14:21,168 INFO  L495      AbstractCegarLoop]: Abstraction has has 308 places, 445 transitions, 6323 flow
[2024-06-20 20:14:21,168 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-20 20:14:21,168 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:14:21,168 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-20 20:14:21,169 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76
[2024-06-20 20:14:21,169 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-20 20:14:21,169 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:14:21,169 INFO  L85        PathProgramCache]: Analyzing trace with hash -329740390, now seen corresponding path program 1 times
[2024-06-20 20:14:21,169 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:14:21,169 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498226463]
[2024-06-20 20:14:21,169 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:14:21,169 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:14:21,210 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:14:29,439 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:14:29,440 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:14:29,440 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498226463]
[2024-06-20 20:14:29,440 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498226463] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:14:29,440 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:14:29,440 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 20:14:29,440 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638339806]
[2024-06-20 20:14:29,440 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:14:29,441 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 20:14:29,441 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:14:29,441 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 20:14:29,441 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-20 20:14:29,547 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 42
[2024-06-20 20:14:29,548 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 308 places, 445 transitions, 6323 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-20 20:14:29,548 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:14:29,548 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 42
[2024-06-20 20:14:29,548 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:14:30,903 INFO  L124   PetriNetUnfolderBase]: 2656/4455 cut-off events.
[2024-06-20 20:14:30,903 INFO  L125   PetriNetUnfolderBase]: For 354509/354513 co-relation queries the response was YES.
[2024-06-20 20:14:30,941 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 38293 conditions, 4455 events. 2656/4455 cut-off events. For 354509/354513 co-relation queries the response was YES. Maximal size of possible extension queue 323. Compared 28516 event pairs, 504 based on Foata normal form. 3/4456 useless extension candidates. Maximal degree in co-relation 38149. Up to 4020 conditions per place. 
[2024-06-20 20:14:30,956 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 446 selfloop transitions, 15 changer transitions 0/468 dead transitions.
[2024-06-20 20:14:30,956 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 468 transitions, 7379 flow
[2024-06-20 20:14:30,958 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 20:14:30,958 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 20:14:30,958 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 156 transitions.
[2024-06-20 20:14:30,958 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4642857142857143
[2024-06-20 20:14:30,958 INFO  L175             Difference]: Start difference. First operand has 308 places, 445 transitions, 6323 flow. Second operand 8 states and 156 transitions.
[2024-06-20 20:14:30,958 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 468 transitions, 7379 flow
[2024-06-20 20:14:31,684 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 311 places, 468 transitions, 7226 flow, removed 35 selfloop flow, removed 4 redundant places.
[2024-06-20 20:14:31,689 INFO  L231             Difference]: Finished difference. Result has 312 places, 447 transitions, 6283 flow
[2024-06-20 20:14:31,690 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=6170, PETRI_DIFFERENCE_MINUEND_PLACES=304, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=445, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=430, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6283, PETRI_PLACES=312, PETRI_TRANSITIONS=447}
[2024-06-20 20:14:31,693 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 269 predicate places.
[2024-06-20 20:14:31,693 INFO  L495      AbstractCegarLoop]: Abstraction has has 312 places, 447 transitions, 6283 flow
[2024-06-20 20:14:31,693 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-20 20:14:31,693 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:14:31,693 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-20 20:14:31,693 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77
[2024-06-20 20:14:31,693 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-20 20:14:31,694 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:14:31,694 INFO  L85        PathProgramCache]: Analyzing trace with hash -21266054, now seen corresponding path program 2 times
[2024-06-20 20:14:31,694 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:14:31,694 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590593209]
[2024-06-20 20:14:31,694 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:14:31,695 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:14:31,745 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:14:39,970 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:14:39,970 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:14:39,971 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590593209]
[2024-06-20 20:14:39,971 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590593209] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:14:39,971 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:14:39,971 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 20:14:39,971 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436753625]
[2024-06-20 20:14:39,971 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:14:39,971 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 20:14:39,971 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:14:39,972 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 20:14:39,972 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-20 20:14:40,079 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 42
[2024-06-20 20:14:40,080 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 447 transitions, 6283 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-20 20:14:40,080 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:14:40,080 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 42
[2024-06-20 20:14:40,080 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:14:41,504 INFO  L124   PetriNetUnfolderBase]: 2664/4469 cut-off events.
[2024-06-20 20:14:41,504 INFO  L125   PetriNetUnfolderBase]: For 362472/362476 co-relation queries the response was YES.
[2024-06-20 20:14:41,541 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 38611 conditions, 4469 events. 2664/4469 cut-off events. For 362472/362476 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 28642 event pairs, 538 based on Foata normal form. 3/4470 useless extension candidates. Maximal degree in co-relation 38465. Up to 4049 conditions per place. 
[2024-06-20 20:14:41,556 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 443 selfloop transitions, 16 changer transitions 0/466 dead transitions.
[2024-06-20 20:14:41,556 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 319 places, 466 transitions, 7327 flow
[2024-06-20 20:14:41,558 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 20:14:41,558 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 20:14:41,558 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 153 transitions.
[2024-06-20 20:14:41,558 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45535714285714285
[2024-06-20 20:14:41,558 INFO  L175             Difference]: Start difference. First operand has 312 places, 447 transitions, 6283 flow. Second operand 8 states and 153 transitions.
[2024-06-20 20:14:41,558 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 319 places, 466 transitions, 7327 flow
[2024-06-20 20:14:42,390 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 313 places, 466 transitions, 7230 flow, removed 35 selfloop flow, removed 6 redundant places.
[2024-06-20 20:14:42,395 INFO  L231             Difference]: Finished difference. Result has 314 places, 449 transitions, 6305 flow
[2024-06-20 20:14:42,395 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=6186, PETRI_DIFFERENCE_MINUEND_PLACES=306, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=447, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=431, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6305, PETRI_PLACES=314, PETRI_TRANSITIONS=449}
[2024-06-20 20:14:42,395 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 271 predicate places.
[2024-06-20 20:14:42,396 INFO  L495      AbstractCegarLoop]: Abstraction has has 314 places, 449 transitions, 6305 flow
[2024-06-20 20:14:42,396 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-20 20:14:42,396 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:14:42,396 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-20 20:14:42,396 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78
[2024-06-20 20:14:42,396 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-20 20:14:42,396 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:14:42,396 INFO  L85        PathProgramCache]: Analyzing trace with hash -18464584, now seen corresponding path program 1 times
[2024-06-20 20:14:42,397 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:14:42,397 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070332669]
[2024-06-20 20:14:42,397 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:14:42,397 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:14:42,451 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:14:52,078 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:14:52,078 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:14:52,078 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070332669]
[2024-06-20 20:14:52,078 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070332669] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:14:52,078 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:14:52,078 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 20:14:52,078 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557941742]
[2024-06-20 20:14:52,079 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:14:52,079 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 20:14:52,079 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:14:52,079 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 20:14:52,079 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-20 20:14:52,337 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 42
[2024-06-20 20:14:52,338 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 314 places, 449 transitions, 6305 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-20 20:14:52,338 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:14:52,338 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 42
[2024-06-20 20:14:52,338 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:14:53,725 INFO  L124   PetriNetUnfolderBase]: 2674/4488 cut-off events.
[2024-06-20 20:14:53,725 INFO  L125   PetriNetUnfolderBase]: For 372700/372700 co-relation queries the response was YES.
[2024-06-20 20:14:53,767 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 38895 conditions, 4488 events. 2674/4488 cut-off events. For 372700/372700 co-relation queries the response was YES. Maximal size of possible extension queue 328. Compared 28757 event pairs, 532 based on Foata normal form. 2/4484 useless extension candidates. Maximal degree in co-relation 38748. Up to 3966 conditions per place. 
[2024-06-20 20:14:53,784 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 414 selfloop transitions, 51 changer transitions 0/472 dead transitions.
[2024-06-20 20:14:53,784 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 322 places, 472 transitions, 7438 flow
[2024-06-20 20:14:53,784 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 20:14:53,785 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 20:14:53,785 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 176 transitions.
[2024-06-20 20:14:53,785 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4656084656084656
[2024-06-20 20:14:53,785 INFO  L175             Difference]: Start difference. First operand has 314 places, 449 transitions, 6305 flow. Second operand 9 states and 176 transitions.
[2024-06-20 20:14:53,785 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 322 places, 472 transitions, 7438 flow
[2024-06-20 20:14:54,646 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 316 places, 472 transitions, 7335 flow, removed 37 selfloop flow, removed 6 redundant places.
[2024-06-20 20:14:54,651 INFO  L231             Difference]: Finished difference. Result has 317 places, 453 transitions, 6461 flow
[2024-06-20 20:14:54,651 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=6202, PETRI_DIFFERENCE_MINUEND_PLACES=308, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=449, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=398, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6461, PETRI_PLACES=317, PETRI_TRANSITIONS=453}
[2024-06-20 20:14:54,651 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 274 predicate places.
[2024-06-20 20:14:54,651 INFO  L495      AbstractCegarLoop]: Abstraction has has 317 places, 453 transitions, 6461 flow
[2024-06-20 20:14:54,652 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-20 20:14:54,652 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:14:54,652 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-20 20:14:54,652 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79
[2024-06-20 20:14:54,652 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-20 20:14:54,652 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:14:54,653 INFO  L85        PathProgramCache]: Analyzing trace with hash 2074246860, now seen corresponding path program 3 times
[2024-06-20 20:14:54,653 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:14:54,653 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758526225]
[2024-06-20 20:14:54,653 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:14:54,653 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:14:54,726 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 20:15:03,427 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 20:15:03,428 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 20:15:03,428 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758526225]
[2024-06-20 20:15:03,428 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758526225] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 20:15:03,428 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 20:15:03,428 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 20:15:03,428 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35099130]
[2024-06-20 20:15:03,428 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 20:15:03,428 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 20:15:03,428 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 20:15:03,429 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 20:15:03,429 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-20 20:15:03,565 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 42
[2024-06-20 20:15:03,565 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 453 transitions, 6461 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-20 20:15:03,565 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 20:15:03,565 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 42
[2024-06-20 20:15:03,565 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 20:15:04,989 INFO  L124   PetriNetUnfolderBase]: 2682/4501 cut-off events.
[2024-06-20 20:15:04,990 INFO  L125   PetriNetUnfolderBase]: For 383830/383834 co-relation queries the response was YES.
[2024-06-20 20:15:05,028 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 39502 conditions, 4501 events. 2682/4501 cut-off events. For 383830/383834 co-relation queries the response was YES. Maximal size of possible extension queue 331. Compared 28871 event pairs, 534 based on Foata normal form. 3/4502 useless extension candidates. Maximal degree in co-relation 39354. Up to 4081 conditions per place. 
[2024-06-20 20:15:05,044 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 448 selfloop transitions, 16 changer transitions 0/471 dead transitions.
[2024-06-20 20:15:05,044 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 324 places, 471 transitions, 7535 flow
[2024-06-20 20:15:05,044 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 20:15:05,044 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 20:15:05,045 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 150 transitions.
[2024-06-20 20:15:05,045 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44642857142857145
[2024-06-20 20:15:05,045 INFO  L175             Difference]: Start difference. First operand has 317 places, 453 transitions, 6461 flow. Second operand 8 states and 150 transitions.
[2024-06-20 20:15:05,045 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 324 places, 471 transitions, 7535 flow
[2024-06-20 20:15:05,913 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 471 transitions, 7304 flow, removed 67 selfloop flow, removed 7 redundant places.
[2024-06-20 20:15:05,918 INFO  L231             Difference]: Finished difference. Result has 319 places, 457 transitions, 6385 flow
[2024-06-20 20:15:05,918 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=6230, PETRI_DIFFERENCE_MINUEND_PLACES=310, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=453, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=438, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6385, PETRI_PLACES=319, PETRI_TRANSITIONS=457}
[2024-06-20 20:15:05,919 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 276 predicate places.
[2024-06-20 20:15:05,919 INFO  L495      AbstractCegarLoop]: Abstraction has has 319 places, 457 transitions, 6385 flow
[2024-06-20 20:15:05,919 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-20 20:15:05,919 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 20:15:05,919 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-20 20:15:05,919 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80
[2024-06-20 20:15:05,919 INFO  L420      AbstractCegarLoop]: === Iteration 82 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 20:15:05,920 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 20:15:05,920 INFO  L85        PathProgramCache]: Analyzing trace with hash 269131960, now seen corresponding path program 2 times
[2024-06-20 20:15:05,920 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 20:15:05,920 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901914661]
[2024-06-20 20:15:05,920 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 20:15:05,920 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 20:15:05,985 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
Killed by 15